Q. The Object Modelling Technique (OMT) uses the following three kinds of model to describe a system 

View solution

Q. An example of a dictionary-based coding technique is 

View solution

Q. A algorithm is guaranteed to find an optimal solution if 

View solution

Q. What is the value of the postfix expression ?
abc d + - * (where a = 8 , b = 4 , c = 2 and d = 5)

View solution

Q. If the queue is implemented with a linked list, keeping track of a front pointer and a rear pointer, which of these pointers will change during an insertion into a non-empty queue?

View solution

Q. ___________ is often used to prove the correctness of a recursive function.

View solution

Q. For any B-tree of minimum degree   t   ≥  2, every node other than the root must have atleast keys and every node can have at most ____ keys. 

View solution

Q. Given two sorted list of size 'm' and 'n' respectively. The number of comparison needed in the worst case by the merge sort algorithm will be 

View solution

Q. Match the following with respect to programming languages

  a. Structured Language  i.   JAVA

  b. Non-structured Language   ii. BASIC

  c. Object Oriented  Programming Language  iii.  PASCAL

  D. Interpreted  Programming Language  iv. FORTRAN

codes:
a b c d

View solution

Q. The compiler converts all operands up to the type of the largest operand is called

View solution

Q. _____________ comparisons  are necessary in the worst case  to find both the maximum and minimum of n numbers.

View solution

Q. Let A and B be two n x n matrices,The efficient algorithm to multiply the two matrices , has the time complexity

View solution

Q. Assuming there are n keys and each key is in the range [0, m - 1]. The run time of bucket sort is

View solution

Q. You have to sort a list L, consisting of a sorted list followed by a few 'random' elements. Which of the following sorting method would be most suitable for such a task?

View solution

Q. A full binary tree with n leaves contains

View solution

Q. 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)?

View solution

Q. 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.

View solution

Q. Convert the following infix expression into its equivalent post fix expression (A + B^D)/(E - F) + G

View solution

Q. Any decision tree that sorts n elements has height

View solution

Q. Match the following .
     List- I                                                    List - II
a. 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

View solution