Data Structure Questions Answers - Chapter 1

• 22. The complexity of linear search algorithm is

  1. O(n)
  2. O(log n)
  3. O(n2)
  4. O(n log n)
  5. Only argument I is strong
  6. Only argument II is strong
  7. Either I or II is strong
  8. Neither I nor II is strong
  9. Both I and II are strong

  Answer :

  Option

• 23. Preorder is

  1. depth first order
  2. breadth first order
  3. topological order
  4. linear order

  Answer :

  Option A

• 24. Recursive problems are implemented by

  1. queues
  2. stacks
  3. linked lists
  4. strings

  Answer :

  Option B

• 25. Which of the following name does not relate to stacks

  1. FIFO lists
  2. LIFO list
  3. Piles
  4. Push-down lists

  Answer :

  Option A

• 26. A graph with one or more edges is at least

  1. 1-chromatic
  2. 2-chromatic
  3. 3-chromatic
  4. 4-chromatic

  Answer :

  Option B

• 27. minimum number of stacks of size n required to implement a queue of size n

  1. One
  2. Two
  3. Three
  4. Four

  Answer :

  Option B

• 28. Which of the following data structure is linear data structure

  1. Trees
  2. Graphs
  3. Array
  4. None of above

  Answer :

  Option C