Q. Consider the following pseudo code segment :

K:=0
 for i1:= l to n
  for i2:= 1 to i1
   :
   :
   :
    for im:= 1 to im–1
     K:= K+1

The value of K after the execution of this code shall be

View solution

Q. Number of binary trees formed with 5 nodes are

View solution

Q. The following postfix expression is evaluated using a stack

823^/23* + 51* –

The top two elements of the stack after first * is evaluated

View solution

Q. Consider the following pseudo-code :

If (A > B) and (C > D) then
A = A + 1
B = B + 1
Endif

The cyclomatic complexity of the pseudo-code is

View solution

Q. Match the following with respect to java.util.* class methods :

(a) Bit Set                      (i) Time zone getTimezone( )
(b) Calendar                 (ii) int hashcode( )
(c) Time zone               (iii) int nextInt( )
(d) Random                  (iv) Void setID(String tzName)

      (a)     (b)    (c)   (d)

View solution

Q. Which of the following data structure is Non-linear type?

View solution

Q. The total number of comparisons in a bubble sort is

View solution

Q. Which of the following is a bad example of recursion?

View solution

Q. McCabe’s cyclomatic metric V(G) of a graph G with n vertices, e edges and p connected component is

View solution

Q. The number of nodes in a complete binary tree of height h (with roots at level 0) is equal to

View solution

Q. The number of different trees with 8 nodes is

View solution

Q. Given a binary tree whose inorder and preorder traversal are given by

Inorder  : EICFBGDJHK
Preorder : BCEIFDGHJK

The post order traversal of the above binary tree is

View solution

Q. The number of disk accesses performed by insertion operation in B-tree of height h is

View solution

Q. When the priority queue is represented by max heap, the insertion and deletion of an element can be performed in (queue containing n elements)

View solution

Q. An undirected graph possesses an eulerian circuit if and only if it is connected and its vertices are

View solution

Q. The minimum number of edges in a connected graph with ‘n’ vertices is equal to

View solution

Q. What is the maximum number of nodes in a B-tree of order 10 of depth 3 (root at depth 0)?

View solution

Q. A binary tree with 27 nodes has …………. null branches.

View solution

Q. The time complexity to build a heap of n elements is

View solution

Q. Which of the following can be the sequence of nodes examined in binary search tree while searching for key 88?

View solution