Harsh-7300/dataset huggingface dataset:
Question: What operations can be performed on Queues?
Reference answer: The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full

Student answer: Comparing with real life scenarios, like the ticket line, songs playlist.\n\nWe can control as per our preferences (and even the generic preferences - Priority Queue), the order of activities that we want to experience. Some performable operations will be - \n1. Insertion 2. Deletion 3. To know what's at the top 4. To compare the time/other activity related queries if provided with the information.
Score: 2.0

Student answer: 1) Enqueue\n2) Deque\n3) Front\n4) Insert\n5) pop
Score: 2.0

Student answer: Common operation are;(FIFO property)\n1.Insertion from top;\n2.Deletion from top;\n3Retrieval;
Score: 2.0

Student answer: The operations that can be performed on queues are:\nEnqueue\nDequeue\nInsert\n
Score: 2.0

Student answer: Deletion, Insertion and Retrieval. 
Score: 1.0

Student answer: Insert (known as Push)\nDelete (known as Pop - can only be used on the chronologically first entered number)\n
Score: 1.0

Student answer: operations that can be performed on linked list are-;\n1-push( )-which pushes the element in the queue\n2-top( )-to get the top element of the queue\n3-pop( )-to remove the top element from the queue
Score: 1.0

Student answer: 1)insert\n2)delete\n3)retrieve
Score: 1.0

Student answer: enqueue and dequeue are the functions required to make a queue in c++ . Queue follows first in first out. 
Score: 1.0

Student answer: it works on FIRST IN FIRST OUT  principle. we can perform various operations like:\npush()->inserting in queue.\npop()->deleting form queue.\ntop()->gives the top element of queue.
Score: 1.0

Student answer: push(),pop(),top() etc.
Score: 1.0

Student answer: pop,push/push_back,sorting,top,etc.
Score: 0.0

Student answer: queue, dequeue
Score: 2.0

Student answer: The operations that can be perform on queues are-push, pop , remove . 
Score: 0.0

Student answer: In the queue operation will be used that the element of array initialize first in last out.
Score: 0.0

Student answer: push, pop
Score: 0.0

Student answer: Queue is similar to stack but it follows the principle of FIFO; that is first in first out. Many operations can be performed om queue like sorting and searching.
Score: 1.0

Student answer: Insertion of element, deletion of an element, swapping between elements, traversing on elements.
Score: 1.0

Student answer: Enqueue & Dequeue can be performed on queues Priority Queues can also be made. Queues follow FIFO principle.
Score: 2.5

Student answer: queue can perform push,deletion,searching 
Score: 0.0

Student answer: enqueue \ndeque are the operation which can be performed on queue
Score: 2.5

Student answer: Push and dequeue can be performed on queues.
Score: 1.0

Student answer: The operations that can be performed on queues are-: push, pop, isempty etc.
Score: 0.0

Student answer: push, pop, top
Score: 0.0
Question: What operations can be performed on Queues?
Reference answer: The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full

Student answer: 1. enqueue\n2. dequeue\n3. isfull\n4. isempty
Score: 2.5

Student answer: Two common operations that can be performed on a queue includes insertion and deletion.
Score: 0.0

Student answer: push, pop, front are some of the operation that can be performed on Queues.\n\n
Score: 0.0

Student answer: push in queue and pop and top   are perform in queue 
Score: 0.0

Student answer: 1. Push: push to first location\n2.Pop: pop from first location\n3. Delete: from a particular position.\n
Score: 0.0

Student answer: enqueue\ndequeue\n
Score: 2.5

Student answer: operations on queues are\npush, pop, insert, delete\n
Score: 0.0

Student answer: Insertion , deletion , sorting , searching are the operation 
Score: 2.5

Student answer: Enqueue and Dequeue are two operations that can be performed on queue.
Score: 2.0

Student answer: enqueue and dequeue
Score: 2.0

Student answer: operation on queues can be performed such as lifo (last in first out ) 
Score: 0.5

Student answer: Several operations can be performed on queue like:-\n1. Insert:- To insert a value in queue from the rear side\n2. Delete:- To delete the value from queue from the front side.\n3. Traverse:- To visit the elements and values on queue.\n4. Edit:- To edit the values of queue.\n5. Store:- The values can be stored in queue for later access.\n\nQueue specific operations are:-\n1. Q-In: To insert the value from the rear side.\n2. Q-Out: To delete of push the value out of the queue. 
Score: 2.5

Student answer: enqeue ,deqeue
Score: 2.5

Student answer: there are two operation perfom on Queues:\n--> Enqueues\n-->Dequeues
Score: 2.0

Student answer: in queue we can performed sorting ,searching ,insertion and deletion operations
Score: 0.0

Student answer: insertion \ndeletion\n
Score: 2.5

Student answer: Enque: Inserting data in Queue\nDeque: Deleting data from Queue
Score: 2.0

Student answer: insert, pop,push
Score: 0.0

Student answer: insertion deletion etc
Score: 0.5

Student answer: Enqueue and Dequeue
Score: 2.0

Student answer: The operations that can be performed on Queues are :\nEnqueue : Enter the element in the queue via the end of the queue\nDequeue: Remove the element in the queue via the start of the queue\nisFull : Checks if the queue is full or not\nisEmpty : Checks if the queue is empty or not
Score: 2.5

Student answer: Operations that can be performed on Queues is 
Score: 0.0

Student answer: dequeue , enqueue,\ninsert .delete
Score: 2.0

Student answer: we use enqueue  and dequeue 
Score: 2.0

Student answer: Insertion: Queues follow the Last in first out order.
Score: 1.0

Student answer: in queues the method which is used  insert update delete
Score: 0.0

Student answer: queues provide fist in last out FILO  approach operation insert delete push pop 
Score: 0.0
Question: What operations can be performed on Queues?
Reference answer: The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full

Student answer: first in first out.
Score: 1.0

Student answer: 1)insertion\n2)deletion\n3)enqueue\n4)dequeue\n5)isempty()\n6)isfull()
Score: 2.5

Student answer: sorting, searching, algorithms can be performed on queues
Score: 0.0
Question: What is linear searching?
Reference answer: Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.

Student answer: Linear Searching is a basic searching algorithm in whick the element to be searched is stored within a variable and is then compared with every element of the array till the element we are looking for is found.
Score: 2.0

Student answer: linear searching is when we search for the elements from beginning to end and at whatever location the number is found we return its address  its time complexity is O(n) 
Score: 2.5

Student answer: in linear searching we search for the given element one after the other so the time complexity of linear searching is O(nm) \nit can be useful if we a small array 
Score: 1.5

Student answer: Linear search checks every element of the data structure and checks if the values match, if not, it moves on to the next element
Score: 2.0

Student answer: Linear search is basic searching algorithm which goes through the entire data structure like an array and returns tthe element if it is found. It checks the entire length of the data structure and hence is less time efficient.
Score: 2.0

Student answer: Linear search is used to search a element in a data structure like array, string in o(n) time complexity. Here we implement a for loop on to traverse the data structure and match its every element to the element we are searching for, if it gets matched ,then break and we get out of loop.
Score: 2.5

Student answer: linear searching is the simplest method of searching a data set.
Score: 1.0

Student answer: In linear search , the algorithm traverse the whole array and if it finds the key element or the desired element then it prints that element.
Score: 2.0

Student answer:  In Linear searching the program traverse through each and every element in array or node in link list and checks whether the element matches the key or not, if key is found the program returns the element and its position otherwise it displays key not found
Score: 2.0

Student answer: Linear Search is defined as a sequential search algorithm that starts at one end and goes through each element of a list until the desired element is found
Score: 2.0

Student answer: this is searching in which values to be searched is to be searches from the first index till the last index until the value is found .It takes o(n) time .
Score: 2.5

Student answer: Searching of any thing in a linear time is called linear searching . For instance u have a 1-D array and have to find the element then it will be an example of linear searching .\nint find= 25; , int n ( size od array)= 6;\nfor (int i =0 ; i < n ; i ++)\n{\n     if (a[i]==find)\n{  return i ; }\n}
Score: 2.0

Student answer: This is the searching technique in which we compare the given key one by one in a linear form.
Score: 1.5
Question: What is linear searching?
Reference answer: Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.

Student answer: Linear Search is a form of element traversal and searching in which we start from the initial element and go on checking the next element until we find the desired element in any data structure. Though it takes linear time complexity it is not feasible for large amount and we thus need to resort to other searching techniques like binary search, median search etc. 
Score: 2.0

Student answer: linear searching is a searching technique that uses for loops to search the values .\nits time complexity is : O(n^2)
Score: 2.0

Student answer: In this searching method we are searching required element from index 1 to last index consicutively until the element is found.
Score: 2.0

Student answer: Linear searching refers to searching all the elements one-by-one\n\nIt is a brute force search technique and will use the maximum time to finish
Score: 2.0

Student answer: linear searching is the manner in which we iteratively traverse the whole array to search the given element present in it.it has complexity of 0(n)
Score: 0.0

Student answer: Linear Searching is searching whether an element exists in a linear list or not. It is a simple search where we check each element of the list and compare it to the element we have to find. If the element is found then we make the counter=1 otherwise the counter remains 0 as we had intitially initialised it.\n
Score: 0.0

Student answer: When we search for the target in an array or any other data structure by going one by one from one end to the other is known as linear searching. It is a brute force and a very simple approach but it takes more time compared to other efficient algorithms.
Score: 2.5

Student answer: When we search an array  or any other data structure in a specific direction , one by one from one end of it to another , then it is known as linear searching. However linear searching is more time consuming than the other efficient algorithms.
Score: 2.0

Student answer: Linear Searching is a way to search for the particular element in a given array. Each element of the array is comparted with the element to be searched when the required element is found it returns the index as well as that element from the array taking O(n) time complexity. 
Score: 2.5

Student answer: Linear search is a searching algorithm which used to find a \
Score: 0.0

Student answer: linear searching take O(n) time to search an element from the data structure. example array take O(n) time to search an element.
Score: 1.5

Student answer: When we search for an element linearly in an array or linked list by traversing one by one through the array or list till we find the element required in O(n) time where n is the size of the array or list.
Score: 2.5
Question: What is linear searching?
Reference answer: Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.

Student answer: The kind of search which takes linear time(O(n)) for searching an element is called linear search.
Score: 2.5

Student answer: Searching technique which takes linear time O(n) to find an element in a given sequence/array.
Score: 2.5

Student answer: searching the data from start to end one by one is called linear search. The time complexity of linear search in O(n). 
Score: 2.5

Student answer: When we traverse an array from the beginning till the end checking each element, this approach is known as linear searching.
Score: 2.0

Student answer: linear searching is the searching in which the particular element is searched linearly that is the first element of the array is checked first and it linearly increases from arr[0] to the size of the array. That's how the element is searched one by one in a linear manner. It has the time complexity of O(n).
Score: 2.5

Student answer: linear searching: suppose we are given an array and a element value (key) then we will iterate on every index of an array until we find that key. this will take o(n) time.\n
Score: 2.5

Student answer: linear searching is basically searching an element in a linear time where searching element say x is compared to every element present in the data structure.
Score: 2.0

Student answer: Linear searching is a searching in data structure helps to search a particular element in a given array.\nIt start from the first element and checks the element then second and continue until found the particular element in the array in o(n) time.
Score: 2.5

Student answer: In Linear Search we traverse each element of the given array and we run a for loop from starting index of the array to the last index of the array. We start traversing each element and we will stop at that index at which the element which we want to find is equal to the element while traversing the array . And after that we will return that index . And if that element doesn't exist in the array then we will return -1.  
Score: 2.0

Student answer: Linear search is a searching technique. In linear search we use key element to compare each element in a given array. 
Score: 1.5

Student answer: It is a searching technique in which we iterate the array and compare each element with key element.
Score: 2.0

Student answer: In the Linear Search we will search the element by going on every index.\nWe will implement a temporary variable which will traverse the array and if the element will found at any of the index it will return the index of the array then we will able to found the element through the linear search. 
Score: 2.0

Student answer: (LIFO).
Score: 0.0
Question: What is linear searching?
Reference answer: Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.

Student answer: linear searching refers to traversing all the elements one by one resulting in O(n) time complexity.
Score: 2.5

Student answer: Searching for an element by traversing in the given data structure element by element is known as linear searching. Its time complexity is O(n), n being the size of the given data structure. 
Score: 2.5

Student answer: A search technique that requires the visiting or analyzing each element while traversing to find the required element is called linear search. Its time complexity is O(n).
Score: 2.5

Student answer: linear searching is a method defined under the searching methods of linear data structure. in this yo go left to right to search for the desired value.
Score: 2.0

Student answer: Linear Searching is the most basic search algorithm that we can perform. It has time complexity O(n).\nIn this we set the element that we want is set as \
Score: 2.5

Student answer: Comparing an element with the every element of an array from beginning to end is known as linear searching.
Score: 2.0

Student answer: Linear search algorithm uses a loop to singly traverse the data and search for a particular key on a specific time. Its time complexity is equal to O(n) where n is the number of elements in worst case.
Score: 2.5

Student answer: Linear Searching is the most common searching algorithm used to search a particular value in a array by traversing over each item present in a array.
Score: 2.0

Student answer: Linear Searching is a process of checking each and every element of the given data structure with the key element. 
Score: 2.0

Student answer: Linear Searching is the algorithm in which we search for an element in an array by looking at every element in the array from start to finish.
Score: 2.0

Student answer: Linear searching means to search a particular element in a single line or at a same level from the start to the end.
Score: 2.0

Student answer: Linear Searching is defined as method of finding the element by traversing through the data structure one after the other and matching it by each element linearly. 
Score: 2.0

Student answer: Linear Searching is a type of searching technique in which system traverse on each and every element in order to search a particular item.
Score: 2.0

Student answer: Searching involving the time complexity of O(n)
Score: 1.0

Student answer: a linear search algorithm is where we traverse through an entire row of elements and compare each of them separately to check for the element we need to search for.
Score: 2.0

Student answer: Linear searching is the method simply find the target element in list of values provided with n2 time complexity using only for loops
Score: 1.5
Question: What is linear searching?
Reference answer: Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.

Student answer: Linear searching is the simplest form of searching in which we search for an entity in a given set of data one-by-one in a linearly order.
Score: 2.0

Student answer: it is the brute force method to search a particular number or character in a given input of list or array respectively
Score: 2.0

Student answer: Linear searching is searching by using one iterator. \nLinear searching can be done in arrays, linked list, hashing, etx.
Score: 2.0

Student answer: Linear searching includes going at every element in a list from the start and searching for the element\nIt take O(n) time where n is the number of elements in the list
Score: 2.5

Student answer: Linear Searching is the process of searching using linear time complextiy ie. Big O of n.
Score: 2.5

Student answer: to search for an element linearly in all elements 
Score: 1.0

Student answer: linear searching is just simply moving right of element is greater and left if lesser and finds the element this way
Score: 1.0

Student answer: Linear Search is defined as a sequential search algorithm that starts at one end and goes through each element of a list until the desired element is found, otherwise the search continues till the end of the data set. It is the easiest searching algorithm.
Score: 2.0

Student answer: linear searching is the easiest method of searching. Starting from the beginning of the data set, each data is matched from the key (element to be found) until a match is found.
Score: 2.0

Student answer: When we start searching from the first element of data set and keep searching each element linearly one by one until the element is found.
Score: 2.0

Student answer: linear search is the simplest form of searching where you can directly compare the given element to the next element and reorder according to their sizes
Score: 1.0

Student answer: Linear searching is a type of searching where we search our info linearly i.e by iteratively visiting the each node.
Score: 2.0

Student answer: In the linear searching we traverse a array one to one  if the element is find than stop and print the element  and is time compexity is O(n).\n
Score: 2.5

Student answer: it is the most basic type of searching in it we search for the element by checking them one by one in an array
Score: 2.0

Student answer: Linear searching refers to searching for a particular data in a linear fashion, i.e, going from one data to another as they are stored in an array.
Score: 2.0

Student answer: In linear searching, the element to be searched is compared sequentially with each of the elements in array. Its time complexity is O(n).
Score: 2.5
Question: What is linear searching?
Reference answer: Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.

Student answer: linear searching is searching sequentially one after another, time complexity o(n)
Score: 2.5

Student answer: When we search for an element by traversing the array. \nIt takes linear time .
Score: 2.0

Student answer: linear searching is one of the sorting techniques in which we declare an array and then compare each element of the array with the key or element we are searching for.\nas soon as the key is found, we print the key along with the position in the array where it was found.
Score: 2.0

Student answer: When we search the element linearly and check them element which we want to search with every element of the data structure from first element to last and when we find the element we can return true.
Score: 2.0

Student answer: Linear searching as the name suggests is the process of searching elements linearly generally it has O(n) time complexity. 
Score: 2.5

Student answer: Linear searching is when the array is searched in ascending order of its index value in a unidirectional manner.
Score: 2.0

Student answer: linear searching is the searching of a data structure in a linear fashion by comparing the element that we have to find with each element of the data structure(array) and if we find the element we return true and note the position of the element. 
Score: 2.0

Student answer: A linear search is the simplest approach to search for an element in a data set. It examines each element until it finds a match, starts from the beginning of the data set, until the end. The search is finished and terminated once the element is located. If it finds no match, the program gets terminated
Score: 2.0

Student answer: traversal of the data structure while matching it with required item/data is known as linear searching. we can use loops for the same 
Score: 2.0

Student answer: this is the algorithm  which search the element in 
Score: 1.0

Student answer: It is a searching method that searches a given array of elements linearly, that is from the first memory block to the last, OR\nfrom i[0] to i[n - 1]
Score: 2.0

Student answer: Linear searching is searching algorithm with linear time complexity such as linear search,it wll view every element till the required element is not found.Its worst case time complexity is n.
Score: 2.0

Student answer: Linear Searching is a searching technique in which we check each element of the list in a linear order until the desired element is obtained.
Score: 2.0

Student answer: linear search is searching from start checking one by one at a time whether the no is found or not
Score: 1.5
Question: What is linear searching?
Reference answer: Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.

Student answer: linear searching is a searching technique that takes O(N) of time complexity.It starts from first index and compares every element with the required element till it finds the element.On finding the element it returns it index if not found return -1.
Score: 2.5

Student answer: it is a searching technique that involves visiting each element individually and is efficient in case of unsorted data.
Score: 2.5

Student answer: In Linear Searching it compare each number with every other number and then gives the output. \nIt has time complexity of O(n) times.
Score: 2.5

Student answer: linear searching is the searching of the element one by one. 
Score: 1.0

Student answer: A sequential search is made over all items one by one is known as linear searching.
Score: 1.5

Student answer: in linear searching, we compare every element of the array to the element which is to be found.
Score: 2.0

Student answer: Linear Searching is traversing the array in a linear fashion. \nStart searching from the first element and go on searching until you find it.
Score: 2.0

Student answer: Linear searching is  a algorithm in which we perform our searching a array element one by one if the element of our search present in the array . We return the element from our search.
Score: 2.0

Student answer: a searching method which used to search a data in a liner form it has no special condtions it will just check every element which is data structure.
Score: 2.0

Student answer: in linear search we compare (if it is equal or not ) the element we have to search with every other element present in the array and return the index if we find the element or else return -1
Score: 2.0

Student answer: Searching in a linear time is called linear searching.\nLinear searching is an example of this type of searching. It has a linear time complexity [O(n)].
Score: 2.5

Student answer: searching up the elements one by one linearly pointer starts from the start moved and looks at every index wherever it matches it stops 
Score: 2.0

Student answer: Linear searching is searching a data item through simple looping method i.e. searching the entire array for the particular data item.
Score: 2.0

Student answer: We compare each element of the array one by one with the element we want to find if its equal then we found the element . Its time complexity is O(n)\nfor(int i=0;i<n;i++)\nif(arr[i]==x)\ncout<<\
Score: 2.5
Question: What is linear searching?
Reference answer: Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.

Student answer: Linear searching is searching through an entire array or other data structure by observing one element at a time. We observe the element at a[ i ] and if it is not equal to the target we move on to the immediate next element till the end of the array is reached. If it is equal to the target then we return the index found.
Score: 2.5

Student answer: to search for an element by traverse a data structure linearly using linearly loops\nlike in the case of the arrays and linked list we used to search an element simply\nby using for loop not by applying any kind of algorithms like binary search.
Score: 1.0

Student answer: Linear Searching is meant by iterating one by one in entire data structure.\n Generally Time Complexity of such algorithms are O(entire length) .
Score: 2.0

Student answer: searching data within an array linearly is called linear searching.
Score: 2.0

Student answer: Linear searching is the searching techniques which is used to search and array linearly i.e., one by one and time complexity is O(n).
Score: 1.0

Student answer: searching elements in the linear data set without performing any operation like diving it into two half or any other, until the data is found..\nbasically we search until the data is found.
Score: 1.0

Student answer: A linear search is the  method of searching a data set. Start from the beginning of the data set, each element of data is checked until a same match is found .and when the item is found, the search ends. 
Score: 2.0

Student answer: The key to be searched is being constantly compared with all other elements in array using single iterator which is used to access all elements of the array.\nTime complexity is O(n).
Score: 1.0

Student answer: In linear searching we take the first element and then compare it with the desired value, if not same then perform the same operation with the next element till the desired output is obtained.
Score: 1.0

Student answer: the searching which is done linearly in a single loop.
Score: 2.0

Student answer: In linear searching we iterate over all the elements until our wanted element is found.
Score: 1.0

Student answer: Linear searching it the iterative searching where the element to be searched is compared with each element of the array (or the particular data structure used) one by one.
Score: 2.0

Student answer: in this searching we traverse to the complete length of the array and checks whether the key matches with that particular index or not
Score: 1.0
Question: What is linear searching?
Reference answer: Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.

Student answer: Linear searching allows a loop to be run throughout the data set and comparing it with the value being searched for. The loop finally breaks after it finds the position at which the desired value is located. 
Score: 2.0

Student answer: pop() and pusback() and many more.
Score: 2.0

Student answer: Searching through all the values of the array one by one from start to end. \narr={1,2,4,5} \nlinear search for 4 will go through each and every element ie 1 then 2 then 4 to find 4.
Score: 2.0

Student answer: it is a type of searching where nodes are checked one by one in a linear fashion.
Score: 2.0

Student answer: When a search is carried out starting from the first element to the last element
Score: 1.0

Student answer: enqueue , dequeue , isFull , isNull
Score: 1.0

Student answer: linear searching is the simplest type of searching where the items are traversed from start to finish until the element we are searching for is found.\nTime complexity: O(n)
Score: 1.0

Student answer: Linear search is a sequential searching algorithm where we start from one end and check every element of the list until the desired element is found. It is the simplest searching algorithm
Score: 2.0

Student answer: Linear searching involves searching an element linearly means while traversing an array only once. It has linear time complexity - O(n).
Score: 2.0

Student answer: linear searching is the process of searching by iterating each and every element.
Score: 2.0

Student answer: In Linear searching a loop traverse through the whole array till the desired position of the element is reached . 
Score: 1.0

Student answer: Linear searching is the process of searching for an element while iterating through the data structure elements one by one in a linear manner.
Score: 2.0

Student answer: This is the most basic type of searching in which each and every element of the data structure is traversed one by one linearly in order to find the desired element.
Score: 2.0

Student answer: Linear searching is a search technique in which the elements are traversed one after the other and it takes O(n) time and O(n) space complexity.
Score: 1.0

Student answer: in linear searching each object in a list or array in checked from starting to a particular value if the value of the object is equal to the value we are searching for searching is stopped and index at which object is present is returned or it continue to search from next object onwards for the value until either it finds the object or reaches the end of the list or array.
Score: 1.0

Student answer: searching by traversing each element of data structure linearly is call linear searching.
Score: 2.0
Question: What is linear searching?
Reference answer: Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.

Student answer: Linear searching is a searching algo with O(n) time complexity in which elements are elements are searched in increasing/decreasing order of their indices.
Score: 1.0

Student answer: Queues Works on FIFO (First In First Out) which means element occuring first will exit first. It is used in BFS traversal algorithm for graphs and Level-Order-Traversal in trees.
Score: 2.0

Student answer: it use brute force concept that is searching and comparing for every element,  linear searching refers to binary search in which we first divide the string in two half part for finding the key and as we check that is the key lies left or right to the two half string and after according to that we shift mid value to mid-1 or mid +1 
Score: 2.0

Student answer: traversing in increments or decrements linearly one by one until we find the required element. \nthe search function has a time constant of n as it goes to every n elements each.
Score: 2.0

Student answer: linear searching means to perform search operation in a linear data structure 
Score: 1.0

Student answer: Linear searching is when we fully iterate over a data structure searching for a specific element in it. It has O(n)(linear) time complexity where n is the number of elements in the data structure, i.e. to search an element linearly the time it would take in worst case is proportional to the number of elements in the data structure.
Score: 1.0

Student answer: linear searching is a type of searching in we search element one by one means we use brute force approach to search an element its time complexity is O(n)^2 .we search one element of an array with the every element of the other array.
Score: 2.0

Student answer: Linear searching of the algorithm is defined as looking for the element in the serial order from starting of the array . It is completed in O(n) Time complexity
Score: 2.0

Student answer: linear searching is when we want to search for an element in an array and we check for every element one at a time until we find the element
Score: 1.0

Student answer: linear searching is searching for the required data in an array in one traversal only
Score: 2.0

Student answer: in linear search each element of the array is checked until a match is found and if not found \
Score: 2.0

Student answer: searching element in  time complexity O(n) 
Score: 2.0

Student answer: linear searching we traverse data structure index by index to find the element 
Score: 1.0
Question: What is linear searching?
Reference answer: Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.

Student answer: Linear search is the most basic search algorithm for any array. It works the most naive and brute force approach of travelling the data in a linear manner that is from the first element to the last and if at any place we find that the item we are searching for is present in the array then we print that index to mark the position where it is found. 
Score: 1.0

Student answer: the simplest method of searching the data set. We traverse through the whole array/LL till we get the desired output(iteratively);
Score: 2.0

Student answer: Linear search is simply searching the element while  traversing the data structure from the start to the end one by one.
Score: 2.0

Student answer: the most basic type of searching algorithm where we traverse through all the elements of the data structure until we got the result.\n
Score: 2.0

Student answer: Taking example of an array . Linear search is to search for lets say an element \
Score: 2.0

Student answer: searching along the array by comparing each element with the desired element
Score: 2.0

Student answer: In linear searching , the elements are arranged in an array and are traversed in one traversal only. 
Score: 2.0

Student answer: Linear searching is a searching technique in which we simply traverse our data structure and try to match our key with every element in the data structure. If match found means that key is present in our data structure otherwise not present.
Score: 2.0

Student answer: linear searching is traversing an array or a vector from the first element to the last element in a single turn.
Score: 2.0

Student answer: linear searching is the type of searching where we shift linearly element by element until the goal element is found.
Score: 2.0

Student answer: Linear searching algorithm is used to find out an element from the given data structure like an array or an liked list.\nLinear search traverse the target from starting to end linearly but the given constraint is that whenever we find the target value we stop doing searching and return the index or address of that corresponding location where our target is present.\nIf the array contains repeated target element then we can traverse the entire array from start to end simultaneously storing the index in another array.
Score: 2.0

Student answer: it is a type of searching technique in which we take element and compare it with every other element to put it in its right place and then repeat the loop for every other element\n  
Score: 2.0
Question: What is linear searching?
Reference answer: Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.

Student answer: Linear searching is an approach for searching an element in an array in O(n) time complexity. Where the cursor goes through the entire list in n time and gives the index where the element is found, if not found in the list it gives -1.
Score: 2.0

Student answer: it is a process of finding an element by checking each and every element present in the array.
Score: 2.0

Student answer: In linear search, the search occurs in a linear manner from the beginning to the end. 
Score: 2.0

Student answer: 1. pop\n2. push\n3. top\n4. isempty
Score: 2.0

Student answer: Linear Searching is a search technique which searches from start to end in a linear manner.
Score: 2.0

Student answer: it stores at one end and goes through each element in a list.
Score: 2.0

Student answer: Linear searching is a searching technique in which we iterate from the beginning element by element till the end, stopping if we find the key element we are looking for. If not then we return showing the user the element to be searched doesn't exist. 
Score: 2.0

Student answer: Linear searching is when all the elements of the array are traversed to find the target element.\nfor(i=0;i<array.length();i++)\n{\nif(array[i] == x)\nreturn i;\n}
Score: 2.0

Student answer: in linear search the data structure are searched linearly from 0 to n.
Score: 2.0

Student answer: In linear searching we search for the key element/target element in an array by traversing the array with the help of loop.
Score: 2.0

Student answer: In Linear Searching, We traverse through out the whole data set from 0-n one by one to find the desired element
Score: 2.0

Student answer: in linear searching we traverse one by one through the whole array to find the particular element in searching. since it searches one by one it is less efficient to binary search.
Score: 2.0

Student answer: searching for elements in a linearly fashion in a data structure with the possible time complexity possible for a program  
Score: 2.0

Student answer: linear searching is the basic searching technique , it searches the data linearly and 
Score: 2.0

Student answer: Linear seaching is a searching algo use to search a particular element from the given array by comparing the elments one by one.
Score: 2.0

Student answer: linear Search is defined as a search algorithm that starts at one end and traverse each element of a list until the desired element is obtained.
Score: 2.0

Student answer: A linear searching is a searching in which we search any algo one by one according to question 
Score: 2.0
Question: What is linear searching?
Reference answer: Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.

Student answer: linear searching is basically a brutte force technique to search an element. Here we use two for loop with the help of which we search an element in array in O(n square) complexity.
Score: 2.0

Student answer: linear searching technique in which you go on searching from the first or last element till the end or starting of data structure until you find the target
Score: 2.0

Student answer: in this we go to every data element and check whether it matches the input or not.
Score: 2.0

Student answer: in liner searching we search for the element we want in a list(array, vector etc) by going one element at a time from starting to end. It is a brute force technique to find an element
Score: 2.0

Student answer: Linear search is a type of search in which data is searched from 1st element to the last element  or visa versa . For example in array an in linear search a data is searched from 1st index to last index . and in every iteration element is searched then the pointer moves to the next element.
Score: 2.0

Student answer: linear searching is to search the data in linear form like in array.
Score: 2.0

Student answer: linear search is basically , traversing the whole array or list and check/compare  for the key element as you traverse the array or list .\nif key element is found we return it otherwise we return -1\nit does the full operation whether or not the element is found
Score: 2.0

Student answer: Linear searching is a technique to search lets say a element in an array it checks each element one by one and compares with the target element. The worst case time complexity of this is O(n).
Score: 2.0

Student answer: It is a searching technique which finds the given number in constant time complexity. It the most preferable searching technique because the time complexity is very less and it is the first and oldest searching technique which is taught.
Score: 2.0

Student answer: linear searching is a searching in which we travel at every element to find out the element.
Score: 2.0

Student answer: In linear search , each element in the array right from the beginning is compared to the element we're looking for. When found, it returns the index of that element.
Score: 2.0

Student answer: searching for an element in an data structure from beginning to end till we found the required element\ntime complexity-> o(n) where the n is the length of the array
Score: 2.0

Student answer: Linear searching is to search the target at every index of array one by one\nits time complexity is O(n)
Score: 2.0

Student answer: linear searching is which in which we search linearly and only one for loop is used and its time complexity is O(n).\n
Score: 2.0