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
|
|---|---|---|---|---|
5,723 | What are the methods to implement stack in C? | The methods to implement stacks are: (1) Array based (2) Linked list based | Methods to implement stack in C are: make a structure and define the functions which we want to implement on the stack. eg sort, push, pop etc. and then use them. | 2 |
5,725 | What are the methods to implement stack in C? | The methods to implement stacks are: (1) Array based (2) Linked list based | Using inbuilt libraries is one of the efficient ways to implement stack in C. Linked List/Arrays can be another efficient means to create stacks if we don't wish to use inbuilt libraries. | 1 |
5,726 | What are the methods to implement stack in C? | The methods to implement stacks are: (1) Array based (2) Linked list based | Linked list in which the last node is refering to its first node | 2 |
5,727 | What are the methods to implement stack in C? | The methods to implement stacks are: (1) Array based (2) Linked list based | an array can be declared with capacity C. we maintain top variable to look for the top element. limit is checked if number of the elements in the array crosses C. | 1 |
5,728 | What are the methods to implement stack in C? | The methods to implement stacks are: (1) Array based (2) Linked list based | stack can be implemented by array or linked list. the operations used will be push, pop, search etc. | 1 |
5,729 | What are the methods to implement stack in C? | The methods to implement stacks are: (1) Array based (2) Linked list based | stack can be implemented using-\narrays\nlinked lists\nheader file of stack class | 1 |
5,730 | What are the methods to implement stack in C? | The methods to implement stacks are: (1) Array based (2) Linked list based | In circular linked list the first node is connected to the tail node due to which each node is connected to its next node which forms a circle. | 2 |
5,731 | What are the methods to implement stack in C? | The methods to implement stacks are: (1) Array based (2) Linked list based | Using STL or creating your own class. | 1 |
5,732 | What are the methods to implement stack in C? | The methods to implement stacks are: (1) Array based (2) Linked list based | push() \npop() \ntop()\nisEmpty()\nsize() | 2 |
5,733 | What are the methods to implement stack in C? | The methods to implement stacks are: (1) Array based (2) Linked list based | Stack can be implemented by three methods:\n\n1. Using STL\n2. Using an array - We make a class 'node' and initialize an array, data and a top element index which is initially -1. Then using constructor, we take values in data and dynamically make an array. Then we write functions for finding the top element, popping out the element, finding the size etc.\n3. Using Linked List - Same procedure as above but rather an array we make a linked list. | 2 |
5,734 | What are the methods to implement stack in C? | The methods to implement stacks are: (1) Array based (2) Linked list based | stack can be implemented by making a class of it or can directly use the library # include<stack> | 2 |
5,735 | What are the methods to implement stack in C? | The methods to implement stacks are: (1) Array based (2) Linked list based | Using 2-D Array\n | 2 |
5,737 | What are the methods to implement stack in C? | The methods to implement stacks are: (1) Array based (2) Linked list based | we can perform basic mathematical operations directly on ADT, like + - * /\nalso they act as a basic building block for the advanced data structures. | 2 |
5,740 | What are the methods to implement stack in C? | The methods to implement stacks are: (1) Array based (2) Linked list based | we can use STL or define struct or our own class and write our own code for generating and implementing a stack. | 1 |
5,741 | What are the methods to implement stack in C? | The methods to implement stacks are: (1) Array based (2) Linked list based | To implement stack we need to create function like top ,insert, delete and create array on which we can apply these functions | 1 |
5,742 | What are the methods to implement stack in C? | The methods to implement stacks are: (1) Array based (2) Linked list based | There are two methods to implement stack by array :-\n1) FILO - First element is the the last to be popped out\n2) LIFO - Last element is the first to be popped out | 1 |
5,743 | What are the methods to implement stack in C? | The methods to implement stacks are: (1) Array based (2) Linked list based | A circular linked list is the data structure in which the tail of the list contains the address of the head or there is no head or tail. | 2 |
5,744 | What are the methods to implement stack in C? | The methods to implement stacks are: (1) Array based (2) Linked list based | \n | 1 |
5,745 | What are the methods to implement stack in C? | The methods to implement stacks are: (1) Array based (2) Linked list based | stacks can be implemented using stl vectors or arrays and also linked lists and using the functions like top,pop, push ton store and input data in them. | 1 |
5,746 | What are the methods to implement stack in C? | The methods to implement stacks are: (1) Array based (2) Linked list based | recursive function, infinix to postfix | 1 |
5,748 | What are the methods to implement stack in C? | The methods to implement stacks are: (1) Array based (2) Linked list based | Stack can be implemented in C using an array where the first empty index of the array is stored and elements are inserted at that index and then the index is incremented. When popping we can decrement that stored index so that the value to be deleted will be overwritten by the next pushed element. | 2 |
5,749 | What are the methods to implement stack in C? | The methods to implement stacks are: (1) Array based (2) Linked list based | push and pop | 1 |
5,750 | What are the methods to implement stack in C? | The methods to implement stacks are: (1) Array based (2) Linked list based | The method to implement stack are \npush()\npop()\nisEmpty() | 1 |
5,751 | What are the methods to implement stack in C? | The methods to implement stacks are: (1) Array based (2) Linked list based | Stack is implemented using array or linked list in C. | 2 |
5,753 | What are the methods to implement stack in C? | The methods to implement stacks are: (1) Array based (2) Linked list based | in circular linked list the first element is connected to the last element as well thus making a circle or a ring. | 1 |
5,754 | What are the methods to implement stack in C? | The methods to implement stacks are: (1) Array based (2) Linked list based | stl that is standard template libraries | 1 |
5,755 | What are the methods to implement stack in C? | The methods to implement stacks are: (1) Array based (2) Linked list based | using arrays , vectors or linked list stack can be implemented in C . \n | 1 |
5,756 | What are the methods to implement stack in C? | The methods to implement stacks are: (1) Array based (2) Linked list based | We can use an struct, create an array and define all the functions that we will be needing like push, pop, etc | 2 |
5,758 | What are the methods to implement stack in C? | The methods to implement stacks are: (1) Array based (2) Linked list based | We push and pull elements in stack to create a stack like the name of stack is s then s.push() and s.pull().. | 2 |
5,759 | What are the methods to implement stack in C? | The methods to implement stacks are: (1) Array based (2) Linked list based | 1. linked list\n2. array\n3. STL(standard template library) | 2 |
5,760 | What are the methods to implement stack in C? | The methods to implement stacks are: (1) Array based (2) Linked list based | circular linked list refers to linked list whose last node's address is stored in first node. | 2 |
5,761 | What are the methods to implement stack in C? | The methods to implement stacks are: (1) Array based (2) Linked list based | two methods can be used: \none -> array\ntwo-> list | 2 |
5,762 | What are the methods to implement stack in C? | The methods to implement stacks are: (1) Array based (2) Linked list based | Stack can be implemented using arrays. | 2 |
5,764 | What are the methods to implement stack in C? | The methods to implement stacks are: (1) Array based (2) Linked list based | recursion can be used as it uses stack. \nAlso array can be used just we have to keep in mind that only the top of it can be accessed at any point. | 1 |
5,765 | What are the methods to implement stack in C? | The methods to implement stacks are: (1) Array based (2) Linked list based | stack can be implemented to carry out arthimatic operations or to decide the order of certain things. | 1 |
5,766 | What are the methods to implement stack in C? | The methods to implement stacks are: (1) Array based (2) Linked list based | We can implement the stack by creating different function for push, pop, insert, delete, top using the aray or linked list data structure. | 2 |
5,767 | What are the methods to implement stack in C? | The methods to implement stacks are: (1) Array based (2) Linked list based | 1) Linked List\n2) Vectors | 1 |
5,768 | What are the methods to implement stack in C? | The methods to implement stacks are: (1) Array based (2) Linked list based | To implement stack in C , we can use struct and implement stack ourselves by defining its functions\nor we can use inbuilt STL and include stack. | 1 |
5,769 | What are the methods to implement stack in C? | The methods to implement stacks are: (1) Array based (2) Linked list based | we can implement stack in c by pop or push function in the stack. | 1 |
5,770 | What are the methods to implement stack in C? | The methods to implement stacks are: (1) Array based (2) Linked list based | Methods to implement stack in C | 1 |
5,771 | What are the methods to implement stack in C? | The methods to implement stacks are: (1) Array based (2) Linked list based | A circular linked list is a linked list in which the \ | 1 |
5,772 | What are the methods to implement stack in C? | The methods to implement stacks are: (1) Array based (2) Linked list based | To implement stack in C, we can use stuck or class to create Stack class and have two data members one to store data and the other to point at the next data value. | 1 |
5,773 | What are the methods to implement stack in C? | The methods to implement stacks are: (1) Array based (2) Linked list based | stack in c is implemented with LIFO (LAST IN FIRST OUT) method | 1 |
5,774 | What are the methods to implement stack in C? | The methods to implement stacks are: (1) Array based (2) Linked list based | Methods to implement stack are using arrays, using queue, and double ended queue. | 1 |
5,775 | What are the methods to implement stack in C? | The methods to implement stacks are: (1) Array based (2) Linked list based | To implement stack we can either use stl and use stack<> vector \nor we can create a pop function with the following method\nvoid pop(int x)\n{\nif(p== st.length()-1)\nreturn;\nelse\nst[p]=x;\n} | 1 |
5,776 | What are the methods to implement stack in C? | The methods to implement stacks are: (1) Array based (2) Linked list based | stack can be implemented in c using array where the first empty index of the array is stored and element are inserted at their indexes | 2 |
5,777 | What are the methods to implement stack in C? | The methods to implement stacks are: (1) Array based (2) Linked list based | Stack follows last in first out rule so first we push element into it and on the retrieval we pop the element and that element which was added in the end gets retrieve first. | 1 |
5,778 | What are the methods to implement stack in C? | The methods to implement stacks are: (1) Array based (2) Linked list based | There are no predefined library for Stacks in C, that's why there are some ways by which can be implemented using array, by linked list | 1 |
5,779 | What are the methods to implement stack in C? | The methods to implement stacks are: (1) Array based (2) Linked list based | By using push function we can implement stack in c | 1 |
5,780 | What are the methods to implement stack in C? | The methods to implement stacks are: (1) Array based (2) Linked list based | we can implement stack in C using arrays and pointers | 1 |
5,781 | What are the methods to implement stack in C? | The methods to implement stacks are: (1) Array based (2) Linked list based | methods to implement stack in c are:\na) by creating and using library\nb)by creating array and then storing it in the form of stack\nc)by using vectors | 1 |
5,785 | What are the methods to implement stack in C? | The methods to implement stacks are: (1) Array based (2) Linked list based | methods to implement stack are:\ninsertion,deletion,isEmpty,size,etc. | 1 |
5,786 | What are the methods to implement stack in C? | The methods to implement stacks are: (1) Array based (2) Linked list based | you can implement a stack using and linked list | 1 |
5,787 | What are the methods to implement stack in C? | The methods to implement stacks are: (1) Array based (2) Linked list based | inserion, deletion, sorting. | 0 |
5,788 | What are the methods to implement stack in C? | The methods to implement stacks are: (1) Array based (2) Linked list based | Linked list\nusing two queues \nusing predefined libraries\n\n | 1 |
5,789 | What are the methods to implement stack in C? | The methods to implement stacks are: (1) Array based (2) Linked list based | There are 2 ways to implement stack.\n1) Using Vector or An array with the condition that the first input in should be the last input out.\n2) Using linked list . | 1 |
5,790 | What are the methods to implement stack in C? | The methods to implement stacks are: (1) Array based (2) Linked list based | using array or by using linked list | 1 |
5,792 | What are the methods to implement stack in C? | The methods to implement stacks are: (1) Array based (2) Linked list based | we Can implement stack in C using arrays , linked list etc. | 1 |
5,794 | What are the methods to implement stack in C? | The methods to implement stacks are: (1) Array based (2) Linked list based | array and linkedlist. | 1 |
5,795 | What are the methods to implement stack in C? | The methods to implement stacks are: (1) Array based (2) Linked list based | Method 1: (Stack Implementation in C using Array) .\nMethod 2: (Stack Implementation using Linked List). \n | 1 |
5,796 | What are the methods to implement stack in C? | The methods to implement stacks are: (1) Array based (2) Linked list based | using array,linkedlist,or using queue | 1 |
5,797 | What are the methods to implement stack in C? | The methods to implement stacks are: (1) Array based (2) Linked list based | Mainly Two methods are used two implement stack in c that is\narray implementation\nLinked list implementation\n | 1 |
5,798 | What are the methods to implement stack in C? | The methods to implement stacks are: (1) Array based (2) Linked list based | methods of implement stack in C is array ,linked list, queue | 1 |
5,799 | What are the methods to implement stack in C? | The methods to implement stacks are: (1) Array based (2) Linked list based | List ADT is type of structure which stores data in a linear way such that bits can be accessed accordingly | 1 |
5,800 | What are the methods to implement stack in C? | The methods to implement stacks are: (1) Array based (2) Linked list based | push,pop,top,isEmpty are the methods | 0 |
5,801 | What are the methods to implement stack in C? | The methods to implement stacks are: (1) Array based (2) Linked list based | 1. Declare a stack with the correct syntax and name.\n2. push the data into the stack.\n3. perform the required operation.\n4. when complete, you can delete the stack. | 1 |
5,802 | What are the methods to implement stack in C? | The methods to implement stacks are: (1) Array based (2) Linked list based | Methods to implement the stack in C: \n1) Using linked list\n2) Using Array | 1 |
5,803 | What are the methods to implement stack in C? | The methods to implement stacks are: (1) Array based (2) Linked list based | 1.Making structure for stack;\n2.Uisng array and fixing insertion and deletion operations. | 1 |
5,804 | What are the methods to implement stack in C? | The methods to implement stacks are: (1) Array based (2) Linked list based | Methods to implement stack in C:\nUsing linked list\nUsing array | 1 |
5,805 | What are the methods to implement stack in C? | The methods to implement stacks are: (1) Array based (2) Linked list based | Define a structure for stack and use array to make it. | 1 |
5,806 | What are the methods to implement stack in C? | The methods to implement stacks are: (1) Array based (2) Linked list based | pointer of the last node does connects to the first node instead of connecting to NULL.\nA doubly linked list whose \ | 1 |
5,807 | What are the methods to implement stack in C? | The methods to implement stacks are: (1) Array based (2) Linked list based | in c stack can be implemented using linked list | 1 |
5,808 | What are the methods to implement stack in C? | The methods to implement stacks are: (1) Array based (2) Linked list based | methods:-\nSTL\npop and push | 1 |
5,809 | What are the methods to implement stack in C? | The methods to implement stacks are: (1) Array based (2) Linked list based | obtained from primitive data type. | 0 |
5,810 | What are the methods to implement stack in C? | The methods to implement stacks are: (1) Array based (2) Linked list based | it can be implemented using linked list in which when we push the element it is connected to the end and when we pop the element the end element is deleted.\nit can also be implemented by using dynamic array. | 1 |
5,811 | What are the methods to implement stack in C? | The methods to implement stacks are: (1) Array based (2) Linked list based | A stack in C can be implemented by creating a linked list where the first node is the top node of the stack. It stores address of the next node. | 1 |
5,812 | What are the methods to implement stack in C? | The methods to implement stacks are: (1) Array based (2) Linked list based | we can implement stack using a linked list using a pointer which stores the address of the data inserted most recently, which will help to use it to perform all the operations like insertion/deletion must be done on that element(element inserted most recently). or we can implement stack using a array using a pointer which stores the address of the data inserted most recently. | 2 |
5,814 | What are the methods to implement stack in C? | The methods to implement stacks are: (1) Array based (2) Linked list based | To implement stack in c first we have to make a dynamic array and make a integer variable .In between filling array add one in variable .if we have to remove an element then we will remove the element on location of variable and minus one in variable. | 2 |
5,816 | What are the methods to implement stack in C? | The methods to implement stacks are: (1) Array based (2) Linked list based | we can use STL, or an array to work as a stack by assigning value to a variable referring the top of the stack and changing it accordingly | 1 |
5,817 | What are the methods to implement stack in C? | The methods to implement stacks are: (1) Array based (2) Linked list based | We store data in the stack and pops out its element according to our need. | 0 |
5,818 | What are the methods to implement stack in C? | The methods to implement stacks are: (1) Array based (2) Linked list based | stack can be implemented either through array or through linked list | 2.5 |
5,820 | What are the methods to implement stack in C? | The methods to implement stacks are: (1) Array based (2) Linked list based | methods to implement stack in c: | 0 |
5,822 | What are the methods to implement stack in C? | The methods to implement stacks are: (1) Array based (2) Linked list based | Using STL: stack<int>st;\n\nOr doing it manualy by creating a push (a function to insert a data) pop (function to remove data) function for an array. | 1 |
5,823 | What are the methods to implement stack in C? | The methods to implement stacks are: (1) Array based (2) Linked list based | The methods to implement stack in c are by making a push function that can push data , pop function which can remove a data, is full function whicjh can check whether the stack is full or not and is empty which can check whetger the stack is empty or not. | 1 |
5,825 | What are the methods to implement stack in C? | The methods to implement stacks are: (1) Array based (2) Linked list based | array \nlinked list | 2.5 |
5,827 | What are the methods to implement stack in C? | The methods to implement stacks are: (1) Array based (2) Linked list based | We maintain a next-Index pointer over the array(stack) to insert or delete elements. Whenever next-Index moves out of range it moves back to start or end if some position are left to fill in the array to optimize space. These extra spaces are left due to pop operation performed. | 1 |
5,829 | What are the methods to implement stack in C? | The methods to implement stacks are: (1) Array based (2) Linked list based | 1. Linked list\n2.Arrays | 2.5 |
5,830 | What are the methods to implement stack in C? | The methods to implement stacks are: (1) Array based (2) Linked list based | stack can be implemented using a list | 2 |
5,832 | What are the methods to implement stack in C? | The methods to implement stacks are: (1) Array based (2) Linked list based | make a stack like we used to make class \nto insert the element write push( )\nand to remove the element pop( ) | 0 |
5,833 | What are the methods to implement stack in C? | The methods to implement stacks are: (1) Array based (2) Linked list based | 1;- Using array.\n2:- Using linked list\n3;- Using Queue | 2.5 |
5,834 | What are the methods to implement stack in C? | The methods to implement stacks are: (1) Array based (2) Linked list based | to implement stack in C language first we need to push the elements into the stack and then pop the elements one by one until the stack is empty. | 1 |
5,835 | What are the methods to implement stack in C? | The methods to implement stacks are: (1) Array based (2) Linked list based | method to implement stack by linked list by top to bottom approach. | 2 |
5,837 | What are the methods to implement stack in C? | The methods to implement stacks are: (1) Array based (2) Linked list based | We can implement stack in C in the form of array and linked list both. | 2.5 |
5,838 | What are the methods to implement stack in C? | The methods to implement stacks are: (1) Array based (2) Linked list based | stack is implemented by FIFO method that is first in first out which means that element is which is inserted first will be coming out first | 1 |
5,841 | What are the methods to implement stack in C? | The methods to implement stacks are: (1) Array based (2) Linked list based | either using stack [ ] or int<stack>stack_name int<vector>stack_name | 1 |
5,843 | What are the methods to implement stack in C? | The methods to implement stacks are: (1) Array based (2) Linked list based | we first import required libraries for stack command and then create an array and | 0 |
5,844 | What are the methods to implement stack in C? | The methods to implement stacks are: (1) Array based (2) Linked list based | element added by first come basis then push pop functioins are implemented accordingly | 0 |
5,846 | What are the methods to implement stack in C? | The methods to implement stacks are: (1) Array based (2) Linked list based | We can implement stack in C using Arrays and structs in C | 0 |
5,848 | What are the methods to implement stack in C? | The methods to implement stacks are: (1) Array based (2) Linked list based | push pop\nis empty\nis full | 0 |
5,849 | What are the methods to implement stack in C? | The methods to implement stacks are: (1) Array based (2) Linked list based | insertion \ndeletion | 0 |