COMPUTER SCIENCE AND ENGINEERING
DATA STRUCTURES
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
dQueue()
|
|
|
de.Queue(Item)
|
|
|
deQueue()
|
|
|
item.remove()
|
|
|
Cant be performed on a Queue Data Structure.
|
Detailed explanation-1: -In queue, insertion operation is known as Enqueue whereas deletion operation is known as Dequeue. Insertion and deletion operation in queue is known as enqueue and dequeue.
Detailed explanation-2: -In computer science, peek is an operation on certain abstract data types, specifically sequential collections such as stacks and queues, which returns the value of the top ("front") of the collection without removing the element from the collection.
Detailed explanation-3: -A queue is an example of a linear data structure, or more abstractly a sequential collection. Queues are common in computer programs, where they are implemented as data structures coupled with access routines, as an abstract data structure or in object-oriented languages as classes.
Detailed explanation-4: -Queue is a non-primitive linear data structure that permits insertion of an element at one end and deletion of an element at the other end. The end at which the deletion of an element take place is called front, and the end at which insertion of a new element can take place is called rear.