Data Structure Questions Answers - Chapter 1

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

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

  Answer And Explanation

  Answer: Option B

  Explanation:

  • View Answer
  • Comment on this question

• 23. The memory address of the first element of an array is called

  1. floor address
  2. first address
  3. foundation address
  4. base address

  Answer And Explanation

  Answer: Option D

  Explanation:

  • View Answer
  • Comment on this question

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

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

  Answer And Explanation

  Answer: Option A

  Explanation:

  • View Answer
  • Comment on this question

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

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

  Answer And Explanation

  Answer: Option C

  Explanation:

  • View Answer
  • Comment on this question

• 26. The complexity of linear search algorithm is

  1. O(n)
  2. O(log n)
  3. O(n2)
  4. O(n log n)

  Answer And Explanation

  Answer: Option A

  Explanation:

  • View Answer
  • Comment on this question

• 27. The complexity of Binary search algorithm is

  1. O(n)
  2. O(log n)
  3. O(n2)
  4. O(n log n)

  Answer And Explanation

  Answer: Option B

  Explanation:

  • View Answer
  • Comment on this question

• 28. The complexity of Bubble sort algorithm is

  1. O(n)
  2. O(log n)
  3. O(n2)
  4. O(n log n)

  Answer And Explanation

  Answer: Option C

  Explanation:

  • View Answer
  • Comment on this question