ADS MCQ

Q1. Linked link are not superior to STL vectors

• a) True

• b) False

Q2. Deleting a node in a linked list is a simple matter of using the delete operator to free the node’s memory

• a) True

• b) False

Q3. The advantage of link list over array is

• a) Link list can grow and shrink in size during the time

• b) Less space is required for storing elements

• c) Both 1 and 2 are correct

• d) None of the above

Q4. Which one of the following algorithm is NOT an example of Divide and conquer technique

• a) Quick Sort

• b) Merge Sort

• c) Bubble Sort

• d) Binary Search

Q5. The inorder traversal of some binary tree produces the sequence DBEAFC, and the postorder transversal of the same tree produced the sequence DEBFCA. Which of the following is correct preorder transversal sequence?

• a) DBAECF

• b) ABEDFC

• c) ABDECF

• d) None of the above

Q6. How many cycles should be contained in a tree?

• a) 0

• b) At least 1

• c) Any number

• d) None of the above

Q7. If graph G has no edges then corresponding adjacency matrix is

• a) Unit matrix

• b) Zero matrix

• c) Matrix with all 1’s

• d) None of the above

Q8. What is not true for linear collision processing?

• a) It is easier to program

• b) It may include more collision

• c) It requires space for links

• d) All are true

Q9. Algorithms can be represented in various ways EXCEPT

• a) PROGRAMS

• b) FLOWCHARTS

• c) DECISION CHARTS

• d) SPREADSHEET

Q10. The element at the root of heap is

• a) Largest

• b) Depending on type of heap it may be smallest or largest

• c) Smallest

• d) None of the above