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,182 | What is linear data structure? | A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure. | These are the data structures which stores data in continuous memory blocks. example: array | 2.5 |
1,183 | What is linear data structure? | A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure. | Linear data structures such as array | 2 |
1,184 | What is linear data structure? | A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure. | Linear Data Structure is used for searching linearly | 1 |
1,185 | What is linear data structure? | A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure. | linear data structure is a 2d type data structure \nfor example array,linked list | 1.5 |
1,186 | What is linear data structure? | A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure. | Data structures that occupy continuous memory locations in RAM are called linear data structures. Ex stack, queue. | 2.5 |
1,187 | What is linear data structure? | A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure. | A linear data structure is the data structure which stores data in a linear fashion for example arrays, linked lists, stack, queue etc. | 2.5 |
1,189 | What is linear data structure? | A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure. | a linear data structure is one dimensional data structure which generally save the data in consecutive blocks of memory | 2.5 |
1,190 | What is linear data structure? | A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure. | Linear data structures are those data structures that creates a linear system of usage, for example linked list is a data structure that contains a node which is made of a data variable and a pointer variable associated to it which gets used to linked it to an another node. The visual representation of a linear data st... | 2.5 |
1,191 | What is linear data structure? | A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure. | Array, vector, Linked List are Linear Data structures. | 1.5 |
1,192 | What is linear data structure? | A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure. | linear data structure is in which that occupy continuous memory location in ram | 2.5 |
1,193 | What is linear data structure? | A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure. | Data structures which store the data in continuous or simultaneous memory locations are linear data structures. | 2.5 |
1,194 | What is linear data structure? | A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure. | list,\nqueue\nstack\nlinear data structure is one in which the data structure is only in 1d\n | 2 |
1,195 | What is linear data structure? | A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure. | In linear data structure the collection of nodes is linear, data is present in more linear form | 1.5 |
1,196 | What is linear data structure? | A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure. | linear data structure means data structure in 1D form\ni.e int, double, char, string etc | 1 |
1,197 | What is linear data structure? | A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure. | Arrays , linked list , stack , queue are the linear data sturcutre in which data is in linear form i,e in sequence not in graph form. | 2 |
1,199 | What is linear data structure? | A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure. | Linked list ,sorting , searching are the linear data structure | 1 |
1,200 | What is linear data structure? | A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure. | linear data structure are such as tree graph array \nthese are know as linear data structure | 0 |
1,201 | What is linear data structure? | A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure. | Linear data structures are data structures arranged in a line-like structure where the elements are linked together in a linear(line) manner. \nSome of them are:-\n1. Arrays\n2. Linked Lists\n3. Queue | 2.5 |
1,202 | What is linear data structure? | A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure. | linear data structure are those in which data is entered in linear form for ex - stack, queue | 2 |
1,204 | What is linear data structure? | A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure. | A linear data structure is a data structure in which a a data structure in linear form | 1.5 |
1,205 | What is linear data structure? | A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure. | linear data structure reffers to the sorted structure whose searching complexity will be O(n). | 1.5 |
1,206 | What is linear data structure? | A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure. | Arrays and Linear lists are linear data structures used for storing data in a linear (line-wise) fashion\nFoe e.g.: arr[5]: In this data is stored from Indexes 0 to 4. | 2.5 |
1,207 | What is linear data structure? | A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure. | Linear data structure can be traversed linearly like lists, arrays, etc. | 1.5 |
1,208 | What is linear data structure? | A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure. | linear data structure is linked list etc | 1 |
1,210 | What is linear data structure? | A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure. | A linear data structure is a data structure which is continuous in nature. An example of the linear data structure is an Array. | 2 |
1,211 | What is linear data structure? | A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure. | Linear data structures are the those arrays, stacks and queues, heap. | 1 |
1,212 | What is linear data structure? | A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure. | arrays- used to store data | 0.5 |
1,214 | What is linear data structure? | A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure. | A linear data structure is a one dimensional structure.\neg. queue, stack, array. | 2 |
1,215 | What is linear data structure? | A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure. | linear data structure is used to store the data in a data base in the form of different variable | 0 |
1,216 | What is linear data structure? | A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure. | data structures which are arranged in a line structure are linear data structure.\nsome examples - queues, stacks. arrays. | 2.5 |
1,217 | What is linear data structure? | A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure. | linear data structure is saving in memory continues way that way linear data structure like array | 2.5 |
1,218 | What is linear data structure? | A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure. | linked list, array, stack ,queue etc. | 1 |
1,219 | What is linear data structure? | A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure. | the data structures which are not derived from another data structures like \n1)array\n | 1.5 |
1,220 | What is linear data structure? | A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure. | linear data structures can be the processes in which time complexity is very small | 0 |
1,221 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | Searching , sorting, adding elements, deleting elements | 2.5 |
1,222 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | operations that can be performed on a data-structure are insertion, deletion, searching, merging, sorting | 2.5 |
1,223 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | common operation that can be performed on a data structure are insertion ,deletion | 2.5 |
1,224 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | 1) Insertion, 2) Deletion, 3) Searching and Retrieving, 4) Sorting, 5) Updating | 2.5 |
1,225 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | Insertion- at start, at end, at given index.\nUpdate- change the value of a given key to new value\nDelete- delete a particular element from the data structure.\nSort- sort the data present inside a data structure\nSearching- searching a given value inside the data structure. | 2.5 |
1,226 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | The common operations that can be performed on a data structure is searching ,deletion, update, retrieving, inserting | 2.5 |
1,227 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | commom operations that can be performed on data structure are :\nsearching \nsorting \ninsertion . | 2.5 |
1,228 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | . Seaching\n. Sorting\n. insertion \n. deletion | 2.5 |
1,229 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | Common operations that can be performed on a data structure are insertion, deletion, swaping, traversing, searching, sorting and many more. | 2.5 |
1,230 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | 1. traversing\n2. insertion\n3. sort\n4. update\n5. stack | 2.5 |
1,231 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | Common operations are as follows-\n1. creation \n2. implementation\n3. Display | 2.5 |
1,232 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | Common operations that can be performed on a data-structure are :-\n1) Insertion \n2) deletion \n3) selection \n4) sorting \n5) Merging | 2.5 |
1,233 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | The common operations are storing data, transferring data, retrieving data, insertion deletion in the given data. | 2.5 |
1,234 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | Common operations that can be performed on a data structure are\nAddition of data\nDeletion of data\nTraversal of data\nStoring data in a apt, easy to access format | 2.5 |
1,235 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | common operation that can be performed on data structures are :\n- traversal\n- deletion\n- insertion | 2.5 |
1,236 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | Common Operation on the data Structure :-\nInsertion, Deletion, Traversal, Display, Sorting. | 2.5 |
1,237 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | 1. Insertion Of data\n2.Searching for data\n3. Retrieval of data if required data found after searching\n4.modifying the data | 2.5 |
1,239 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | some operations like searching ,sorting, insertion ,deletion, heapify, construction of trees ,forming recurrences ,finding shortest path of all in graph | 2.5 |
1,240 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | Common operations that can be performed on data structure:\n1)Searching: Linear Search, Binary Search, Median Search\n2)Sorting: Bubble Sort, Merge Sort, Insertion Sort, Selection Sort\n\n | 2.5 |
1,241 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | Searching , Insertion , Deletion , Dividing , Merging , Reversing ,Traversal. | 2.5 |
1,242 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | the common operations that can be performed on searching , sorting , deleting ,merging, traversals etc. | 2.5 |
1,243 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | common operations performed on data structres :\ninsert: used to add particular element into the data structure\ndelete: used to delete a particular element from the data structure\n\n | 2.5 |
1,244 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | Common operations that can be performed on a data structure are :\ni) traversing\nii)insert\niii) delete | 2.5 |
1,245 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | insertion , deletion , traversing , reversal , search | 2.5 |
1,246 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | Some common operations are traversal , insertion and deletion. | 2.5 |
1,247 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | Searching, Traversal, Sorting, Insertion, Deletion etc | 2.5 |
1,248 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | Searching, insertion, deletion, sorting, Traversal, etc. | 2.5 |
1,249 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | the common operation that can be performed on data structure are :\n1) pushing an element in the provided data structure.\n2)popping the element from the given data structure.\n3)getting the first and last element from the given data structure.\n4)Getting the address of the element from the given data structure. | 2.5 |
1,250 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | Common operations that can be performed on a data structure: insertion, deletion, searching, sorting (in some data structures). | 2.5 |
1,251 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | Some common operations which can be performed in data structure are searching and sorting like depth first search or breadth first search, we can calculate minimum cost problems, minimum /maximum distance problems, travelling salesman problem, inserting an element, deleting an element and so on | 2.5 |
1,252 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | 1) inserting \n2)deletion\n3)searching \n4)sorting\n | 2.5 |
1,253 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | the common operations that can be performed on any data structures are :-\nsearching an element\nextracting an element \ninserting an element | 2.5 |
1,254 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | searching, sorting ,depth first search and breadth first search | 2.5 |
1,255 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | Some common operations that can be performed on a data-structure are :\ninsertion, deletion, sorting | 2.5 |
1,256 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | adding an element, removing an element, searching or sorting in data structure. | 2.5 |
1,257 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | searching and sorting are common operations that can be performed on a data-structure.\n | 2.5 |
1,258 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | The common operations are :\nsearching and sorting | 2.5 |
1,259 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | Common operations that can be performed on a data-structures are:\n1. searching \n2. sorting. | 2.5 |
1,260 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | various operations include:-\nsearching\nsorting \ndeleting\ntraversing\nadding or inserting | 2.5 |
1,261 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | Searching, sorting, insertion, deletion are some of the common operations that can be performed on a data-structure. | 2.5 |
1,262 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | A data structure can be used to store, search and retrieve and delete if required, any piece of information. Various data structures can be used in various situations to perform the mentioned operations. | 2.5 |
1,263 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | Sorting, searching, data storage and operations like arithmetic operation etc. | 2.5 |
1,264 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | Some common operations that can be performed on data structures are:\n- Insertion\n- Deletion\n- Sort\n | 2.5 |
1,265 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | Various operations that can be performed on a data structure are arithmetic operations , boolean operations , relational operations like or( | | ),and( && ) | 2.5 |
1,266 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | Common operations that can be performed on a data structure are:\n1. Insertion\n2. Deletion\n3. Updating\n4. Calculation, etc. | 2.5 |
1,267 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | Common operation carried out on Data-Structure are storage, insertion, deletion, and calculation or computation. | 2.5 |
1,268 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | Common operations that can be performed on data structure are:\nInsertion\nDeletion\nSelection\n | 2.5 |
1,269 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | 1)Searching\n2)Sorting\n3)Deletion\n4)Insertion | 2.5 |
1,270 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | Common operations such as searching, sorting, insertion, deletion. | 2.5 |
1,271 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | Data structures are used to store data and hence the common operations performed on these are storing the data, searching the element and keeping the record by adding or deleting nodes. | 2.5 |
1,272 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | Common Operations on data structures.\n1. Traversal\n2. Insertion\n3. Deletion\n4. Update | 2.5 |
1,273 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | Traversing ,Searching ,Sorting, Deletion ,Insertion | 2.5 |
1,274 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | searching, sorting, deleting, inserting, merging etc. | 2.5 |
1,275 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | Insert, Delete, Update are the most common operations | 2.5 |
1,276 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | Insertion, deletion, and searching. | 2.5 |
1,277 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | implementation of linked lists, stacks, queues, graphs, and various types of trees including heaps | 2.5 |
1,278 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | Common operations that can be performed on a data-structure are:-\n1. Insertion\n2. Deletion\n3. Searching\n4. Finding and extracting minimum and maximum | 2.5 |
1,279 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | Accessing the elements\nInsert\nDelete\nUpdate\nDisplay | 2.5 |
1,280 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | 1)Insertion\n2)Updation\n3)Deletion\n4)Searching | 2.5 |
1,281 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | add data , remove data , find frequency of element , add two together , convert from one data struct. to another | 2.5 |
1,282 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | Searching Sorting Insertion\nDeletion | 2.5 |
1,283 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | Insertion , traversing and deletion operation | 2.5 |
1,284 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | common operations that can be performed on a data structure are\n1.input\n2. output\n3. search | 2.5 |
1,285 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | The common operations that could be performed are insertion, deletion, union , find min or max. | 2.5 |
1,286 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | Operations that can be performed on a data structure are searching anything in data, sorting the data accordingly (increasing or decreasing), Insertion of elements into the data structure or deletion of elements from the data structure. | 2.5 |
1,287 | What are common operations that can be performed on a data-structure? | The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence | Common operations that can be performed on a data-structure are insertion, searching, sorting, deletion , updating etc. | 2.5 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.