Harsh-7300/dataset huggingface dataset:
Question: What is linear data structure?
Reference answer: 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.

Student answer:  In  the Linear data structure where data elements are arranged sequentially or linearly where each and every element is attached to its previous and next adjacent is called a linear data structure. In linear data structure, single level is involved.
Score: 2.5

Student answer: it is a data structure in which data is arranged linearly like array and linked list
Score: 2.5

Student answer: A linear data structure is one that stores data linearly in the memory. An array is an example of a linear data structure. 
Score: 2.5

Student answer: Linear data structure are the type of data structures in which the elements are stored in sequential memory locations. One can traverse through all the elements knowing only the location of first element in the structure. For example: Arrays.
Score: 2.5

Student answer: data structure that stores data sequentially, after after another\nfor example: queue, vector, lists. etc
Score: 2.5

Student answer: Linear data structure : array 
Score: 1.5

Student answer: A linear data structure is one where data items are arranged in a linear fashion. Each member is attached to its neighboring elements. The structure permits single-level data storage because the data elements are stored in a linear fashion. The data can be traversed in one run. \ncertain examples of linear data structure are-stacks, linked lists, queues etc.
Score: 2.5

Student answer: It is a data structure where elements are arranged sequentially or linearly.\nFor example arrays. 
Score: 2.5

Student answer: Linear data structure is a data structure in which the elements or the required data are kept linearly for example:\nArrays, Queue, stack, vector etc.
Score: 2.5

Student answer: A linear data structure is a data structure that can only be traversed unidirectionally. Eg: Arrays, linked list, etc.
Score: 2.5

Student answer: a linear data structure is a one in which the data is allocated in such a way that we traverse the data in linear fashion like (one after the other) example in an array rather than jumping from one memory location to other. 
Score: 2.5

Student answer: Data structure where data elements are arranged sequentially or linearly where each and every element is attached to its previous and next adjacent is called a linear data structure. Here can traverse all the elements in single run only. Linear data structures are easy to implement because computer memory is arranged in a linear way. Its examples are array, stack, queue, linked list, etc.
Score: 2.5

Student answer: data structures that store information one after the other in the memory.\neg: array, string
Score: 2.5

Student answer: in which each data are4 connected one after the other 
Score: 2.5

Student answer: In a linear data structure, the elements are stored in a continuous memory space
Score: 2.5

Student answer: linear data structures like 1d array,stack,queue
Score: 2.5
Question: What is linear data structure?
Reference answer: 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.

Student answer: A linear data structure is one where data items are arranged in a linear way. Each member of the data structre is attached to its neighboring element. 
Score: 2.5

Student answer: linear data structures:\narray\nlinked list\nstack\nqueue
Score: 2.5

Student answer: Linear data structure stores data in 1D manner.Example-array,vector,stack,queue
Score: 2.5

Student answer: a linear data structure is one that stores single type of data such as array
Score: 2.5

Student answer: Linear Data Structure has lesser time complexity 
Score: 1.0

Student answer: linear data structure is arrangement of data where data is arranged in linear way. 
Score: 2.0

Student answer: Linear data structure is arrangement of data where data items are arranged in a linear way.
Score: 2.0

Student answer: linear data structure is the structure in which node has only one child or one branch . You can go only in one direction.
Score: 2.0

Student answer: A linear data structure is a data structure having elements arranged in a linear fashion \nEg - Array
Score: 2.0

Student answer: Linear data structure are the data structure that performs operation in single dimension such as array , strings , stack , queue and etc.
Score: 2.5

Student answer: having elements arranged in linear fashion.
Score: 2.0

Student answer: Data structures that are linear in size like linked lists are called linear data structures
Score: 2.5

Student answer: The data structures in which the data is stored in a sequential order is a linear data structure. For example: arrays.
Score: 2.5

Student answer: linear as the name only suggest it is arranging something in the linear or the sequntial order \nso in linear data structure the data is arranged in the linear order
Score: 2.5

Student answer: The linear data structure includes:\n1-Stack\n2-Queue\n3-Lists
Score: 2.5

Student answer: all data items are connected in linear manner example array
Score: 2.5

Student answer: A linear data structure is the one in which we can iterate through the whole data without without coming back to an element which has already been iterated through. For example, an array, a singly linked list, a hash table. Here the length of the data structure is the number of hops or iterations it takes to reach from the starting element to the ending element.
Score: 2.0

Student answer: like arrays, linked list, that data structure that can be useful linearly in both its work and while iterating 
Score: 2.0

Student answer: Linear Data Structure are Data Structure which have continuous memory for storage\nfor eg. array , linked list  etc..
Score: 1.0

Student answer: linear data structure means a structure which is connected linearly to each other in some manner . for example an array is connected with indexes starting from zero whereas a linked list unlike array is connected through addresses of a pointer index.
Score: 1.0
Question: What is linear data structure?
Reference answer: 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.

Student answer: Linear data structure is the data structure where data items are arranged in a linear fashion. Each member is attached to its neighbouring elements.
Score: 1.0

Student answer: data structure in which data is stored in linear way for example array and lists.
Score: 1.0

Student answer: in linear  data items are arranged in a linear way.  and the data can be traversed in one run.
Score: 2.0

Student answer: Data Structure In 1 D is known as linear data structure. It stores data horizontally memory blocks. These group of  memory blocks can also be called an Array. A single iterator is used to traverse memory chunk and assign the values to the memory blocks.
Score: 1.0

Student answer: Linear data structure stores data in a one dimensional or linear fashion. Examples of linear data structures are arrays, stacks and linked lists.
Score: 1.0

Student answer: it is a type of data structure in which the data is stored linearly example- array, stack, etc.
Score: 1.0

Student answer: A linear data structure is defined as a structure in which the data is arranged in linear order. Ex : array, list\nExample of non linear ds: Trees
Score: 1.0

Student answer: Linear data structures are data structures which store data in contiguous memory locations. Eg: Array\nThese can be traversed linearly, in a specific order in which the data is saved. 
Score: 1.0

Student answer: a data structure in which the elements are organized in a linear manner.ie. the elements are arranged one after the other in a specific order.\n
Score: 1.0

Student answer: A linear data structure is a data structure in which each data value is linearly connected with the one that precedes and suceeds it . 
Score: 2.0

Student answer: linear data structure are data structures in which data is stored in a line/linear manner. For example- array, vector, list.
Score: 1.0

Student answer: all elements are stored at the same level in linear ds like arrays and linked lists.
Score: 1.0

Student answer: linear data structure is linearly connected to all other nodes of the data structure as in i.e  linked list.
Score: 1.0

Student answer: A data structure in which the data is stored one after another such that every element is connected to just one element which is it's intermediate.
Score: 2.0

Student answer:  inputs which are provided to it . There are three types of  notations i.e.,  big O, big Theta (Î˜), and big Omega (Î©).
Score: 2.0

Student answer: Linear data structures are one dimentional data structures. Eg: Lists, 1-d array 
Score: 1.0

Student answer: Linear data structures are data structures in which data elements are stored in a linear sequence.\n1 Arrays\n2 linked list\n3 stacks\n4 queue
Score: 2.0
Question: What is linear data structure?
Reference answer: 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.

Student answer: Arrays, vectors, stack, queues are all linear data structure. We store the elements linearly means in a line and all the algorithms we apply on linear data structure are in a line only like traversal, searching, sorting etc. They have linear time complexity - O(n).
Score: 1.0

Student answer: linear data structure is 
Score: 1.0

Student answer: We can define Linear data structure ->  the adajacents elements in linear data structure are connected lineraly to each other .\nex. Linked Lists
Score: 2.0

Student answer: A linear data structure is one which stores data in a linear manner.\nEx-Array, List
Score: 2.0

Student answer: linear data structure is a way of storing data in which storage buckets or connected linearly and no multi-dimensional is present after fully creation of data structure.
Score: 2.0

Student answer: Linear data structures are the data structures in only one dimension.\n Some of the examples are 1D array, stack, queue etc.
Score: 2.0

Student answer: Linear data structure stores data in contiguous memory locations which means that they are stored in memory in adjacent memory places.
Score: 2.0

Student answer: a linear data structure is a 1D data structure like a list, array, linked list, queue and many others in which one parameter like height or width is set to one.
Score: 1.0

Student answer: The data structure that use linear structure format like stack ,linked list, queue . These data structure traverse, search linearly.
Score: 2.0

Student answer: The data structures which can imagined to be placed in a line.\nEx, Array, Stack, Queue.
Score: 1.0

Student answer: Asymptotic Notations are symbols used to determine the time and space complexity of the algorithms.\nThey are-\n1.) Big Omega Notation\n2.) Big O Notation\n3.) Theta Notation\n4.) Small Omega Notation\n4.) Small O Notation
Score: 1.0

Student answer: linear data structure refers for finding elements one by one and comparing one by one , not optimal 
Score: 2.0

Student answer: data structures which are uni directional and doesnt have any branching. like 2d arrays, linlked lists.
Score: 2.0

Student answer: linear data structure is linear function who function create linear structure 
Score: 2.0

Student answer: linear data structure help us into perform some function in a linear format for example we can use linear data structure using array and we can not use linear data structure using matrix 
Score: 1.0

Student answer: Linear data structure is a data structure where all the data can be iterated over linearly, it will take n iterations, n being the size of the linear data structure. All the data is in a line, like in arrays, stacks, queues, lists.
Score: 2.0

Student answer: linear data structure includes array, linked list etc 
Score: 1.0
Question: What is linear data structure?
Reference answer: 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.

Student answer: Linear data structure are termed as array , linked list which has the address of the next node in a linear way, such as we can move to other elements of the data structure in a linear way
Score: 2.0

Student answer: A linear data structure is one which has no branches, one node is connected is at most connected to 2 nodes.
Score: 1.0

Student answer: it is a data structure which is linear in size example linked list, arrays
Score: 1.0

Student answer: Linear data structure such as array have only one way implementation  of operation on them . 
Score: 1.0

Student answer: A linear data structure is used to store data in a linear fashion as in array where each element is stored as contiguous memory in a linear way.
Score: 1.0

Student answer: linear data structure are  like  linked list , arrays . that stores values 
Score: 1.0

Student answer: A linear data structure is the one that stores the data linearly and there is only one dimension when trying to access the data. For example a single dimensional array, a stack, a queue or a linked list are all linear data structures. As we can move in only one dimension in these data structures. 
Score: 2.0

Student answer: where data items are arranged in a linear fashion
Score: 1.0

Student answer: Linear data structure are the data structures that stores data  linearly or we can say that one by one .For example, suppose any object comes first then we will place it at first position and if after that any object will come then we will place it at second position and so on.\n 
Score: 2.0

Student answer: A data structure in which we can traverse in only one direction i.e we don't  have other paths .. eg. arrays , stack , queue.
Score: 2.0

Student answer: Data Structures in which we can store data linearly is called linear data structure. Examples of linear data structure are arrays, linked list(doubly linked list, circular linked list etc.)
Score: 2.0

Student answer: linear data structure are the ones that travel in one direction as if walking on a line. for example an linked list is a linear data structure where the traversal happens in one direction unlike a tree where the movement from the root nodes can go in either of the direction of its child nodes.
Score: 1.0

Student answer: A linear data structure is which is of linear size eg - arrays, linked lists and only insertion operation is performed.
Score: 1.0

Student answer: It is a data structure which stores the data in linear format that is it assigns a value to every corresponding index in a straight line  .For example: Array ,vector ,etc. 
Score: 1.0

Student answer: liner data structure is a way of storing the data in way that the time complexity is linear while doing operations such as inserting, deleting, traversing. For example arrays.
Score: 1.0
Question: What is linear data structure?
Reference answer: 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.

Student answer: Linear data structures are the data structures that move only in one direction and work linearly eg: arrays. 
Score: 1.0

Student answer: Linear data structure are those data structures which store data in the system on contiguous memory locations(in a linear fashion). The best example of the linear data structure is array which store the data on continuous memory locations and hence it become very easy to access the data in O(1) time complexity and also we can decide according to the row major order.
Score: 1.0

Student answer: a linear data structure is a data structure in which data is stored 1 dimensionally eg. arrays stacks queues etc.
Score: 1.0

Student answer: In linear data structure there is no branching among the elements and the traversal is in a linear order where each element is denoted by a specific index for example arrays.
Score: 1.0

Student answer: array is an example of linear data structure
Score: 1.0

Student answer: Linear Data Structure helps stacking data in a linear manner. 
Score: 1.0

Student answer: A linear data structure is a data structure which stores data in a single dimension and a single row. eg Array, Vector
Score: 1.0

Student answer: A linear data structure is a one which stacks data in a linear manner.  For example, each pointer points only to one particular address of the other data value.\nExamples- Stack, Queue. linked list
Score: 1.0

Student answer: linear data structure are the part of data structure which deals with arrays in linear form like 1d array 
Score: 1.0

Student answer: Linear data structure are one dimensional data structures elements linked to each other. They are stored in a line that is linearly in the memory for example arrays, stack , queue etc. Levels or hierarchies aren't present. 
Score: 1.0

Student answer: linear data structures is a collection of data which can be easily accessed through the use of pointers and indices.
Score: 1.0

Student answer: linear data structure is a structure which stores data linearly like array, stack, queue etc.
Score: 1.0

Student answer: Linear data structure is the data structure where the data can be iterated linearly
Score: 1.0

Student answer: in linear data structure data or the items are arranged linearly in a straight line                                                                                                                                                                                                                                            
Score: 1.0

Student answer: linear data structures include types like singly linked lists, doubly linked lists , queues, stacks, heaps etc. which avoid a hierarchical structure using a data type. 
Score: 1.0

Student answer: Linear data structure
Score: 1.0

Student answer: A linear data structure are like: arrays strings etc.
Score: 1.0
Question: What is linear data structure?
Reference answer: 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.

Student answer: linear data structure is a structure of data where data are arranged in a linearly. Each member is attached to its neighboring elements. This data structure permits single-level data storage and can be traversed in one go.
Score: 1.0

Student answer: A linear data structure in which data is arranged in a linear way.
Score: 1.0

Student answer: a linear data structure are the one where data items are arranged in a linear fashion. Here each member is attached to its neighboring element.
Score: 1.0

Student answer: A data structure in which the arrangement of data items is in linear order that is one after the other and only one to one that data structure is known as a linear data structure. for ex. array, linked list
Score: 1.0

Student answer: This data structure stores the data in linear fashion like arrays, stacks, queues, etc.\n
Score: 1.0

Student answer: A data structure which stores its data in a chain or in linear manner . Exampe-  stack, queue, array
Score: 1.0

Student answer: An example of a linear data structure is an array 
Score: 1.0

Student answer: linear data structure which we can stored in a linear manner. like array, string etc.
Score: 1.0

Student answer: linear data structure is one where all data items are arranged in linear fashion i.e in a single row\nfor Eg: Arrays,Strings
Score: 1.0

Student answer: Linear data structure is a data structure which can be implemented in linear time.
Score: 1.0

Student answer: It is a type of data structure in which time complexity is always constant .  Some of its examples are linear search , binary search.
Score: 2.0

Student answer: linear data structure is data structure in ehich we can traverse from start to end in a sigle direction.
Score: 1.5

Student answer: Data structure where data elements are arranged sequentially or linearly where each and every element is attached to its previous and next adjacent is called a linear data structure. In linear data structure, single level is involved. Therefore, we can traverse all the elements in single run only. Linear data structures are easy to implement because computer memory is arranged in a linear way. Its examples are array, stack, queue, linked list, etc. \n
Score: 1.5

Student answer: a data structure in which data is stored only in one direction such as array
Score: 2.0

Student answer: Linear data structures are those data structures that share continious memory location\n example of linear data structure is array
Score: 2.0

Student answer: linear data structure is in which we form operations in 1d sequence and it types are array,string and many linear data structure 
Score: 1.0
Question: What is linear data structure?
Reference answer: 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.

Student answer: Asymptomatic analysis gives us an a definite view on the Time complexity of an algorithm. Various different functions depending on how many times they run. increase the time complexity. Asymptomatic analysis gives us a mathematical view to define the worst and best case scenarios on the efficiency i.e. Time complexity and space complexity of an algorithm. Ex- O(n),Theta(n).O(n^2).etc
Score: 1.0

Student answer: It has data elements arranged in sequential manner and each member is connected to its previous and next element.
Score: 1.0

Student answer: Linear data structures like lists - arrays, linked lists etc. These are basically storage data structures which store multiple values while utilizing space in linear pattern, repeating at fixed intervals .i.e. according to its fundamentals.
Score: 2.0

Student answer: A liner data structure stores data linearly in a sequence.\nExamples of linear data structure: \n1) Array\n2) Linked List\n3) Stacks\n4) Queues
Score: 2.0

Student answer: Linear data structure are the primitive dat structures present in the respective programming language using which other data structure are implemented or generated.\nfor eg, array, linked list etc.
Score: 1.5

Student answer: The data  structures having a linear sequence.The linear data structures we have studies are as follows:\nArray \nLinked list\nStacks\nQueues\n
Score: 1.0

Student answer: These are the primitive data structure which can be used to generate new data structure.\neg : array 
Score: 1.0

Student answer: linear data structure are structure like array in which data is stored linearly and can be accessed using index or pointers
Score: 1.0

Student answer: is a base for all the other data structures, for example, array is a data structure from which we can derive other data structures
Score: 1.0

Student answer: linear data structures are arrays. They are the base for complex data structures. 
Score: 1.0

Student answer: in linear data structure the data in connected or stored in linear fashion.\nex. linked list, array etc.
Score: 1.0

Student answer: a linear data structure is type of data structure in which the elements are connected in a linear fashion. Each element is connected to only one element which is generally the next element. Examples are-linked list.
Score: 1.0

Student answer: a linear data structure is a type of data structure in which data is stored in a connected fashion,i.e. linearly.for example- linked list.
Score: 2.5

Student answer: Data structures which store data in a linear manner are called linear data structures.  example stacks, queues
Score: 2.5

Student answer: In linear data structure the data is stored one after another so if we have to go to last data we have to go through every stored data eg-array,linklist.
Score: 2.5
Question: What is linear data structure?
Reference answer: 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.

Student answer: Data structure that can be traversed in a linear order, example arrays, linked lists.
Score: 2.0

Student answer: The data structure which does one thing that is to store or pass the data. Examples of linear data structure is array, however linked list is not a linear data structure as it not only store the data pass also stores the information of the next the node.
Score: 1.0

Student answer: These are the data structures which stores data in continuous memory blocks. example: array
Score: 2.5

Student answer: Linear data structures such as array 
Score: 2.0

Student answer: Linear Data Structure is used for searching linearly 
Score: 1.0

Student answer: linear data structure is a 2d type data structure \nfor example array,linked list
Score: 1.5

Student answer: Data structures that occupy continuous memory locations in RAM are called linear data structures. Ex stack, queue. 
Score: 2.5

Student answer: A linear data structure is the data structure which stores data in a linear fashion for example arrays, linked lists, stack, queue etc.
Score: 2.5

Student answer: a linear data structure is one dimensional data structure  which generally save the data in consecutive blocks of memory 
Score: 2.5

Student answer: 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 structure is a non loop containing structure that allowes traversing either of the two sides and not randomly.
Score: 2.5

Student answer: Array, vector, Linked List are Linear Data structures.
Score: 1.5

Student answer: linear data structure is in which that occupy continuous memory location in ram 
Score: 2.5

Student answer:  Data structures which store the data in continuous or simultaneous memory locations are linear data structures.
Score: 2.5

Student answer: list,\nqueue\nstack\nlinear data structure is one in which the data structure is only in 1d\n
Score: 2.0

Student answer: In linear data structure the collection of nodes is linear, data is present in more linear form
Score: 1.5

Student answer: linear data structure means data structure in 1D form\ni.e int, double, char, string etc
Score: 1.0

Student answer: 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.
Score: 2.0

Student answer: Linked list ,sorting  , searching are the linear data structure
Score: 1.0

Student answer: linear data structure are such as tree graph array \nthese are know as linear data structure 
Score: 0.0
Question: What is linear data structure?
Reference answer: 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.

Student answer: 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
Score: 2.5

Student answer: linear data structure are those in which data is entered in linear  form for ex - stack, queue 
Score: 2.0

Student answer: A linear data structure is a data structure in which a a data structure in linear form
Score: 1.5

Student answer: linear data structure reffers to the  sorted structure whose searching complexity will be O(n). 
Score: 1.5

Student answer: 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.
Score: 2.5

Student answer: Linear data structure can be traversed linearly like lists, arrays, etc.
Score: 1.5

Student answer: linear data structure is linked list etc
Score: 1.0

Student answer: A linear data structure is a data structure which is continuous in nature. An example of the linear data structure is an Array.
Score: 2.0

Student answer: Linear  data structures are the those arrays, stacks and queues, heap.
Score: 1.0

Student answer: arrays- used to store data 
Score: 0.5

Student answer: A linear data structure is a one dimensional structure.\neg. queue, stack, array.
Score: 2.0

Student answer: linear data structure is used to store the data in a data base in the form of different variable 
Score: 0.0

Student answer: data structures which are arranged in a line structure are linear data structure.\nsome examples - queues, stacks. arrays.
Score: 2.5

Student answer: linear data structure is saving in memory continues way that way  linear data structure like array 
Score: 2.5

Student answer: linked list, array, stack ,queue etc.
Score: 1.0

Student answer: the data structures which are not derived from another data structures like \n1)array\n
Score: 1.5

Student answer: linear data structures can be the processes in which time complexity is very small
Score: 0.0
Question: What are common operations that can be performed on a data-structure?
Reference answer: 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

Student answer: Searching , sorting, adding elements, deleting elements
Score: 2.5

Student answer: operations that can be performed on a data-structure are insertion, deletion, searching, merging, sorting
Score: 2.5

Student answer: common operation that can be performed on a data structure are insertion ,deletion 
Score: 2.5

Student answer: 1) Insertion, 2) Deletion, 3) Searching and Retrieving, 4) Sorting, 5) Updating
Score: 2.5

Student answer: 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.
Score: 2.5

Student answer: The common operations that can be performed on a data structure is searching ,deletion, update,  retrieving, inserting
Score: 2.5

Student answer: commom operations that can be performed on data structure are :\nsearching \nsorting \ninsertion .
Score: 2.5

Student answer: . Seaching\n. Sorting\n. insertion \n. deletion
Score: 2.5

Student answer: Common operations that can be performed on a data structure are insertion, deletion, swaping, traversing, searching, sorting and many more. 
Score: 2.5

Student answer: 1. traversing\n2. insertion\n3. sort\n4. update\n5. stack
Score: 2.5

Student answer: Common operations are as follows-\n1. creation \n2. implementation\n3. Display
Score: 2.5

Student answer: Common operations that can be performed on a data-structure are :-\n1) Insertion \n2) deletion \n3) selection \n4) sorting \n5) Merging 
Score: 2.5

Student answer: The common operations are storing data, transferring data, retrieving data, insertion deletion in  the given data.
Score: 2.5

Student answer: 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 
Score: 2.5

Student answer: common operation that can be performed on data structures are :\n- traversal\n- deletion\n- insertion
Score: 2.5

Student answer: Common Operation on the data Structure :-\nInsertion, Deletion, Traversal, Display, Sorting.
Score: 2.5

Student answer: 1. Insertion Of data\n2.Searching for data\n3. Retrieval of data if required data found after searching\n4.modifying the data
Score: 2.5

Student answer: some operations like searching ,sorting, insertion ,deletion, heapify,  construction of trees ,forming recurrences ,finding shortest path of all in graph
Score: 2.5

Student answer: 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
Score: 2.5
Question: What are common operations that can be performed on a data-structure?
Reference answer: 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

Student answer: Searching , Insertion , Deletion , Dividing , Merging , Reversing ,Traversal.
Score: 2.5

Student answer: the common operations that can be performed on searching , sorting , deleting ,merging, traversals etc.
Score: 2.5

Student answer: 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
Score: 2.5

Student answer: Common operations that can be performed on a data structure are :\ni) traversing\nii)insert\niii) delete
Score: 2.5

Student answer: insertion  , deletion , traversing , reversal , search
Score: 2.5

Student answer: Some common operations are traversal , insertion and deletion.
Score: 2.5

Student answer: Searching, Traversal, Sorting, Insertion, Deletion etc
Score: 2.5

Student answer: Searching, insertion, deletion, sorting, Traversal, etc.
Score: 2.5

Student answer: 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.
Score: 2.5

Student answer: Common operations that can be performed on a data structure: insertion, deletion, searching, sorting (in some data structures).
Score: 2.5

Student answer: 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
Score: 2.5

Student answer: 1) inserting \n2)deletion\n3)searching \n4)sorting\n
Score: 2.5

Student answer: the common operations that can be performed on any data structures are :-\nsearching an element\nextracting an element \ninserting an element
Score: 2.5

Student answer: searching, sorting ,depth first search and breadth first search 
Score: 2.5

Student answer: Some common operations that can be performed on a data-structure are :\ninsertion, deletion, sorting
Score: 2.5

Student answer: adding an element, removing an element, searching or sorting in data structure.
Score: 2.5

Student answer: searching and sorting are common operations that can be performed on a data-structure.\n
Score: 2.5

Student answer: The common operations are :\nsearching and sorting 
Score: 2.5

Student answer: Common operations that can be performed on a data-structures are:\n1. searching \n2. sorting.
Score: 2.5

Student answer: various operations include:-\nsearching\nsorting \ndeleting\ntraversing\nadding or inserting
Score: 2.5
Question: What are common operations that can be performed on a data-structure?
Reference answer: 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

Student answer: Searching, sorting, insertion, deletion are some of the common operations that can be performed on a data-structure.
Score: 2.5

Student answer: 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.
Score: 2.5

Student answer: Sorting, searching, data storage and operations like arithmetic operation etc. 
Score: 2.5

Student answer: Some common operations that can be performed on data structures are:\n- Insertion\n- Deletion\n- Sort\n
Score: 2.5

Student answer: Various operations that can be performed on a data structure are arithmetic operations , boolean operations , relational operations like or( | | ),and( && )
Score: 2.5

Student answer: Common operations that can be performed on a data structure are:\n1. Insertion\n2. Deletion\n3. Updating\n4. Calculation, etc.
Score: 2.5

Student answer: Common operation carried out on Data-Structure are storage, insertion, deletion, and calculation or computation.
Score: 2.5

Student answer: Common operations that can be performed on data structure are:\nInsertion\nDeletion\nSelection\n
Score: 2.5

Student answer: 1)Searching\n2)Sorting\n3)Deletion\n4)Insertion
Score: 2.5

Student answer: Common operations such as searching, sorting, insertion, deletion.
Score: 2.5

Student answer: 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.
Score: 2.5

Student answer: Common Operations on data structures.\n1. Traversal\n2. Insertion\n3. Deletion\n4. Update
Score: 2.5

Student answer: Traversing ,Searching ,Sorting, Deletion ,Insertion
Score: 2.5

Student answer: searching, sorting, deleting, inserting, merging etc.
Score: 2.5

Student answer: Insert, Delete, Update are the most common operations
Score: 2.5

Student answer: Insertion, deletion, and searching.
Score: 2.5

Student answer: implementation of linked lists, stacks, queues, graphs, and various types of trees including heaps 
Score: 2.5

Student answer: Common operations that can be performed on a data-structure are:-\n1. Insertion\n2. Deletion\n3. Searching\n4. Finding and extracting minimum and maximum
Score: 2.5

Student answer: Accessing the elements\nInsert\nDelete\nUpdate\nDisplay
Score: 2.5

Student answer: 1)Insertion\n2)Updation\n3)Deletion\n4)Searching
Score: 2.5

Student answer: add data , remove data , find frequency of element , add two together , convert from one data struct. to another
Score: 2.5

Student answer: Searching Sorting Insertion\nDeletion
Score: 2.5

Student answer: Insertion , traversing and deletion operation 
Score: 2.5
Question: What are common operations that can be performed on a data-structure?
Reference answer: 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

Student answer: common operations that can be performed on a data structure are\n1.input\n2. output\n3. search
Score: 2.5

Student answer: The common operations that could be performed are insertion, deletion, union , find min or max.
Score: 2.5

Student answer: 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.
Score: 2.5

Student answer: Common operations that can be performed on a data-structure are insertion, searching, sorting, deletion , updating etc.
Score: 2.5

Student answer: The  operations are :-\nINSERTION\nDELETION\nUPDATION 
Score: 2.5

Student answer: insertion ,deletion, update ,modify 
Score: 2.5

Student answer: The following operations can be performed on a data structure: \n1. Insertion\n2. Deletion\n3. Search
Score: 2.5

Student answer: Searching, Insertion, Deletion, Sorting are some common operations that can be performed on a data structure. 
Score: 2.5

Student answer: insertion, deletion, iteration
Score: 2.5

Student answer: Common operations performed on a data structure are:\n1. Insertion \n2. Deletion\n3. Searching\n4.Modification\n
Score: 2.5

Student answer: searching,sorting,insertion,traversal,deletion etc.
Score: 2.5

Student answer: Searching, sorting, traversal etc. 
Score: 2.5

Student answer: Following are the common operations that can be performed on a data-structure:\n->Insertion\n->Updation\n->Deletion\n->Traversal
Score: 2.5

Student answer: The common operations that can be performed on a data structures are sorting, storing, merging, insertion, deletion, etc.
Score: 2.5

Student answer: THE common operations that can be performed on a data structure are \n1 deletion\n2 union\n3 traversal\n4 searching \n5 sorting\n
Score: 2.5

Student answer: Common operations are:\n1. Traversing\n2. Searching\n3. Sorting\n4. Insertion \n5. Deletion
Score: 2.5

Student answer: we can add or delete items. we can traverse the data structure 
Score: 2.5

Student answer: 1. Insert Data\n2. Delete Data\n3. Move Positions\n4. Edit
Score: 2.0

Student answer: common operations are adition subtraction multiplication accessing the elements
Score: 2.5

Student answer: some common operations that can be performed on data structures are:
Score: 2.5

Student answer: common operations like insertion merging searching , sorting can be performed on a data structure
Score: 2.0

Student answer: we can perform insertion deletion and searching operations on a data structure
Score: 2.0

Student answer: insert or store data\ndelete\nupdate data\nsearch an element stored in data structure
Score: 2.0
Question: What are common operations that can be performed on a data-structure?
Reference answer: 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

Student answer: Insertion\nDeletion\nSelection\nSearching
Score: 2.5

Student answer: Searching, Sorting are the operations that can be performed on a data structure. 
Score: 2.0

Student answer: Common operations are:\nSearching, Sorting, insertion of new data.
Score: 2.5

Student answer: insertion, deletion , finding maximum and minimum element.
Score: 2.0

Student answer: Sorting\nSearching\nTraversing
Score: 2.5

Student answer: The common-operation that can be performed on a data-structure are taking input and printing outputs.
Score: 2.5

Student answer: searching, sorting, inserting, deleting
Score: 2.5

Student answer: Insertion and deletion at any position , finding element are common operations that can performed on a data structure
Score: 2.5

Student answer: Following operations can be performed on a data structure:-\n1. Insertion\n2. Deletion\n3. Traversal\n
Score: 2.5

Student answer: operations performed are searching sorting insertion
Score: 2.5

Student answer: The common operations that can be performed on a data-structure are:\n1-Traversal\n2-Insertion\n3-Deletion\n4-Searching
Score: 2.5

Student answer: Search , Insert , Delete
Score: 2.5

Student answer: Searching, sorting, heapify or then making it to a min heap or a max heap, get minimum, get maximum
Score: 2.5

Student answer: adding, deleting a particular thing, updating, forming its structure\nwell like trees in case of trees we can add a node and delete a node \ncan be done using traversing a node, here a node can be anything that you wants to represent.\naccording to our need we can perform various operations.
Score: 2.0

Student answer: ->Insertion\n->Deletion\n->Updating\n->accessing data
Score: 1.0

Student answer: searching\nsorting\npossible shortest path and many more
Score: 1.0

Student answer: Common operations on a data structure are traversal,insertion,deletion,searcing,sorting and merging.
Score: 1.0

Student answer: insert-insert the element\ndelete-delete any  element\nupdate-update element with another element
Score: 1.0

Student answer: sorting and searching.
Score: 1.0

Student answer: Common operations such as remove and  insert can be performed on data structure. Commands used in STL to this is pop and push 
Score: 1.0

Student answer: Common operations that can be performed on data structures are insertion, deletion, updation, searching etc.
Score: 2.0

Student answer: common operations that can be performed are insertion, deletion, updation.
Score: 1.0

Student answer: Insertion\nDeletion\nsearching\nSorting
Score: 2.0
Question: What are common operations that can be performed on a data-structure?
Reference answer: 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

Student answer: Common operations that can be performed on data structures are Searching , Sorting and traversal. Some types of searches are: Binary search, linear search, etc. Some types of sorting are: selection sort, merge sort , quick sort, etc. Based on the time complexities of these algorithms in the best and worst case , the appropriate searching , sorting algorithm is chosen.\n
Score: 2.0

Student answer: searching \nsorting\ninsertion deletion
Score: 2.0

Student answer: 1) Traversal/Printing\n2) Delete\n3) Insertion (In most cases at any particular position too)\n4) Updating \n
Score: 1.0

Student answer: Sorting Searching
Score: 1.0

Student answer: 1. Insertion\n2. Deletion\n3. Traversal
Score: 2.0

Student answer: operations that can be performed are: searching, sorting , deleting , input of nodes etc.
Score: 2.0

Student answer: Common operations include entering data, deleting data ,searching, sorting, merging
Score: 2.0

Student answer: Linear data structures are those stores data in a linear manner such as array ,vector, stack ,queues , in these the data in stored one by one .
Score: 2.0

Student answer: Insertion \nDeletion\nSearching 
Score: 2.0

Student answer: Traversing \nsearching\ninsertion \ndeletion\nupdate
Score: 2.0

Student answer: 1. We can find sum of an array\n2. Maximum Element & Minimum Element\n3. Searching - Binary Search, Linear Search, Interpolation Search, Median Search\n4. Sorting - Selection Sort, Bubble Sort, Merge Sort, Quick Sort, Heap Sort
Score: 2.0

Student answer: common operations that can be performed on data structures are sorting ,searching etc.
Score: 2.0

Student answer: 1. Deletion\n2. Insertion\n3. Transversal
Score: 1.0

Student answer: Operations-Insert, Delete, Update
Score: 1.0

Student answer: Sorting, Searching, pop, push, delete, extract min, extract max, transversal, bi-directional pointing 
Score: 2.0

Student answer: Their are many operations that can be done on different data structures such as :\n1 . Traversing \n2. Searching\n3. Insertion\n4. Deletion
Score: 1.0

Student answer: Finding min and max data, extraction of particular data or min or max element, sorting of data in particular order, 
Score: 2.0

Student answer: some common operations that can be performed on data structures are:\n1. insertion\n2. deletion\n3. swapping\n4. modification\n5. searching\n6. sorting\n7. printing\n8. traversing
Score: 2.0

Student answer: insertion, deletion, traversal, searching.
Score: 1.0

Student answer: The common operations that can be performed on a data-structure are insertion, deletion and replace.
Score: 1.0

Student answer: Linear Data structures stores the data in a linear form.\nFor example- arrays, list, etc.
Score: 1.0