Navigate

Question Detail

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

  • stack
  • queue
  • deque
  • tree

Answer: Option C

Similar Questions :

1. Recursive problems are implemented by

  • queues
  • stacks
  • linked lists
  • strings

Answer: Option B

2. ++i is equivalent to

  • i = i + 2
  • i = i + 1
  • i = i + i
  • i = i - 1

Answer: Option B

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

  • floor address
  • first address
  • foundation address
  • base address

Answer: Option D

4. Which sorting method is slowest

  • Quick sort
  • Heap sort
  • Shell sort
  • Bubble sort

Answer: Option D

5. Which data structure is needed to convert infix notations to postfix notations

  • linear list
  • tree
  • stack
  • queue

Answer: Option C

Read more from - Data Structure Questions Answers - Chapter 1