LLJ 2

The following statements
for (i = 3; i < 15; i +=3)
{
printf (“%d”, i);
++i;
}
will result in the printing of

• (a) 36912
  

• (b) 3691215
  

• (c) 3711
  

• (d) 371115
  

Consider the declarations:
char first (int(*) (char, float));
int second (char, float)
Which of the following function invocation is valid?

• (a) first (*second)

  
  

• (b) first (&second);

  
  

• (c) first (second)

  
  

• (d) none of these

  
  

The output of the following program
main ( )
{
int a = 1, b = 2, c = 3;
printf (“%d”, a+ = (a+ = 3, 5, a));
}
will be

• a.)12

• b)6

• c)9

• d)8

In delete operation of binary search tree, we need inorder successor (or predecessor) of a node
when a node to be deleted where it has both left and right child. Which of the following is true
about inorder successor needed in delete operation?

• a) Inorder successor is always either leaf node or a node with empty right child
  

• b) Inorder successor maybe an ancestor of the node
  

• c) Inorder successor is always a leaf node.
  

• d) Inorder successor is always either a leaf node or a node with empty left child
  

Which of the following is NOT true about linked list implementation of queue?

• a) In enqueue operation, if new nodes are inserted at the beginning of linked list, then in
  dequeue operation nodes must be removed from end.
  

• b) In enqueue operation, if new nodes are inserted at the end, then in dequeue nodes must be
  removed from the beginning.
  

• c) Both (a) and (b)
  

• d) None of the above
  

Consider the following AVL tree.
Which of the following order of elements are inserted into an empty AVL tree, so that it is
possible to get the above AVL tree?

• (a) 94, 71, 86, 25, 98, 83, 27, 90
  

• b) 98, 94, 90, 83, 86, 25, 71, 94
  

• c) 86, 25, 98, 83, 27, 90, 71, 94
  

• d) None of these
  

The complexity of Binary search algorithm is

• a) O(n)
  

• b) O(logn)
  

• c) O(n2)
  

• d) O(n log n)
  

A binary tree whose every node has either zero or two children is called

• a) Complete binary tree

  
  

• b) Binary search tree

  
  

• c) Extended binary tree

  
  

• d) None of above

  
  

When new data are to be inserted into a data structure, but there is no available space; this
situation is usually called

• a) underflow

  
  

• b) overflow

  
  

• c) housefull

  
  

• d) saturated

  
  

What is the time complexity of extracting the root element from a Min-Heap or Max-Heap?

• a) O(n)

• b) O(log n)

• c) O(1)

• d) O(n log n)