Harsh-7300/dataset huggingface dataset:
Question: What are some examples of divide and conquer algorithms?
Reference answer: The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points)

Student answer: merge sort, insertion sort
Score: 2.0

Student answer: Merge sort , quick sort, closest pair problem,   are the examples of divide and conquer algorithm
Score: 2.5

Student answer: Merge sort, quick sort are some examples of divide and conquer.\nFinding closest pairs in a plane is a problem in which we can apply the divide and conquer approach.
Score: 2.5

Student answer: sorting techniques like quick sort  and binary sort can also be an eg
Score: 2.5

Student answer: Some examples of divide and conquer are:\n1- Binary Search\n2- Merge sort\n3- Quicksort
Score: 2.5

Student answer: Quick sort , merge sort
Score: 2.5

Student answer: Solving the n queen problem, merge-sort
Score: 2.0

Student answer: used in MERGE SORT here the array is divided into two halves and smaller of the two values \ngets matched at the end.\nused in BINARY SEARCH here we first sort the array and find the mid element and place the right element in its \nright position and reducing our complexity which reduces to O(LOG N)\n
Score: 1.0

Student answer: One good Example of divide and conquer is binary Search in which we divide our search space accordingly and doing operation on that required search space.\nOther examples are:\n->Quick Sort\n->Ternary Search (somewhat extension of binary search
Score: 1.0

Student answer: merge sort\nquick sort
Score: 2.0

Student answer: Examples of divide and conquer algorithm are binary search , dynamic programming. It is used when same subproblems are not evaluated many times.
Score: 2.0

Student answer: merge sort\nquick sort\nradix sort
Score: 1.0

Student answer: Binary Search\nQuicksort\nMerge Sort\n
Score: 2.0

Student answer: Quick Sort\nMerge Sort - The Array is subdivided to smaller arrays and after reaching the unit array they are combined.\nBubble Sort- An array element constantly being compared with previous array element then swapping takes place.\n
Score: 1.0

Student answer: Some examples of divide and conquer are Merge sort and quick sort
Score: 1.0

Student answer: merge sort, N-queen, rat in a maze
Score: 1.0

Student answer: Merge sort, binary search
Score: 2.0

Student answer: Merge Sort, Quick Sort, Radix Sort,
Score: 1.0

Student answer: merge sort\nbinary search
Score: 1.0

Student answer: Divide and Conquer utilizes solving of a problem by breaking down the data set into smaller subsets and then performing the desired operations on it. And then subsequently, perform it again and again while bringing it all together to achieve the final solution.\nFollowing are some examples\n1) Quick Sort\n2) Merge Sort
Score: 2.0

Student answer:  whose complexity is better than the brute force approach.
Score: 1.0

Student answer: 1. Merge sort\n2. Binary search \n3. Quick sort
Score: 2.0
Question: What are some examples of divide and conquer algorithms?
Reference answer: The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points)

Student answer: divide and conquer is used in binary seach for eg. to search a page in dictionary\nalso in merge sort eg. to sort an array of elements.
Score: 2.0

Student answer: Merge sort , quick sort, Closest Pair of Points\nStrassenâ€™s Algorithm of matrix multiplication
Score: 2.0

Student answer: There are various approaches to develop an algorithm such as divide and conquer ,backtracking .\nThe algorithms which is developed using the divide & conquer techniques involve three steps: Divide the original problem into various subproblems. Solve every subproblem individually, recursively. Combine the solution of the subproblems into a solution of the whole original problem.\nThe algorithm which is developed using backtracking involves moving to the answer at each step and note the other available paths for that step ,if it reaches the output then its good otherwise it retracts its steps and try other available paths to reach the output.
Score: 1.0

Student answer: Merge sort, Binary Search
Score: 1.0

Student answer: selection sort\ninsertion sort \nquick sort\nmerge sort
Score: 2.0

Student answer: Divide and conquer includes dividing the array in parts and then apply algorithms. Examples are - Merge Sort & Quick Sort
Score: 1.0

Student answer: quick sort and merge sort are examples of divide and conquer.
Score: 1.0

Student answer:  Binary Search\nMerge Sort\nQuick Sort
Score: 1.0

Student answer: Merge Sort\nQuick Sort\n
Score: 1.0

Student answer: binary search, merge sort, quick sort
Score: 2.0

Student answer: Binary search, Merge sort
Score: 1.0

Student answer: binary search, interpolation search finding square root or cube root of a number and many more.
Score: 1.0

Student answer: sorting of array using quicksort, stock buy and sell  to attain max profit .
Score: 1.0

Student answer: The examples of divide and conquer algorithms :-\n1) Quick Sort\n2) Merge Sort\n3) Binary Search\n4) Interpolation Search
Score: 1.0

Student answer: Algorithms are developed by first-\nUnderstanding the problem, Finding the solutions from pre-existing algorithms, If not available then finding the new algorithm, design the optimal algorithm
Score: 1.0

Student answer: in divide and conquer algorithm merge sort algorithm and quick sort algorithm comes .
Score: 2.0

Student answer: merge sort,  closest pair point.
Score: 1.0

Student answer: those algorithm that can be perform by dividing a problem into small parts and then solved separately those problems comes under divide and conquer algorithm  
Score: 1.0

Student answer: Merge Sort uses divide and conquer strategy, as well as Binary search in we keep dividing or search space into 2.
Score: 1.0

Student answer: The examples are :\nmerge sort \nquick sort
Score: 2.0
Question: What are some examples of divide and conquer algorithms?
Reference answer: The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points)

Student answer: Some examples of divide and conquer technique is that\na}It is Used in binary search of an element\nwhich has many advantages in real life such as counting the occurence of a number 
Score: 2.0

Student answer: some examples are mergesort , quicksort etc.
Score: 1.0

Student answer: binary search, quick sort, merge sort, strassen multiplication are some examples of divide and conquer algorithms
Score: 1.0

Student answer: binary search ,median search ,different sorting algorithm like quick sort, merge sort
Score: 2.0

Student answer: merge sort\n
Score: 1.0

Student answer: examples of divide and conquer :-\n1. merge sort \n2. quick sort 
Score: 1.0

Student answer: Some examples of divide and conquer algorithms are binary search, merge sort, etc. These problems are the ones where we solve a smaller part of the problem first and then club all those results together to get the solution to the bigger and the main problem.
Score: 2.0

Student answer: binary search
Score: 1.0

Student answer: Simply,  when we want to shorten our problem we use divide and conquer like when we calculate the time complexity of a recursive recurrence relation we use divide and conquer , in binary search ,in merge sort , etc.
Score: 1.0

Student answer: 1.binary Search\n2.quick sort\n3.merge sort
Score: 2.0

Student answer: merge sort, quick sort, binary search, 
Score: 1.0

Student answer: Examples of divide and conquer algorithms are binary search , sorting techniques like merge sort, quick sort, etc. 
Score: 2.0

Student answer: Examples are: Binary search, Merge sort, etc.
Score: 2.0

Student answer: merge sort, quick sort are some of the examples of divide and conquer algorithms.
Score: 2.0

Student answer: merge sort\nquick sort\nbinary search
Score: 2.0

Student answer: Binary Search, Merge sort , Quick sort are some examples of divide and conquer algorithms.
Score: 2.0

Student answer: binary search\nquick sort\nmerge sort
Score: 2.0

Student answer: Some basic examples of divide and conquer are : Merge Sort ,  Finding the shortest path between two points etc
Score: 2.0

Student answer: binary search, merge sort,etc.
Score: 2.0

Student answer: Some examples of divide and conquer algorithms are as follows: \nQuick Sort. Merge Sort, Greedy Algorithms including Knapsack, Travelling Salesman Problem, 
Score: 2.0

Student answer: 1. Merge Sort\n2. Traveling Salesman\n3. Coinage\n4. 0/1 Knapsack
Score: 2.0

Student answer: Divide and conquer examples-\nMerge Sort\nQuick Sort\nGreedy technique\n
Score: 1.0

Student answer: 1. in railways to sort   which train will come on which platform and at what station \n2. To find information about particular in seconds while a person will take days to find in a company
Score: 1.0

Student answer: Some examples of divide and conquer algorithms are merge sort, quick sort, binary search. 
Score: 1.0
Question: What are some examples of divide and conquer algorithms?
Reference answer: The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points)

Student answer: Merge Sort\nQuick Sort\nBinary Search
Score: 1.0

Student answer: merge sort and binary search uses divide and conquer algorithms.
Score: 1.0

Student answer: There are some sorting techniques such as merge sort, quick sort and some searching techniques such as binary search.
Score: 2.0

Student answer: Merge Sort\nQuick Sort
Score: 2.0

Student answer: examples of divide and conquer are:\nmerge sort\nclosest pair of points.\nsprinklar problem.
Score: 2.0

Student answer: merge sort , helix sort , selection sort 
Score: 2.0

Student answer: Some examples of divide and conquer algorithms are:\n
Score: 1.0

Student answer: In divide and conquer algorithms we use to divide the things into smaller ones and then conquer for example:-  
Score: 1.0

Student answer: binary search \nquick sort\nmerge sort\n
Score: 1.0

Student answer: Binary Search can be the example of divide and conquer algorithms.
Score: 1.0

Student answer: Examples of divide and conquer algorithm are:\nmerge sort, quick sort, binary search, etc.\n
Score: 1.0

Student answer: examples of divide and conquer algorithms are merge sort and quick sort
Score: 1.0

Student answer: Merge sort, quick sort, insertion sort.
Score: 1.0

Student answer: Merge sort, quick sort, binary search
Score: 1.0

Student answer: Some examples of divide and conquer algorithms are BINARY SEARCH , MERGE SORT AND QUICK SORT
Score: 1.0

Student answer: merge sort and quick sort is the one of the most suitable example of divide and conquer algorithm.
Score: 1.0

Student answer: some examples of divide and conquer stratergy is :\n1. merge sort\n2. quick sort\n3. insertion sort
Score: 1.0

Student answer: 1. Binary search\n2. Ternary search\n3. Merge sort\n4. Interpolation search\n
Score: 1.0

Student answer: 1). Merge Sort\n2).Quick Sort\n3).Binary Search\n4).Linear Search
Score: 1.0

Student answer: closest pair of points, merge sort and quicksort.
Score: 1.0
Question: What are some examples of divide and conquer algorithms?
Reference answer: The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points)

Student answer: 1. Quicksort is a sorting algorithm. The algorithm picks a pivot element and rearranges the array elements so that all elements smaller than the picked pivot element move to the left side of the pivot, and all greater elements move to the right side. Finally, the algorithm recursively sorts the subarrays on the left and right of the pivot element.\n2. Merge Sort is also a sorting algorithm. The algorithm divides the array into two halves, recursively sorts them, and finally merges the two sorted halves.\n3. Closest Pair of Points: The problem is to find the closest pair of points in a set of points in the x-y plane. The problem can be solved in O(n^2) time by calculating the distances of every pair of points and comparing the distances to find the minimum. The Divide and Conquer algorithm solves the problem in O(N log N) time.\n4. Strassenâ€™s Algorithm is an efficient algorithm to multiply two matrices. A simple method to multiply two matrices needs 3 nested loops and is O(n^3). Strassenâ€™s algorithm multiplies two matrices in O(n^2.8) time.\n\n
Score: 1.0

Student answer: merge sort
Score: 1.0

Student answer: Merge sort \nQuick sort\nare the some examples of  divide and conquer algorithms
Score: 1.0

Student answer: examples of divide and conquer algorithms are manly search and sorting algorithms \nbinary search, linear search , merge sort, quick sort
Score: 1.0

Student answer: Common operations that can be performed on a data structure are input of data, and manipulation of data. Manipulation of data takes place via different methods depending on our algorithm and what we use as such. Ex- sorting a data, finding the element with the max or min value in the data structure,  finding common elements in the data structure etc.
Score: 1.0

Student answer: Merge Sort,Quick Sort,
Score: 1.0

Student answer: Binary search\nmerge sort\ninversion count\nquick sort
Score: 1.0

Student answer: 1.) The one of the most known sorting technique MERGE SORT .\n2.) Binary Search \n3) Quick Sort
Score: 1.0

Student answer: Few examples of D& C are;\n1.Merge sort;\n2.Binary Search;\n3.Stock and sell problem;\n4.Quick sort\netc.
Score: 1.0

Student answer: Some examples are:\nRecursion\nQuick sort\nBinary search
Score: 1.0

Student answer: Quick sort and merge sort.
Score: 1.0

Student answer: Merge Sort \nQuicksort \nStrassen's Matrix Multiplication
Score: 1.0

Student answer: some examples of divide and conquer algorithm are-;\n1-quick sort\n2-merge sort\n
Score: 1.0

Student answer: examples:-\nmerge sort\nbinary search
Score: 1.0

Student answer: merge sort and binary search are examples of divide and conquer algorithms.
Score: 1.0

Student answer: merge sort\nquick sort \nbinary search
Score: 1.0

Student answer: Some examples of divide and conquer algorithms are quick sort, merge sort ,binary search.
Score: 1.0
Question: What are some examples of divide and conquer algorithms?
Reference answer: The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points)

Student answer: merge sort ,quick sort
Score: 2.5

Student answer: network flow algorithm, graphs etc
Score: 0.0

Student answer: Some example of divide and conquer algorithms are-\nmerge sort, binary search.
Score: 2.5

Student answer: examples for divide and conquer algorithm is merge sort ,quick sort,
Score: 2.5

Student answer: binary search, merge sort, quick sort
Score: 2.5

Student answer: In divide and conquer algorithm we first divide the problem in many sub-problems and then try to solve the sub-problems and in the end we try to merge everything together to finally solve the bigger problem.
Score: 1.0

Student answer: merge sort\n
Score: 2.0

Student answer: Binary Search, Merge Sort 
Score: 2.5

Student answer: Merge sort And Quick sort 
Score: 2.5

Student answer: in railway network \nin stock exchange problem
Score: 0.0

Student answer: Some examples include: Merge sort and quick sort algorithm
Score: 2.5

Student answer: Some examples of divide and conquer algorithms are binary search, merge sort etc.
Score: 2.5

Student answer: quick sort algorithm\nmerge sort algorithm
Score: 2.5

Student answer: 1. binary search\n2. quick sort\n3. merge sort
Score: 2.5

Student answer: 1)Merge Sort\n2)Quick Sort\n
Score: 2.5

Student answer: quick sort and merge sort 
Score: 2.5

Student answer: 1. Merge sort\n2. Quick sort.\n3. Binary search.
Score: 2.5

Student answer: merge sort\nquick sort\nare the examples of d and c algo.
Score: 2.5

Student answer: divide and conquer approach is to break the problem statement into parts and solve them separately \nfor eg:- addition and multiplication of 2 linked lists
Score: 1.5

Student answer: 1:- Merge sort \n2:- Quick sort\n3:- N-queen 
Score: 2.0

Student answer: Some of the examples of divide and conquer algorithms are :- \n1.Merge Sort\n2.heapify
Score: 2.0

Student answer: sorting and searching
Score: 2.5

Student answer: merge sort ,quick sort ,binary search 
Score: 2.5

Student answer: Some examples are:-\n1. Merge sort\n2. Quick sort
Score: 2.5

Student answer: merge sort \nbinary search \n
Score: 2.5

Student answer: Google , Amazon , etc are some example of divide and conquer algorithm.\nmerge sort algorithm is used in divide and conquer.\n
Score: 1.5

Student answer: quick sort\nmerge sort
Score: 2.5

Student answer: binary search\nmerge sort\nsubarray sum problem\nquick sort
Score: 2.5

Student answer: Binary Search \nMerge Sort\n
Score: 2.5

Student answer: Merge sort, binary search, quick sort.
Score: 2.5

Student answer: example of divide and conquer algorithm merge sort and quick sort
Score: 2.5

Student answer: Example of Divide and Conquer algorithms are :-\n1) Quick sort\n2) Merge Sort
Score: 2.5

Student answer: Some examples of Divide and Conquer Algorithms are Binary Search and Merge Sort. 
Score: 2.5
Question: What are some examples of divide and conquer algorithms?
Reference answer: The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points)

Student answer: Some examples of divide and conquer algorithms are Dijkstra algorithm, ford Fulkerson algorithms,
Score: 0.0

Student answer: merge sort \nquick sort
Score: 2.5

Student answer: in divide and conquer algorithm , we first divide the elements then take it one by one step and then write in right manner. 
Score: 1.5

Student answer: Merge sort\n
Score: 2.5

Student answer: when we are doing aeration in which large database is concern and we have to find out the certain function from that database we use divide and conquered \nlike during searching someone profile on social media we can use divide and conquer it had database which divide a system into a serial potion and sech on that bases 
Score: 2.0

Student answer: some of the applications of divide and conquer algorithms are used in:\n1) Merge sort\n2) Quick sort
Score: 2.5

Student answer: divide and conquer algorithms we solve big problem it sub parts example matrix multipi
Score: 2.5

Student answer: master theorem.
Score: 0.0

Student answer: 1)merge sort\n2)quick sort
Score: 2.5

Student answer: examples of divide and conquer\nrat in a  maze,\ntravelers theorem\nHamiltonian  graph\n
Score: 0.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 uses the LIFO (last in first out) principle that is elements that are added last are deleted first. There is only one same path of adding and deleting elements, elements are stacked on top one over another and the element at the top of the stack is deleted first. 
Score: 2.5

Student answer: stacks uses LIFO principle i.e. last in first out we use stacks to store the recent data in order to access it as fast as we can. it stores the values at the compile time
Score: 2.5

Student answer: stack is a data structure in which first element which is inserted in a stack comes out last it follows  LIFP appoch \n
Score: 2.0

Student answer: We use stacks because:\n1) They do not require limits like arrays\n2) They provide LIFO process (Last In First Out) that reduces time complexities of many algorithm and operations
Score: 2.5

Student answer: Stack offers a methodology called LIFO which stands for Last In First Out. For ex, website navigator. Last website visited is brought first when we click back. Undo also does the same.
Score: 2.5

Student answer: Stack are LIFO data structure used to store data in last in and first out form. Stack are used in place of array to reduce space complexity and operation like push and pop are easy to implement on stack.
Score: 2.5

Student answer: a stack is used in evaluating expressions consisting of operands and operators. 
Score: 2.5

Student answer: Stack gives  last in first out operation. Stack helps in finding the parenthesis of the expression
Score: 2.0

Student answer: stack is a linear data structure which follows last in first out method and is used for many purposes like parenthesis and many more
Score: 2.0

Student answer: Stacks are the linear data structure that are used to store the values of a particular data ,in LIFO format i.e.  Last In First OUT 
Score: 2.5

Student answer: Stacks are used , when we need to perform the operation on every part of string or any number and make better use of it . Stacks basically have insertion and deletion both from the top , it follows FIFO approach.
Score: 1.0

Student answer: We use stack for storing information in FIFO form(first input first output).
Score: 1.0

Student answer: Stack is a data structure that is ideally used to store data in a linear format 
Score: 1.5

Student answer: we use stacks to implement the LIFO ( last in first out ) technique.
Score: 2.5

Student answer: Stack Data structure follows LIFO (Last In First Out) Rule. We use stack in :- \n- Depth First Search\n- Inorder Traversal of binary tree.  \n- Finding postfix expression
Score: 2.5

Student answer: Stacks are based on the principle of LIFO i.e last in first out\n\nthe data that was entered in the last will be retrieved first
Score: 2.5

Student answer: Stacks are the data structure which works on the principle of \
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: stacks are used to compute to prestore some values and then compute the function given.it helps to give element from top and end  in much less complexity.
Score: 1.0

Student answer: We use stacks to easily push the element in the list.
Score: 1.0

Student answer: We use stacks to temporarily store elements in an order which we can use later on. In other words it is a temporary holder of elements and \nmany other operations can be conducted with the help of stacks.
Score: 1.0

Student answer: We use stacks to store data in an order which we can utilise later. The various operations that can be perfor
Score: 1.0

Student answer: stacks are the type of data structures which uses the mechanism of Last In First Out.They are helpful in storing large amount of data and is used in the algorithms which takes high space complexities.
Score: 2.5

Student answer: Stack is a data structure which follows LIFO( last in first out ). We use stacks when we have to extract something in reverse order of its insertion. 
Score: 2.5

Student answer: as stack is LIFO ,  we need a stack to get some of our operations in constant time . like insertion , deletion 
Score: 2.5

Student answer: Stacks use LIFO (Last In First Out) approach which means the last element to be inserted gets deleted first. Stacks are used in various algorithms when we want to know the last element that was inserted or want the delete the latest element inserted. Stacks are used in recursion as the function waits for the answer from the latest recursive function callled.
Score: 2.5

Student answer: Stacks use the LIFO (last in first out) approach which helps when our requirement of the problem requires us to have to delete the element inserted most recently.
Score: 2.5

Student answer: We use stacks to store the element/ data on LIFO basis. ( When the most recent information is required in the solution ). We use stacks in DFS where we are traversing the data using stack data structure.
Score: 2.5

Student answer: Stack are the data structure used to store data inside it. Stack are used when we want to pop the that data first which is pushed at last. It follows first in last out approach. 
Score: 2.5

Student answer: We use stacks as per our requirement in a problem, when we want to address the last inserted value first (LIFO). Eg: Depth First Search
Score: 2.5

Student answer: stacks are the data structures which are used to store the data in it and is used to delete some data or insert some data.
Score: 2.5

Student answer: stacks is also known as last in first out(LIFO). 
Score: 2.5

Student answer: stacks is a special data structure with some functions similar to array. stacks help to store data from top and result out the data in different order is called stacks convert the arrangement of values from ascending to decreasing form.```
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 to add/remove elements in a particular order. Stacks can also be used for backtracking algorithms.
Score: 2.0

Student answer: we use stacks to add or remove elements in particular order.
Score: 2.5

Student answer: Stack is a kind of Data Structure which is used for storing the data . Stack is very efficient to store the data if we want to store the data in order . Stacks are a better option to use over linked list because these can also be used in STL and we can easily perform many operations (like insertion and deletion ) in stack which is difficult to use in linked list .\nStacks use LIFO(Last In First Out) method .
Score: 2.5

Student answer: We use stacks when we want to represent data in the vertical form nd use functions which follows the principle of \
Score: 2.5

Student answer: we use stacks when we have to store the data in a vertical format or when we havew to access it on the LIFO principle (last in first out). We can use several built in functions to deal with the data stored in stacks for accessing the top most element or delete it.
Score: 2.5

Student answer: Stack works on the principle of Last In First Out (LIFO). IT is used to store object on which we want to perform operations later on and operations on those objects first which entered last.
Score: 2.5

Student answer: Stacks can be used in conditions where we need to use the concept of first in first out.(FIFO) Examples of places where stacks can be used are undo/redo operations etc.
Score: 1.5

Student answer: we use stacks for multiple use cases, for sorting, for prefix and post fix notation
Score: 2.5

Student answer: We use stacks when we have to use the First In First Out (FIFO) approach. In stacks the element gets added to the top of the stack and the last element is removed when we want to delete (pop). Stacks are also used to solve the infix, prefix, postfix expressions.
Score: 1.5

Student answer: A stack work for the retrieval of last element in the first order....It works on the basis of first come , last serve.
Score: 2.0

Student answer: We use stacks to store data in form of chronological order so as to retrieve the data accordingly.  Stack allows us to use the memory efficiently by maintaining the top variable and keeping the count of data.\n 
Score: 2.5

Student answer: we use stacks when we want to work on the that last inputted value at the begining of our program as it used the property of LIFO (Last in First Out)
Score: 2.5

Student answer: We use stack whenever we require FIFO(First In First Out) property in our solution.\n
Score: 2.0

Student answer: We use stack whenever we need FIFO(First In First Out) property in our solution.
Score: 2.0

Student answer: Stacks are used to fulfil the need of FIFO(First in First out) in the solution.
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 the data structures that are used to store large number of data.
Score: 1.5

Student answer: Stack are the type of data structures which are used to store large data.
Score: 2.5

Student answer: it is a linear data structure in which elements are accessed, inserted and deleted from one end called the top of the stack. Stack follows the LIFO  approach. Two basic operations on a stack are push and pop.
Score: 2.5

Student answer: One good use of stack is to remove the implementation of recursion as it can recursively provide data instead of having to call a function again and again.
Score: 2.5

Student answer: Stacks are a linear data structure that works in Last In First Out method .They are used to store data and solve problems that require reversing and sometimes in trees.
Score: 2.5

Student answer: Stacks are useful data structures which follow LIFO (last in first out) . This can be be helpful in algorithms like depth first search in binary trees. 
Score: 2.5

Student answer: stack is a form of data structure which is like putting plates over another place it completely overlaps and whenever required we use the topmost plate.... similarly to store data in such a form where after storing we get obliged by last go first out format we use stack
Score: 2.5

Student answer: Stacks are used for LIFO purposes. LIFO stands for Last In First Out.\nIt is used to explore deep branches of trees and graphs. For example - Used in depth-first searching
Score: 1.0

Student answer: Stack follows the last in first out approach. We use stacks to keep track of the order of operations\nfor eg. in a compiler the functions that are called last would finish first\neg2. to check parathesis, stacks are used\nDepth first search is used using stacks
Score: 2.5

Student answer: 1)for LIFO-last in first out\n2)problems are solved in order\n3)no direct jump to another function before completing one
Score: 2.5

Student answer: to add or remove an element , it is FIFO
Score: 1.0

Student answer: Last in first out\nwe can use the data structure where we need to enter in last and take it out first
Score: 2.5

Student answer: when we have use the functionality of first in last out then we use the stacks 
Score: 2.5

Student answer: we use stacks to store data, which can be used later on. It uses the technique of last come first serve ( LIFO).\nexample: function calling uses stack implementation
Score: 2.5

Student answer: We use stacks to insert data in a LAST IN FIRST OUT manner, it enables us to extract the piece of data that was inserted at the last . We can use top for getting the information regarding the data present on the top of stack and push , pop could be used respectively for insertion and deletion.
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: stacks is a data structure used to store in the values, it used the concept of LIFO (last in first out) and ejects values accordingly. It is used in searching algorithm and also in tries.
Score: 2.5

Student answer: We use stacks for storing the data linearly in such a way that we can use the oldest  information first for our purposes as it is a LIFO(Last in first out)Process.
Score: 2.5

Student answer:  A stack is a linear data structure in which elements are accessed, inserted and deleted from one end called the top of the stack. Stack follows the LIFO ( Last In First Out) approach. Two basic operations on a stack are push and pop.
Score: 2.5

Student answer: stacks are useful if we need to add or remove something in an array in an particular manner 
Score: 1.0

Student answer: It is an easy way to store and access elements that only need to be used once.
Score: 1.0

Student answer: We can use stacks to make Last In First Out(LIFO) programs. 
Score: 2.5

Student answer: we use stack to store memory temporarily, it uses LIFO which is helpful to recover data if lost.
Score: 2.5

Student answer: Application of stack is : In depth first search\nRecursive functions also use stack.
Score: 2.5

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, and even piling up of data.
Score: 2.0

Student answer: Stack is used when we want to use the last element first as stack works on the principle of last in first out.
Score: 2.5

Student answer: Whenever we are in a need to store data linearly and have a tendency to take out the last inserted there we prefer to use stacks .
Score: 2.5

Student answer: Stack is a last in first out data structure which is commonly used for storage of information and in some algorithms as well.
Score: 2.5

Student answer: we use stacks when we have to store the data in lifo fashion(last in first out)\nstacks are the data structure used in the background for backtracking and other operations
Score: 2.5

Student answer: We use stack or queue instead of arrays when we want the elements in a specific order. The order can be LIFO or FIFO anything.
Score: 2.5

Student answer: stack is a data structure that follows LIFO. thus, the data on top will be out first, kind of like a bucket.\nstacks can be used to store temporary data files
Score: 2.5

Student answer: we use stack to calculate the operations like DFS we use stack so that first er focus on the deepth stack is first the last in first out is used in stack in which we traversal on each element 
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: Stacks is a data structure following the rule LIFO\nThe element entered in the last will the first one to come out\nStacks can also be used to make better algorithms for different data structures
Score: 2.5

Student answer: stacks are last in first out based .\nthey can be understood as a pile of books \nthey are real life possible thing.\nwhen constrains of lifo are applied in a 1-D array it becomes a stack we use stack for organsing are data as examle:the recent incident is ought to be searched more in google this way we can store the data in stack and the recent input will be the answer reducing the time complexity
Score: 2.5

Student answer: A Stack can be used for evaluating expressions consisting of operands and operators. Stacks can also be used for Backtracking.
Score: 2.5

Student answer: stacks works on last in last out which can be used graph traversal , prefix suffixes etc.
Score: 1.5

Student answer: Stack is a LIFO data structure that is last in first out.We use stack to keep track of memory and space used in a program so that  when a stack overflows is gives us an error.
Score: 2.5

Student answer: stack uses last in first out technique so we use it when we need to access most recently entered data first
Score: 1.0

Student answer: Stacks is a LIFO (last in first out) data structure in which it returns the last value stored in the stack when we pop out the top value and returns -1 if the stack is full.
Score: 2.5

Student answer: stack is used for backtracking. 
Score: 1.0

Student answer: Stack can be used for backtracking.
Score: 1.0

Student answer: we use stacks when Last In First Out method is used. 
Score: 2.5

Student answer: Stack implements Last In First Out(LIFO). Whenever we need this situation we use stacks.
Score: 2.5

Student answer: Stacks are the data structure that performs operation in FILO, we majorly use stacks to use this operation. 
Score: 1.0

Student answer: We use stack for the use of first come last out approach. 
Score: 1.0

Student answer: it is a efficient data structure that has a property of last in first out (LIFO) this property helps to perform certain action easily that why we use stacks
Score: 2.5

Student answer: Stack is a data structure that follows the LIFO (Last In First Out Rule). A stack can be implemented using an array or a linked list. Stacks have different applications. \n1. It is used in Depth First Search (DFS) traversal of a tree.\n2. Recursive functions can be used to convert into iterative using stacks.
Score: 2.5

Student answer: stacks are used to carry out and evaluating the operations and operands
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 a data structure that stores the data according to FIFO (First In First Out) principle i.e. the data can be accessed through one way only. The data item that was stored at last will be accessed first. It is very useful while performing various searches.
Score: 2.0

Student answer: We use stack so that we get the information about memory or space like when we get stack overflow
Score: 2.5

Student answer: We use stacks because it is a linear data structure and is of the type last in last out. If we want to quickly store a value which needs to be accessed immediately afterwards (and discarded) we can use it. It is especially useful in divide and conquer strategy of algorithm solving. 
Score: 2.5

Student answer: stacks works on LAST IN FIRST OUT, the element that has put in the last we have to access it first\nlike in case of DFS traversal of graphs.
Score: 2.0

Student answer: Stack is a data Structure in which we can say our data is stored in stack ,(pilled up)\nIt is LIFO type Data Structure(Last in First Out)\n|      6   |\n|     5    |   --> illustration of Stack\n|___4_ _ |\nit is used when we need to excess data which we entered latest.
Score: 1.0

Student answer: when we are told to solve a question which demands first in first out approach or required to pop or put data in top to down manner then we use stacks.
Score: 2.0

Student answer:  A stack can be used for evaluating expressions consisting operands and operators. It can be used for backtracking. It can be used to convert one form to other form.
Score: 2.0

Student answer: so that we can remove first inserted element at last. as it works on last in first out  principal last inserted element will be removed at first.
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
Score: 1.0

Student answer: Stacks is based upon first in first out principle or FIFO. The data that you are inserting in stack would be pushed out first after that the second, the third  and so on.
Score: 1.0

Student answer: Stack is a type of data structure to store the data. It works on the principle of first in first out. So if we need to store data and then retrieve it in opposite order of the values places then we should use stack data structure.
Score: 1.0

Student answer: stacks are used when we want to use the last in first out principle as stacks works on LIFO.
Score: 1.0

Student answer: Stack uses LIFO approach (Last in first out) that means we can stack our data and the recent data is called first. Stack has some major applications in the understanding of recursion.
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: Stacks works on the principle of LIFO: Last in First out. This approach of retrieving the data and using it for it other purpose is useful in many problems and helps to reduce the steps of our solution. The stack module of STL library has predefined functions which reduce the effort of writing the most used pieces of code.
Score: 1.0

Student answer: it is data structure works on last in first out basis.\nwe use  it for\n1 expression evaluation-for evaluating arithmetic operations\n2undo/redo functions\n3.for backtracking and recursion
Score: 2.0

Student answer: Stacks follow the Last in, First out procedure. So they are basically used to maintain the record whenever we need to fill a dataset and use these properties. 
Score: 1.0

Student answer: Merge sort, N queens problems, Closest pair problem
Score: 1.0

Student answer: We use stacks wherever Last in First out property is required.\nFor example in parenethesis matching problem, stacks are used to store opening parenthesis until closing arrives.
Score: 2.0

Student answer: stacks are used to arrange data in first in last out fashion.
Score: 1.0

Student answer: Whenever we need to access the data entered at last in a data structure first of all
Score: 1.0

Student answer: Merge sort 
Score: 1.0

Student answer: Stacks are data structures that are based on the principle of Last In First Out (LIFO). We use stack to implement techniques such as recursion, some other examples are : Tower of Hanoi , Reversing Linked Lists etc.
Score: 1.0

Student answer: we use stacks rather than array to use elements in a specific order
Score: 2.0

Student answer: Stacks are like a block in which we can push our elements. Then, we can find the top most element, pop out top element etc. It's time complexity depends on the operation but space complexity is O(n) as we are taking memory. Stacks can be helpful in questions like we have to find a count of a number, to check duplicate numbers. In such questions, we can pass each and every element of array in a stack. Then start popping out top element with necessary conditions.
Score: 1.0

Student answer: stacks work on the principle of LIFO (last in first out). Stacks can be used to  record the track of elements stored.
Score: 1.0

Student answer: we use  stacks to do the questions or algorithms in which we have to push the first element as pop it at last. as stack is filled bottom to top .\nLast in First out property
Score: 1.0

Student answer: We use stacks when we need to perform the LIFO (Last In First Out) operation in a particular problem.
Score: 1.0

Student answer: it used in the cases for which we want the operation \
Score: 1.0

Student answer: Stack is a linear data structure that follows LIFO method to perform all the operations.
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: Stacks are used to store data that are in order. They work on the principle of LIFO ( Last in First Out ). So , elements are stored when an array or any data structure is traversed and the last element traversed is stored on the top and can be retrieved first. This helps in accessing the recent or last data being stored and can be operated upon.
Score: 1.0

Student answer: stack is a data structure which the principle of LIFO (Last in First out). which can be seen in many places in daily lives like stack of a plate. sometimes this technique is used to solve various problem like like problem in which 3 rods are given and we have to move the discs from one rod to another and arrange them in a particular manner.
Score: 1.0

Student answer: stacks are used to keep the record of the element .It follow the LIFO approach last come first out which mean the last element which inserted in stacks will come out first.
Score: 1.0

Student answer: Stacks are used for their FILO (First In Last Out) or LIFO (Last In First Out) properties.
Score: 2.0

Student answer: Merge Sort and problems such as shortest distance on 2D graph are the examples of divide and conquer algorithms.\n
Score: 2.0

Student answer: stacks used LIFO (last in first out ) approach , we use stacks for comparison of words, string , for example we use stack in string matching algorithm . 
Score: 2.0

Student answer: they are data structures used for storing data mostly in the form of first in last out order. \nyou can push and pop data nodes according to youyr requirements.\n
Score: 2.0

Student answer: it is the faster,   it is the use very  easy
Score: 2.0

Student answer: we use stack for easy pushing and popping of an element the working of an stack is like a element is pushed at the end of the stack and one element popped from the top that we need 
Score: 2.0

Student answer: We use stack to solve problems where the data moves in a firs-in-first-out manner i.e. the data we push or insert in the stack last should pop or get removed first.
Score: 1.0

Student answer: stacks are the data structure in which uses the principle of last-in-first out (LIFO) .it uses the push function (to insert the element) and pop function.
Score: 1.0

Student answer: we use stacks as it uses to implement  LIFO technique last in first out technique and it can be very useful to solve mathmatical equations ina very efficient ways
Score: 2.0

Student answer: Stacks are used to solve problems like undo text, 
Score: 1.0

Student answer: depth first search uses stack data structure in its execution
Score: 1.0

Student answer: stacks work on the principle of last in first out(LIFO),thus are useful when we want to remove elements in a this manner.
Score: 1.0

Student answer: for last in first out kind of operations
Score: 1.0