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,344 | 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 done on Queue are enque, deque, changing the value of element etc. | 1 |
2,345 | 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 |
2,346 | 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 insertion, deletion , finding the first element of queue using top function, etc. | 1 |
2,347 | 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 push the elements(enqueue) , pop elements from queue(dequeue). | 1 |
2,348 | 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 is used to add a new element in the queue.\nDequeue is used to delete the first element in the queue | 1 |
2,349 | 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 can perform\ninsertion - push\ndeletion - pop\noperations | 1 |
2,350 | 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 FIFO type datastructure.\nThe operations performed on queues-\nPush - Used for pushing or inserting the element in the queue from back.\nPop- Used for popping out an element from the front of the queue.\nTop- Used to get the top most element from the queue.\nRemove or delete- For removing a particular elemen... | 1 |
2,351 | 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() = insertion \ndequeue() = Deletion\ntop()\n | 1 |
2,352 | 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 are:\nenqueue, dequeue, pop, push, isfull, isempty, delete, sort etc | 1 |
2,353 | 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 create min, ,max heap, priority queue, which is works efficiently in searching max or min functions. | 1 |
2,354 | 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 use the first in first out technique. (FIFO) | 1 |
2,355 | 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 | fashion. If we want to store something in a data structure and pop(remove) it in the last, then we use this data structure | 1 |
2,356 | 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 can have the following operations-\nFirst in, First out\nSearching\nSorting\n\n | 1 |
2,357 | 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 perfomed on queues | 2 |
2,358 | 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 - enqueue, dequeue, isempty() | 1 |
2,359 | 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 operation - delete an element from rear\nPush operation - insert an element from front | 1 |
2,360 | 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()- to delete the element\nisempty()- to check is queue is empty or not\npush()- to insert a element on top \n | 1 |
2,361 | 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 and search. | 1 |
2,362 | 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 insert element\nPop --- To delete element\nSize---\nisEmpty- To check Empty Queue | 1 |
2,363 | 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 | 1 |
2,364 | 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 | 1 |
2,365 | 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 which can be performed on queues are:\n | 1 |
2,367 | 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()\nenqueue()\npeek()\n | 1 |
2,369 | 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 in queue are:\nenqueue(insertion) , dequeue(deletion), front(to get the first element), back(to get the last element), size(to get the size of a queue), isEmpty(to check whether it is empty or not), etc. | 2 |
2,370 | 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 | you can insert, remove and check the front element in a queue, you can also check the size of queue and whether it is empty or not | 2 |
2,371 | 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, pop, isempty | 2 |
2,372 | 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- returns and delete the first object or the object that was entered first\nenqueue- insert a new element at the end\nsize()- return the size of queues\nisempty- checks wether the queue is empty or not\nfront- to get the first element | 2 |
2,373 | 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 on queues is enque and deque | 2 |
2,374 | 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 structured as an ordered collection of items which are added at one end called rear end, and other end called front end. | 2 |
2,375 | 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\n2. dequeue\n3. isempty\n4. isfull\netc\n | 2 |
2,376 | 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 supports first in first out (FIFO) property, we can perform :\n1. pop operation -> It gives you first element that was inserted in queue\n2. push -> it pushes a element at last in queue\n3. front -> it gives you the front element present in queue | 2 |
2,377 | 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 are needed to insert and pop the data which it does in constant time complexity. It follows the FIFO(First first out) fashion.\nInsertion and deletion of the data is very simple in case of queues. There are various other operations that a user can perform by using Queues. | 2 |
2,378 | 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, push and many other. | 2 |
2,379 | 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: adding a element at the end of the queue.\n2. dequeue: deleting an element from the front of the queue.\n3. traversal\n | 2 |
2,380 | 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-insert an element at the end of the queue\npop-remove an element from the front of the array | 2 |
2,381 | 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 function\nPop function\nTop function\ndelete function\nare the function performed on queues | 2 |
2,382 | 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 in first in first out in this data structure first element is get out at last and last element is out at last | 2 |
2,383 | 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 | Merge sort and quick sort are examples of divide and conquer algorithms | 2 |
2,384 | 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()\n2)Dequeue() \n3)Peek() \n4)isEmpty() \n5)isNull() | 2 |
2,385 | 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 | Comparing with real life scenarios, like the ticket line, songs playlist.\n\nWe can control as per our preferences (and even the generic preferences - Priority Queue), the order of activities that we want to experience. Some performable operations will be - \n1. Insertion 2. Deletion 3. To know what's at the top 4. To ... | 2 |
2,386 | 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\n2) Deque\n3) Front\n4) Insert\n5) pop | 2 |
2,387 | 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 | Common operation are;(FIFO property)\n1.Insertion from top;\n2.Deletion from top;\n3Retrieval; | 2 |
2,388 | 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 on queues are:\nEnqueue\nDequeue\nInsert\n | 2 |
2,389 | 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 and Retrieval. | 1 |
2,390 | 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 (known as Push)\nDelete (known as Pop - can only be used on the chronologically first entered number)\n | 1 |
2,391 | 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 linked list are-;\n1-push( )-which pushes the element in the queue\n2-top( )-to get the top element of the queue\n3-pop( )-to remove the top element from the queue | 1 |
2,392 | 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)insert\n2)delete\n3)retrieve | 1 |
2,393 | 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 are the functions required to make a queue in c++ . Queue follows first in first out. | 1 |
2,394 | 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 | it works on FIRST IN FIRST OUT principle. we can perform various operations like:\npush()->inserting in queue.\npop()->deleting form queue.\ntop()->gives the top element of queue. | 1 |
2,395 | 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(),top() etc. | 1 |
2,396 | 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,push/push_back,sorting,top,etc. | 0 |
2,397 | 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 | 2 |
2,398 | 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 perform on queues are-push, pop , remove . | 0 |
2,399 | 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 the queue operation will be used that the element of array initialize first in last out. | 0 |
2,400 | 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 | 0 |
2,401 | 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 similar to stack but it follows the principle of FIFO; that is first in first out. Many operations can be performed om queue like sorting and searching. | 1 |
2,402 | 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 of element, deletion of an element, swapping between elements, traversing on elements. | 1 |
2,403 | 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 can be performed on queues Priority Queues can also be made. Queues follow FIFO principle. | 2.5 |
2,404 | 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 can perform push,deletion,searching | 0 |
2,405 | 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 \ndeque are the operation which can be performed on queue | 2.5 |
2,406 | 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 dequeue can be performed on queues. | 1 |
2,407 | 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 on queues are-: push, pop, isempty etc. | 0 |
2,408 | 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, top | 0 |
2,409 | 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\n2. dequeue\n3. isfull\n4. isempty | 2.5 |
2,410 | 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 | Two common operations that can be performed on a queue includes insertion and deletion. | 0 |
2,411 | 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, front are some of the operation that can be performed on Queues.\n\n | 0 |
2,412 | 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 in queue and pop and top are perform in queue | 0 |
2,413 | 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: push to first location\n2.Pop: pop from first location\n3. Delete: from a particular position.\n | 0 |
2,414 | 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\n | 2.5 |
2,416 | 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 on queues are\npush, pop, insert, delete\n | 0 |
2,417 | 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 , sorting , searching are the operation | 2.5 |
2,418 | 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 are two operations that can be performed on queue. | 2 |
2,419 | 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 |
2,420 | 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 on queues can be performed such as lifo (last in first out ) | 0.5 |
2,421 | 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 | Several operations can be performed on queue like:-\n1. Insert:- To insert a value in queue from the rear side\n2. Delete:- To delete the value from queue from the front side.\n3. Traverse:- To visit the elements and values on queue.\n4. Edit:- To edit the values of queue.\n5. Store:- The values can be stored in queue ... | 2.5 |
2,422 | 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 | enqeue ,deqeue | 2.5 |
2,423 | 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 two operation perfom on Queues:\n--> Enqueues\n-->Dequeues | 2 |
2,424 | 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 queue we can performed sorting ,searching ,insertion and deletion operations | 0 |
2,425 | 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 \ndeletion\n | 2.5 |
2,426 | 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 | Enque: Inserting data in Queue\nDeque: Deleting data from Queue | 2 |
2,427 | 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, pop,push | 0 |
2,428 | 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 etc | 0.5 |
2,429 | 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 |
2,430 | 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 on Queues are :\nEnqueue : Enter the element in the queue via the end of the queue\nDequeue: Remove the element in the queue via the start of the queue\nisFull : Checks if the queue is full or not\nisEmpty : Checks if the queue is empty or not | 2.5 |
2,431 | 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 is | 0 |
2,432 | 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,\ninsert .delete | 2 |
2,433 | 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 use enqueue and dequeue | 2 |
2,434 | 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: Queues follow the Last in first out order. | 1 |
2,435 | 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 the method which is used insert update delete | 0 |
2,437 | 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 provide fist in last out FILO approach operation insert delete push pop | 0 |
2,438 | 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. | 1 |
2,439 | 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)enqueue\n4)dequeue\n5)isempty()\n6)isfull() | 2.5 |
2,440 | 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 | sorting, searching, algorithms can be performed on queues | 0 |
2,441 | What is linear searching? | Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search i... | Linear Searching is a basic searching algorithm in whick the element to be searched is stored within a variable and is then compared with every element of the array till the element we are looking for is found. | 2 |
2,442 | What is linear searching? | Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search i... | linear searching is when we search for the elements from beginning to end and at whatever location the number is found we return its address its time complexity is O(n) | 2.5 |
2,443 | What is linear searching? | Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search i... | in linear searching we search for the given element one after the other so the time complexity of linear searching is O(nm) \nit can be useful if we a small array | 1.5 |
2,444 | What is linear searching? | Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search i... | Linear search checks every element of the data structure and checks if the values match, if not, it moves on to the next element | 2 |
2,445 | What is linear searching? | Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search i... | Linear search is basic searching algorithm which goes through the entire data structure like an array and returns tthe element if it is found. It checks the entire length of the data structure and hence is less time efficient. | 2 |
2,446 | What is linear searching? | Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search i... | Linear search is used to search a element in a data structure like array, string in o(n) time complexity. Here we implement a for loop on to traverse the data structure and match its every element to the element we are searching for, if it gets matched ,then break and we get out of loop. | 2.5 |
2,447 | What is linear searching? | Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search i... | linear searching is the simplest method of searching a data set. | 1 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.