4 votes 4 votes A ________ is a linear list in which insertions and deletions are made to from either end of the structure. Circular queue. Priority queue. Stack. Dequeue. DS nielit2016dec-scientistb-it data-structures queue + – admin asked Mar 31, 2020 • retagged Aug 23, 2020 by Lakshman Bhaiya admin 2.0k views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply Hradesh patel commented Apr 3, 2020 i edited by Hradesh patel Jul 30, 2020 reply Follow Share Dequeue 2 votes 2 votes aanchal008 commented May 9, 2020 reply Follow Share In dequeue insertion and deletion can be done from both the ends. 1 votes 1 votes Please log in or register to add a comment.
1 votes 1 votes (D).Dequeue Deque or Double Ended Queue is a generalized version of Queue data structure that allows insert and delete at both ends. Operations on Deque: insertFront(): Adds an item at the front of Deque. insertLast(): Adds an item at the rear of Deque. deleteFront(): Deletes an item from front of Deque. deleteLast(): Deletes an item from rear of Deque. Saitheja Muthoju answered Apr 26, 2020 Saitheja Muthoju comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes D) Dequeue. Dequeue means double ended queue.It can act as queue from front as well as from rear side.Thats why both insertion and deletion is possible from either end. vivekkumar11112 answered Jun 30, 2020 vivekkumar11112 comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes Dequeue: it's actually DE-queue, i.e Double Ended Queue. Unlike a simple queue, it allows insertions and deletions from either side of the structure. Shashi Kamal Chakrab answered Jul 30, 2020 Shashi Kamal Chakrab comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes The Option D As in Dequeue, insertion and deletion can be done from both sides jordan17 answered Aug 19, 2020 jordan17 comment Share Follow See all 0 reply Please log in or register to add a comment.