Question

Download Solution PDF

Which of the following uses only increment operations for adding and removing element at either end?

  1. Queues
  2. Stacks
  3. Priority Queues
  4. Deques

Answer (Detailed Solution Below)

Option 4 : Deques

Detailed Solution

Download Solution PDF
Download Solution PDF
‹‹ Previous Ques
Next Ques ››
Exams Tests Super Practice

More Queue Questions

Q1.Which of the following uses only increment operations for adding and removing element at either end?
Q2.Time taken for addition of an element in a queue is of the order of 
Q3.Suppose a circular queue of capacity (n - 1) elements is implemented with an array of n elements. Assume that the insertion and deletion operations are carried out using REAR and FRONT as array index variable respectively. Initially, REAR = FRONT = 0. The conditions to detect queue empty and queue full are
Q4.A double‐ended queue (dequeue) supports adding and removing items from both the ends of the queue. The operations supported by dequeue are AddFront(adding item to front of the queue), AddRear(adding item to the rear of the queue), RemoveFront(removing item from the front of the queue), and RemoveRear(removing item from the rear of the queue). You are given only stacks to implement this data structure. You can implement only push and pop operations. What’s the time complexity of performing AddFront() and AddRear() assuming m is the size of the stack and n is the number of elements?
Q5.Consider the queues Q1 containing four elements and Q2 containing none (shown as the Initial State in the figure). The only operations allowed on these two queues are Enqueue(Q, element) and Dequeue(Q). The minimum number of Enqueue operations on Q1 required to place the elements of Q1 in Q2 in reverse order (shown as the Final State in the figure) without using any additional storage is___________. 
Q6.Suppose a circular queue of capacity (n −1) elements is implemented with an array of n elements. Assume that the insertion and deletion operations are carried out using REAR and FRONT as array index variables, respectively. Initially, REAR = FRONT = 0. The conditions to detect queue full and queue empty are
Q7.Consider the following operation along with Enqueue and Dequeue operations on queues, where k is a global parameter. MultiDequeue(Q){ m = k while (Q is not empty) and (m > 0) { Dequeue(Q) m = m – 1 } } What is the worst case time complexity of a sequence of n queue operations on an initially empty queue?
Q8.The five items: A, B, C, D, and E are pushed in a stack, one after the other starting from A. The stack is popped four times and each element is inserted in a queue. Then two elements are deleted from the queue and pushed back on the stack. Now one item is popped from the stack. The popped item is _____.
Q9.Consider a standard circular queue ‘q’ implementation (which has same condition for queue full and queue empty) whose size is 11 and the elements of the queue are q[0], q[1], .... q[10]. The front and rear pointers are initialized to point at q[2]. In which position will the ninth element be added ?
Q10.Typical time requirement for operations on queues is:

More Programming and Data Structure Questions

Q1.What is the output of the following code? int i = 1 ; while ( i <= 10 ) printf ( "%d\n", i );
Q2.Which of the following is the syntax of the conditional operator in C?
Q3.Which of the following is a unary operator in C?
Q4.If a C program contains only one function, it must be __________.
Q5.Which operator is used for bitwise OR in C?
Q6.What is the purpose of the sizeof operator in C?
Q7.Which of the following functions is used to find the length of a string in C?
Q8.The ternary operator can be used as a replacement for which loop/statement?
Q9.What is the limitation of the conditional operator (? :) in C?
Q10.What is a recursive function?
Testbook Edu Solutions Pvt. Ltd.
1st & 2nd Floor, Zion Building,
Plot No. 273, Sector 10, Kharghar,
Navi Mumbai - 410210
support@testbook.com
Toll Free:1800 833 0800
Office Hours: 10 AM to 7 PM (all 7 days)
Company
About usCareers We are hiringTeach Online on TestbookPartnersMediaSitemap
Products
Test SeriesTestbook PassOnline CoursesOnline VideosPracticeBlogRefer & EarnBooks
Copyright © 2014-2022 Testbook Edu Solutions Pvt. Ltd.: All rights reserved
User PolicyTermsPrivacy
Hot Links： teen patti real cash game teen patti gold downloadable content teen patti joy 51 bonus teen patti glory