CS301 Grand Quiz by Junaid

CS301 GRAND QUIZ

1. Consider the following infix expression. 7/8+9 If one converts the above expression into postfix, what would be the resultant expression? a. 789/+ b. 78/+9 c. /78+9 d. 78/9+ 2. Suppose there are 100 elements in an equivalence classes so initially there will be 100 tree. The collection of tree is called_ a. Cluster b. Class c. Forest d. Bunch 3. For a perfect binary tree of height h, having N nodes the sum of height of nodes is a. N-h-1 b. N-1 c. N-1+h d. -(h-1) 4. Sorting procedure normally takes ______time a. N log N b. 2 N c. N*N*N d. N 5. there are 100 elements in an equivalence classes then will have ______state initially a. b. c. d. 6. ________ objects (objects accessed by pointers) are called anonymous objects. a. Private b. Nameless c. Friend d. Public 7. ___________ is a self-balancing tree. a. AVL b. Binary Tree c. d. ALV 8. Which of the following operation returns but do not removes top value of the stack? a. Push b. Pop

c. Top d. First 9. Int htdiff = height(root->getLeft()) __________ height(root->getRight()); The above line of code is taken from AVL insert method. Complete it by selecting an appropriate symbol. a. b. c. d.

10. Which operation of the queue data structure is used to insert an element into the Queue? a. Enqueue() b. Dequeue() c. Fornt() d. Remove()
11. For making binary search tree for strings we need, ________ data type. a. Char b. Int c. Float d. Double
12. Local variables defined inside function body are ________ automatically at the end of function execution. a. Created b. Destroyed c. Incremented d. Decremented

9. If a node has three fields, then this node will be related to a. Linked list b. Doubly linked list c. Circular linked list d.

10. ________ is an area in computer memory that is allocated dynamically. a. Heap b. Stack c. Queue d. Linked list
11. Linked list use _______ to store data. a. Array b. 2-D Array c. Variables

d. Linked Memory

12. The lifetime of a transient object cannot exceed that of the application. a. True b. False c. d.
13. To represent hierarchical relationship between elements, which data structure is suitable? a. Dequeue b. Priority c. Stack d. Tree
14. Local variables of a function are stored in, a. b. Stack c. Queue d. AVL tree
15. In-order traversal method traverses tha data in a. Non sorted order b. Random order c. Sorted order d.
16. Dequeue() operation of queue data structure is used to _________ a. Get an element from the front of the queue b. Remove an element from the front and return it c. Insert an element at the front d. Insert an element at the back
17. In a tree, we link the nodes in such a way that it _________ a linear structure. a. Does not remain b. Forms c. Reverses d. Remains
18. Factorial is an example of ________ function. a. Recursive b. Non-recursive c. Cube d. Log
19. All the objects created using _________ operator have to be explicitly destroyed using delete operator. a. New