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,603
|
What is a circular linked list?
|
A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.
|
Circular linked list are connected linked list from head and body by other linked list
| 0
|
5,604
|
What is a circular linked list?
|
A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.
|
it is the one in which address of last node of single linked list is again connected to the previous address of first node and a ;loop is made .
| 2.5
|
5,605
|
What is a circular linked list?
|
A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.
|
the linked list in (which it has 2 nodes first to store data of elements and second is to store address the next elements ) in a circular way , in which last elemnt can be first or first can be last
| 2
|
5,606
|
What is a circular linked list?
|
A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.
|
In a circular linked list, the pointer of the last node points at the address of the first node.
| 2.5
|
5,607
|
What is a circular linked list?
|
A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.
|
circular liked list is the method of interesting a data in the form of LinkedList into a database
| 0
|
5,608
|
What is a circular linked list?
|
A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.
|
a linked list which is connected end to end toi its start and end points
| 0
|
5,609
|
What is a circular linked list?
|
A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.
|
=122;
| 0
|
5,610
|
What is a circular linked list?
|
A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.
|
circular linked list is the implementation of data.
| 0
|
5,611
|
What is a circular linked list?
|
A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.
|
the linked list in which ending node is connected to starting node and which creates a loop
| 2
|
5,612
|
What is a circular linked list?
|
A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.
|
circular linked list is the linked list in which the last node is again connected to the first node and it make a loop eventualy.
| 2.5
|
5,614
|
What are the methods to implement stack in C?
|
The methods to implement stacks are: (1) Array based (2) Linked list based
|
we can define structure for implementing stack in C\nBy list we can implement stack\nby linked list we can implement stack\n
| 2.5
|
5,616
|
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 two data structures: \n1) Array\n2) Linked List
| 2.5
|
5,617
|
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 array, Linked List.
| 2.5
|
5,618
|
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 implement using array , linked list or many more
| 2.5
|
5,620
|
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 :-\n.Through array \n.Through linked list
| 2.5
|
5,621
|
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 through array as well as link list.
| 2.5
|
5,623
|
What are the methods to implement stack in C?
|
The methods to implement stacks are: (1) Array based (2) Linked list based
|
methods are as follows-\n1. push() to push the value in stack\n2. pop() to pop out the value from the stack\n3. is empty () to check stack is empty or not \n4. is full () to check stack is full or not \n
| 2
|
5,624
|
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 linked list to get the implementation of stack . \nBy making the function that make have the properties of stack using linked list.
| 2.5
|
5,625
|
What are the methods to implement stack in C?
|
The methods to implement stacks are: (1) Array based (2) Linked list based
|
In stack we store the store the data in FIFO form , so if we have put a data first it will be last to come out.
| 2.5
|
5,627
|
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 :\n- through array\n- through linked lists\n
| 2.5
|
5,628
|
What are the methods to implement stack in C?
|
The methods to implement stacks are: (1) Array based (2) Linked list based
|
- create array[capacity]\n- maintain variable like size = 0, front = 0;\n- insert at front position and then size++, front++;\n- deletion can be done at one front position, then size--, front--;
| 2.5
|
5,630
|
What are the methods to implement stack in C?
|
The methods to implement stacks are: (1) Array based (2) Linked list based
|
It is a kind of Linked list in which the head and the tail of the linked is same. There is no different head and tail of it.\nHence, it is known as circular linked list.
| 2.5
|
5,631
|
What are the methods to implement stack in C?
|
The methods to implement stacks are: (1) Array based (2) Linked list based
|
stack can b implemented using a queue, vector ,array values are first stored in the array, queue than push/pull operation is done.
| 2.5
|
5,634
|
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 by using the malloc() function , this will be donr by dynamically using an array. AnD A top pointer will be used for directing to the top element of the stack. The size of the stack can be same as the size of an array. We can enter the elements of the stack by using push() function and a stack follows the LIFO behaviour that is last in and first out.
| 2.5
|
5,636
|
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 is a special linked list in which the tail of the last node of list points to the head of the same list, forming a closed chain.
| 2.5
|
5,637
|
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 functions and array data structure.\nmethods: \n
| 2.5
|
5,638
|
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 array or linked list. We will have to make the functions to add, pop and find the top element in the stack.
| 2
|
5,639
|
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 or linked lists.
| 2.5
|
5,640
|
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 using vector to implement stacks in C/C++.\nWe can also use arrays and linked lists and implement stacks with the help of different friend functions.
| 2.5
|
5,642
|
What are the methods to implement stack in C?
|
The methods to implement stacks are: (1) Array based (2) Linked list based
|
pop(), insert(), top(): built-in methods.\nWithout STL, an array can be used where elements are inserted from the front and the rest are shifted to the right, elements are deleted from the front and the rest are shifted to left.\n
| 2
|
5,644
|
What are the methods to implement stack in C?
|
The methods to implement stacks are: (1) Array based (2) Linked list based
|
1) we make an array.\n2) we start placing the element in it that is start taking the initial index of an array.\n3) the first inserted element will come out of the stack in last.\n
| 2.5
|
5,645
|
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:-\nimplement stack using array, and its functions such as s.top(),s.push,etc can be perfomed using array by defining different functions .
| 2.5
|
5,646
|
What are the methods to implement stack in C?
|
The methods to implement stacks are: (1) Array based (2) Linked list based
|
To implement stacks in the
| 1
|
5,649
|
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:\n
| 1
|
5,650
|
What are the methods to implement stack in C?
|
The methods to implement stacks are: (1) Array based (2) Linked list based
|
First we have to implement a header file #include<stack>\nthem can iteratively implement stack or through STL we can.\nStack performs LIFO operation . LAST IN FIRST OUT.\nWe can make the stack and then insert the elements in order.
| 1
|
5,652
|
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 array or linked lists. We can construct our own functions for performing the various operations on them like insertion, deletion, etc.\nor we can also use the built in functions using stl libraries by including them.
| 2.5
|
5,653
|
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 a class. We can make a class which stores data in form of array or linked list. We can make our own functions for the insertion, deletion and searching in the class. Insertion with take place at the end node. Deletion will take place by removing the first element and then shifting others. And searching can be done by using any of the relevant search algorithms.
| 2.5
|
5,654
|
What are the methods to implement stack in C?
|
The methods to implement stacks are: (1) Array based (2) Linked list based
|
To implement a stack in c we can use an array or linked list and define insertion ,view and delete operations. we can store the index of the latest entry and upon insertion insert value at index+1 , or while retrieval access the maximum index element as it would be the latest or while deletion free the space occupied by the latest index.
| 2.5
|
5,655
|
What are the methods to implement stack in C?
|
The methods to implement stacks are: (1) Array based (2) Linked list based
|
by using the appropriate declaration.
| 2.5
|
5,656
|
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 one in which the last element is linked to the first element (like a snake biting its own tail)
| 2.5
|
5,657
|
What are the methods to implement stack in C?
|
The methods to implement stacks are: (1) Array based (2) Linked list based
|
There are different methods to implement stacks in C like;\n(i)Using STL\n(ii)Using Vectors
| 1
|
5,658
|
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 is by using the inbuilt stack library of STL called <stack> as the header file and then use the inbuilt functions called push pop and top.
| 1
|
5,659
|
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:\n1) Array\n2) Built in STL library <stack>
| 2.5
|
5,660
|
What are the methods to implement stack in C?
|
The methods to implement stacks are: (1) Array based (2) Linked list based
|
One of the method to implement stack in C is by using a double dimension array (2D - array).
| 2.5
|
5,661
|
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 array to implement stack in C.
| 2
|
5,662
|
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,663
|
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 push and pop operations in C. Push is used to add elements in the stack whereas pop is used to remove or delete elements from stack. Ex: push(4) etc
| 2.5
|
5,664
|
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 in c:\n1. using array\n2. using linked list
| 2.5
|
5,665
|
What are the methods to implement stack in C?
|
The methods to implement stacks are: (1) Array based (2) Linked list based
|
There are several ways to implement a stack in C, including:\n\n1. Using an array\n\n2. Using a linked list\n\n3. Using a dynamic array\n\n4. Using the standard library
| 2.5
|
5,666
|
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 struct for implementing stack in c or simply use and array the same as in cpp and enforce the functions for the array throughout the code to follow the functions for the stack.
| 2.5
|
5,667
|
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 implement in C using two queues and STL
| 2.5
|
5,668
|
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 array and assign function to it such that in takes and deletes data in a manner similar to stack.
| 2
|
5,669
|
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 stack function or it can be implemented with the help of 2 queues an many more
| 2
|
5,670
|
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 form a struct and then implementing each operation to it.
| 1
|
5,671
|
What are the methods to implement stack in C?
|
The methods to implement stacks are: (1) Array based (2) Linked list based
|
Arrays, vectors, linked list can be used to implement stack. It would have insert/push, delete/pop, top functions
| 2.5
|
5,672
|
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
| 2.5
|
5,673
|
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 using linked list \n
| 2.5
|
5,674
|
What are the methods to implement stack in C?
|
The methods to implement stacks are: (1) Array based (2) Linked list based
|
Vector \n
| 1
|
5,675
|
What are the methods to implement stack in C?
|
The methods to implement stacks are: (1) Array based (2) Linked list based
|
by creating function to implement stack in c.
| 2.5
|
5,676
|
What are the methods to implement stack in C?
|
The methods to implement stacks are: (1) Array based (2) Linked list based
|
a stack can be implemented either by using a array or by using a linked list
| 2.5
|
5,677
|
What are the methods to implement stack in C?
|
The methods to implement stacks are: (1) Array based (2) Linked list based
|
push, pop, isempty, top
| 1
|
5,678
|
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 can be implemented in many ways, using arrays is the easiest one
| 2.5
|
5,679
|
What are the methods to implement stack in C?
|
The methods to implement stacks are: (1) Array based (2) Linked list based
|
LIFO(Last in first out)
| 1
|
5,680
|
What are the methods to implement stack in C?
|
The methods to implement stacks are: (1) Array based (2) Linked list based
|
lLIFO METHOD IS USED TO IMPLEMENT THE STACK IN C AND THEE OPERATIONS IS INSERTION UPDATION AND DELETION.
| 2.5
|
5,681
|
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 array or linked list.
| 2.5
|
5,682
|
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 arrays, linked list or STL in C.
| 2.5
|
5,683
|
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 STL as well as array.
| 2.5
|
5,685
|
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 \n1.array\n2. linked list \n
| 2.5
|
5,686
|
What are the methods to implement stack in C?
|
The methods to implement stacks are: (1) Array based (2) Linked list based
|
push : Adds an element to the top of the stack.\npop : Removes the topmost element from the stack.\nisEmpty : Checks whether the stack is empty.\nisFull : Checks whether the stack is full.\ntop : Displays the topmost element of the stack.
| 2.5
|
5,687
|
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 arrays and can push values in the array.
| 2.5
|
5,688
|
What are the methods to implement stack in C?
|
The methods to implement stacks are: (1) Array based (2) Linked list based
|
Linked list and vectors help to implement stack in C.
| 2.5
|
5,689
|
What are the methods to implement stack in C?
|
The methods to implement stacks are: (1) Array based (2) Linked list based
|
there is a stack header available in std library otherwise a simple stack can also be implemented using an array.
| 2.5
|
5,690
|
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 is by\n1 importing the stack class from the package \n2, defining the stack functionality by array and making methods to perform the operations each time maintaining the stack LIFO property
| 2.5
|
5,691
|
What are the methods to implement stack in C?
|
The methods to implement stacks are: (1) Array based (2) Linked list based
|
Methods are:\n1. Push(): Insert a new element into the stack i.e just insert a new element at the beginning of the linked list.\n2. Pop(): Return the top element of the Stack i.e simply delete the first element from the linked list.\n3. Peek(): Return the top element.\n4. Display(): Print all elements in Stack.
| 2.5
|
5,692
|
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 stacks using queue,
| 2.5
|
5,693
|
What are the methods to implement stack in C?
|
The methods to implement stacks are: (1) Array based (2) Linked list based
|
FOR implementing the stack we use last in first out so that we can searchg out with depth wise way
| 2.5
|
5,694
|
What are the methods to implement stack in C?
|
The methods to implement stacks are: (1) Array based (2) Linked list based
|
1. Use the Standard Template Library\n2. To create a Class in which the methods perform the functions of the stack
| 1
|
5,695
|
What are the methods to implement stack in C?
|
The methods to implement stacks are: (1) Array based (2) Linked list based
|
#include<stack>\npush(),pop(),top(),
| 2.5
|
5,696
|
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:\n
| 1
|
5,697
|
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 array and linked list
| 2.5
|
5,698
|
What are the methods to implement stack in C?
|
The methods to implement stacks are: (1) Array based (2) Linked list based
|
s.push() s. pop()
| 2.5
|
5,699
|
What are the methods to implement stack in C?
|
The methods to implement stacks are: (1) Array based (2) Linked list based
|
1)using arrays\n2)using linked lists
| 2.5
|
5,700
|
What are the methods to implement stack in C?
|
The methods to implement stacks are: (1) Array based (2) Linked list based
|
Array
| 2.5
|
5,701
|
What are the methods to implement stack in C?
|
The methods to implement stacks are: (1) Array based (2) Linked list based
|
Push , Pop, are the methods to implement stack in C .
| 2.5
|
5,702
|
What are the methods to implement stack in C?
|
The methods to implement stacks are: (1) Array based (2) Linked list based
|
push- Add an element to the top of stack.\npop- Remove the topmost element from stack.\ntop- display the topmost element.
| 2.5
|
5,703
|
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 STL and array.
| 2.5
|
5,704
|
What are the methods to implement stack in C?
|
The methods to implement stacks are: (1) Array based (2) Linked list based
|
Array \nSTL
| 2
|
5,705
|
What are the methods to implement stack in C?
|
The methods to implement stacks are: (1) Array based (2) Linked list based
|
The way we can implement stack in C are by using vectors and by implementing each function for Stack to be performed.
| 1
|
5,706
|
What are the methods to implement stack in C?
|
The methods to implement stacks are: (1) Array based (2) Linked list based
|
array, STL
| 2
|
5,708
|
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:-\n1. Arrays\n2. Linked lists
| 2.5
|
5,709
|
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 linked list
| 2.5
|
5,710
|
What are the methods to implement stack in C?
|
The methods to implement stacks are: (1) Array based (2) Linked list based
|
Circular list is a list in which the last node contains the address of the first node or head node.
| 2.5
|
5,711
|
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 last node is connected with start node
| 2.5
|
5,713
|
What are the methods to implement stack in C?
|
The methods to implement stacks are: (1) Array based (2) Linked list based
|
using linked list we can implement stacks, creating a structured class and make node calling parameters\nto implement stacks
| 1
|
5,714
|
What are the methods to implement stack in C?
|
The methods to implement stacks are: (1) Array based (2) Linked list based
|
->by array\n->by Stack
| 1
|
5,716
|
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:\n1- push\n2- pop\n3- isEmpty\n4- isFull\n5- top
| 2
|
5,718
|
What are the methods to implement stack in C?
|
The methods to implement stacks are: (1) Array based (2) Linked list based
|
push\npop\nisEmpty\nisFull \ntop
| 2
|
5,719
|
What are the methods to implement stack in C?
|
The methods to implement stacks are: (1) Array based (2) Linked list based
|
Inbuilt libraries can be used to implement stack. \n#include<c.stack>\nCreate array where you empty out first index element of array.\n
| 1
|
5,721
|
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
| 1
|
5,722
|
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 node
| 2
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.