DSA (D1+D2)

1. A queue follows __________

• a) FIFO (First In First Out) principle

• b) LIFO (Last In First Out) principle

• c) Ordered array

• d) Linear tree

2.If the elements “A”, “B”, “C” and “D” are placed in a queue and are deleted one at a time, in what order will they be removed?

• 
  a) DCBA

• b) ABCD

• c) DCAB
  

• d) ABDC

3. Queues serve major role in ______________
   
   
   

• 3. a) Simulation of recursion

• 3. b) Simulation of arbitrary linked list

• 3. c) Simulation of limited resource allocation
     

• 3. d) Simulation of heap sort

The number of edges from the root to the node is called __________ of the tree.

• a) Height
  

• b) Depth
  

• c) Length
  

• d) Width

4. A binary tree is a

• a) with no child

• b) with one child

• c) with two children

• d) all of the above

how many binary trees are possible with 3 nodes

• 20

• 10

• 30

• 40

Minimum number of nodes in a binary tree of height H

• n

• n+1

• H+1

• H+N

A node with out any child

• sibling

• left

• right

• leaf

The children with same parent are called

• left children

• right children

• leaf child

• siblings

what is the time complexity of binary search tree for best case?

• O(n)

• O(n2)

• O(log n)

• O(nlog n)