Harsh-7300/dataset huggingface dataset:
Question: Why do we use stacks?
Reference answer: Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.

Student answer: stack is used to implement last in first out ( LIFO) . the element we enter 
Score: 1.0

Student answer: We use stacks in the cases where we need to get the data from only one direction. It works on the principle of LIFO so in any case where we want to store the data in a linear data structure and we only need to get or access the element that was last inserted in in we use Stacks. It is very commonly used in search algorithms for Graphs. 
Score: 2.0

Student answer: Stacks are LIFO (Last In First Out) operators. Stack are used in balanced parenthesis problems where we have to check if the opening parenthesis are balanced by the number of closing parenthesis.
Score: 2.0

Student answer: Stack is a linear data structure which follows the LIFO principle which says that last in first out and in many problems we need LIFO principle and we easily solve those problems by using stack.
Score: 2.0

Student answer: when we have problem where we have to implement last in first out
Score: 2.0

Student answer: Stacks are used in order to store data such that only 1 field is required at that time. As the name suggests, its just like stack of blocks we can say storing the data.\nTo take an example in order to make it more clear we use stacks in undo and redo operations.  like in undo it gives what was the last step done.  
Score: 2.0

Student answer: stacks are used to arrange the function calls in any problem, where we use the concept of last in first out, that is it for example there is a function which is has a function call of a print function within so it stops the execution right away and puts the print function on top now and solves it first and then goes back to the original problem.
Score: 1.0

Student answer: We use stacks as it eases the process of algorithm as the elements get arranged like stacks.
Score: 1.0

Student answer: Stacks basically follows the principle of LIFO that is last in first out. And at many places we want this principle and hence we use stack there. Example where we use stack is  depth first search.
Score: 1.0

Student answer: Stacks work on the principle of LIFO that is Last In First Out. So whenever we deal with a problem where we need to deal with the current element first we would use stack.
Score: 1.0

Student answer: stacks follows first in last out property. so where we need to perform an operation where this type of operation is needed we use a stack.\n
Score: 1.0
Question: Why do we use stacks?
Reference answer: Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.

Student answer: Stack are the data structure use to store the element in such a way that the element which will come in Last, will get out firstly.\nIt obeys LIFO property and hence whenever we need it we use it.\nSome examples of use of stack are Depth First Search, For doing preorder or inorder traversal iteratively without using internal stack space, For solving any recursive problem, the system internally uses the stack.\n
Score: 1.0

Student answer: in stacks as we use LIFO last in first out therefore it helps in problems where we need the data we entered last before others.
Score: 1.0

Student answer: We use stacks in cases when we need to insert the data from front and also take it(pop) from front. For instance in a library book management system we can use stacks for storing the data regarding the books. 
Score: 1.0

Student answer: we use stacks to store the elements , then we can pop ,push the element , find the topmost element, etc.
Score: 1.0

Student answer: Stacks uses the LIFO technique to form a linear data structure. 
Score: 1.0

Student answer: We use stacks to store data in the \
Score: 1.0

Student answer: Stack is used when we require a linear data structure which follows LIFO technique. it is very useful when we need to apply recursion in program.
Score: 1.0

Student answer: stacks are used for finding the particular order in whcih actions are perfomed.
Score: 1.0

Student answer: Stack is based in Last In First Out property. These are at the basic level arrays only and can be implemented from the same. These are useful for performing quick operations like push, pop and where we need to remember the last element at which we were as it makes accessing the last element easier than in an array. 
Score: 1.0

Student answer: Stack follows FILO - First In Last Out rule.
Score: 1.0

Student answer: stacks are used first in first out problems. the data enter first is pop out first
Score: 1.0

Student answer: because it follows LIFO rule.
Score: 1.0

Student answer: Stacks are used to solve the problem where the data moves in FirstIN LastOUT manner
Score: 1.0

Student answer: We use stacks to store the data with last in first out system.it is used as a container to store the data items.
Score: 1.0

Student answer: We use stack because:\na)to organize the data (large data)\nb)to provide the best time complexity\nc)to make our question easier
Score: 1.0

Student answer: We use stacks to store the data in form of LIFO i.e Last in first out
Score: 1.0

Student answer: we use stacks because of the feasibility of use and we also use it for back tracking.\nit also helps in converting one form of equation to another from.\n\n
Score: 1.0

Student answer: Stacks can be used mainly for backtracking. It can also be used for convert one expressions to another expressions.
Score: 1.0
Question: Why do we use stacks?
Reference answer: Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.

Student answer: stack is basically used for last in first out scenarios. It can be used in backtracking for eg. to check parenthesis matching in an expression
Score: 1.0

Student answer: we use stack to solve the algorithmic problems that require LIFO (Last in first out) data structures
Score: 1.0

Student answer: Stacks use LIFO operation which means Last data in will be displayed first. It can be used in DFS tree traversal. 
Score: 1.0

Student answer: We use stack for applications that need first in last out type applications. It is a data structure that stores data in such a way that data entered last leaves first. It is also used to remove recursion.\n
Score: 1.0

Student answer: Stack data structure follows the principle where the first input is will be output last . It is used where we need to store the previous information but the operation we are asked to perform on the last entered input . LIKE STACK DATA STRUCUTURE IS USED IN DFS TRAVERSAL OF GRAPH .
Score: 1.0

Student answer: stack is used to store data in first in last out manner.
Score: 1.0

Student answer: stack are lifo operation which means the data we entered at last will come out at first.
Score: 1.0

Student answer: Stack is a data structure which has property of last in first out (LIFO), so we can access only top element. It is widely used in recursive approaches such as devide and conquer algos as it stores all the recursive calls made. It is also used in evaluating prefix and postfix notations.
Score: 1.0

Student answer: Stacks are needed to insert and pop the data which it does in constant time complexity. It follows the LIFO(last in first out) fashion.\nInsertion and deletion of the data is very simple in stacks. There are various other operations that a user can perform by using stacks.
Score: 2.0

Student answer: stack used when we want to follow the order of LIFO. last in first out element arrive in last will remove at first.
Score: 2.0

Student answer: stacks work on last in first out basis. We use stack or queue instead of arrays/lists when we want the elements in a specific order i.e. in the order we put them (queue) or in the reverse order (stack). \nstacks are dynamic while arrays are static. So when we require dynamic memory we use queue or stack over arrays
Score: 2.0

Student answer: we use stack when we have to process data in linear manner
Score: 2.0

Student answer: Stack Data structure is of LiFo type data structure i.e. \nLast in first out type it is used in many algorithms but the main use of stack is while doing problems \nthat use recursion as the last call of any recursive function will be executed first
Score: 2.0
Question: Why do we use stacks?
Reference answer: Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.

Student answer: stacks are used on the concepts of last in first out which includes a data structure in which element which is added first come out last and the element which is inserted at lsst is first out
Score: 2.0

Student answer: The approach to develop algorithms depends on the problem we are solving that is given to us. An appropriate data structure is chosen, multiple of them can be used as such. And then we try to reach the end goal of the solution using the least amount of traversal or time complexity and manipulate our data accordingly.   
Score: 2.0

Student answer: A Stack can be used for evaluating expressions consisting of operands and operators. Stacks can be used for Backtracking, i.e., to check parenthesis matching in an expression. It can also be used to convert one form of expression to another form. It can be used for systematic Memory Management.\n
Score: 1.0

Student answer: LIFO data structures. Last in First Out.\nSo we can use stack when we want to compare an element with its next element. We can solve the problem in linear time complexity and linear space complexity. Stacks are very useful in questions where we are dealing with piles or related scenarios. Like for example two piles of stones from which we can remove the stone on top to make one of the piles shorter in height. 
Score: 1.0

Student answer: Stacks are used to store large amount of data.\nStacks are very much important data structure as it has unique property of LIFO.
Score: 1.0

Student answer: Stack is a modification of array which follow LIFO(Last in first out )property.\nWe use stack data type when we need these operations like in BFS algorithm we need parent node information which is visited lastly so we use stack for this so we can delete that element which is used lastly.
Score: 1.0

Student answer: We use stack as a memory to store elements or usually to store large amounts of data
Score: 1.0

Student answer: There are certain problems which can be solved very easily using stacks in place of array because of it works on the principle of LIFO(Last In First Out).
Score: 1.0

Student answer: For secondary or auxiliary storage to store some particular values, \nStack operates on LIFO - Last In, First Out.
Score: 1.0

Student answer: stacks are last in first out data structure when we use recursive functions stacks are used by recursion or whenever we need functionality like last in first out we use stack
Score: 2.0

Student answer: stacks is used as a better substitute to solve certain problems in place of using an array
Score: 2.0

Student answer: Stack is used to implement linked lists. In place of arrays , stack is better suited to solve certain problems.
Score: 2.0

Student answer: stack works on the principle of LAST IN FIRST OUT. when we want to use LIFO type of data structure we use stack
Score: 1.0
Question: Why do we use stacks?
Reference answer: Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.

Student answer: We use stacks for the cases where we need to solve problem according for LIFO(last in first out ).In other words, we use it where we need to solve the problem by solving for sub problems. We solve the main problem in the last and sub problems firstly.
Score: 2.0

Student answer: we use stacks when we want to access the last element added in the data structure ,i.e. we want to use LIFO principle.
Score: 2.5

Student answer: We use stacks to store data in a way such that it can leave or enter
Score: 2.5

Student answer: The stack is - last in first out, it mean we are going to fill the stack with data but if we take the data from stack it will give the lasted data which have been inserted in the stack.
Score: 2.5

Student answer: Stack is used in arrays it used sometimes for sorting ,deleting the index given term and it works like first in last out for this approach it solve easily  
Score: 0.0

Student answer: we use stacks to store data in a linear fashion and retrieve data in Last In First Out manner.
Score: 2.5

Student answer: We use stack to store data, it is follows the principle of LIFO; that is last in first out. The element we enters at last should be pop out first.
Score: 2.5

Student answer: we use stack in an algorithm whenever we need to have a track of the previous element in the algorithm
Score: 2.5

Student answer: Since stacks follow the principle of LIFO which makes insertion very easy in stack .Function by default use stack data structure.
Score: 2.5

Student answer: Stacks are used when we need a data structure which requires LIFO(Last in first out) Lets assume there is a problem in which we need values for the last added data in our  query so by using stack it will help us to reduce the time complexity 
Score: 2.5

Student answer: We use stack when we have LIFO priority i.e. data that comes last executes first. Example : in our printers.
Score: 2.5

Student answer: We use stacks in cases where we need to traverse a particular data in a sequential manner and at the same time store the data from that given data in a paricular sequence as per the conditions. For example we us e stack stack to traverse a string and convert it to infix to post fix there we need satck because stack allows first in last out . So we can use the stack to pop or push any values in a sequential manner. 
Score: 2.5

Student answer: we use stacks because it follows last in first out approach
Score: 0.5

Student answer: stack is data structure which uses last in first out approach. it gives data that is  added most latest in the data structure. it has various applications and is used to solve many famous problem such as tower of hanoi . it is also used by operating system to set priority of tasks  
Score: 2.5
Question: Why do we use stacks?
Reference answer: Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.

Student answer: Stack is a data structure that allow its data member to pop out in a LIFO manner which means the last in first out which translates to an opposite of what queue does. 
Score: 2.5

Student answer: Stack are Last In First Out or LIFO data structures. Whatever comes last in the stack will leave first and correspondly with other elements in the stack. They are often used in DFS or depth First search.
Score: 2.5

Student answer: We use stacks when we want to always access the last element that went in the stack while performing pop operation. (LIFO)
Score: 2.5

Student answer: we use stacks to store data \nwhen output is required in in lifo manner 
Score: 2.5

Student answer: we use stacks to easy our programing,
Score: 0.0

Student answer: as stacks works on the principle of LIFO (last in first out)\nfor eg:- if you have assign the various trolleys (numbered from 1 to 50) in a mall to the customers coming \nso we can no. the first customer with 50 and next will be assigned with 49 and so on.
Score: 2.5

Student answer: using stacks , we can easily search an element
Score: 0.0

Student answer: Stacks works on the principle of FIRST IN LAST OUT 
Score: 1.0

Student answer: we use stack for swapping values e3asily.
Score: 0.0

Student answer: stacks are use to organize the data in a sequence so that it can be accessed easily \nis stack data is arranged in the form of fifo(first in first out ) \n
Score: 0.0

Student answer: Stacks are used when we have to follow the Last In First Out(LIFO) principle with the given data, i.e. when the latest data holds the greater priority to be taken out.\nSome of the uses are:-\n# DFS(Depth First Search)\n# Tower of Hanoi\n# In Prefix, Postfix and Infix problems
Score: 2.5

Student answer: stacks  are linear data structure which  are used to store the data
Score: 0.0

Student answer: we use stack to arrange the element it flows first in first out policy in which a element which come first will terminate first.
Score: 0.0

Student answer: stacks are the data structures used for storing data and impliment it by following the property of LIFO (last in first out)
Score: 2.5

Student answer: Stack is a type of data structure use to store data 
Score: 0.0

Student answer: because stacks works on last in first out so stacks are useful in graph traversals and other searching techniques. push, pop etc are also used in stacks
Score: 2.0

Student answer: we use stacks to perform the problem in less time interval, their are predefined stl functions, we also use push and pop approach in stack for the functioning of the problem.
Score: 1.5

Student answer: Stacks can be used for traversal. Stacks can also be used to store data. It uses the Last In First Out Principle. Stacks are used in recursion, the undo - redo feature, etc .
Score: 2.0
Question: Why do we use stacks?
Reference answer: Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.

Student answer: Stacks is used to store the extra data of some set that is not in use but can be required in further research.
Score: 0.0

Student answer: like  there are some problems we face while working on arrays that is when we want add more items in array we need to preallocate the memory whereas in stacks we need no pre allocation and we can add or remove any item at that instant, 
Score: 2.0

Student answer: we use stack , to solve the problems in FILO form , like n number of plates are kept in such a manner that the first plate in the last and last plate which inserted in last , chosen to first.
Score: 2.0

Student answer: the stack data structure is used when we need a first in first out type of algorithm for our program.\nthe stack library is easy to understand and use.
Score: 0.0

Student answer: we use stack to store a data in a a database in a ferment  of form of fist in last out it help to optimizer the performance and the result of the given problem 
Score: 1.0

Student answer: Stacks can be use dto 
Score: 0.0

Student answer: stacks provide fist in fist out FIFO approach that way we use stacks 
Score: 1.0

Student answer: last in first out method
Score: 1.0

Student answer: we use stacks for problems which require FIFO and for the prefix and suffix problems too .
Score: 0.0

Student answer: the purpose of using stack is to store the data in the present file
Score: 0.0
Question: What operations can be performed on Queues?
Reference answer: 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

Student answer: enqueue(addition of elements),dequeue(deletion of elements)
Score: 2.5

Student answer: operations that  can be performed on Queues are \ninsert a node  from end\nremove a node from beginning\nremove a node from middle\nsearch a given node\ndelete a node from beginning \ndelete a node from end
Score: 2.5

Student answer: some common operation which can be perfomed in queues are inserting an element in a queue ,deleting an element from the queue 
Score: 1.5

Student answer: 1) Insertion: Inserts at the top of queue\n2) Deletion: Deletes the first element of the queue\n3) finding the topmost element\n4) Searching: Find the topmost element, if not correct delete it and continue
Score: 1.0

Student answer: enqueue\ndequeue\nsort\n
Score: 2.5

Student answer: The operations that can be performed on queues are enqueue , dequeue, and to check whether it is empty we can call isEmpty() function. we can also do searching in queues.
Score: 2.5

Student answer: Enqueue( )\nDequeue( )\npeek( )\nisfull( )\nisnull( )
Score: 2.5

Student answer: . searching an element \n. sorting an element
Score: 2.5

Student answer: Following operations can be performed on queue\n- Insertion of node (enqueue)\n- Deletion of node (dequeue)\n- Searching\n- Sorting
Score: 2.5

Student answer: operations that are performed on queues are as follows-\n1. is empty(); \n2. is full();\n3. insert(); // to insert value  in the queue\n4. delete(); // to delete values from queue
Score: 2.5

Student answer: 1) top\n2) isempty\n3) merging of queue\n4) pop\n5) push \n
Score: 2.5

Student answer: The basic operation of queues is to store data in such form by arranging its minimum and maximum data in according to priority queue.\npop\npush\ndeletion\ninsertion\n
Score: 1.0

Student answer: Since Queue works on FIFO- first in first out mechanism we can perform functions on it like PUSH (to enter data) and POP(to remove the data).
Score: 2.5

Student answer: operations that can be performed on queue are :\n- dequeue\n- enqueue\n
Score: 2.5

Student answer: enqueue\n- dequeue\n- peek
Score: 2.5

Student answer: queue follows FIFO i.e first in first out\n\noperations that can be performed are:\n1. insert data in queue\n2. retrieve data from the queue
Score: 2.5

Student answer:  (LIFO).\nIn this, if we enter/push the values at the last of the stack then the first value will be returned.
Score: 2.5

Student answer: insertion, deletion, extract min ,extract max can be done on queue
Score: 1.5

Student answer: push, pop can be performed
Score: 2.0

Student answer: Enqueue , Dequeue 
Score: 2.5

Student answer: enqueue and dequeue are the very common operations that can be performed on queues
Score: 2.5
Question: What operations can be performed on Queues?
Reference answer: 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

Student answer: Queues are type of data structures which use the mechanism of First In First Out. the operations which can be performed on queues can be \n1.Enqueue: entering particular element in the queue  \n2.Dequeue: deleting the particular element from the queue 
Score: 2.5

Student answer: Queues are data structures which follow FIFO ( first in first out ). Operations that can be performed on queue are :\ni) push() : inserts data in queue\nii) pop() : deletes data in queue which lies at first position (i.e. inserted first)
Score: 2.5

Student answer: enqueue ,dequeue ,traverse , get size , reverse , search 
Score: 2.5

Student answer: enqueue: To add an element to the queue.\ndequeue: To delete and element from the queue.\nfirst: To find the first element in the queue.
Score: 2.5

Student answer: Insertion, Deletion, Traversal
Score: 2.5

Student answer: push, pop and finding the address ( using iterator) of an element in queues.
Score: 2.5

Student answer: there are several operation that can be performed on Queues  :\n1) pushing element into it.\n2) popping element from it.\n3) find address(iterator) of an element of Queues.\netc.\n
Score: 2.5

Student answer: On queues, we can perform post-fix, pre-fix conversions, Breadth First Search.
Score: 2.5

Student answer: pushing, popping are some operations which can be performed on queues
Score: 2.5

Student answer: Queues :First in first out (FIFO)\nwe can perform various operation on queues like:\n1)enqueue (to insert a element in queue)\n2)dequeue(to delete a element in queue) 
Score: 2.5

Student answer: Queues help us to perform certain operations which are pushing and popping a particular element from the queue to get the order and element we want.
Score: 2.5

Student answer: \nOperations that can be performed on queues are \ninsertion, deletion, function call, 
Score: 1.5

Student answer: Operations that can be performed on a queue are enqueue (adding an element to the end of the queue) and dequeue (removing the element at the starting of the queue)
Score: 2.5

Student answer: enqueqe, dequeue 
Score: 2.5

Student answer: The are many operations which can be performed in queue like searching and sorting but the most important one is FIFO (Fist In First Out ) method.\nIn FIFO method the element which inserted first should be deleted first.
Score: 2.5

Student answer:  or \
Score: 0.0

Student answer: we can push an element in the queue on the FIFO principle using push and also pop the last element inserted using pop.
Score: 1.0

Student answer: Enqueue (Insertion into queue)\nDequeue (Deletion from queue)\nFront (To print the front of the queue)
Score: 2.5
Question: What operations can be performed on Queues?
Reference answer: 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

Student answer: Queues can be used in the cases when we require to use the concept of LIFO (last in first out). For example shortest job first , breadth first search in graphs, level order traversal of trees etc.
Score: 2.5

Student answer: Sorting can be performed so amazingly on queues, simple functions like push and pop can be use to sort out an array of the given input by the user.\n
Score: 2.5

Student answer: Operation that can be performed on queue are:\n- Dequeue (delete)\n- Enqueue (insert)\n- Disjoint-set operations: -union   -find
Score: 2.5

Student answer: A queue works on the basis of first come first serve and it performs various dynamic operations .
Score: 2.5

Student answer: Operations that can be performed on queues are:\n1. Insertion\n2. deletion\n3.rbegin\n4.rend
Score: 2.5

Student answer: Various Operations that can be performed on Queues are:-\n1)Push_back\n2)rend\n3)rbegin\n4)begin\n5)end\n5)pop\n6)deletion
Score: 1.0

Student answer: Following operations can be performed on queues:\nInsertion\nDeletion\nSelection\nPush back\nEnd\nBegin\nPop
Score: 2.5

Student answer: The following operations can be performed on Queues:\n1)Insertion\n2)Deletion\n3)Selection\n4)End\n5)Begin\n6)Pop
Score: 2.5

Student answer: Deletion, Selection, Insertion, Pop, Begin
Score: 2.5

Student answer: We can perform various operations on queues like Insertion,Deletion,Union etc.
Score: 2.5

Student answer: 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.
Score: 2.5

Student answer: queues follow FIFO , first in first out \nenqueue and dequeue\nDFS can be performed using Queue
Score: 1.0

Student answer: 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.
Score: 2.5

Student answer: push and pop operations can be performed on queues
Score: 2.0

Student answer: 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.
Score: 2.0

Student answer: storing of data \nimplementations of stack and various data structures\nfirst go first come type scheme\n
Score: 2.0

Student answer: 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
Score: 2.5
Question: What operations can be performed on Queues?
Reference answer: 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

Student answer: Queues follow the first in first out approach\nQueues have the following operations\n1) insert/enqueue\n2) delete/ dequeue\n3) front \n
Score: 2.0

Student answer: 1)Insertion\n2)Deletion\n3)Updation-Priority queue
Score: 1.5

Student answer: add or remove an element , compare elements , etc
Score: 1.0

Student answer: Queue()\nenqueue()\nempty()\nnull()\npeek()
Score: 2.5

Student answer: insertion and pop operation  
Score: 1.0

Student answer: Some of the operations that can be performed on queues are:\n1. insertion\n2. deletion
Score: 1.0

Student answer: 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).
Score: 2.5

Student answer: Many operations can be performed on queues like insertion of element and deletion of elements and searching and sorting 
Score: 1.0

Student answer: Operation that can be perform on Queues are insertion, deletion and searching.
Score: 2.5

Student answer: QUEUE IS FOLLOW THE FIFO THE OPERATIONS ARE PERFORMED IN ARE :-\nINSERTION \nUPDATION \nDELETION
Score: 2.5

Student answer: enqueue , deque, peek, isfull
Score: 2.5

Student answer: The following operations can be performed on queues: \n1. Insertion\n2. Deletion
Score: 2.5

Student answer: Enqueue, Dequeue, Search, Empty, Reverse are some of the operations.
Score: 2.5

Student answer: insert back and pop front, other operations can include iterating the data
Score: 1.0

Student answer: 1.Insertion \n2. Deletion \nQueue is used to perform breadth first search in trees or graphs.\n
Score: 2.5

Student answer: insertion, deletion, searching, 
Score: 1.0

Student answer: 1. reversing\n2 traversing\n3. searching of an element.\n4. sorting
Score: 2.5

Student answer: Following operations can be performed on Queues:\n->Enqueue\n->delqueue\n->delete 
Score: 2.5

Student answer: Deletion, merging, insertion can be used on queue while priority queue arranges the information with respect to the information provided by the user.
Score: 1.0

Student answer: 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
Score: 2.5

Student answer: The queue operations are as follows:\n\n1.create\n2.enqueue\n3.dequeue\n4.isEmpty\n5.isFull\n6.size
Score: 2.5

Student answer: enqueue (push)\ndequeue (pop)\ntraversal
Score: 2.5

Student answer: 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.
Score: 2.5

Student answer: queue()\ndequeue()\nfront()\nisEmpty()\npush()
Score: 2.5
Question: What operations can be performed on Queues?
Reference answer: 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

Student answer: Queues are FIFO (first in first out).Can be related as to a queue of a movie ticket .push() pop() front() top() enqueue() dequeue()
Score: 2.5

Student answer: 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.
Score: 2.5

Student answer: operations can be performed on queues are insertion deletion merging searching sorting
Score: 2.5

Student answer: enqueue and dequeue
Score: 2.5

Student answer: enqueue-add data to queue\ndqueue-delete data from queue\nsearch element \n
Score: 2.5

Student answer: Enqueue, Dequeue
Score: 2.5

Student answer: Dequeue, Enqueue are the operations can be performed on Queues. 
Score: 2.5

Student answer: Operations in queue are- enqueue, dequeue, peek.
Score: 2.5

Student answer: deletion, insertion, sorting ,
Score: 2.5

Student answer: Queue implements First In First Out(FIFO). \nInserts the element and takes out that element first.
Score: 2.5

Student answer: The operation that can performed on Queues are Push() , Pop() , Top() and etc. 
Score: 2.5

Student answer: queue, dequeue, front
Score: 2.5

Student answer: queues are basically first in first out (FIFO) so it helps in many ways to solve problems 
Score: 2.5

Student answer: Operations that can be performed on a queue:-\n1. Enqueue (insertion)\n2. Dequeue (deletion)\n3. Traversal
Score: 2.5

Student answer: push pop enqueue dequeue
Score: 2.5

Student answer: Following operations can be performed on queues:\n1- Insertion\n2- Deletion\n3- Searching
Score: 2.5

Student answer: Enqueue , Dequeue
Score: 2.5

Student answer: 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 position at [ i ][ j ].
Score: 2.5

Student answer: like push refers to adding an element to a queue\npop refers to deleting a top element from a queue.
Score: 2.0

Student answer: FIFO Type Data Structure(First in First Out)\nOperation:\n->pop\n->push
Score: 2.0

Student answer: FILO operations can be performed , to build heap we use queues.
Score: 1.0

Student answer: 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.
Score: 1.0

Student answer: push \npop
Score: 1.0

Student answer: Enqueue() \nDequeue() \nPeek() \n
Score: 2.0
Question: What operations can be performed on Queues?
Reference answer: 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

Student answer: q.push - insert elements in queue\nq.pop - delete elements in queue\nq.isempty() - checks if the queue is empty or not  \n
Score: 2.0

Student answer: 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.
Score: 2.0

Student answer: operations that can be performed on Queues are push and pop.
Score: 1.0

Student answer: 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
Score: 2.0

Student answer: 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. 
Score: 2.0

Student answer: top():returns the top element\npop():eliminates the top element\nempty():to check whether the queue is empty or not
Score: 1.0

Student answer: Push and Pop operations can be performed on Queues. We can also check if it's empty or not. 
Score: 1.0

Student answer: Stacks follow LIFO order. Last in first out.\nThey are used because we can insert and delete elements in them with ease.
Score: 1.0

Student answer: 1. Enqueue - Insertion\n2. Dequeue - Deletion\n3. Traversal \n4. isempty\n5. isfull\n6. find top element
Score: 2.0

Student answer: push operation,\npop operation,\nsearch operation
Score: 2.0

Student answer: Enqueue()\nDequeue() \nPeek()\nisFull() \nisNull()\n
Score: 1.0

Student answer: 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.
Score: 2.0

Student answer: 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)
Score: 2.0

Student answer: 1) create\n2) enqueue\n3) dequeue\n4) isEmpty\n5) isFull\n6) size
Score: 1.0

Student answer: 1. We can find front element\n2. Rear Element\n3. Pop out elements\n4. Sorting\n5. Searching\n6. Number of elements
Score: 1.0

Student answer: pushback(). top(), pop() and other operations can be used on queue.
Score: 2.0

Student answer: isempty \nsearch \nenqueue\ndequeue
Score: 2.0

Student answer: The most common operations on queue are Push and Pop. 
Score: 1.0

Student answer:  or \
Score: 2.0

Student answer: There are many opearions that can be done on Queues. Some of them are :\n1. Insertion\n2. Deletion\n3. Traversal
Score: 1.0
Question: What operations can be performed on Queues?
Reference answer: 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

Student answer: 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  
Score: 2.0

Student answer: 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
Score: 1.0

Student answer: Inserting , deleting ,searching , traversing .
Score: 2.0

Student answer: Queues are used for their FIFO (First In First Out) properties. The operations that can be performed are pop, push, peek, is empty.
Score: 2.0

Student answer: 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.
Score: 1.0

Student answer: 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
Score: 1.0

Student answer: create, eequce,  dequce,  size,  is empty, is full.
Score: 1.0

Student answer: 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.
Score: 1.0

Student answer: The Operation performed in queues are\n Enqueue (for inserting the element )\nDequeue (for removing the element )\n
Score: 1.0

Student answer: In queues we can perform \na)push()\nb)pop()\nc)delete() \nd)isEmpty() operations
Score: 2.0

Student answer: some operations are:\n1)queue- add element to the queue\n2)dequeue-remove element from the queue
Score: 1.0

Student answer: insertion, deletion can be performed on queues
Score: 1.0

Student answer: insertion ,deletion
Score: 1.0

Student answer: first in first out operations
Score: 1.0

Student answer: push() ->to push the data into the queue  , pop()-> to remove the front element , top() -> to show the value of the front element 
Score: 2.0

Student answer: 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 
Score: 1.0

Student answer: 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
Score: 2.0

Student answer: We can perform operations like enqueue(insertion in queue) , dequeue(deletion in queue). 
Score: 1.0
Question: What operations can be performed on Queues?
Reference answer: 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

Student answer: dequeue : to remove the first element from the queue.\nenqueue : to push an element at the end of the queue.
Score: 1.0

Student answer: Operations which can be done on Queue are enque, deque, changing the value of element etc.
Score: 1.0

Student answer: enqueue, dequeue
Score: 2.0

Student answer: Operations that can be performed on queues are insertion, deletion , finding the first element of queue using top function,  etc. 
Score: 1.0

Student answer: We can push the elements(enqueue) , pop elements from queue(dequeue). 
Score: 1.0

Student answer: enqueue is used to add a new element in the queue.\nDequeue is used to delete the first element in the queue
Score: 1.0

Student answer: queues can perform\ninsertion - push\ndeletion - pop\noperations
Score: 1.0

Student answer: 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 element from the queue. For updating the queue.
Score: 1.0

Student answer: enqueue() = insertion \ndequeue() = Deletion\ntop()\n
Score: 1.0

Student answer: Operations which can be performed are:\nenqueue, dequeue, pop, push, isfull, isempty, delete, sort etc
Score: 1.0

Student answer: we can create min, ,max heap, priority queue, which is works efficiently in searching max or min functions.
Score: 1.0

Student answer: Queues use the first in first out technique. (FIFO)
Score: 1.0

Student answer:  fashion. If we want to store something in a data structure and pop(remove) it in the last, then we use this data structure
Score: 1.0

Student answer: Queues can have the following operations-\nFirst in, First out\nSearching\nSorting\n\n  
Score: 1.0

Student answer: insertion,deletion can be perfomed on queues
Score: 2.0

Student answer: Operations that can be performed on queues - enqueue, dequeue, isempty()
Score: 1.0

Student answer: Pop operation - delete an element from rear\nPush operation - insert an element from front
Score: 1.0

Student answer: pop()- to delete the element\nisempty()- to check is queue is empty or not\npush()- to insert a element on top \n
Score: 1.0

Student answer: Insertion, deletion and search.
Score: 1.0

Student answer: Push-- To insert element\nPop --- To delete element\nSize---\nisEmpty- To check  Empty Queue
Score: 1.0

Student answer: enqueue , dequeue 
Score: 1.0

Student answer: enqueue , dequeue 
Score: 1.0

Student answer: The operations which can be performed on queues are:\n
Score: 1.0

Student answer: dequeue()\nenqueue()\npeek()\n
Score: 1.0
Question: What operations can be performed on Queues?
Reference answer: 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

Student answer: 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.
Score: 2.0

Student answer: 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
Score: 2.0

Student answer: insert, pop, isempty
Score: 2.0

Student answer: 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
Score: 2.0

Student answer: The operations that can be performed on queues is enque and deque
Score: 2.0

Student answer: Queue is structured as an ordered collection of items which are added at one end called rear end, and other end called front end.
Score: 2.0

Student answer: 1. enqueue\n2. dequeue\n3. isempty\n4. isfull\netc\n
Score: 2.0

Student answer: 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
Score: 2.0

Student answer: 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.
Score: 2.0

Student answer: pop, push and many other.
Score: 2.0

Student answer: 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
Score: 2.0

Student answer: push-insert an element at the end of the queue\npop-remove an element from the front of the array
Score: 2.0

Student answer: Push function\nPop function\nTop function\ndelete function\nare the function performed on queues
Score: 2.0

Student answer: 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
Score: 2.0

Student answer: Merge sort and quick sort are examples of divide and conquer algorithms 
Score: 2.0

Student answer: 1)Enqueue()\n2)Dequeue() \n3)Peek() \n4)isEmpty() \n5)isNull() 
Score: 2.0