Unnamed: 0 int64 1 5.86k | Question stringclasses 24
values | Sample ANS stringclasses 24
values | Student ANS stringlengths 1 1.06k | Score float64 0 2.5 |
|---|---|---|---|---|
1,610 | Briefly explain the approaches to develop algorithms. | 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 ... | 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. | 1 |
1,611 | Briefly explain the approaches to develop algorithms. | 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 ... | 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. | 2 |
1,612 | Briefly explain the approaches to develop algorithms. | 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 ... | 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 p... | 1 |
1,613 | Briefly explain the approaches to develop algorithms. | 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 ... | approaches to a developing an algorithm are:\nrecursive\niterative\nsubstitution\n | 2 |
1,614 | Briefly explain the approaches to develop algorithms. | 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 ... | 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. | 1 |
1,615 | Briefly explain the approaches to develop algorithms. | 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 ... | Basically, algorithm is a collection of steps that tells about how a particular task is happening through code. | 1 |
1,617 | Briefly explain the approaches to develop algorithms. | 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 ... | approaches to develop an algorithm are \nbrute force approach\ngreedy approach\ndynamic programming\ndivide and conquer | 1 |
1,618 | Briefly explain the approaches to develop algorithms. | 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 ... | 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 ... | 1 |
1,619 | Briefly explain the approaches to develop algorithms. | 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 ... | 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 | 1 |
1,620 | Briefly explain the approaches to develop algorithms. | 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 ... | 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 ... | 1 |
1,621 | Briefly explain the approaches to develop algorithms. | 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 ... | 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. | 1 |
1,622 | Briefly explain the approaches to develop algorithms. | 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 ... | the approaches to develop algorithm are to find the time complexity and space complexity. | 1 |
1,623 | Briefly explain the approaches to develop algorithms. | 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 ... | 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 usin... | 2 |
1,624 | Briefly explain the approaches to develop algorithms. | 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 ... | 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. | 2 |
1,625 | Briefly explain the approaches to develop algorithms. | 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 ... | some common approaches for developing algrothm are \n1. dynamic programing\n2. backtracking\n3greedy approach\n4. divide and conquer | 2 |
1,626 | Briefly explain the approaches to develop algorithms. | 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 ... | 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... | 1 |
1,627 | Briefly explain the approaches to develop algorithms. | 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 ... | 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 th... | 1 |
1,628 | Briefly explain the approaches to develop algorithms. | 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 ... | 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 | 1 |
1,630 | Briefly explain the approaches to develop algorithms. | 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 ... | 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 | 1 |
1,631 | Briefly explain the approaches to develop algorithms. | 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 ... | 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. | 1 |
1,632 | Briefly explain the approaches to develop algorithms. | 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 ... | the approach to develop algorithms is that they should take the least time complexity and space complexity when solving a problem | 1 |
1,633 | Briefly explain the approaches to develop algorithms. | 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 ... | The approaches to develop algorithm are:\na)Firstly we see what the question is asking\nb)We | 1 |
1,634 | Briefly explain the approaches to develop algorithms. | 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 ... | Approaches to develop the algorithms are:-\n | 1 |
1,637 | Briefly explain the approaches to develop algorithms. | 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 ... | approaches to develope an algorithm are:\n1)divied and conquer\n2)backtracking\n3)greedy algorithm\n4)dynamic programming\n5)branch and bound algorithm | 1 |
1,638 | Briefly explain the approaches to develop algorithms. | 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 ... | 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 | 1 |
1,640 | Briefly explain the approaches to develop algorithms. | 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 ... | 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 | 1 |
1,642 | Briefly explain the approaches to develop algorithms. | 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 ... | The approach to develop an algorithm is to first analyze the logic behind the outcome and then develop the particular algorithm behind it. | 1 |
1,643 | Briefly explain the approaches to develop algorithms. | 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 ... | 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. | 1 |
1,645 | Briefly explain the approaches to develop algorithms. | 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 ... | 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... | 1 |
1,646 | Briefly explain the approaches to develop algorithms. | 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 ... | algorithms are develop according to better time and space complexity. | 1 |
1,647 | Briefly explain the approaches to develop algorithms. | 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 ... | 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 | 1 |
1,648 | Briefly explain the approaches to develop algorithms. | 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 ... | 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 | 1 |
1,649 | Briefly explain the approaches to develop algorithms. | 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 ... | 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 | 1 |
1,651 | Briefly explain the approaches to develop algorithms. | 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 ... | Linear data structure, is when traversing goes in a single line ex-array, linked list, stack | 1 |
1,652 | Briefly explain the approaches to develop algorithms. | 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 ... | 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 | 1 |
1,653 | Briefly explain the approaches to develop algorithms. | 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 ... | 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. | 1 |
1,654 | Briefly explain the approaches to develop algorithms. | 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 ... | 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.... | 1 |
1,655 | Briefly explain the approaches to develop algorithms. | 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 ... | To develop a algorithm:\n1.We firstly generate the problem statement;\n2.A problem solution is proposed;\n3.Asympotmatic analysis;\n4.Testing;\n\n | 1 |
1,656 | Briefly explain the approaches to develop algorithms. | 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 ... | 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. | 1 |
1,657 | Briefly explain the approaches to develop algorithms. | 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 ... | 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. | 1 |
1,659 | Briefly explain the approaches to develop algorithms. | 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 ... | 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 | 1 |
1,661 | Briefly explain the approaches to develop algorithms. | 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 ... | 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. | 1 |
1,662 | Briefly explain the approaches to develop algorithms. | 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 ... | algorithms should have optimal time complexity and space complexity and it should give the optimal solution . the algorithms should be efficient | 1 |
1,663 | Briefly explain the approaches to develop algorithms. | 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 ... | 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. | 1 |
1,664 | Briefly explain the approaches to develop algorithms. | 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 ... | 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. | 1.5 |
1,665 | Briefly explain the approaches to develop algorithms. | 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 ... | 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 | 1.5 |
1,666 | Briefly explain the approaches to develop algorithms. | 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 ... | 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 . | 1.5 |
1,667 | Briefly explain the approaches to develop algorithms. | 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 ... | 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. | 1.5 |
1,668 | Briefly explain the approaches to develop algorithms. | 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 ... | 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. | 2.5 |
1,669 | Briefly explain the approaches to develop algorithms. | 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 ... | 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. | 2 |
1,670 | Briefly explain the approaches to develop algorithms. | 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 ... | divide and conquer approach\nback and bound approach\nbacktracking approach\ngreedy approach\ndynamic programing | 2.5 |
1,671 | Briefly explain the approaches to develop algorithms. | 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 ... | 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. | 1.5 |
1,672 | Briefly explain the approaches to develop algorithms. | 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 ... | 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 p... | 1 |
1,673 | Briefly explain the approaches to develop algorithms. | 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 ... | 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 approa... | 2.5 |
1,674 | Briefly explain the approaches to develop algorithms. | 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 ... | An algorithm should have least time and space complexity. we constantly try to make algorithms that have lesser time complexity. | 1.5 |
1,675 | Briefly explain the approaches to develop algorithms. | 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 ... | There are multiple approaches to develop an algorithm like by optimsing the time complexity of algorithm and optimising the space somplexity of the algorithm. | 1.5 |
1,676 | Briefly explain the approaches to develop algorithms. | 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 ... | first we analyse the problem and then approach towards the solution | 1 |
1,677 | Briefly explain the approaches to develop algorithms. | 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 ... | first we can use brute force approach and then from there work on reducing its complexities | 1.5 |
1,678 | Briefly explain the approaches to develop algorithms. | 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 ... | 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 | 1.5 |
1,681 | Briefly explain the approaches to develop algorithms. | 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 ... | 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: ... | 2.5 |
1,682 | Briefly explain the approaches to develop algorithms. | 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 ... | approaches TO develop algorithms;\n1.using recurrence relation ->we obtain the recurrence relation \n2, guess approach -> we guess and then obtain time complexity\n | 2 |
1,684 | Briefly explain the approaches to develop algorithms. | 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 ... | 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 | 1 |
1,686 | Briefly explain the approaches to develop algorithms. | 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 ... | 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. | 0 |
1,687 | Briefly explain the approaches to develop algorithms. | 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 ... | concept of notation which helps in develop algorithm | 0 |
1,688 | Briefly explain the approaches to develop algorithms. | 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 ... | to develop the algorithm understand the problem statement break it into task perform each task separately optimism the algorithm | 1.5 |
1,689 | Briefly explain the approaches to develop algorithms. | 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 ... | Algorithms can be developed through several approaches wheather it be time approach or space approach. | 1 |
1,690 | Briefly explain the approaches to develop algorithms. | 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 ... | first we have to understand the problem then we have to find a perfect algorithm | 1 |
1,692 | Briefly explain the approaches to develop algorithms. | 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 ... | 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 | 1 |
1,693 | Briefly explain the approaches to develop algorithms. | 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 ... | 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 | 1 |
1,694 | Briefly explain the approaches to develop algorithms. | 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 ... | 1. Problem Statement\n2. Sources available\n3. Time efficiency\n4. Space efficiency | 1 |
1,695 | Briefly explain the approaches to develop algorithms. | 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 ... | 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. | 1 |
1,696 | Briefly explain the approaches to develop algorithms. | 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 ... | 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 | 1 |
1,697 | Briefly explain the approaches to develop algorithms. | 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 ... | 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 | 1 |
1,698 | Briefly explain the approaches to develop algorithms. | 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 ... | 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 | 1.5 |
1,699 | Briefly explain the approaches to develop algorithms. | 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 ... | 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 | 2 |
1,700 | Briefly explain the approaches to develop algorithms. | 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 ... | need to solve the problem\ntechnique which we will apply to solve it\nability to compare the problem with real word experiences.\n | 1 |
1,702 | Briefly explain the approaches to develop algorithms. | 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 ... | first the logical algorithm is written \nthen it is converted to pseudo code\nthen into languages like c++,java etc. | 0 |
1,703 | Briefly explain the approaches to develop algorithms. | 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 ... | 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 . | 1 |
1,704 | Briefly explain the approaches to develop algorithms. | 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 ... | 1getting the right approch the probelem using basic | 0 |
1,705 | Briefly explain the approaches to develop algorithms. | 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 ... | it depends of need ex greedy approaches dynamic approaches for optimization's | 2 |
1,706 | Briefly explain the approaches to develop algorithms. | 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 ... | greedy.(is the use of maximum optimization). | 1 |
1,707 | Briefly explain the approaches to develop algorithms. | 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 ... | na | 0 |
1,708 | Briefly explain the approaches to develop algorithms. | 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 ... | approach to develop algorithms:\n1. find the time complexity \n2..correct approach for the question\n3. result should be minimal | 1 |
1,709 | What are some examples of divide and conquer algorithms? | 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) | Longest Common Subsequence, Djikstra Algorithm,Recursion, FLoyd Warshall Algorithm, Hamiltonian Path, Knapsack. | 1 |
1,710 | What are some examples of divide and conquer algorithms? | 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) | examples of divide and conquer algorithms are genome sequencing, dictonary searching etc | 1 |
1,711 | What are some examples of divide and conquer algorithms? | 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) | 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 | 1 |
1,712 | What are some examples of divide and conquer algorithms? | 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) | 1) Merge Sort\n2) Binary Search\n3) Quick Sort\n4) Shortest distance between points in a Graph | 2.5 |
1,713 | What are some examples of divide and conquer algorithms? | 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) | Merge Sort\nQuick Sort\nPairwise shortest distance between two points | 2.5 |
1,714 | What are some examples of divide and conquer algorithms? | 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) | There are some examples of divide and conquer algorithms like Merge Sort ,Quick sort | 2.5 |
1,715 | What are some examples of divide and conquer algorithms? | 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) | examples of divide and conquer are binary searches and merge sort . \n | 2.5 |
1,716 | What are some examples of divide and conquer algorithms? | 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) | . quicksort.\n. mergesort\n. binary search | 2.5 |
1,717 | What are some examples of divide and conquer algorithms? | 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) | examples of divide and conquer algorithm are \n- Merge sort\n- Binary Search\n- Quicksort | 2.5 |
1,718 | What are some examples of divide and conquer algorithms? | 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) | 1. quick sort\n2. merge sort\n3. Strassen's algorithm | 2.5 |
1,719 | What are some examples of divide and conquer algorithms? | 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) | 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 | 2.5 |
1,720 | What are some examples of divide and conquer algorithms? | 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) | 1)Merge sort \n2)Quick sort \n3)closet pair path problem | 2.5 |
1,721 | What are some examples of divide and conquer algorithms? | 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) | Quick sort, merge sort, binary search | 2.5 |
1,722 | What are some examples of divide and conquer algorithms? | 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) | Merge and Quick Sort | 2.5 |
1,723 | What are some examples of divide and conquer algorithms? | 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) | examples of divide and conquer algorithms are :\n- quick sort | 2.5 |
1,724 | What are some examples of divide and conquer algorithms? | 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) | Merge Sort\n- Matrix Multiplication.\n | 2 |
1,725 | What are some examples of divide and conquer algorithms? | 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) | 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 | 2 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.