Harsh-7300/dataset huggingface dataset:
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: by developing recurrence relations \nusing specific time complexities space complexities, keeping the record of its worst case best case we can develop algorithm.. which will work accordingly
Score: 1.0

Student answer: Analyze the given question \nlist out the memory blocks to be used for solving the problem\nimplement solving technique using your code, for example - while using backtracking to solve N queen problems, recursive tree is drawn, \nbased upon the logic try to write a pseudo code
Score: 2.0

Student answer: To develop an algorithm we first need to know where that algorithm will fail and where will it apply.
Score: 1.0

Student answer: approaches are to first understand the problem statement and then write down the pseudo code briefly and then also analyze the edge cases and handle them. 
Score: 2.0

Student answer: First we should analyze the algo thoroughly and then optimize it according to the best space and time complexity found.
Score: 2.0

Student answer: first of all we need to identify what the problem is. We should then make a pictorial representation of the data structure used and the whole working of how we want to approach the problem on paper. Then we should start writing the code. As far as approach is concerned, observe which data structure can be used to solve the problem in most effective way. Then using our prior knowledge about the data structure, we must either apply the classic approaches, and if we find a better approach, we should apply that.
Score: 2.0

Student answer: approach includes-\nunderstand the algorithm\nanalyse it\nbreak down  the algorithm\nwrite the pseudocode or flowcharts
Score: 1.0

Student answer: With context to the problem, we have multiple ways of working out the solution. But we have to choose our approach in a very sensible manner while taking care of the optimization and the test cases. For example, in knapsack problem. DP and Greedy both can be used to derive the answer. But 0/1 problem becomes a problematic approach if we choose greedy. 
Score: 1.0

Student answer: We first think of a brute force approach that can solve the porblem and calculate its complexity and then we try to optimise the problem using an \
Score: 2.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: Basic approaches remain the same for all the algorithms where it is divide and conquer, backtracking ,etc. \n1. Try to simplify the problem into simpler cases. \n2. Try to find out data structures that can be used to solve the cases. \n3. Look for validity using test cases. \n4. Further optimize it and look for better ways/ data structure.\n\nDivide and conquer -> divide problem into smaller subproblems and find solution of each of the smaller subproblems. Then recombine these to solve the bigger problem,\n\nDP - we solve each of the cases and store all the solutions to smaller problems in matrices or arrays to cut out the overlapping subproblems of the recursion.\n\nBacktracking - > Go in all the directions to find the solutions (except those which are cut short because of invalid advancement. for example - in rat in a maze problem, we try all the paths to reach the finish block but we don't in the directions blocked by the obstacles. 
Score: 2.0

Student answer: Main approaches are:\nGreedy method\nDynamic Programming\nBack Tracking \nLinear method \n
Score: 1.0

Student answer: Brute force approach: To try to develop an algorithm without using any pattern or pre requesite \nGreedy approach: This approach solves the problem step by step so that the problem occurring first is solved first\nDivide and conquer approach: This algorithm divides the problem into set of sub problems and each is solved individually
Score: 1.0

Student answer: Data structures can be used for collectively  storing various data types together for solving a particular question.
Score: 2.0

Student answer: Step 1. Implement a bruteforce solution\nStep 2. Try to reduce the time and space complexity \nStep 3. Apply asymtotic analysis and various data structures that can reduce the time and space complexity of the algorithm.
Score: 2.0

Student answer: There 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: 1.0

Student answer: First, we read the problem and then we think how to solve it, not efficiently but only a brute force method to solve. Then step by step, we try to reduce time complexity and reach an efficient solution. For example - Like while solving backtracking questions, we first think about the problem, then apply brute force solution. After that, we try to apply recursion and solve more efficiently.
Score: 2.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: an algorithm of a problem can be developed by divide and conquer, backtracking. greedy or dynamic programming approaches.
Score: 1.0

Student answer: Greedy\nBacktracking\nDivide and conquer\nDP\n
Score: 2.0

Student answer: To develop an algorithm, understand the problem, try and build a solution which uses less time even on larger inputs and also does not take a lot of space.
Score: 1.0

Student answer: first understand the problem, second break it into sub problems and achievable steps, third brought down a way of achieving that sub problem, fourth check is there another way!, if yes then find which one is more efficient use that, if no move further to next step, fifth write the algorithm in the form of code for the problem and test if it works properly.
Score: 1.0

Student answer: 1. Understand the problem statement.\n2. Try to find the best possible approach to find the solution of that problem.\n3. Use the analogy of real life solutions in computing terms.\n4. Design the algorithm keeping all these things in mind. \n5. Try to minimize the space and time complexity of the designed algorithm.
Score: 2.0

Student answer: Divide and conquer -  First the data sstructure is divided until the given condition and once it is fulfilled , it is operated upon.\nBranch and bound - \nGreedy approach - Problem is solved by sorting the data structure in a particular order and then finding the max , min or the data fulfilling the specidied condition\nDynamic programming - Reducing the time and space complexity by storing the values processed in the recursive stack space in an array so that the function need not process the value for the same input when encountered and can access it from the array.\n
Score: 2.0

Student answer: while developing an algorithm we first write our requirement and the information given to us then we decide which approach to use to create the algorithm like divide and conquer, greedy method, dynamic programming & backtracking. after that we write the pseudo code for the algorithm which is basically breaking the problem into different steps like making a counter, running a loop. etc. and then after that code is written for the algorithm in a particular language.
Score: 1.0

Student answer: To develop an algorithms we need to understand the requirement of the algorithm and develop a pseudo code and check it for different test case and specially find the base case where algorithm may act differently. Moreover take care of time complexity and space complexity better the time and space complexity better the algorithm.  
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: The approaches to develop algorithms :-\n1) Identify problem\n2) Identify data structure to use and their working\n3) Implement the algo\n4) Try to make it more efficient
Score: 1.0

Student answer: Common Operations performed on data-structures are-\nSearching\nSorting\nInsertion\nDeletion
Score: 1.0

Student answer: for developing the algorithms first you should have to make approach for solving the problem as 
Score: 2.0

Student answer: greedy approach, 
Score: 1.0

Student answer: we have to follow some rules before developing an algorithm first is that algorithm following the rules that are given or not and second is to save the time and space according to the question
Score: 2.0

Student answer: First we analyse the problem at our hand, and try to find out the best solving technique be it backtracking, divide and conquer, or dynamic programming. We can also use brute force to get a clear idea of the problem and get a vanilla algorithm and then work on it.  After designing an algorithm there are 2 ways: prerioiri and postreori to find the time complexity of the algorithm, after deducing it we see if it has scope for improvement, if yes then do so.
Score: 1.0

Student answer: we wil use following approaches to develop algorithm :-\n1) if the algorithm is complete or not.\n2) check its time and spaces complexity (means they should be minimum).\n3) check for admissable means if the solution given by the algorithm is optimal or not.\n\nbased on these approaches we will develop the algorithm
Score: 1.0

Student answer: The approaches to develop an algorithms are\n*)understanding the problem statement .\n*)understand the asymptotic notations such as desired time complexity and space complexity.
Score: 1.0

Student answer: by writing pseudocode
Score: 2.0

Student answer: first try to connect the problem with real world scenario , then develop a raw solution to the problem ,once it is able to handle all the possible test cases try to optimize it by minimizing  its time and space complexity.
Score: 1.0

Student answer: to develop algorithms  following approaches are taken-\n
Score: 1.0

Student answer: The approach to develop algorithms is to \nfirst understand the problem \nfind put the  
Score: 1.0

Student answer: The approaches to develop algorithms are based on the nature of the problem i.e. if the problem can be divided into smaller problem of similar nature, what kind of data structure we require to efficiently solve the problem. Based on these techniques there are various approaches like divide and conquer, brute force, dynamic programming, greedy approaches, etc.
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.Divide problems into set of subproblems\n2.Solve every subproblem individually\n3.Combine the solutions to obtain solution for the original problem
Score: 2.0

Student answer: To develop the algorithms, we simple require an overview of what we are going to do to solve the problem and the general steps which we are performing one by one to approach the solution.
Score: 1.0

Student answer: 1. analyze the problem clearly.\n2. break the problem into sub problem if its too large.\n3. design the algorithm for the sub problem if possible.\n4. Analyze the complexity.\n5.Dry run for various inputs and try to optimize it.
Score: 2.0

Student answer: Algorithms are written in order to find the most efficient way ,precisely saying the way having least time complexity. Approaches to algorithm include firstly to find out any way through which we can get to solution of our problem. Secondly to find any other way involving less time, Thirdly to analyse if its the best possible way out. Fourthly to code it.
Score: 1.0

Student answer: approaches to a developing an algorithm are:\nrecursive\niterative\nsubstitution\n
Score: 2.0

Student answer: First, analyze the problem thoroughly. Then write down the basic , common ideas or the steps to achieve that algorithm somewhere and when the brute force gets ready, then look upon the time complexity and after that on the space complexity.
Score: 1.0

Student answer: Basically, algorithm is  a collection of steps that tells about how a particular task is happening through code. 
Score: 1.0

Student answer: approaches to develop an algorithm are \nbrute force approach\ngreedy approach\ndynamic programming\ndivide and conquer
Score: 1.0

Student answer: An algorithm is a set of generalized steps which are obeyed to write computer programs by which we can solve a certain problem.\nThe approaches to develop an algorithm is-\nFirstly clearly under stand the problem statement and understand the edge cases and all the constraints.\nNow, we will be in need to find the best data structure to be used to code out that particular algorithm.\nTry to solve the problem on the bases of brute force approach and then try to do optimization for the solution.\nTry to use the properties of existing algorithm and then invent new algorihtm by writing the steps.
Score: 1.0

Student answer: Greedy Approach - we make optimal decisions for present case to get a optimal solution for case\ndynamic approach - we store the data used in case it is needed in future\nbacktracking - in this we backtrack to previous case if answer not found 
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: The main purpose of developing an algorithm is to keep in mind it must work in every language.\nTo develop an algorithm we must look at the problem in a simpler manner and develop an efficient code which can help us achieve our solution\nWhich can be obtained by implementing any of the following strategies: Divide and Conquer, Greedy approach, Backtracking and Dynamic programming
Score: 1.0

Student answer: algorithm is a stepwise solution to a problem. To develop an algorithm first we will try to think about the most naive approach, then break it into subproblems and try to improve it in a such a way that it become more cost efficient  and time complexity and space complexity is better.
Score: 1.0

Student answer: the approaches to develop algorithm are to find the time complexity and space complexity.
Score: 1.0

Student answer: First we use a brute force approach and check whether we can solve the question by it in the best time and space complexity. Then if we can get a better time complexity than the original brute force approach then we try to make the algorithm more efficient by checking whether the question given to us can be solved using any other approach. Then we make the algorithm more efficient by changing its space and time complexity.\n
Score: 2.0

Student answer: To develop an algorithm is to solve a smaller problem, which in turn solves a bigger problem. like. taking example of a Fibonacci series try to solve the first to two or three answers and accordingly frame a formula or algo and hence apply it to the bigger problem.
Score: 2.0

Student answer: some common approaches for developing algrothm are \n1. dynamic programing\n2. backtracking\n3greedy approach\n4. divide and conquer
Score: 2.0

Student answer: Approach to develop algorithm is first we need to understand the problem. Then think of brute force solution. See the time and space complexities and how we can improve those. See if existing algorithms or methods exist and how and if using those algorithms or modifying them we can solve the problem. the pseudo code is written and seen if it is better than previous approaches and then finally converted to code. 
Score: 1.0

Student answer: Divide and conquer approach - the problem is divided into smaller subsets and then solved\nBacktracking approach - all the possible solutions of a problem are traversed to get the optimum result\nGreedy approach-the first optimum solution is taken into consideration\nDynamic Programming approach-tabular solution for the optimum solution
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) analysis of the problem at hand\n2) writing the approach and pseudo code\n3) finding the best solution for the given problem\n4)adjusting the solution according to the problem\n5) debugging the solution
Score: 1.0

Student answer: Firstly, the given problem is analyzed and then the problem is divided for further analysis into subproblem\nThen, the best solution for every subproblem is analyzed and then the solution of the subproblems are adjusted according to main problem \nMost Efficient method found in this process is used at the last
Score: 1.0

Student answer: Approaches to develop algorithms:\nfirst we develop the brute force of the algorithm working in the question\nthen we find out if any better approach with better time complexity and space complexity could we used and then we apply that approach to solve our problem.
Score: 1.0

Student answer: the approach to develop algorithms is that they should take the least time complexity and space complexity when solving a problem 
Score: 1.0

Student answer: The approaches to develop algorithm are:\na)Firstly we see what the question is asking\nb)We 
Score: 1.0

Student answer: Approaches to develop the algorithms are:-\n
Score: 1.0

Student answer: approaches to develope an algorithm are:\n1)divied and conquer\n2)backtracking\n3)greedy algorithm\n4)dynamic programming\n5)branch and bound algorithm
Score: 1.0

Student answer: to develop and algorithm you must understand the problem statement thoroughly and its requirements. After that you must identify the time and space complexity of you approach and them improve it to the better and best algorithm possible
Score: 1.0

Student answer: We try to find a solution to a problem such that it is also efficient. We can use greedy method, dynaminc programming, divide and conquer, backtracking etc.. to do so
Score: 1.0

Student answer: The approach to develop an algorithm is to first analyze the logic behind the outcome and then develop the particular algorithm behind it.
Score: 1.0

Student answer: steps to develop an algorithms are:\n1. understand the problem in your mind and perform a dry run on pen and paper\n2. think accordingly which data structure to use\n3. form your algo according to the knowledge you get from dry run.
Score: 1.0

Student answer: The task of user is to find the best possible approach to develop the algorithm so that it has the minimum time complexity and it covers all the possible test cases so that the program does not fail for any of the hidden base case. There are many approaches such as 1) greedy approach, 2)dynamic approach,  3) divide and conquer approach, 4) brute force approach.\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: algorithms are develop according to better time and space complexity.
Score: 1.0

Student answer: Greedy 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: 1.0

Student answer: 1.analyze the problem\n2.check what do we have\n3.think how can we solve the problem with the data given\n4.come up with solution
Score: 1.0

Student answer: First find the best suitable approaches that may be applied on given theorem such as greedy , dp etc.\nthen find the suitable data structure that ease to traverse the data \nand then build the algo step by step
Score: 1.0

Student answer: Linear data structure, is when traversing goes in a single line ex-array, linked list, stack
Score: 1.0

Student answer: 1)Brute-force or exhaustive search.\n2)Divide and Conquer.\n3)Greedy Algorithms.\n4)Dynamic Programming.\n5)Branch and Bound Algorithm.\n6)Randomized Algorithm.\n7)Backtracking.\n
Score: 1.0

Student answer: 1. Understand the problem statement.\n2. Try to devise steps that can lead to the solution.\n3. Write those steps in simple language to make the understanding easier for the reader.\n4. Include all the necessary information that leads to the solution.
Score: 1.0

Student answer: 1.) Divide and conquer approach where we work on a sub problem and keep on adding the solution  to get the solution of the big problem.\n2) Backtracking approach which is used to find all the solutions of a problem whether it is optimal or not .\n3) Greedy Approach where we find the best possible solution at each step.\n4) Dynamic Approach
Score: 1.0

Student answer: To develop a algorithm:\n1.We firstly generate the problem statement;\n2.A problem solution is proposed;\n3.Asympotmatic analysis;\n4.Testing;\n\n
Score: 1.0

Student answer: The approaches to develop algorithms include first breaking down the problem statement,then choosing the best suited data structure or data structures as per the requirement \nand writing the solution in a simple understandable language.
Score: 1.0

Student answer: 1. Analyze the problem and generate a problem statement.\n2. Think about the possible ways to solve the problem.\n3.Write the optimize algorithm according to your knowledge.
Score: 1.0

Student answer: approaches to develop algorithm are-;\n1-check its time complexity, analysis of best case, worst case all types of scenarios\n2-check its space complexity how much space it would be requiring and optimise it to use least space as more space can exhaust large amount of memory of system\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: First the problem is studied thoroughly and best solutions are written. Then using backtracking , divide and conquer techniques an optimal solution is found. In some cases values of past problems are stored to refer to incase the program faces the problem again , like in dynamic programming.
Score: 1.0

Student answer: algorithms should have optimal time complexity and space complexity and it should give the optimal solution .   the algorithms should be efficient
Score: 1.0

Student answer: The approaches to develop algorithms include the motive of finding the optimal solution to a problem i.e. the solution which is both time-efficient and space efficient.
Score: 1.0

Student answer: there are various approaches to develop an algorithm ,one such is known as brute force or naive approcah,having absurd time and space complexity.After which we try to optimise our solution by using a suitabledata structure and a suitable algorithm ,thereby providing both a time and space efficient solution.
Score: 1.5

Student answer: the first approach to develop algorithm is to reach the solution, which can be done by making the problem smaller and smaller and finding its solution. then find ways to optimize that solution in the best way possible way. time complexity should be kept in mind
Score: 1.5

Student answer: First we have to identify the problem after that we have to find algorithms which may solve the problem ,after that we have to find space and time complexty and chose the most effecient one .
Score: 1.5

Student answer: I have first approach is that the algo. is not be large and main approach is that less time complexity in comparing to other method . For developing the algorithm we know the appropriate logic to attempting and solving the problem.
Score: 1.5

Student answer: first we find a solution to the given problem, then we find ways to optimize our solution. divide and conquer, greedy approaches are some examples of algorithms.
Score: 2.5

Student answer: The first approach is to apply brute force, that is the process without thinking about the time complexity. Then we can try to optimize the algorithm aiming to reduce the time complexity.  We should always consider the worst case scenario while writing any algorithm and take further step accordingly.
Score: 2.0

Student answer: divide and conquer approach\nback and bound approach\nbacktracking approach\ngreedy approach\ndynamic programing
Score: 2.5

Student answer: Objective of developing an algorithm is offering the user with the most time efficient as well as with the space efficient solution to his problem .The solution must perform best amongst the best and worst case scenarios.
Score: 1.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 should read the question and find which Data Structure is being used in that particular program and to find that data structure we have to know what operations has to be used to solve that problem then make a flowchart and write the program acording to it like if in a question it is asked for a function that performs last in first out then we have to use stack in it  
Score: 1.0

Student answer: to develop a algorithm first we need to check the problem and than we need to think how efficiently and producitvely we can solve the problem for that we have to divide the problem in parts and than solve each part to get the final solution by ths we can develop a algorithm\nexample dyanamic programming \ngreedy approach \ndivide and conquer
Score: 2.5

Student answer: An algorithm should have least time and space complexity. we constantly try to make algorithms that have lesser time complexity.
Score: 1.5

Student answer: There are multiple approaches to develop an algorithm like by optimsing the time complexity of algorithm and optimising the space somplexity of the algorithm.
Score: 1.5

Student answer: first we analyse the problem and then approach towards the solution
Score: 1.0

Student answer: first we can use brute force approach and then from there work on reducing its complexities
Score: 1.5

Student answer: Approaches to develop algorithm can include identification of the basic mechanism involved in the problem following to this will be the time complexity efficient algorithm that would be given priority in selection of algorithms
Score: 1.5

Student answer: 1. Divide and conquer approach: Divide the problem into subproblems . Reach the smallest subproblem recursively . Write solution for smallest subproblem. Backtrack to reach final answer.\n2. Recursion and backtracking: use recursuion to trace all solutions . If you find an invalid path , backtrack.\n3. Greedy approch: At each step, write the best fit solution for that time.
Score: 2.5

Student answer: approaches TO develop algorithms;\n1.using recurrence relation ->we obtain the recurrence relation \n2, guess approach -> we guess and then obtain time complexity\n
Score: 2.0

Student answer: 1) read the problem statement \n2) think of the similar examples\n3) think of a particular solution to it \n4) develop some possible test cases and run them roughly\n5) find the more efficient solution once you have find the basic approach
Score: 1.0

Student answer: First we have to analyse the problem and then we have to identify suitable type of data structure that could be used to solve the problem.
Score: 0.0

Student answer: concept of notation which helps in develop algorithm
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: to develop the algorithm understand the problem statement break it into task perform each task separately optimism the algorithm  
Score: 1.5

Student answer: Algorithms can be developed through several approaches wheather it be time approach or space approach. 
Score: 1.0

Student answer: first we have to understand the problem then we have to find a perfect algorithm
Score: 1.0

Student answer: 1) we should understand the need of  problem\n2) build the logic  find its is correct approach or not\n3) find the time complexity of developed algorithm
Score: 1.0

Student answer: the one an only approach to make algorithm is by using greedy approach in which we are getting more profit and less usage of space , also reduces time complexity
Score: 1.0

Student answer: 1. Problem Statement\n2. Sources available\n3. Time efficiency\n4. Space efficiency
Score: 1.0

Student answer: to develop algorithm we first analyse the code and check for its time and space comlexity and find ways in which we can edit the code so that we have lower time and space complexity and our output is close to accurate.
Score: 1.0

Student answer: to develop algorithm firstly one should know how to approach to the problem, what are the mandatory conditions  required for the problem to solve, then write each steps in normal english form mentioning the mandatory conditions
Score: 1.0

Student answer: to develop an algorithm first we will understand the problem \nthen we will try to find the method or approach to solve the problem\nafter finding the appropriate approach we will create the steps to execute the approach which we call as algorithm
Score: 1.0

Student answer: There are two approaches to develop algorithms:\n\nPriori:\nDoes not depend on machine\nDo analysis before implementing the algorithm \n\nPostriori:\nDepends on machine\nDo analysis after implementing the algorithm 
Score: 1.5

Student answer: The approaches to develop algorithms are understanding the problem statement for which we have to develop the algorithm then divide the problem into subproblems and find approach to solve the subproblems 
Score: 2.0

Student answer: need to solve the problem\ntechnique which we will apply to solve it\nability to compare the problem with real word experiences.\n
Score: 1.0

Student answer: first the logical algorithm is written \nthen it is converted to pseudo code\nthen into languages like c++,java etc.
Score: 0.0

Student answer: for building a certain algo we need to address the problem and look forward to that with the possible nearest solution by which we can get the our desirable output and we meet to build algo by take computation power and the time complexity in the mind .
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: 1getting the right approch the probelem using basic 
Score: 0.0

Student answer: it  depends of need  ex greedy approaches dynamic approaches for optimization's
Score: 2.0

Student answer: greedy.(is the use of maximum optimization).
Score: 1.0

Student answer: na
Score: 0.0

Student answer: approach to develop algorithms:\n1. find the time complexity \n2..correct approach for the question\n3. result should be minimal
Score: 1.0
Question: What are some examples of divide and conquer algorithms?
Reference answer: The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points)

Student answer: Longest Common Subsequence, Djikstra Algorithm,Recursion, FLoyd Warshall Algorithm, Hamiltonian Path, Knapsack.
Score: 1.0

Student answer:  examples of divide and conquer algorithms are genome sequencing, dictonary searching etc
Score: 1.0

Student answer: some examples of divide and conquer algorithms are merge sort and quick sort in which we divide the problem into smaller problem and then solve them
Score: 1.0

Student answer: 1) Merge Sort\n2) Binary Search\n3) Quick Sort\n4) Shortest distance between points in a Graph
Score: 2.5

Student answer: Merge Sort\nQuick Sort\nPairwise shortest distance between two points
Score: 2.5

Student answer: There are some examples of divide and conquer algorithms like Merge Sort ,Quick sort
Score: 2.5

Student answer: examples of divide and conquer are binary searches and merge sort . \n
Score: 2.5

Student answer: . quicksort.\n. mergesort\n. binary search
Score: 2.5

Student answer: examples of divide and conquer algorithm are \n- Merge sort\n- Binary Search\n- Quicksort
Score: 2.5

Student answer: 1. quick sort\n2. merge sort\n3. Strassen's algorithm
Score: 2.5

Student answer: Some examples of divide and conquer are as follows-\n1. Closest pair problem\n2. Stock pricing problem\n3. Strassen multiplication problem\n4.Merge sort \n5.Quick sort
Score: 2.5

Student answer: 1)Merge sort \n2)Quick sort  \n3)closet pair path problem
Score: 2.5

Student answer: Quick sort, merge sort, binary search
Score: 2.5

Student answer: Merge and Quick Sort
Score: 2.5

Student answer: examples of divide and conquer algorithms are :\n- quick sort
Score: 2.5

Student answer:  Merge Sort\n- Matrix Multiplication.\n
Score: 2.0

Student answer: divide and conquer algorithms are best used when the subproblems of a problem are similar to the original problem and same approach can be used to solve all the sub-problems and lead us to desired output\n\nSome examples are: \n1. Merge Sort\n2. Matrix Multiplication
Score: 2.0

Student answer: merge sort, quick sort, median search, binary search
Score: 2.5

Student answer: Examples are:\nBinary Search\nMerge Sort\n\n
Score: 2.0

Student answer: Merge sort, Quick sort
Score: 2.0

Student answer: insertion sort , quick sort are the very common examples of divide and conquer algorithms.
Score: 2.0

Student answer: Some Examples of divide and conquer algorithms are- Binary search,merge sort,bubble sort,selection sort,insertion sort and median search 
Score: 2.5
Question: What are some examples of divide and conquer algorithms?
Reference answer: The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points)

Student answer: Divide and conquer algorithms are used in solving many problems (like to find minimum distance between two points in a plane, etc ) . The concept of this algorithm is to divide the main problem into smaller subproblems. Then we find solution of these smaller subproblems and subsequently compute the solution of main, big problem. The main catch in this algorithm is that the smaller subproblems should be similar to the parent problem, otherwise this algorithm will not work. \nSome examples of Divide and Conquer algorithms are : merge sort, quicksort,  etc.  
Score: 2.5

Student answer: merge sort ,quick sort etc. are the example of divide and conquer as in divide nd conquer we divide the problem into subproblem and then  recursively  get the resultant output by combining the output got from subproblems.
Score: 2.5

Student answer: Merge Sort: In which we keep dividing the arrays into sub arrays until only one element is present in each sub array. Then we merge those sub-arrays into a sorted array.\nQuick Sort: The pivot divides the array in 2 parts one side sorted and one side unsorted. the pivot keeps on changing as the array gets sorted.\nBinary Search: We keep dividing the sorted array into halves until we find the element.\n
Score: 2.5

Student answer: Binary search, quick sort and merge sort.
Score: 2.5

Student answer: Binary search, quicksort and merge sort.
Score: 2.5

Student answer: Some example of divide and conquer algorithm are :\n1) merge sort\n2)quick sort\n3)binary search\n\n\n
Score: 2.5

Student answer: Some examples of divide and conquer algorithms are:\n1. Merge sort\n2. Closest points
Score: 2.5

Student answer: some common examples for divide and conquer algorithm are merge sort, quick sort, binary search, radix sort.
Score: 2.5

Student answer: graph coloring\n\nHamiltonian cycle\n
Score: 1.0

Student answer: some common examples of divide and conquer algorithms are merge sort, quick sort ,etc.
Score: 2.5

Student answer: some examples of divide and conquer are-1->merge sort 2->radix sort 3->binary search 4->quick sort.
Score: 2.5

Student answer: Some Examples of divide and conquer algorithms are: \nMerge sort, Quick sort, binary search, etc. 
Score: 2.5

Student answer: Some examples of divide and conquer are Binary search, Merge Sort and Quick sort.
Score: 2.5

Student answer: Examples are:\nquick sort , binary search , merge sort
Score: 2.5

Student answer: Some examples of divide and conquer algorithms are : Merge and Quick Sort.
Score: 2.5

Student answer: Some examples of divide and conquer are:\n1. Merge Sort.\n2. Quick Sort.\n3. Binary Search.
Score: 2.5

Student answer: divide and conquer algorithms include binary search, finding subsets, merge sort, quick sort, etc.
Score: 2.5

Student answer: Binary search\nMerge Sort
Score: 2.5
Question: What are some examples of divide and conquer algorithms?
Reference answer: The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points)

Student answer: some examples of divide and conquer Algorithms include median search, quicksort, merge sort ,binary search etc. Here they divide the problem into further smaller sub problems and recurs to find perform the desired operation.
Score: 2.5

Student answer: in divide and conquer algorithm you divide the problem into multiple small problems and then accordingly try to find the desirable solution in all the small problems. \nImagine you have to search for a particular value in a given array of input by the user, it will be very time consuming if you do it by brute force approach it is better to divide the array into small piece and then run the search for it. IT WILL SAVE TIME!
Score: 2.5

Student answer: Divide and Conquer algorithms are to divide the bigger problem into smaller subproblems, then solving the subproblems and eventually obtaining the result of the original problem.\nThe best example of this algorithm is - Merge Sort.\nIn Merge Sort, the array is divided into subarrays till one element is left in each. Then it is sorted then the subarrays are merged and again sorted until the entire original array is sorted.
Score: 2.5

Student answer: Various searching and sorting techniques use the divide and conquer approach like normal search , binary sorting, insertion sort, selection sort etc
Score: 2.5

Student answer: Examples of divide and conquer are:\nBinary search algorithm, quick-sort, merge sort, N-queens problem, etc.
Score: 2.5

Student answer: example of Divide And Conquer algorithm are:\nQuicksort\nMerge Sort\nBinary Search\nN-Queens,\nRat in a MAze
Score: 2.5

Student answer: Examples of divide and conquer algorithms are:\nN-knights\nRat in a maze\nN-Queens
Score: 1.0

Student answer: Binary search, merge sort, etc.
Score: 2.5

Student answer: Examples of Divide and conquer algorithm are- merge sort, binary search.
Score: 2.5

Student answer: Various sorting and searching techniques are based on divide and conquer algorithm like merge sort, binary search. Binary tree traversal also comes under divide and conquer algorithm.
Score: 2.5

Student answer: Examples:\n1. Merge Sort\n2. Quick Sort\n3. Binary Search
Score: 2.5

Student answer: Merge Sort, Quick Sort
Score: 2.0

Student answer: merge sort, quick sort, etc.
Score: 2.0

Student answer: It can be used in merge sort , quick sort and other algorithms that require breaking the problem into smaller pieces, solving them and then recombine
Score: 0.0

Student answer: Merge sort, quick sort 
Score: 2.0

Student answer: merge sort\nquick sort\nradix sort and many more
Score: 2.5

Student answer: Examples to divide and conquer algorithms - merge sort, quick sort, binary search 
Score: 2.5

Student answer: Merge sort, \nQuick sort\nBinary search\n
Score: 2.5

Student answer: 1)Fibonacci series\n
Score: 1.0

Student answer: merge sort , quick sort
Score: 2.5
Question: What are some examples of divide and conquer algorithms?
Reference answer: The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points)

Student answer: Quick Sort\nBinary Search\nMerge sort
Score: 2.5

Student answer: Binary search 
Score: 1.5

Student answer: examples of divide and conquer algorithms:\n1. merge sort\n2. binary search
Score: 2.5

Student answer: Some examples are merge sort, quick sort, binary search.
Score: 2.5

Student answer: There are multiple examples of divide and conquer few of which are \n1. merge sort ( splits the given data further and further while swapping)\n2. binary search 
Score: 2.5

Student answer: Divide and conquer algorithm examples are merge sort, quick sort and closest-pair algorithm
Score: 2.5

Student answer: EXAMPLES OF THE CONQUER ALGOROTHMS ARE :_\nMERGE SORT\nQUICK SORT\nSELECTION SORT\nINSERTION SORT\n
Score: 2.5

Student answer: quick sort ,merge sort ,binary search
Score: 2.5

Student answer: Some examples of divide and conquer algorithms are: \n1. Merge Sort\n2. Binary Search
Score: 2.5

Student answer: Quick sort, Binary search, Merge sort are some examples of divide and conquer algorithms.
Score: 2.5

Student answer: merge sort, quick sort.
Score: 2.5

Student answer: 1.Binary Search\n2. Merge sort\n3. Quick sort
Score: 2.5

Student answer: divide and conquer algorithm works on the basis that we divide the problem into set of small problems and then solve them at an individual level and later compile them together to define the final solution of the problem.\neg-Merge sort, insertion sort, selection sort.
Score: 2.5

Student answer: quick sort\nmerge sort
Score: 2.5

Student answer: Following are  some examples of divide and conquer algorithms:\n->Merge sort\n->Quick sort\n->Binary search
Score: 2.5

Student answer: Merge sort, quick sort are some of the examples of divide and conquer algorithms.
Score: 2.5

Student answer: some divide and conquer algorithms are\nquicksort\nbucket sort\nradix sort\nbinary search\n
Score: 2.5

Student answer: Merge Sort and quick sort is the the example of divide and conquer.
Score: 2.5

Student answer: binary search\nmerge sort
Score: 2.5

Student answer: divide - merge sort ,
Score: 2.5

Student answer: Merge Sort, \nQuick Sort,\nBinary Search
Score: 2.5

Student answer: merge sort,binary search
Score: 2.5

Student answer: some examples of divide and conquer algorithms are:\nMerge Sort\nQuick Sort\nBinary Search
Score: 2.5

Student answer: binary search , merge sort, quick sort
Score: 2.5

Student answer: quick sort and merge sort
Score: 2.5

Student answer: binary search\nmerge sort
Score: 2.5

Student answer: Merge Sort\nQuick Sort\n
Score: 2.5

Student answer: merge sort , quick sort are some examples of divide and conquer algorithms.
Score: 2.5

Student answer: Merge sort, quick sort, Closest pair of points.
Score: 2.0

Student answer: merge sort, quick sort and binary search
Score: 2.0

Student answer: Merge Sort\nQuick Sort
Score: 2.0

Student answer: Merge sort , binary search 
Score: 2.0