Unnamed: 0 int64 1 5.86k | Question stringclasses 24
values | Sample ANS stringclasses 24
values | Student ANS stringlengths 1 1.06k | Score float64 0 2.5 |
|---|---|---|---|---|
2,242 | What operations can be performed on Queues? | The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full | Operations that can be performed on queues are:\n1. Insertion\n2. deletion\n3.rbegin\n4.rend | 2.5 |
2,243 | What operations can be performed on Queues? | The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full | Various Operations that can be performed on Queues are:-\n1)Push_back\n2)rend\n3)rbegin\n4)begin\n5)end\n5)pop\n6)deletion | 1 |
2,244 | What operations can be performed on Queues? | The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full | Following operations can be performed on queues:\nInsertion\nDeletion\nSelection\nPush back\nEnd\nBegin\nPop | 2.5 |
2,245 | What operations can be performed on Queues? | The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full | The following operations can be performed on Queues:\n1)Insertion\n2)Deletion\n3)Selection\n4)End\n5)Begin\n6)Pop | 2.5 |
2,246 | What operations can be performed on Queues? | The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full | Deletion, Selection, Insertion, Pop, Begin | 2.5 |
2,247 | What operations can be performed on Queues? | The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full | We can perform various operations on queues like Insertion,Deletion,Union etc. | 2.5 |
2,248 | What operations can be performed on Queues? | The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full | Major operation performed on queue are\n1. Enqueue - Used to insert data in queue in FIFO order.\n2. Dequeue - Used to remove data from queue. it always removes first element.\n3. Front - used to return first node or first element from queue. | 2.5 |
2,249 | What operations can be performed on Queues? | The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full | queues follow FIFO , first in first out \nenqueue and dequeue\nDFS can be performed using Queue | 1 |
2,250 | What operations can be performed on Queues? | The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full | enqueue, dequeue, insertion and deletion based upon FIFO (First In First Out) technique and searching is also done by removing each element and inserting them back. | 2.5 |
2,251 | What operations can be performed on Queues? | The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full | push and pop operations can be performed on queues | 2 |
2,252 | What operations can be performed on Queues? | The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full | Insertion and deletion can be performed in queue. Since in follows FIFO (first in first out). New data is inserted at latest node and data is deleted from earliest node. | 2 |
2,253 | What operations can be performed on Queues? | The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full | storing of data \nimplementations of stack and various data structures\nfirst go first come type scheme\n | 2 |
2,254 | What operations can be performed on Queues? | The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full | Operations that can be performed on Queues - \n1. Push - inserting an element\n2. Pop - deleting an element\n3. front - getting the top element \n4. end - getting the last inserted element\n5. empty- to find if the queue is empty or not | 2.5 |
2,255 | What operations can be performed on Queues? | The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full | Queues follow the first in first out approach\nQueues have the following operations\n1) insert/enqueue\n2) delete/ dequeue\n3) front \n | 2 |
2,256 | What operations can be performed on Queues? | The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full | 1)Insertion\n2)Deletion\n3)Updation-Priority queue | 1.5 |
2,257 | What operations can be performed on Queues? | The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full | add or remove an element , compare elements , etc | 1 |
2,258 | What operations can be performed on Queues? | The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full | Queue()\nenqueue()\nempty()\nnull()\npeek() | 2.5 |
2,259 | What operations can be performed on Queues? | The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full | insertion and pop operation | 1 |
2,260 | What operations can be performed on Queues? | The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full | Some of the operations that can be performed on queues are:\n1. insertion\n2. deletion | 1 |
2,261 | What operations can be performed on Queues? | The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full | The operations that could be performed on queue(FIFO) are push(helps too insert), pop(helps to delete the first position); first(returns the first position data); last( returns the last position data). | 2.5 |
2,262 | What operations can be performed on Queues? | The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full | Many operations can be performed on queues like insertion of element and deletion of elements and searching and sorting | 1 |
2,263 | What operations can be performed on Queues? | The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full | Operation that can be perform on Queues are insertion, deletion and searching. | 2.5 |
2,264 | What operations can be performed on Queues? | The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full | QUEUE IS FOLLOW THE FIFO THE OPERATIONS ARE PERFORMED IN ARE :-\nINSERTION \nUPDATION \nDELETION | 2.5 |
2,265 | What operations can be performed on Queues? | The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full | enqueue , deque, peek, isfull | 2.5 |
2,266 | What operations can be performed on Queues? | The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full | The following operations can be performed on queues: \n1. Insertion\n2. Deletion | 2.5 |
2,267 | What operations can be performed on Queues? | The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full | Enqueue, Dequeue, Search, Empty, Reverse are some of the operations. | 2.5 |
2,268 | What operations can be performed on Queues? | The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full | insert back and pop front, other operations can include iterating the data | 1 |
2,269 | What operations can be performed on Queues? | The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full | 1.Insertion \n2. Deletion \nQueue is used to perform breadth first search in trees or graphs.\n | 2.5 |
2,270 | What operations can be performed on Queues? | The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full | insertion, deletion, searching, | 1 |
2,271 | What operations can be performed on Queues? | The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full | 1. reversing\n2 traversing\n3. searching of an element.\n4. sorting | 2.5 |
2,272 | What operations can be performed on Queues? | The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full | Following operations can be performed on Queues:\n->Enqueue\n->delqueue\n->delete | 2.5 |
2,273 | What operations can be performed on Queues? | The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full | Deletion, merging, insertion can be used on queue while priority queue arranges the information with respect to the information provided by the user. | 1 |
2,274 | What operations can be performed on Queues? | The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full | the operations that can be performed in queues are\n1 push( insert an element)\n2. delete( delete the element from the queue)\n3 emptying of queue | 2.5 |
2,275 | What operations can be performed on Queues? | The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full | The queue operations are as follows:\n\n1.create\n2.enqueue\n3.dequeue\n4.isEmpty\n5.isFull\n6.size | 2.5 |
2,276 | What operations can be performed on Queues? | The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full | enqueue (push)\ndequeue (pop)\ntraversal | 2.5 |
2,277 | What operations can be performed on Queues? | The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full | queues is used for first in first out and it is uesd for various operation such as BFS and varipous other operation .it is used to treverse on level vise on the graph. | 2.5 |
2,278 | What operations can be performed on Queues? | The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full | queue()\ndequeue()\nfront()\nisEmpty()\npush() | 2.5 |
2,279 | What operations can be performed on Queues? | The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full | Queues are FIFO (first in first out).Can be related as to a queue of a movie ticket .push() pop() front() top() enqueue() dequeue() | 2.5 |
2,280 | What operations can be performed on Queues? | The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full | basic operations that can be performed on queues are :\nEnqueue() - Insertion of elements to the queue.\nDequeue() - Removal of elements from the queue.\nPeek() - Acquires the data element available at the front node of the queue without deleting it.\nisFull() - Validates if the queue is full.\nand many more. | 2.5 |
2,281 | What operations can be performed on Queues? | The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full | operations can be performed on queues are insertion deletion merging searching sorting | 2.5 |
2,282 | What operations can be performed on Queues? | The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full | enqueue and dequeue | 2.5 |
2,283 | What operations can be performed on Queues? | The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full | enqueue-add data to queue\ndqueue-delete data from queue\nsearch element \n | 2.5 |
2,284 | What operations can be performed on Queues? | The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full | Enqueue, Dequeue | 2.5 |
2,285 | What operations can be performed on Queues? | The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full | Dequeue, Enqueue are the operations can be performed on Queues. | 2.5 |
2,286 | What operations can be performed on Queues? | The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full | Operations in queue are- enqueue, dequeue, peek. | 2.5 |
2,287 | What operations can be performed on Queues? | The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full | deletion, insertion, sorting , | 2.5 |
2,288 | What operations can be performed on Queues? | The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full | Queue implements First In First Out(FIFO). \nInserts the element and takes out that element first. | 2.5 |
2,289 | What operations can be performed on Queues? | The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full | The operation that can performed on Queues are Push() , Pop() , Top() and etc. | 2.5 |
2,290 | What operations can be performed on Queues? | The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full | queue, dequeue, front | 2.5 |
2,291 | What operations can be performed on Queues? | The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full | queues are basically first in first out (FIFO) so it helps in many ways to solve problems | 2.5 |
2,292 | What operations can be performed on Queues? | The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full | Operations that can be performed on a queue:-\n1. Enqueue (insertion)\n2. Dequeue (deletion)\n3. Traversal | 2.5 |
2,293 | What operations can be performed on Queues? | The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full | push pop enqueue dequeue | 2.5 |
2,294 | What operations can be performed on Queues? | The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full | Following operations can be performed on queues:\n1- Insertion\n2- Deletion\n3- Searching | 2.5 |
2,295 | What operations can be performed on Queues? | The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full | Enqueue , Dequeue | 2.5 |
2,296 | What operations can be performed on Queues? | The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full | On analysis if n queens problem when observing a queen, we can discard the entire row, and entire column of the 2D array. Further we can eliminate other positions by going from [ i ][ j ] to [ i+1 ][ j+2 ] till the end of the j column and then doing j++. A queen can move vertically, horizontally and diagonally form her... | 2.5 |
2,297 | What operations can be performed on Queues? | The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full | like push refers to adding an element to a queue\npop refers to deleting a top element from a queue. | 2 |
2,298 | What operations can be performed on Queues? | The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full | FIFO Type Data Structure(First in First Out)\nOperation:\n->pop\n->push | 2 |
2,299 | What operations can be performed on Queues? | The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full | FILO operations can be performed , to build heap we use queues. | 1 |
2,300 | What operations can be performed on Queues? | The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full | Operations that can be performed on Queues are enqueue i.e., adding an element to the end of the queue , dequeue i.e., remove an element from front of a queue, isempty to check if queue is empty or not. | 1 |
2,301 | What operations can be performed on Queues? | The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full | push \npop | 1 |
2,302 | What operations can be performed on Queues? | The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full | Enqueue() \nDequeue() \nPeek() \n | 2 |
2,303 | What operations can be performed on Queues? | The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full | q.push - insert elements in queue\nq.pop - delete elements in queue\nq.isempty() - checks if the queue is empty or not \n | 2 |
2,304 | What operations can be performed on Queues? | The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full | Queue is used to store data and then retrieve it in the same order as placed. We can insert, delete, and search in a queue. | 2 |
2,305 | What operations can be performed on Queues? | The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full | operations that can be performed on Queues are push and pop. | 1 |
2,306 | What operations can be performed on Queues? | The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full | pop(): Removes the element from the front\npush_back(): pushes the element at the back\ntop(): return the front most element\nempty(): checks whether the queue is empty or not | 2 |
2,307 | What operations can be performed on Queues? | The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full | push, pop, sort, are the most basic operations that can be performed on queues. push gives us the first entered element. pop deletes the first entered element. Queue works on FIFO: First in first out. | 2 |
2,308 | What operations can be performed on Queues? | The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full | top():returns the top element\npop():eliminates the top element\nempty():to check whether the queue is empty or not | 1 |
2,309 | What operations can be performed on Queues? | The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full | Push and Pop operations can be performed on Queues. We can also check if it's empty or not. | 1 |
2,310 | What operations can be performed on Queues? | The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full | Stacks follow LIFO order. Last in first out.\nThey are used because we can insert and delete elements in them with ease. | 1 |
2,311 | What operations can be performed on Queues? | The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full | 1. Enqueue - Insertion\n2. Dequeue - Deletion\n3. Traversal \n4. isempty\n5. isfull\n6. find top element | 2 |
2,312 | What operations can be performed on Queues? | The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full | push operation,\npop operation,\nsearch operation | 2 |
2,313 | What operations can be performed on Queues? | The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full | Enqueue()\nDequeue() \nPeek()\nisFull() \nisNull()\n | 1 |
2,314 | What operations can be performed on Queues? | The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full | Expressions with operands and operators can be evaluated using a stack. To check whether the parenthesis in an expression match, stacks can be utilised for backtracking. Additionally, it can be used to change one expression into another. It can be applied to methodical memory management. | 2 |
2,315 | What operations can be performed on Queues? | The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full | Some operations that can be applied on the queues are:\n1. Push (to insert elements at the end of the queue)\n2. Pop (to remove elements from the start of the queue)\n3. Seek (Top) operation (to get the first elem of the queue)\n4. Size operation (to get the size of the queue) | 2 |
2,316 | What operations can be performed on Queues? | The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full | 1) create\n2) enqueue\n3) dequeue\n4) isEmpty\n5) isFull\n6) size | 1 |
2,317 | What operations can be performed on Queues? | The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full | 1. We can find front element\n2. Rear Element\n3. Pop out elements\n4. Sorting\n5. Searching\n6. Number of elements | 1 |
2,318 | What operations can be performed on Queues? | The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full | pushback(). top(), pop() and other operations can be used on queue. | 2 |
2,319 | What operations can be performed on Queues? | The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full | isempty \nsearch \nenqueue\ndequeue | 2 |
2,320 | What operations can be performed on Queues? | The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full | The most common operations on queue are Push and Pop. | 1 |
2,321 | What operations can be performed on Queues? | The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full | or \ | 2 |
2,322 | What operations can be performed on Queues? | The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full | There are many opearions that can be done on Queues. Some of them are :\n1. Insertion\n2. Deletion\n3. Traversal | 1 |
2,323 | What operations can be performed on Queues? | The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full | Extraction of first element present or we can call popping out, Reducing the size of the queue, Sorting on queues are possible, Min-Max elements retrieval, Insertion , Deletion | 2 |
2,324 | What operations can be performed on Queues? | The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full | 1. push operation to add some object in the queue\n2. pop operation to remove some object from the queue\n3. seek operation returns the object present at the first place in a queue\n4. size operation returns the size of the queue\n5. is_empty operation to check whether the queue is empty or not | 1 |
2,325 | What operations can be performed on Queues? | The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full | Inserting , deleting ,searching , traversing . | 2 |
2,326 | What operations can be performed on Queues? | The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full | Queues are used for their FIFO (First In First Out) properties. The operations that can be performed are pop, push, peek, is empty. | 2 |
2,327 | What operations can be performed on Queues? | The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full | Stack uses LIFO (Last In First Out) principle which means that element occurred last will exit first. It majorly used in reversing the given input and also in some algorithm of Graphs and trees. | 1 |
2,328 | What operations can be performed on Queues? | The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full | operations which can be performed on queues are:\ncomparison of string , calculating the pattern we want from text,\nqueue ca be used in binary tree for finding complete binary tree | 1 |
2,330 | What operations can be performed on Queues? | The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full | create, eequce, dequce, size, is empty, is full. | 1 |
2,332 | What operations can be performed on Queues? | The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full | pop()->deletes the very first element in the queue, push(x)-> inserts x at the back of the queue, size()->tells the size of the queue, empty()-> checks whether the queue is empty. | 1 |
2,333 | What operations can be performed on Queues? | The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full | The Operation performed in queues are\n Enqueue (for inserting the element )\nDequeue (for removing the element )\n | 1 |
2,334 | What operations can be performed on Queues? | The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full | In queues we can perform \na)push()\nb)pop()\nc)delete() \nd)isEmpty() operations | 2 |
2,335 | What operations can be performed on Queues? | The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full | some operations are:\n1)queue- add element to the queue\n2)dequeue-remove element from the queue | 1 |
2,336 | What operations can be performed on Queues? | The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full | insertion, deletion can be performed on queues | 1 |
2,337 | What operations can be performed on Queues? | The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full | insertion ,deletion | 1 |
2,338 | What operations can be performed on Queues? | The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full | first in first out operations | 1 |
2,339 | What operations can be performed on Queues? | The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full | push() ->to push the data into the queue , pop()-> to remove the front element , top() -> to show the value of the front element | 2 |
2,340 | What operations can be performed on Queues? | The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full | The most common algorithms that can be performed on a Queue are \npush - to insert an element\npop - to get the first inserted element\nisempty - to check if the stack is empty | 1 |
2,341 | What operations can be performed on Queues? | The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full | 1.push:can enter an element\n2.pop: can delete the element at the top\n3.front: can return the top element(which is entered in starting)\n4.size: can return the size of existing queue\n | 2 |
2,342 | What operations can be performed on Queues? | The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full | We can perform operations like enqueue(insertion in queue) , dequeue(deletion in queue). | 1 |
2,343 | What operations can be performed on Queues? | The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full | dequeue : to remove the first element from the queue.\nenqueue : to push an element at the end of the queue. | 1 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.