## MCQs Data Structure|UGC-NET|GATE|Data Structures

21. | Suppose there are logn sorted lists of n logn elements each. The time complexity of producing a sorted list of all these elements is (use heap data structure) |

A. | O(n log logn) |

B. | ?(n logn) |

C. | ? (n logn) |

D. | ? (n3/2) |

View/Hide Ans | |

Explanation | |

22. | Skolmization is the process of |

A. | bringing all the quantifiers in the beginning of a formula in FDL |

B. | removing all the universal quantifiers |

C. | removing all the existential quantifiers |

D. | all of the above. |

View/Hide Ans | |

Explanation | |

23. | The postfix expression AB + CD – * can be evaluated using a |

A. | stack |

B. | tree |

C. | queue |

D. | linked list |

View/Hide Ans | |

Explanation | |

24. | The post order traversal of a binary tree is DEBFCA. Find out the preorder traversal |

A. | ABFCDE |

B. | ADBFEC |

C. | ABDECF |

D. | None of the above |

View/Hide Ans | |

Explanation | |

25. | The number of colours required to properly colour the vertices of every planer graph is |

A. | 2 |

B. | 3 |

C. | 4 |

D. | 5 |

View/Hide Ans | |

Explanation | |

26. | A binary search tree is a binary tree : |

A. | All items in the left subtree are less than root |

B. | All items in the right subtree are greater than or equal to the root |

C. | Each subtree is itself a binary search tree |

D. | All of the above |

View/Hide Ans | |

Explanation | |

27. | Leaves of which of the following trees are at the same level? |

A. | Binary tree |

B. | B-tree |

C. | AVL-tree |

D. | Expression tree |

View/Hide Ans | |

Explanation | |

28. | The Inorder traversal of the tree will yield a sorted listing of elements of tree in |

A. | Binary tree |

B. | Binary search tree |

C. | Heaps |

D. | None of the above |

View/Hide Ans | |

Explanation | |

29. | Which of the following data structure is linear type? |

A. | Strings |

B. | Lists |

C. | Queues |

D. | All of the above |

View/Hide Ans | |

Explanation | |

30. | To represent hierarchical relationship between elements, which data structure is suitable? |

A. | Dequeue |

B. | Priority |

C. | Tree |

D. | All of the above |

View/Hide Ans | |

Explanation |

Author Does Not claim of any answer these answers are as per expert opinion