 A directory of Objective Type Questions covering all the Computer Science subjects. Here you can access and discuss Multiple choice questions and answers for various compitative exams and interviews.

 21. How many PUSH and POP operations will be needed to evaluate the following expression by reverse polish notation in a stack machine (A * B) + (C * D/E)? a. 4 PUSH and 3 POP instructions b. 5 PUSH and 4 POP instructions c. 6 PUSH and 2 POP instructions d. 5 PUSH and 3 POP instructions

 22. Consider an array A[20. 10], assume 4 words per memory cell and the base address of array A is 100. What is the address of A[11,5]? Assume row major storage. a. 560 b. 565 c. 570 d. 575

 23. Convert the following infix expression into its equivalent post fix expression (A + B^D)/(E - F) + G a. ABD^ + EF-/G+ b. ABD + ^EF-/G+ c. ABD + ^EF/-G+ d. ABD^ + EF/-G+

 24. Any decision tree that sorts n elements has height a. Ω (n) b. Ω(/gn) c. Ω(n/gn) d. Ω(n^2)

 25. Match the following .     List- I                                                    List - IIa. Bucket sort                                      i. O(n^3/gn)b. Matrix chain multiplication           ii. O(n^3) c. Huffman codes                             iii. O(nlgn)d. All pairs shortest paths               iv. O(n)code:a   b   c   d a. iv   ii   i   iii b. ii   iv   i   iii c. iv   ii   iii   i d. iii   ii   iv   i

 26. Suppose that we have numbers between 1 and 1000 in a binary search tree and we want to search for the number 365. Which of the following sequences could not be the sequence of nodes examined ? a. 4, 254,403, 400,332,346, 399, 365 b. 926,222,913,246,900,260,364,365 c. 927,204,913, 242,914,247,365 d. 4,401,389,221,268, 384,383, 280,365

 27. Converting a primitive type data into its corresponding wrapper class object instance is called a. Boxing b. Wrapping c. Instantiation d. Autoboxing