adplus-dvertising
frame-decoration

Question

A data structure where elements can be added or removed at either end but not in the middle is called …

a.

linked lists

b.

stacks

c.

queues

d.

dequeue

Answer: (d).dequeue

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. A data structure where elements can be added or removed at either end but not in the middle is called …

Similar Questions

Discover Related MCQs

Q. When does top value of the stack changes?

Q. A ……………….. is a linear list in which insertions and deletions are made to from either end of the structure.

Q. In a priority queue, insertion and deletion takes place at ………………

Q. Which of the following is an application of stack?

Q. Which of the following name does not relate to stacks?

Q. The term "push" and "pop" is related to the

Q. A data structure where elements can be added or removed at either end but not in the middle

Q. Which data structure allows deleting data elements from front and inserting at rear?

Q. The postfix form of the expression (A + B)∗(C∗D − E)∗F / G is

Q. What is the postfix form of the following prefix expression -A/B*C$DE ?

Q. The minimum number of multiplications and additions required to evaluate the polynomial
P = 4x3+3x2-15x+45 is

Q. The data structure required to evaluate a postfix expression is

Q. The data structure required to check whether an expression contains balanced parenthesis is

Q. What data structure would you mostly likely see in a non recursive implementation of a recursive algorithm?

Q. The process of accessing data stored in a serial access memory is similar to manipulating data on a

Q. The postfix form of A*B+C/D is

Q. Let the following circular queue can accommodate maximum six elements with the following data
front = 2 rear = 4
queue = _______, L, M, N, ___, ___

What will happen after ADD O operation takes place?

Q. What is the postfix form of the following prefix:
*+ab–cd

Q. A queue is a,

Q. Which data structure is needed to convert infix notation to postfix notation?