Monday, August 31, 2015

AMCAT COMPUTER PROGRAMMMING PREVIOUS QUESTIONS (PAPERS)-13



121. I have a problem to solve which takes as input a number n property that given the solution for (n
programming technique will I use to solve such a problem?
A. Iteration         B. Decision-making       C. Object Oriented Programming   D. Recursion
Solution: Answer will be option B.

122. Here is an infix notation: ((A+B)*C-(D-E))^(F+G) Choose the correct postfix notation of the above from the given options?
A. AB+CD*E--FG+^         B. AB+C*DE--FG+^       C. AB+C*DE-FG-+^   D. A+BC*DE-FG-+^
Solution: Answer will be option B.

123. 123. If the depth of a tree is 3 levels, then what is the size of the Tree?
A. 2                        B. 4                      C. 6                      D. 8
Solution: Answer will be option D.

124. One of the following options is a form of access used to add and remove nodes from a queue.
A. LIFO               B. FIFO               C. Both LIFO and FIFO    D. None of these
Solution: Answer will be option C.


125. What is the time complexity of adding three matrices of size NXN cell-by-cell?
A. O (N)                                B. O (N^2)                           C. O (N^3)                           D. None of these
Solution: Answer will be option B.

126. Choose the correct answer. A sort which uses the binary tree concept such that any number in the tree is larger than all the numbers in the sub tree  below it is called
A. Selection sort                                            B. Insertion sort                                                C. Heap sort                       D. Quick sort
Solution: Answer will be option C.


Contact Form

Name

Email *

Message *