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,498 | 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 is basically the basic logic applied in then question then develop the pseudo code required for the problem all the data structure to be used in that solution and then try to run the code with logic and data structure for all the test cases. | 0 |
1,500 | 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 and algorithm are space complexity based or time complexity based. for lowest space or time complexity possible, | 2.5 |
1,501 | 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 the algorithm is to take the input first then write base condition and then break main problem to sub-problems. | 2.5 |
1,502 | 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:\n1. First check that what kind of Data Structure can be use to solve the problem .\n2. Then develop the cases which can be use to solve the problem \n3. Find out that what kind of Time and Space complexity is perfect for the problem .\n4. Find out the base cases.\n5. Implement ... | 2.5 |
1,503 | 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 ... | Approached to develop algorithms are:\n1. First take input.\n2. divide the problem into sub problems.\n3. solve all the sub problems using same logic.\n4. Merge all the sub problems after solving them.\n5. Display the answer. | 1 |
1,504 | 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 analysed and the basic data structures and concepts are identified which will be definitely used. \nThen the logic is developed for which the lesser space and time is taken.\nfunctions are used and the final values returned.\n | 1 |
1,505 | 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 a brute force is thought upon the solution. It is the most basic solution which any problem can have, without worrying about any complexity.\nThe we try to break it in smaller problems and think solution for it and make recursive algorithm for the same.\nThen we analyze if there is repeatition of of any smaller... | 2 |
1,506 | 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 using Divide and conquer techniques. Greedy mechanisms, Dynamic Programming, backtracking concepts etc. | 2.5 |
1,507 | 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 step should always be to understand the problem first and then start to look out for the data structures you can use for the same and then accordingly calculating the time complexity of the approach. Always remember that the best algorithm is the one which is the fastest and covers all the use cases of the probl... | 2.5 |
1,508 | 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 ... | Our approach to develop an algorithm must be how to receive an optimal solution that also takes the minimum time and space.\nNow we can choose which one is more appropriate:\n-Divide and Conquer: To divide our problem in to subproblems then solve the subproblems and then eventually obtaining the required solution.\n-Ba... | 2.5 |
1,509 | 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 on the basis of their efficiency. i.e, based on their time , based on their space complexity etc\nthat is through dynamic programming or greedy approach etc. | 2.5 |
1,510 | 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 am algorithm are:\n1. Divide the problem into sub-problems. \n2. Define the input. \n3. Check if you can directly use any of the existing algorithms.\n4. Modify the existing algorithms to solve the given problems.\n5. Try to make the algorithms more optimized by using approaches of dynamic progra... | 2.5 |
1,511 | 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 many approaches to develop Algorithms:\nSome of the most popular approaches are:\n1) Divide and Conquer:\nin this technique we divide the current problem in multiple subproblems such that each sub problem is exactly same as big problem.\neg: Rat in a maze, n-queens, uses backtracking that comes under Divide a... | 2.5 |
1,512 | 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:\nDivide and conquer - dividing the problems into smaller problems and getting the solution\nGreedy algorithm - Checking all the possible outcomes of a given problem\nDynamic Programming - Finding the most optimum solution to the given problem using memory memorization. \nBacktr... | 2.5 |
1,513 | 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 we need to write down the problem we need to solve, then we see if that problem can be divided into smaller sub problems, then we find a solution to solve that problem in the least time, then we implement that solution into a code. | 2.5 |
1,514 | 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 write the problem, then divide it into sub-problems (if possible), then solve the sub problems to find an optimized solution, then merge the solutions to find the final solution. | 2.5 |
1,515 | 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 defined as the finite number of steps or sequence of operations required to solve a problem. To develop an algorithm we need to first check the user requirements, then design an algorithm as per the requirements. The algorithm should take a finite input and generate a finite output in the required amoun... | 2.5 |
1,516 | 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: We solve small problems and handle base case so recursion will solve bigger problem.\n2. Backtracking: here we try all possible combination and pick the best one.\n3. Greedy Approach: here we try to pick best solution at every step.\n4. Dynamic Programming - Try all possible solution and save the... | 2.5 |
1,517 | 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 ... | here are three commonly used approaches to develop algorithms −\nGreedy Approach − finding solution by choosing next best option\nDivide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently\nDynamic Programming − diving the problem to a minimum possible sub-problem a... | 2.5 |
1,518 | 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 ... | each algorithm is developed in a different manner, but the main focus goes like analyzing the algorithm, implementing a brute force stratergy first , then trying out a more subtle approach with much less time complexity considering various methods of algorithm forming like backtracking, divide and conquer, greedy appro... | 2.5 |
1,519 | 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 thinking a brute force approach to solve a problem. then optimizing the algorithm using various data structures and making changes in the approach to solve complex problem efficiently | 2.5 |
1,520 | 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 many common approaches such as brute force , greedy and dynamic programming to develop algorithms. Brute force is the simplest way in which apply any possible simple logic to solve the problem at hand. IN greedy approach we try to take the best possible root at each step which increases the possibility of get... | 2.5 |
1,521 | 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 look closely upon the problem statement and briefly understand the things asked\nthereafter we use different approached like divide and conquer or greedy or backtracking and many more to obtain the solution\nafter which the space and time complexities are compared to get the optimized solution of the given pro... | 2.5 |
1,522 | 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. Algorithm must give complete solution to a problem. \n2. The solution may or may not be optimal.\n3. Less Time consuming | 2.5 |
1,523 | 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)Waterfall approach\nDeveloping algorithms include understanding the problem, taking into consideration the space and time complexity, checking the feasibility of the problem, whether the algorithm is complete and optimal | 2.5 |
1,524 | 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 : we divide the problems in subproblems\n2)greedy : the first approach which hit mind first , it does not provide optimal solution\n3)dynamic programming : using recurssion we divide problem into subproblems which provide optimal solution | 2.5 |
1,525 | 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 analyze our requirements , and find the best algo for the problem which takes the least time and uses least amount of resources | 2.5 |
1,526 | 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 ... | \nAnalyze data\nObjectify need \nTime analysis \nSpace analysis\n | 2.5 |
1,527 | 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.first understand the problem properly\n2.apply the brute force approach \n3. Try to reduce the time and complexity and optimize it \n4. If its work that particular set of information then algorithm developed | 2.5 |
1,528 | 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 approach developing an algorithm \n1. we need to read and understand the problem carefully\n2. apply brute force for to problem first\n3. now see how we can optimize the solution \nwe can use different techniques like divide and conquer, backtracking, greedy etc. | 2.5 |
1,529 | 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 ... | recursive , divide and conquer, greedy, dynamic | 2.5 |
1,530 | 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 is coming up with a pattern with the knowledge of DS and attempting to use minimum space and complexity in order to form the most optimum algorithm | 2.5 |
1,531 | 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 algorithm is based on its efficiency to find the solution in minimum time while taking minimum space in memory of our system | 2 |
1,532 | 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 are to the develop of the algortihm:\nGREEDY APPROACH\nDYNAMIC APPROACH\nDEVIDE AND CONQUER APPROACH | 2.5 |
1,533 | 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 used first find all the possible ways and then check the complexity for the program so it can run in the least time possible | 2.5 |
1,534 | 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 divide and conquer which divides problem into smaller problems. Backtracking algorithms follow a particular way and if a solution is not found, backtracks and goes to another way. | 2.5 |
1,536 | 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 these day is to find the fastest way to search, sort, iterate through the data, for fast reponse time. | 2.5 |
1,538 | 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 firstly, we understand the problem and try to devise various ways using different test cases \nthen we implement a simple code using the algorithm that we've devised and then we workout on the pre designed algorithm and implement the one which is best suited with respect to our ... | 2.5 |
1,539 | 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 ... | Master's theorem | 2.5 |
1,540 | 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 ... | Following are the approaches to develop algorithms.\n->Greedy algo: Taking descision at every step\n->Dynamic Programming: Taking out best/efficient possible answer by framing a formula or method. | 2.5 |
1,541 | 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 developed depending on its use. Most algorithms are used to find the optimal result of of the problem like the search algorithms. They are very helpful in various fields and studies. | 2.5 |
1,542 | 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 the algorithm is finding the optimum and efficient solution of the problem | 2.5 |
1,544 | 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 algorithm should be time and space efficient. this means that the program shouldnt contain any unnecessary loops. predefined data structures take up a lot of space as well, so its better to take the input dynamically so that no space is wasted at all \n | 1 |
1,545 | 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 develop algorithm so that to get get the good or optimal approach for any problerm | 1 |
1,546 | 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 ... | Try to understand what the problem wants you to do\nFind a data structure for the given problem\nTry solving the problem with brute force\nTry to make your solution better by making efficient algorithms in terms of time and space complexity | 2.5 |
1,547 | 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 method:finds local optimal solution\ndynamic:stores the solution of the sub problem in dp[][] to provide efficiency by decreasing time\ndivide and conquer:divides the problem into sub problem until it cant be divided further and then solves each sub problem | 2.5 |
1,549 | 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 take a variable and develoop such that it takes the minimum time less space | 1 |
1,550 | 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 ... | . write the pseudo code \n. do dry run | 1 |
1,551 | 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 ... | define a solution to a problem\ncheck if the approach to the problem gives reliable and consistent solution | 1 |
1,554 | 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:\n | 2.5 |
1,555 | 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 is to by building logic to reach the goal in given time and space complexity. | 2.5 |
1,556 | 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 ... | While developing algorithms we take care of the time and space complexities and write a program which implements the logic satisfying these conditions | 2.5 |
1,557 | 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 is to make a certain code to takes less space and take less time to works. | 2.5 |
1,558 | 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 ... | development of algorithm can be done by first thinking of all possible cases and then finding some base case which will have a surely solutions to them without the help of other functions | 1 |
1,559 | 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 analyze and write a pseudo code that efficiently solving the problem in terms of time and space .we find this complexities with the help of recurrence functions and then we implement the algorithm.\nThese are the steps:\nAnalyzing and thinking a solution\nsolving (pseudo code)\nimplementation \n | 1 |
1,560 | 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 algorithm should must return a feasible output.\n | 1 |
1,563 | 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 several approaches like divide and conquer in which first we divide the problem in subpart and then merge them | 2.5 |
1,564 | 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 try the brute force approach to solve a problem. Then try try to optimize the solution by making use of different techniques like divide and conquer and greedy approach. We can use recursion. If we can see the there is scope for improving the space complexity and time complexity namely to reduce the number of re... | 2.5 |
1,565 | 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 can be to know how much work it does, to get the need of it\nto use the current data structure at correct place.\nto know the edge cases involved in developing algorithms\nto keep in mind about the complexity \n | 2 |
1,566 | 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 Algorithms we need to\n->Firstly Understand Ques Correctly\n->Develop the logic \n->Then think which Data Structure is most Suitable\n->then try to optimized the algorithm in terms of time and memory\n->Most Importantly our algorithms must have correct output of all test cases and edges test cases | 1 |
1,567 | 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 , brute force approach ,FIFO , LIFO etc. | 1 |
1,568 | 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 mainly the devide and step techniques. Divide the given problem into a set of subproblems. Solve every problem individualy recursively.Combine the solution of subproblems into a solution of the whole problem. | 2 |
1,569 | 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 ... | 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 | 1 |
1,571 | 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 ... | 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 | 2 |
1,572 | 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 we first need to know where that algorithm will fail and where will it apply. | 1 |
1,573 | 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 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. | 2 |
1,574 | 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 analyze the algo thoroughly and then optimize it according to the best space and time complexity found. | 2 |
1,575 | 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 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... | 2 |
1,576 | 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 includes-\nunderstand the algorithm\nanalyse it\nbreak down the algorithm\nwrite the pseudocode or flowcharts | 1 |
1,577 | 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 ... | 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 problema... | 1 |
1,578 | 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 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 \ | 2 |
1,579 | 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 ... | 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 ... | 2 |
1,580 | 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 ... | Main approaches are:\nGreedy method\nDynamic Programming\nBack Tracking \nLinear method \n | 1 |
1,581 | 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 ... | 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 solve... | 1 |
1,582 | 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 ... | Data structures can be used for collectively storing various data types together for solving a particular question. | 2 |
1,583 | 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 ... | 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. | 2 |
1,584 | 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 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 ... | 1 |
1,585 | 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 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 sol... | 2 |
1,586 | 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 of a problem can be developed by divide and conquer, backtracking. greedy or dynamic programming approaches. | 1 |
1,587 | 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\nBacktracking\nDivide and conquer\nDP\n | 2 |
1,588 | 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, 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. | 1 |
1,589 | 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 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 ... | 1 |
1,590 | 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 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. | 2 |
1,591 | 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 - 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... | 2 |
1,592 | 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 ... | 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 prob... | 1 |
1,593 | 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 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 ... | 1 |
1,594 | 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 :-\n1) Identify problem\n2) Identify data structure to use and their working\n3) Implement the algo\n4) Try to make it more efficient | 1 |
1,595 | 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 ... | Common Operations performed on data-structures are-\nSearching\nSorting\nInsertion\nDeletion | 1 |
1,596 | 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 developing the algorithms first you should have to make approach for solving the problem as | 2 |
1,598 | 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, | 1 |
1,599 | 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 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 | 2 |
1,600 | 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 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: prerioi... | 1 |
1,601 | 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 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 | 1 |
1,602 | 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 an algorithms are\n*)understanding the problem statement .\n*)understand the asymptotic notations such as desired time complexity and space complexity. | 1 |
1,604 | 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 ... | by writing pseudocode | 2 |
1,605 | 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 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. | 1 |
1,606 | 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 algorithms following approaches are taken-\n | 1 |
1,607 | 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 to \nfirst understand the problem \nfind put the | 1 |
1,608 | 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 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, dyn... | 1 |
1,609 | 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 problems into set of subproblems\n2.Solve every subproblem individually\n3.Combine the solutions to obtain solution for the original problem | 2 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.