Data Structure Questions Answers - Chapter 1

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

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

  Answer And Explanation

  Answer: Option B

  Explanation:

  • View Answer
  • Comment on this question

• 9. Which is problem oriented language

  1. BASIC
  2. PL/I
  3. FORTRAN
  4. none of above

  Answer And Explanation

  Answer: Option D

  Explanation:

  • View Answer
  • Comment on this question

• 10. Sort which compares adjacent elements in a list and switches where necessary is

  1. Insertion sort
  2. Heap sort
  3. Quick sort
  4. Bubble sort

  Answer And Explanation

  Answer: Option D

  Explanation:

  • View Answer
  • Comment on this question

• 11. Recursive problems are implemented by

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

  Answer And Explanation

  Answer: Option B

  Explanation:

  • View Answer
  • Comment on this question

• 12. Recursive problems are implemented by

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

  Answer And Explanation

  Answer: Option B

  Explanation:

  • View Answer
  • Comment on this question

• 13. A linear list from which elements can be added or removed from either end is called

  1. stack
  2. queue
  3. deque
  4. tree

  Answer And Explanation

  Answer: Option C

  Explanation:

  • View Answer
  • Comment on this question

• 14. Which is ALGOL based simulation language

  1. FORTRAN
  2. SIMSCRIPT
  3. GASP IV
  4. none of above

  Answer And Explanation

  Answer: Option B

  Explanation:

  • View Answer
  • Comment on this question