Motorola Previous Years Solved Sample Placement Papers
-
Bubble sorting is:
A: Two stage sorting
B: .....
C: ....
D: None of the above
Ans: [Your Answer] -
C++ supports:
A: Pass by value only
B: Pass by name
C: Pass by pointer
D: Pass by value and by reference
Ans: [Your Answer] -
Selection sort for a sequence of N elements:
Number of comparisons = _________
Number of exchanges = ____________
Ans: [Your Answer] -
Insertion sort:
Number of comparisons = _________
Number of exchanges = ____________
Ans: [Your Answer] -
What is a language?
A: Set of alphabets
B: Set of strings formed from alphabets
C: ............
D: None of the above
Ans: [Your Answer] -
Which is true about heap sort?
A: Two method sort
B: Has complexity of O(N2)
C: Complexity of O(N3)
D: ..........
Ans: [Your Answer] -
In binary tree which of the following is true?
A: Binary tree with even nodes is balanced
B: Every binary tree has a balanced tree
C: Every binary tree can't be balanced
D: Binary tree with odd number of nodes can always be balanced
Ans: [Your Answer] -
Which of the following is not conducive for linked list implementation of array?
A: Binary search
B: Sequential search
C: Selection sort
D: Bubble sort
Ans: [Your Answer] -
In C++, casting in C is upgraded as:
A: dynamic_cast
B: static_cast
C: const_cast
D: reinterpret_cast
Ans: [Your Answer] -
Which of the following is false regarding protected members?
A: Can be accessed by friend functions of the child
B: Can be accessed by friends of child's child
C: Usually inaccessible by friends of class
D: Child has the ability to convert child ptr to base ptr
Ans: [Your Answer] -
What is the output of the following?
void main() { int a = 5, b = 10; int &ref1 = a, &ref2 = b; ref1 = ref2; ++ref1; ++ref2; cout << a << b << endl; }
A: 5 and 12
B: 7 and 10
C: 11 and 11
D: None of the above
Ans: [Your Answer]