Navigate

Question Detail

Deletion from one end and insertion from other end is

  • stack
  • branch
  • tree
  • queue

Answer: Option D

Similar Questions :

1. Which is problem oriented language

  • BASIC
  • PL/I
  • FORTRAN
  • none of above

Answer: Option D

2. Deletion from one end and insertion from other end is

  • stack
  • branch
  • tree
  • queue

Answer: Option D

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

  • linear list
  • tree
  • stack
  • queue

Answer: Option C

4. What are the minimum number of queues needed to implement the priority queue?

  • One
  • Two
  • Three
  • Four

Answer: Option B

Explanation:

One queue is used for the actual storing of data, and the other one is used for storing the priorities.

5. O log(n) can be conneted with

  • Selection sort
  • Insertion sort
  • Binary sort
  • Merge sort

Answer: Option C

Read more from - Data Structure Questions Answers - Chapter 1