Data structure MCQ Set-2

1. The post order traversal of a binary tree is DEBFCA. Find out the pre order traversal
2. Which of the following sorting algorithm is of divide-and-conquer type?
  • Bubble sort
  • Insertion sort
  • Quick sort
  • All of above
3. An algorithm that calls itself directly or indirectly is known as
  • Sub algorithm
  • Recursion
  • Polish notation
  • Traversal algorithm
4. In a binary tree, certain null entries are replaced by special pointers which point to nodes higher in the tree for efficiency. These special pointers are called
  • Leaf
  • branch
  • path
  • thread
5. The in order traversal of tree will yield a sorted listing of elements of tree in
  • Binary trees
  • Binary search trees
  • Heaps
  • None of above
6. In a Heap tree
  • Values in a node is greater than every value in left sub tree and smaller than right sub tree
  • Values in a node is greater than every value in children of it
  • Both of above conditions applies
  • None of above conditions applies
7. In a graph if e=[u, v], Then u and v are called
  • endpoints of e
  • adjacent nodes
  • neighbors
  • all of above
8. A connected graph T without any cycles is called
  • a tree graph
  • free tree
  • a tree
  • All of above
9. In a graph if e=(u, v) means
  • u is adjacent to v but v is not adjacent to u
  • e begins at u and ends at v
  • u is processor and v is successor
  • both b and c
10. If every node u in G is adjacent to every other node v in G, A graph is said to be
  • isolated
  • complete
  • finite
  • strongly connected