A double-ended queue allows A. adding elements at one end and removing them from both ends B. adding elements at one end, removing them from the other end, and viewing (first) elements at either end. C. adding, removing, and viewing elements at either end. D. adding elements at both ends and removing them from one end E. none of the above

A data structure in which elements can be inserted or deleted at/from both the ends but not in the middle:AQueueBCircular queueCDequeueDPriority queue

A data structure in which elements can be inserted or deleted at/from both the ends but not in the middle is?a) Queueb) Circular queuec) Dequeued) Priority queue

Question 12 1 Point A queue follows the principle of: Last-in, First-out (LIFO) First-in, First-out (FIFO) Random In, Random Out (RIRU) None of the above Question 13 1 Point How can you add an element to a queue? Insert it anywhere Insert it at the beginning Insert it at the end (back) You cannot add elements to a queue Question 14 1 Point How can you remove an element from a queue? Remove it anywhere Remove the last element added Remove the first element added (front) You cannot remove elements from a queue Question 15 1 Point What is the name for the first element that can be removed from a queue? Top element First element Current element Head element Question 16 1 Point What real-world scenario is similar to a queue? A stack of plates A branching pipe A waiting line at a store A conveyor belt moving in a circle Question 17 1 Point Queues are considered: A complex data structure A fundamental data structure An obsolete data structure Rarely used in applications Question 18 1 Point You can access any element in a queue at any time. True False Question 19 1 Point Queues are used in computer networks to handle incoming data packets. True False Question 20 1 Point Reservation centers use queues to manage customer requests. True False Question 21 1 Point A newly created queue is always full. True False

eries of operations: add(‘k’), add(‘m’), add(‘n’), remove(), add(‘s’) and remove() are performed on an empty queue of size 4. Which of the following is FALSE?AThe next add operation will set tail to 0BThe next two calls to add(item) will make the queue fullCThe value of front is 2 and and the value of tail is 3DThe next delete operation will set front to 0

if front == -1 && rear == -1In the Array implementation of the queue,the above statement implies that: queue isOptionsnone of theseemptyfullhaving a single element