Unnamed: 0 int64 1 5.86k | Question stringclasses 24
values | Sample ANS stringclasses 24
values | Student ANS stringlengths 1 1.06k | Score float64 0 2.5 |
|---|---|---|---|---|
1,932 | What are some examples of divide and conquer algorithms? | 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) | merge sort ,quick sort ,binary search | 2.5 |
1,933 | What are some examples of divide and conquer algorithms? | 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) | Some examples are:-\n1. Merge sort\n2. Quick sort | 2.5 |
1,934 | What are some examples of divide and conquer algorithms? | 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) | merge sort \nbinary search \n | 2.5 |
1,935 | What are some examples of divide and conquer algorithms? | 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) | Google , Amazon , etc are some example of divide and conquer algorithm.\nmerge sort algorithm is used in divide and conquer.\n | 1.5 |
1,936 | What are some examples of divide and conquer algorithms? | 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) | quick sort\nmerge sort | 2.5 |
1,937 | What are some examples of divide and conquer algorithms? | 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) | binary search\nmerge sort\nsubarray sum problem\nquick sort | 2.5 |
1,938 | What are some examples of divide and conquer algorithms? | 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) | Binary Search \nMerge Sort\n | 2.5 |
1,939 | What are some examples of divide and conquer algorithms? | 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) | Merge sort, binary search, quick sort. | 2.5 |
1,940 | What are some examples of divide and conquer algorithms? | 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) | example of divide and conquer algorithm merge sort and quick sort | 2.5 |
1,941 | What are some examples of divide and conquer algorithms? | 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) | Example of Divide and Conquer algorithms are :-\n1) Quick sort\n2) Merge Sort | 2.5 |
1,942 | What are some examples of divide and conquer algorithms? | 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) | Some examples of Divide and Conquer Algorithms are Binary Search and Merge Sort. | 2.5 |
1,943 | What are some examples of divide and conquer algorithms? | 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) | Some examples of divide and conquer algorithms are Dijkstra algorithm, ford Fulkerson algorithms, | 0 |
1,944 | What are some examples of divide and conquer algorithms? | 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) | merge sort \nquick sort | 2.5 |
1,945 | What are some examples of divide and conquer algorithms? | 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) | in divide and conquer algorithm , we first divide the elements then take it one by one step and then write in right manner. | 1.5 |
1,946 | What are some examples of divide and conquer algorithms? | 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) | Merge sort\n | 2.5 |
1,947 | What are some examples of divide and conquer algorithms? | 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) | 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 base... | 2 |
1,948 | What are some examples of divide and conquer algorithms? | 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) | some of the applications of divide and conquer algorithms are used in:\n1) Merge sort\n2) Quick sort | 2.5 |
1,949 | What are some examples of divide and conquer algorithms? | 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) | divide and conquer algorithms we solve big problem it sub parts example matrix multipi | 2.5 |
1,950 | What are some examples of divide and conquer algorithms? | 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) | master theorem. | 0 |
1,951 | What are some examples of divide and conquer algorithms? | 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) | 1)merge sort\n2)quick sort | 2.5 |
1,952 | What are some examples of divide and conquer algorithms? | 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) | examples of divide and conquer\nrat in a maze,\ntravelers theorem\nHamiltonian graph\n | 0 |
1,953 | Why do we use stacks? | 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. | 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. | 2.5 |
1,954 | Why do we use stacks? | 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. | 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 | 2.5 |
1,955 | Why do we use stacks? | 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. | stack is a data structure in which first element which is inserted in a stack comes out last it follows LIFP appoch \n | 2 |
1,956 | Why do we use stacks? | 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. | 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 | 2.5 |
1,957 | Why do we use stacks? | 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. | 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. | 2.5 |
1,958 | Why do we use stacks? | 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. | 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. | 2.5 |
1,959 | Why do we use stacks? | 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. | a stack is used in evaluating expressions consisting of operands and operators. | 2.5 |
1,960 | Why do we use stacks? | 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. | Stack gives last in first out operation. Stack helps in finding the parenthesis of the expression | 2 |
1,961 | Why do we use stacks? | 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. | stack is a linear data structure which follows last in first out method and is used for many purposes like parenthesis and many more | 2 |
1,963 | Why do we use stacks? | 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. | 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 | 2.5 |
1,964 | Why do we use stacks? | 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. | 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. | 1 |
1,965 | Why do we use stacks? | 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. | We use stack for storing information in FIFO form(first input first output). | 1 |
1,966 | Why do we use stacks? | 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. | Stack is a data structure that is ideally used to store data in a linear format | 1.5 |
1,967 | Why do we use stacks? | 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. | we use stacks to implement the LIFO ( last in first out ) technique. | 2.5 |
1,968 | Why do we use stacks? | 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. | 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 | 2.5 |
1,969 | Why do we use stacks? | 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. | 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 | 2.5 |
1,970 | Why do we use stacks? | 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. | Stacks are the data structure which works on the principle of \ | 1 |
1,971 | Why do we use stacks? | 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. | 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. | 1 |
1,972 | Why do we use stacks? | 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. | We use stacks to easily push the element in the list. | 1 |
1,973 | Why do we use stacks? | 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. | 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. | 1 |
1,974 | Why do we use stacks? | 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. | We use stacks to store data in an order which we can utilise later. The various operations that can be perfor | 1 |
1,975 | Why do we use stacks? | 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. | 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. | 2.5 |
1,976 | Why do we use stacks? | 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. | 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. | 2.5 |
1,977 | Why do we use stacks? | 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. | as stack is LIFO , we need a stack to get some of our operations in constant time . like insertion , deletion | 2.5 |
1,978 | Why do we use stacks? | 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. | 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 fro... | 2.5 |
1,979 | Why do we use stacks? | 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. | 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. | 2.5 |
1,980 | Why do we use stacks? | 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. | 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. | 2.5 |
1,981 | Why do we use stacks? | 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. | 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. | 2.5 |
1,982 | Why do we use stacks? | 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. | 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 | 2.5 |
1,983 | Why do we use stacks? | 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. | 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. | 2.5 |
1,984 | Why do we use stacks? | 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. | stacks is also known as last in first out(LIFO). | 2.5 |
1,986 | Why do we use stacks? | 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. | 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.``` | 2 |
1,988 | Why do we use stacks? | 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. | Stacks are used to add/remove elements in a particular order. Stacks can also be used for backtracking algorithms. | 2 |
1,989 | Why do we use stacks? | 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. | we use stacks to add or remove elements in particular order. | 2.5 |
1,990 | Why do we use stacks? | 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. | 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 st... | 2.5 |
1,991 | Why do we use stacks? | 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. | We use stacks when we want to represent data in the vertical form nd use functions which follows the principle of \ | 2.5 |
1,992 | Why do we use stacks? | 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. | 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. | 2.5 |
1,993 | Why do we use stacks? | 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. | 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. | 2.5 |
1,994 | Why do we use stacks? | 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. | 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. | 1.5 |
1,995 | Why do we use stacks? | 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. | we use stacks for multiple use cases, for sorting, for prefix and post fix notation | 2.5 |
1,996 | Why do we use stacks? | 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. | 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. | 1.5 |
1,997 | Why do we use stacks? | 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. | A stack work for the retrieval of last element in the first order....It works on the basis of first come , last serve. | 2 |
1,998 | Why do we use stacks? | 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. | 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 | 2.5 |
1,999 | Why do we use stacks? | 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. | 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) | 2.5 |
2,000 | Why do we use stacks? | 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. | We use stack whenever we require FIFO(First In First Out) property in our solution.\n | 2 |
2,001 | Why do we use stacks? | 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. | We use stack whenever we need FIFO(First In First Out) property in our solution. | 2 |
2,002 | Why do we use stacks? | 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. | Stacks are used to fulfil the need of FIFO(First in First out) in the solution. | 2 |
2,003 | Why do we use stacks? | 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. | Stacks are the data structures that are used to store large number of data. | 1.5 |
2,004 | Why do we use stacks? | 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. | Stack are the type of data structures which are used to store large data. | 2.5 |
2,005 | Why do we use stacks? | 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. | 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. | 2.5 |
2,006 | Why do we use stacks? | 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. | 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. | 2.5 |
2,007 | Why do we use stacks? | 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. | 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. | 2.5 |
2,008 | Why do we use stacks? | 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. | 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. | 2.5 |
2,009 | Why do we use stacks? | 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. | 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 | 2.5 |
2,010 | Why do we use stacks? | 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. | 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 | 1 |
2,011 | Why do we use stacks? | 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. | 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 | 2.5 |
2,012 | Why do we use stacks? | 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. | 1)for LIFO-last in first out\n2)problems are solved in order\n3)no direct jump to another function before completing one | 2.5 |
2,013 | Why do we use stacks? | 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. | to add or remove an element , it is FIFO | 1 |
2,014 | Why do we use stacks? | 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. | Last in first out\nwe can use the data structure where we need to enter in last and take it out first | 2.5 |
2,015 | Why do we use stacks? | 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. | when we have use the functionality of first in last out then we use the stacks | 2.5 |
2,016 | Why do we use stacks? | 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. | 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 | 2.5 |
2,017 | Why do we use stacks? | 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. | 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. | 2.5 |
2,018 | Why do we use stacks? | 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. | 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. | 2.5 |
2,019 | Why do we use stacks? | 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. | 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. | 2.5 |
2,020 | Why do we use stacks? | 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. | 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. | 2.5 |
2,021 | Why do we use stacks? | 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. | stacks are useful if we need to add or remove something in an array in an particular manner | 1 |
2,022 | Why do we use stacks? | 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. | It is an easy way to store and access elements that only need to be used once. | 1 |
2,023 | Why do we use stacks? | 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. | We can use stacks to make Last In First Out(LIFO) programs. | 2.5 |
2,024 | Why do we use stacks? | 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. | we use stack to store memory temporarily, it uses LIFO which is helpful to recover data if lost. | 2.5 |
2,025 | Why do we use stacks? | 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. | Application of stack is : In depth first search\nRecursive functions also use stack. | 2.5 |
2,026 | Why do we use stacks? | 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. | 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 da... | 2 |
2,027 | Why do we use stacks? | 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. | Stack is used when we want to use the last element first as stack works on the principle of last in first out. | 2.5 |
2,028 | Why do we use stacks? | 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. | 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 . | 2.5 |
2,029 | Why do we use stacks? | 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. | Stack is a last in first out data structure which is commonly used for storage of information and in some algorithms as well. | 2.5 |
2,030 | Why do we use stacks? | 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. | 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 | 2.5 |
2,031 | Why do we use stacks? | 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. | 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. | 2.5 |
2,032 | Why do we use stacks? | 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. | 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 | 2.5 |
2,033 | Why do we use stacks? | 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. | 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 | 2.5 |
2,034 | Why do we use stacks? | 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. | 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 | 2.5 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.