Identify the data structure which allows deletions at both ends of the list but insertion at only one end.

Home / Engineering / Data Structure (DS) / Question

M

Mr. Dubey • 51.17K Points
Coach

Q.) Identify the data structure which allows deletions at both ends of the list but insertion at only one end.

(A) input restricted dequeue

(B) output restricted qequeue

(C) priority queues

(D) stack

Correct answer : Option (A) - input restricted dequeue

Share

Discusssion

Login to discuss.

Related MCQs on Data Structure (DS)

Q. Removing duplicate records is a process called _____________.

Q. Which of the following is true of a network structure?

Q. Domain constraints, functional dependency and referential integrity are special forms of

Q. Regarding bias and variance, which of the following statements are true? (Here ‘high’ and ‘low’ are relative to the ideal model. (i) Models which overfit are more likely to have high bias (ii) Models which overfit are more likely to have low bias (iii) Models which overfit are more likely to have high variance (iv) Models which overfit are more likely to have low variance

Q. What refers to the externally observable structure of an OO program?

Q. If there is a solution, breadth first search is _______________to find it

Q. A formula consisting of disjunctions of min-terms is called _________.

Q. primary parts oc c comipler is in

Q. Which of the following is not the internal sort?

Q. HFC contains _______