Harsh-7300/dataset huggingface dataset:
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: operations performed on data -structure :\ncomparing , finding best optimise solution , decreasing time complexity, finding optimal path on map, graph coloring , string matching 
Score: 1.0

Student answer: operations like input and output of data. storing and searching required data. deletion and replacement of data.
Score: 2.0

Student answer: sorted, merge,  push back, create function, insert, tree, array, stack, graph, searching
Score: 2.0

Student answer: we can perform search ,sort ,insertion operation and many more on a data structure
Score: 1.0

Student answer: Some of the common operations that can be performed on a data structure are pop or remove or erase(which can be used to delete elements), push, insert(which can be used to add elements), size( which can be used to access the size of the data structure), empty( to check whether the data structure is empty or not).
Score: 1.0

Student answer: The operation are \nInserting the element \nDeleting the element\nSearching the element
Score: 1.0

Student answer: The common operations which can be performed on data structure are \nInsertion \nDeletion\nSearching
Score: 2.0

Student answer: insertion,deletion, search.
Score: 1.0

Student answer: insertion, deletion, rotation are some operations that can be performed on a data structure
Score: 1.0

Student answer: insertion of elements into them ,deletion of elements ,sorting of elements, swapping of elements
Score: 2.0

Student answer: search\ndelete\ninsert\nsort
Score: 1.0

Student answer: common operation that can be performed on data structure are :-\ninsertion \ndeletion \n
Score: 1.0

Student answer: The most common operations that are performed on any data structure are traversal, inserting an element, deleting an element, modifying an element.
Score: 1.0

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

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

Student answer: searching and sorting.
Score: 1.0

Student answer: There are various data structures. Most simply to start with array, linked list, stacks, queue, heap and much more. Operations such as adding new element, deleting an old element, changing the value of the particular element, printing all elements are operations that could be performed in a data structure.
Score: 1.0

Student answer: insertion\ndeletion\nsearching\ntraversal\n
Score: 2.0

Student answer: Common operations that can be performed on a data structure are insertion, deletion , finding of an element , etc. 
Score: 1.0

Student answer: Generally, common operations include insertion, deletion, updation, searching etc.
Score: 1.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 a data structure are: Inserting, deleting, traversing, searching.
Score: 1.0

Student answer: insertion, deletion, searching, sorting are the common operations that can be performed on a data structure.
Score: 1.0

Student answer: The most common operations that can be performed on a data structure are -\nSearching an element, \nSorting the data of that data structure in a perticular fashion like in ascending order and in descending order,\nDeletion of an particular element or more than one elements from the given data structure.\nInserting an element in the given data structure.\nUpdation in the given data value in a data structure.\nAccessing the element from front or back also deletion of an element from both front and bachl.\n
Score: 1.0

Student answer: insertion\ndeletion\nupdation\ntraversal
Score: 1.0

Student answer: Common operations which can be performed are:\nInsertion , Searching And Deletion of an element in a data structure.\n
Score: 1.0

Student answer: Searching, sorting, finding a pattern,etc.
Score: 1.0

Student answer: The common operations that can be performed on a data structure are linking a list, gaming program, searching and sorting. 
Score: 1.0

Student answer: Common operations that can be done in a data structure are:\n1. Sort\n2. Search\n
Score: 1.0

Student answer: Common operations and can be performed on data structures are- searching, sorting, merging, partition, etc.
Score: 1.0

Student answer: common operations performed on data structure are  \nsorting\nbacktracking\nrecursion  
Score: 1.0

Student answer: Common operations that can be performed on data structures are insertion, deletion, updating, traversals, searching and more.
Score: 1.0

Student answer: Insertion, deletion, sorting, searching
Score: 1.0

Student answer: size, to check if empty, searching, sorting, deletion, insertion and updating are some commonly used operations on data structures.
Score: 2.0

Student answer: Searching, sorting, insertion, deletion
Score: 2.0

Student answer: Stack, Queue, Searching ,Sorting , Deletion, Insertion, Traversal, Pointers , etc. can be performed on a data structure.
Score: 1.0

Student answer: Insertion, Deletion, Searching ,Sorting are commo n operations performed on a data-structure.
Score: 1.0

Student answer: searching , sorting , traversal etc.
Score: 2.0

Student answer: The common operations that can be performed on data structures are:\na)add,subtact\nb)print\nc)max min\n
Score: 1.0

Student answer: Common Operations that can be performed on a datastructure are :insertion deletion searching etc.
Score: 1.0

Student answer: search operation , sort operation , insertion etc. can be commonly performed on a data structure
Score: 1.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 operation that can be performed in data structure are:\n1)searching \n2)sorting\n3)insertion\n4)deletion
Score: 1.0

Student answer: You can change the shape, structure and order of data items, you can insert, delete and modify the data items in  a data structure.
Score: 1.0

Student answer: Sort, insert, push, pop
Score: 1.0

Student answer: Some common operations are:\nSorting\nMerging\nSearching\nInsertion\nDeletion
Score: 1.0

Student answer: The common operations that can be performed on an data structure are traversal , insertion ,deletion opertations .
Score: 1.0

Student answer: common operation performed on data structures are sorting, searching, traversing, storing etc. 
Score: 2.0

Student answer: searching, sorting, insertion, deletion ,object creation etc.
Score: 2.0

Student answer: Common operations include insert, delete, sort, etc.
Score: 2.0

Student answer: There are a number of operations which can be performed in data-structure such as insertion , deletion , addition , subtraction , multiplication division and so on.
Score: 1.0

Student answer: insertion , deletion ,replacing, search an element in it ,sort the element.
Score: 1.0

Student answer: Traversing: Traversing a Data Structure means to visit the element stored in it. It visits data in a systematic manner. This can be done with any type of DS. \nSearching: Searching means to find a particular element in the given data-structure. It is considered as successful when the required element is found. Searching is the operation which we can performed on data-structures like array, linked-list, tree, graph, etc.\nInsertion: It is the operation which we apply on all the data-structures. Insertion means to add an element in the given data structure. \nDeletion: It is the operation which we apply on all the data-structures. Deletion means to delete an element in the given data structure. \n\n\n
Score: 1.0

Student answer: insert an element ,search for an element ,remove an element
Score: 1.0

Student answer:  common operations that can be performed on a data-structure are \nInsertion\nDeletion \nupdation\n
Score: 1.0

Student answer: common operations that can be performed is insertion and deletion
Score: 1.0

Student answer: Asymptomatic notations are mathematical representations to define or assign the complexity and efficiency of any algorithm. \nThere are mainly 3 - \nBig O notations , ex - O(n)\nTheta notations \nOmega Notations 
Score: 1.0

Student answer: 1)Searching\n2)Sorting\n3)Insertion
Score: 1.0

Student answer: insertion.\ndeletion.\nsize.\nto check if its empty.
Score: 1.0

Student answer: Operations performed on a data-structure: \n1) Sorting\n2) Searching 
Score: 1.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 operation are;\n1.Insertion;\n2.Deletion;\n3Retrieval;\n4.Updation.
Score: 1.0

Student answer: The common operations that can be performed on a data structure are searching,sorting,
Score: 1.0

Student answer:  Searching, Sorting and Traversing.
Score: 1.0

Student answer: Insert: To add/insert a new value in the structure (for example: inserting new values in Linked Lists)\nDelete: to delete a pre-existing or user-inserted value\nEdit: To edit any inserted value.\nUpdate: To replace the original value with a better or later/newer one. (used in: MATLAB version of an SR Latch)
Score: 1.0

Student answer: we can delete the element\nwe can search the element\nwe can insert or update the data structure
Score: 1.0

Student answer: common operations that can be performed on a data structure are:\n1)searching\n2)sorting\n3)traversing
Score: 1.0

Student answer: data is stored. operations such as searching, sorting in ascending or descending order, returning maximum or minimum element, traversaL can be performed on data structures,
Score: 2.0

Student answer: 1. storing the elements\n2. searching the elements\n3. deleting the elements
Score: 2.0

Student answer: The common operations that can be performed on a data structure include storing the elements, searching for any element, deleting the element.
Score: 2.5

Student answer: common operations that can be performed on a data-structure are searching, sorting,insertion ,deletion,insertion and deletion at end /beginning/or at a particular position,merging,dividing,etc..
Score: 2.5

Student answer: add element to the data structure (push), delete element from it (pop),  finding the top element etc
Score: 2.0

Student answer: The common operators are-sorting, searching , insertion, deleting. 
Score: 2.0

Student answer: Like creating a node ,linked list ,and making tree for searching the node ,using bfs and dfs,\nmain is for sorting and searching that have many techniques for solve them.
Score: 2.0

Student answer: traversal, sort, search, insertion, deletion
Score: 2.5

Student answer: Many common operations can be performed on a data-structure like searching, sorting, traversing etc.
Score: 2.0

Student answer: Inserting elements, Deleting elements, traversal on elements in data structure
Score: 2.0

Student answer: Common operations that can be performed on data structures are insertion, deletion ,update and sort.
Score: 2.0

Student answer: Common operations that can be performed on a Data Structures are Insertion,Deletion,searching,sorting etc
Score: 2.0

Student answer: searching\nsorting \nare common operations that can be performed on a data structure
Score: 1.5

Student answer: Some common operations are: Searching and sorting.
Score: 1.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: The common operations that can be performed on a linear data structure are we can insert new data, pop a value, replace a paricular value by another value,swapping two values, deletion etc.
Score: 2.0

Student answer: additon updation and deletion of data
Score: 2.0

Student answer: the common operations are push and pull ie insertion or retrieval  of data. then there is sizeof operation which is to know to size of data structure. isfull() and isempty() structures are also used commonly.
Score: 1.5

Student answer: Some common operations that can be performed on a data structure includes insertion into it, deletion and traversal through it. Sorting can also be done on the member items of a data structure.
Score: 2.5

Student answer: Push\nDelete\nFront\nTop\n
Score: 1.5

Student answer: searching , sorting are the common operation 
Score: 1.5

Student answer: 1. Insertion\n2.Deletion.\n3.updation.\n4.Searching .
Score: 2.0

Student answer: insertion\ndeletion\nsearching\nsorting
Score: 2.0

Student answer: common operations that can be performed are addition(+), multiplication(*), subtraction(-), division(/) of numbers into one another \ninsertion and deletion of inputs etc 
Score: 0.0

Student answer: Insertion , Deletion , Sorting , Searching are the common operation thar can be performed on data structure.
Score: 2.0

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

Student answer: Insertion, deltion,traverse
Score: 2.0

Student answer: sorting searching 
Score: 1.5

Student answer: Some of the common operations that could be performed on a data structures are:-\n1. Insert:- To insert a value in the structures.\n2. Delete:- To delete the value from the structures.\n3. Traverse:- To visit the elements and values on the structure.\n4. Edit:- To edit the values of the structures.\n5. Store:- The data can be stored in the structures.
Score: 2.5

Student answer: insert , delete , findmin , extractmin , sorting , searching
Score: 2.5

Student answer: searching\nsorting\nmerging\n
Score: 2.0

Student answer: it can be insertion , deletion ,replacement etc...
Score: 1.5

Student answer: Inserting\nSearching\nSorting\nDeleting\nExtraction
Score: 2.0

Student answer: insert, delete,etc.
Score: 2.0

Student answer: searching, sorting
Score: 1.5

Student answer: data storing and searching can be performed on a data structure.
Score: 1.5

Student answer: Common operations performed are :\nadd() : to add an element\npop(): to delete an element\nisempty(): to check if the data structure is empty\nisfull(): to check if the data structure is full
Score: 1.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: Some common operations the can be performed on a data - structure are searching,  insertion, deletion.
Score: 2.0

Student answer: searching \nsorting \nmerging\ndividing\ntraversing
Score: 2.5

Student answer: insertion \ndeletion \ntraverse\nsorting 
Score: 2.0

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

Student answer: insert , delete , search 
Score: 2.0

Student answer: 1 modified\n2 insert\n3 delete\n\n
Score: 2.0

Student answer: linear & non linear.
Score: 0.0

Student answer: 1)insertion \n2)deletion \n3)traversal
Score: 2.0

Student answer: operations that can be performed on data structures are Boolean , algebra, matrix multiplication 
Score: 0.0
Question: Briefly explain the approaches to develop algorithms.
Reference answer: There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly

Student answer: Algorithms are developed by first analysing the problem, then looking for a solution and then modifying our solution as to make sure the time and space complexity conditions are met.
Score: 1.0

Student answer: firstly we develop a pseudocode for the algorithm also known as naive approach and then we proceed to the development of the algorithm by determining the time complexity of the algorithm 
Score: 2.5

Student answer: there can be many approaches to develop an algorithms we can use approaches like greedy algorithms , dynamic programming and divide and conquer 
Score: 2.5

Student answer: Algorithms can be developed easily by following this methodology: \n1) Brute Force: Uses the maximum amount of loops and comparisons to find the solution\n2) Divide and Conquer: Divide problem into subproblems and then solve each subproblem to get the solution\n3) Backtracking: Traverse through every available solution if it matches the correct solution continue else backtrack to the previous step\n4) Greedy: Find the local Optimal solution(can have multiple answers to a single problem)\n5) Dynamic Programming: Find the most optimal solution by using memoization
Score: 2.5

Student answer: Brute Force: Direct approach to solve given problem. Usually it is not the optimal solution and is not efficient in terms of Time complexity or space complexity.\nDivide and Conquer: It involves dividing the problem into smaller subproblems then solving the sub problems and joining the solutions back together to solve the initial problem for example in merge sort.\nBacktracking: It involves considering all the possible outcomes of a particular step in a given problem. We then consider each of the possibility and check whether it is correct and it can be part of the solution or not. If it is then we move further else we go back and consider a different solution to the previous step. We do this till we acheive the final outcome.\nGreedy Approach: It involves considering the best available solution at every step. This may not give the optimal solution always.\nDynamic Programming: It involves initalising various intial values and then using these initial values to find the next values. This is done using matrices.
Score: 2.5

Student answer: Algorithms are develop to solve a problem in a good way according to its time and space complexity .\nFirstly the basic approach is Brute force search where we don't consider time and space as a barrier. our only aim is to find solution of a problem.\nSecondly there are algorithms like divide and conquer and many more which always tried to solve the problem in a less time and space complexity than brute force algorithms.\n
Score: 2.5
Question: Briefly explain the approaches to develop algorithms.
Reference answer: There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly

Student answer: Approaches to develop an algorithms are :-\n. Greedy approach\n. Divide and conquer\n. Backtracking \n. Dynamic programming
Score: 2.5

Student answer: There are many approaches used to develop algorithms\ngreedy approach - it is used for optimization purposes it not necessarily gives the best solution but the solution it gives takes less time and space\ndynamic programing - it is also used for optimization problems but it check every solution available and always gives the best solution\nbacktracking \ndivide and conquer- it divides the large problem into similar sub problems and solve them first and then combine them to solve the larger problem
Score: 2.5

Student answer: approaches are as follows-\n1. analyses of the given problem\n2. Thinking of the most suitable data structure which could solve the problem\n3. Build the naive approach to tackle the problem first\n4. find the best approach that could solve the problem in less complexity(space and time) than other .
Score: 2.5

Student answer: The approach to develop an algorithm is done in the following steps  :-\n1) study the problem theory carefully\n2) Try to find the solution of the problem using calculation .\n3) Observe the solution and use notations to get the time complexity \n4) optimize you solution in terms of time and space complexity\n5) write the algorithm in a easy manner and implement it on the terminal 
Score: 2.5

Student answer: Algorithms can be written by first understanding the given problem, then firstly taking the input values, then applying the basic idea and solving the problem, writing it in steps form.\n1.)write the basic  solution.\n2.) take the input.\n3.) write the easiest n understandable algorithm.
Score: 2.5

Student answer: The approach to develop an algorithm include understanding the problem thoroughly and then suggesting a solution which satisfices the criteria of having suitable time complexity (ideally linear) and consuming minimum required external storage.
Score: 2.5

Student answer: different approaches are :\n- divide and conquer - understand the problem break it into sub problems and then solve the subproblems and then step by step move to the main problem\n- greedy approach : in each step find the best possible solution for the time being.
Score: 2.5

Student answer: - Understand the problem and break it into smaller problem.\n- Write steps to solve the smaller problem (irrespective of any programming language).\n- Optimise your solution and write steps for bigger problem.
Score: 2.5
Question: Briefly explain the approaches to develop algorithms.
Reference answer: There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly

Student answer: 1. start with what you have - the input\n2. identify the end goal - the output\n3. now identify is there any way you can use the basic algorithms(like for ex binary search, LCS, LIS, etc) to get the desired output\n4. now write the intermediate steps that can be used to take you to desired results
Score: 2.5

Student answer: In order to develop thr algorithm, we must;-\n1. First input all the information you have been given\n2. Predict the output by dry-running it.\n3. \n
Score: 2.5

Student answer: 1.predict and understand the problem statement .\n2.find the best suited data structure that can be used.\n3.develop all edges, base cases form recurrences if needed, function needed.\n4.analise the time constraints set the limits of the function accordingly .\n5.check if the time and space complexity can be reduced further.
Score: 2.5

Student answer: Approach is as follows:\n1)We need to deeply understand what the problem statement is actually saying. For that we can use some examples to understand the problem.\n2)Then we need to find the best suited data structure for the given problem.\n3)Then draw the recursive tree for the problem to understand the approach.\n4)Side by side, write the algorithm for each step of the recursive tree.\n\n
Score: 2.5

Student answer: For developing algorithms \n1. understand the problem statement \n2.find all possible way to solve that problem\n3.develop the algorithm which takes minimal time as well as the space complexities \n4.to check if the particular problem is optimizable.
Score: 1.0

Student answer: Approach to develop algorithm :\n1. to write statements and step by step approach\n2. in form of pseudo code
Score: 1.0

Student answer: 1) try to get the output .\n2) try to get best Time complexity and space complexity in optimization\n3)  first we check if the algorithm is able to handle Average case or not.\n
Score: 1.0

Student answer: First we read and understand the problem given to us.\nThen we think about the most optimal approach to solve the problem.\nWe check its time and space complexity and see that if there is any approach which takes lesser time.\nWe finally code the approach we have made.\n
Score: 1.0
Question: Briefly explain the approaches to develop algorithms.
Reference answer: There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly

Student answer: 1. First, we need to look for an efficient approach to solve a solution i.e. whether to use backtracking, greedy or DP approach. \n2. Once, the approach has been decided, then the solution to the problem is implemented using the approach. For example, in dive and conquer, the problem is divided into smaller sub-problems and then we solve those sub-problems and then in return, the the main problem is also solved.\n3. After the algorithm is designed, we should try and check for the least time complexity possible. This will give an optimal solution.\n\n
Score: 2.5

Student answer: 1.Firstly we divide the problems into sub problems. \n2. Try to find an optimal and efficient solution to them individually using Backtracking, DP, Greedy and brute approaches.\n3. We try to implement the approach designed by us and compile our program with main function.\n4. After our algorithm is complete, we look for time complexity and analyze if any better way to modify the algorithm is possible.
Score: 2.5

Student answer: Approach to develop an algorithm are:\n1) Analyze the given problem statement.\n2)Try to find the rough solution of the problem and try to create a flow chat for better understanding.\n3)write the pseudocode from the flowchart developed above.\n4)Check that the solution created by you is optimal and efficient or not if not try do develop other optimal solution for the given case.\n5)one optimal and efficient solution if found then that become the algorithm.
Score: 2.5

Student answer: Some approaches to develop algorithms are:\n1. Greedy approach: to consider the value or path that seems like best meeting our requirement without analyzing it further. May or may not give optimal solution. Eg: to find the shortest path to a goal, the next nearest city from the start is taken into our solution.\n2. Dynamic approach: to analyze all the possible solutions and then choosing the optimal one. Always gives optimal solution.
Score: 2.5

Student answer: the approaches are firstly analyze the given problem then try to find the basic solution to that problem without going into the details at first then try to write the pseudo code for the solution according to you then dry run the code ,dry run the code for some of the random values then check whether you have got the desired or required result also consider the time complexity which is required to solve the given problem because half of the problem can be solved through that.
Score: 2.5

Student answer: we divide the given problem in smaller problem and start writing code for smaller problem . with this approach we will start developing techniques for  bigger problem.
Score: 2.5
Question: Briefly explain the approaches to develop algorithms.
Reference answer: There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly

Student answer: the approaches to develop algorithm is basically the basic logic applied in then question then develop the pseudo code required for the problem all the data structure to be used in that solution and then try to run the code with logic and data structure for all the test cases.
Score: 0.0

Student answer: Approaches to develop and algorithm are space complexity based or time complexity based. for lowest space or time complexity possible,
Score: 2.5

Student answer: the approach to develop the algorithm is to take the input first then write base condition and then break main problem to sub-problems.
Score: 2.5

Student answer: The approaches to develop Algorithms are:\n1. First check that what kind of Data Structure can be use to solve the problem .\n2. Then develop the cases which can be use to solve the problem \n3. Find out that what kind of Time and Space complexity is perfect for the problem .\n4. Find out the base cases.\n5. Implement the searching and sorting operations if needed then apply the particular cases.\n6. Call the function.
Score: 2.5

Student answer: Approached to develop algorithms are:\n1. First take input.\n2. divide the problem into sub problems.\n3. solve all the sub problems using same logic.\n4. Merge all the sub problems after solving them.\n5. Display the answer.
Score: 1.0

Student answer: First the problem is analysed and the basic data structures and concepts are identified which will be definitely used. \nThen the logic is developed for which the lesser space and time is taken.\nfunctions are used and the final values returned.\n
Score: 1.0

Student answer: Firstly a brute force is thought upon the solution. It is the most basic solution which any problem can have, without worrying about any complexity.\nThe we try to break it in smaller problems and think solution for it and make recursive algorithm for the same.\nThen we analyze if there is repeatition of of any smaller problem and if yes then we store it as we won't call it again and simply use the stored value (Dynamic Programming - DP)
Score: 2.0

Student answer: Algorithms can be developed using Divide and conquer techniques. Greedy mechanisms, Dynamic Programming, backtracking concepts etc.
Score: 2.5

Student answer: First step should always be to understand the problem first and then start to look out for the data structures you  can use for the same and then accordingly calculating the time complexity of the approach. Always remember that the best algorithm is the one which is the fastest and covers all the use cases of the problem(be it base case, corner case, etc) 
Score: 2.5
Question: Briefly explain the approaches to develop algorithms.
Reference answer: There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly

Student answer: Our approach to develop an algorithm must be how to receive an optimal solution that also takes the minimum time and space.\nNow we can choose which one is more appropriate:\n-Divide and Conquer: To divide our problem in to subproblems then solve the subproblems and then eventually obtaining the required solution.\n-Backtracking- Exploring all the possible solutions of a problem and finding the right answer following our given constraints.\n-Greedy- Using a greedy approach to get a solution (to get more profit)\n-DP- To ensure optimal substructure and no overlapping problems.
Score: 2.5

Student answer: Algorithms can be developed on the basis of their efficiency. i.e, based on their time , based on their space complexity etc\nthat is through dynamic programming or greedy approach etc.
Score: 2.5

Student answer: Approaches to develop am algorithm are:\n1. Divide the problem into sub-problems. \n2. Define the input. \n3. Check if you can directly use any of the existing algorithms.\n4. Modify the existing algorithms to solve the given problems.\n5.  Try to make the algorithms more optimized by using approaches of dynamic programming.
Score: 2.5

Student answer: There are many approaches to develop Algorithms:\nSome of the most popular approaches are:\n1) Divide and Conquer:\nin this technique we divide the current problem in multiple subproblems such that each sub problem is exactly same as big problem.\neg: Rat in a maze, n-queens, uses backtracking that comes under Divide and conquer.\n2) Greedy Approach: In this approach we write algorithm in such a way that we get locally optimised result at each step.\neg: fractional Knapsack, Job scheduling etc algorithms uses this approach.\n3) Dynamic Programming: This is more optimised technique which aims at getting the optimised result at the end when program terminates.\nfor this this approach used memoisation and tabulation so that the repeated occurences can be ommited and value can be stored in a @-D array.\neg: 0/1 Knapsack, Longest Common Subsequence etc.\n
Score: 2.5

Student answer: The approaches to develop algorithms are:\nDivide and conquer - dividing the problems into smaller problems and getting the solution\nGreedy algorithm - Checking all the possible outcomes of a given problem\nDynamic Programming - Finding the most optimum solution to the given problem using memory memorization. \nBacktracking - Moving back and finding the the output to our solution.
Score: 2.5

Student answer: Firstly we need to write down the problem we need to solve, then we see if that problem can be divided into smaller sub problems, then we find a solution to solve that problem in the least time, then we implement that solution into a code.
Score: 2.5
Question: Briefly explain the approaches to develop algorithms.
Reference answer: There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly

Student answer: To develop an algorithm first write the problem, then divide it into sub-problems (if possible), then solve the sub problems to find an optimized solution, then merge the solutions to find the final solution.
Score: 2.5

Student answer: An algorithm is defined as the finite number of steps or sequence of operations required to solve a problem. To develop an algorithm we need to first check the user requirements, then design an algorithm as per the requirements. The algorithm should take a finite input and generate a finite output in the required amount of time complexity. It should be able to generate optimal solution to the problem in order to be efficient algorithm.
Score: 2.5

Student answer: 1. Divide and Conquer: We solve small problems and handle base case so recursion will solve bigger problem.\n2. Backtracking: here we try all possible combination and pick the best one.\n3. Greedy Approach: here we try to pick best solution at every step.\n4. Dynamic Programming - Try all possible solution and save them and pick the best one.
Score: 2.5

Student answer: here are three commonly used approaches to develop algorithms âˆ’\nGreedy Approach âˆ’ finding solution by choosing next best option\nDivide and Conquer âˆ’ diving the problem to a minimum possible sub-problem and solving them independently\nDynamic Programming âˆ’ diving the problem to a minimum possible sub-problem and solving them combinedly
Score: 2.5

Student answer: each algorithm is developed in a different manner, but the main focus goes like analyzing the algorithm, implementing a brute force stratergy first , then trying out a more subtle approach with much less time complexity considering various methods of algorithm forming like backtracking, divide and conquer, greedy approach or a dynamic approach and finally seeing if there is any other method to optimize the problem further.
Score: 2.5

Student answer: the first approach is thinking a brute force approach to solve a problem. then optimizing the algorithm using various data structures and making changes in the approach to solve complex problem efficiently
Score: 2.5

Student answer: there are many common approaches such as brute force , greedy and dynamic programming to develop algorithms. Brute force is the simplest way in which apply any possible simple logic to solve the problem at hand. IN greedy approach we try to take the best possible root at each step which increases the possibility of getting the best result. Dynamic programming always ensures the most optimal solution in all cases , as in this we go through all possible outcomes and choose the best among them.
Score: 2.5
Question: Briefly explain the approaches to develop algorithms.
Reference answer: There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly

Student answer: first we look closely upon the problem statement and briefly understand the things asked\nthereafter we use different approached like divide and conquer or greedy or backtracking and many more to obtain the solution\nafter which the space and time complexities are compared to get the optimized solution of the given problem
Score: 2.5

Student answer: Approaches to develop algorithms: -\n1. Algorithm must give complete solution to a problem. \n2. The solution may or may not be optimal.\n3. Less Time consuming 
Score: 2.5

Student answer: 1)Waterfall approach\nDeveloping algorithms include understanding the problem, taking into consideration the space and time complexity, checking the feasibility of the problem, whether the algorithm is complete and optimal
Score: 2.5

Student answer: 1)divide and conquer : we divide the problems in subproblems\n2)greedy : the first approach which hit mind first , it does not  provide optimal solution\n3)dynamic programming : using recurssion we divide problem into subproblems which provide optimal solution
Score: 2.5

Student answer: we analyze our requirements , and find the best algo for the problem which takes the least time and uses least amount of resources
Score: 2.5

Student answer: \nAnalyze data\nObjectify need \nTime analysis \nSpace analysis\n
Score: 2.5

Student answer: 1.first understand the problem properly\n2.apply the brute force approach \n3. Try to reduce the time and  complexity and optimize it \n4. If its work that particular set of information then algorithm developed 
Score: 2.5

Student answer: to approach developing an algorithm \n1. we need to read and understand the problem carefully\n2. apply brute force for to problem first\n3. now see how we can optimize the solution \nwe can use different techniques like divide and conquer, backtracking, greedy etc.
Score: 2.5

Student answer: recursive , divide and conquer, greedy, dynamic
Score: 2.5

Student answer: The approaches to develop algorithms is coming up with a pattern with the knowledge of DS and attempting to use minimum space and complexity in order to form the most optimum algorithm 
Score: 2.5

Student answer: The approach to develop algorithm is based on its efficiency to find the solution in minimum time while taking minimum space in memory of our system
Score: 2.0

Student answer: The approaches are to the develop of the algortihm:\nGREEDY APPROACH\nDYNAMIC APPROACH\nDEVIDE AND CONQUER APPROACH
Score: 2.5

Student answer: we used first find all the possible ways and then check the complexity for the program so it can run in the least time possible 
Score: 2.5
Question: Briefly explain the approaches to develop algorithms.
Reference answer: There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly

Student answer: There are divide and conquer which divides problem into smaller problems. Backtracking algorithms follow a particular way and if a solution is not found, backtracks and goes to another way.
Score: 2.5

Student answer: the approach these day is to find the fastest way to search, sort, iterate through the data, for fast reponse time.
Score: 2.5

Student answer: the approaches to develop algorithms are firstly, we understand the problem and try to devise various ways using different test cases \nthen we implement a simple code using the algorithm that we've devised and then we workout on the pre designed algorithm and implement the one which is best suited with respect to our problems.
Score: 2.5

Student answer: Master's theorem
Score: 2.5

Student answer: Following are the approaches to develop algorithms.\n->Greedy algo: Taking descision at every step\n->Dynamic Programming: Taking out best/efficient possible answer by framing a formula or method.
Score: 2.5

Student answer: An algorithm is developed depending on its use. Most algorithms are used to find the optimal result of of the problem like the search algorithms. They are very helpful in various fields  and studies.
Score: 2.5

Student answer: the approaches to develop the algorithm is finding the optimum and efficient solution of the problem 
Score: 2.5

Student answer: the algorithm should be time and space efficient. this means that the program shouldnt contain any unnecessary loops. predefined data structures take up a lot of space as well, so its better to take the input dynamically so that no space is wasted at all \n
Score: 1.0

Student answer: we develop algorithm so that to get get the good or optimal approach for any problerm
Score: 1.0

Student answer: Try to understand what the problem wants you to do\nFind a data structure for the given problem\nTry solving the problem with brute force\nTry to make your solution better by making efficient algorithms in terms of time and space complexity
Score: 2.5

Student answer: greedy method:finds local optimal solution\ndynamic:stores the solution of the sub problem in dp[][] to provide efficiency by decreasing time\ndivide and conquer:divides the problem into sub problem until it cant be divided further and then solves each sub problem
Score: 2.5

Student answer: to develop algorithm take a variable and develoop such that it takes the minimum time less space
Score: 1.0

Student answer: . write the pseudo code \n. do dry run
Score: 1.0

Student answer: define a solution to a problem\ncheck if the approach to the problem gives reliable and consistent solution
Score: 1.0

Student answer: Approach to develop Algorithm:\n
Score: 2.5
Question: Briefly explain the approaches to develop algorithms.
Reference answer: There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly

Student answer: approach to develop algorithms is to by building logic to reach the goal in given time and space complexity.
Score: 2.5

Student answer: While developing algorithms we take care of the time and space complexities and write a program which implements the logic satisfying these conditions
Score: 2.5

Student answer: The approaches to develop algorithm is to make a certain code to takes less space and take less time to works.
Score: 2.5

Student answer: development of algorithm can be done by first thinking of all possible cases and then finding some base case which will have a surely  solutions to them without the help of other functions
Score: 1.0

Student answer: first we analyze and  write a pseudo code that efficiently solving the problem in terms of time and space .we find this complexities with the help of recurrence functions and then we implement the algorithm.\nThese are the steps:\nAnalyzing and thinking a solution\nsolving (pseudo code)\nimplementation \n
Score: 1.0

Student answer: The algorithm should must return a feasible output.\n
Score: 1.0

Student answer: There are several approaches like divide and conquer in which first we divide the problem in subpart and then merge them
Score: 2.5

Student answer: First try the brute force approach to solve a problem. Then try try to optimize the solution by making use of different techniques like divide and conquer and greedy approach. We can use recursion.  If we can see the there is scope for improving the space complexity and time complexity namely to reduce the number of repeated operations, we can apply dynamic programming. 
Score: 2.5

Student answer: approaches can be to know how much work it does, to get the need of it\nto use the current data structure at correct place.\nto know the edge cases involved in developing algorithms\nto keep in mind about the complexity \n
Score: 2.0

Student answer: To Develop Algorithms we need to\n->Firstly Understand Ques Correctly\n->Develop the logic \n->Then think which Data Structure is most Suitable\n->then try to optimized the algorithm in terms of time and memory\n->Most Importantly our algorithms must have correct output of all test cases and edges test cases
Score: 1.0

Student answer: divide and conquer approach , brute force approach ,FIFO , LIFO etc.
Score: 1.0

Student answer: Approaches to develop algorithm are mainly the devide and step techniques. Divide the given problem into a set of subproblems. Solve every problem individualy recursively.Combine the solution of subproblems into a solution of the whole problem.
Score: 2.0