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
|
|---|---|---|---|---|
203 | Why we need to do algorithm analysis? | A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm. | we use algorith for making problem easy and less time to doing it. | 1.5 |
204 | Why we need to do algorithm analysis? | A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm. | to find out the algorithms that are more efficient in terms of the occupied space and running time (considering, multiple solutions are available for the same problem). | 2.5 |
205 | Why we need to do algorithm analysis? | A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm. | Every algorithm take certain amount of time, hence algorithm analysis is important to check whether a certain algorithm can be performed in less time or not. \nMore than time we also want to check and reduce the space complexity of the algorithm. Hence to make an algorithm works efficiently we want to reduce the time and space complexity. | 2.5 |
206 | Why we need to do algorithm analysis? | A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm. | To obtain most optimized solution for a given problem | 2.5 |
207 | Why we need to do algorithm analysis? | A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm. | To obtain the most optimal solution for a problem which is most time efficient and space efficient. | 2.5 |
208 | Why we need to do algorithm analysis? | A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm. | We need to do Algorithm Analysis because it helps us to know how efficient our program is if we do analysis of our algorithm it may help us to generate efficient time and space complexity for our program | 2.5 |
209 | Why we need to do algorithm analysis? | A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm. | we need to do algorithm analysis because accidental use of insufficient or wrong algorithm can effect the system | 2.5 |
210 | Why we need to do algorithm analysis? | A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm. | We need algorithm analysis to make our code efficient and less time consuming. There are different ways to achieve a particular end result but certain defined algorithms make them more efficient and provide better end user experience. | 2.5 |
211 | Why we need to do algorithm analysis? | A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm. | We need algorithm analysis in order to optimize the code in terms of its time complexity and space complexity so that the algorithm runs in a more efficient way. | 1.5 |
212 | Why we need to do algorithm analysis? | A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm. | we need algorithm analysis so that we can check the utility of an algorithm in a particular problem, that how much is it useful. these are done by analysing the space and time complexity of the algorithm | 2.5 |
213 | Why we need to do algorithm analysis? | A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm. | we need algorithm analysis to know the efficiency of the algorithm on the basis of different parameters such as time and space. this analysis is used to compare different algorithm and see which algorithm is best suited for the given task and its requirement. | 2.5 |
214 | Why we need to do algorithm analysis? | A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm. | We need algorithm analysis to understand the proper functioning of the program we intend to develop. Algorithm analysis also gives the ability to use the most efficient algorithm keeping the desired requirements intact to give best system performance. | 2.5 |
215 | Why we need to do algorithm analysis? | A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm. | Algorithm analysis defines how efficient an algorithm or the program is. It describes the least and max time and space taken by the program. | 2.5 |
216 | Why we need to do algorithm analysis? | A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm. | we need algorithm to make our code very efficent and also take less timing ,take less memory in algorithm we can solve one question in many ways .\n | 2.5 |
217 | Why we need to do algorithm analysis? | A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm. | We need algorithm analysis so that we can figure out the best and most optimised algorithm to solve our problem. Each algorithm takes certain space(memory) and certain running time. Because we want to complete our work using minimal memory and time, algorithm analysis is essential. | 2.5 |
218 | Why we need to do algorithm analysis? | A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm. | we need to do algorithm analysis to determine the running time and space time complexity of the algorithm | 2.5 |
219 | Why we need to do algorithm analysis? | A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm. | it is important because the accidental use of an inefficient algorithm can be effect system performance | 2.5 |
220 | Why we need to do algorithm analysis? | A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm. | we need algorithm analysis to find the best approach to a particular type of problems statements. | 2.5 |
221 | Why we need to do algorithm analysis? | A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm. | We need algorithm analysis in order to determine the time and space complexity of the algorithm and to know when the algorithm is taking the best time and when it is taking worst.\nIt also tell us how much space we need in order to implement that algorithm. | 2.5 |
222 | Why we need to do algorithm analysis? | A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm. | To prepare a blueprint before the execution of actual program and to generalize a problem statement , we need to do algorithm analysis. | 2.5 |
223 | Why we need to do algorithm analysis? | A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm. | We need to do algorithm analysis because it helps us to understand the process of any algorithm step by step to understand the time complexity of any problem. | 2 |
224 | Why we need to do algorithm analysis? | A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm. | we need to do algorithm analysis because to optimism \n the code and save the runtime time complexity and space in the code | 2.5 |
225 | Why we need to do algorithm analysis? | A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm. | Algorithm analysis allows us to create a preview of the working of the algorithm thus determining the time and space complexity beforehand as a rough sketch and also if the algorithm is functioning properly and as desired or not. | 2.5 |
226 | Why we need to do algorithm analysis? | A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm. | we need algorithm analysis to find there running time complexity and space complexity | 2.5 |
227 | Why we need to do algorithm analysis? | A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm. | Algorithm analysis is use to give a basic structure to program or precise the code. | 1 |
228 | Why we need to do algorithm analysis? | A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm. | we need to do algorithm analysis to know the time and space complexity of algorithm and also find the best way to solve the problem. W analyze the algorithm to find its benefits and drawbacks. of used algorithm. | 2.5 |
229 | Why we need to do algorithm analysis? | A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm. | we need to do analysis of algorithm in order to find efficient solutionn as per given complexity | 1.5 |
230 | Why we need to do algorithm analysis? | A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm. | We need algorithm analysis for performing specific task through best algorithm in order to find optimal algorithm we compare and imply changes in specific algorithm to achieve optimal algorithm in terms of space and time complexity. | 1 |
231 | Why we need to do algorithm analysis? | A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm. | we use algorithm analysis so we can shorten the time complexity and space complexity of a particular code. So to save the cost of computing in the future. | 1 |
232 | Why we need to do algorithm analysis? | A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm. | algorithm analysis is needed to know about the program efficiently and acknowledge the complexity and details about the problem, to provide the solution efficiently. | 1 |
233 | Why we need to do algorithm analysis? | A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm. | we need to do algorithm analysis in order to practice the coding for program for the given problem | 0 |
234 | Why we need to do algorithm analysis? | A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm. | We need to do algorithm analysis to get an idea of and determine which algorithm would take the most optimal amount of time and memory space. We do this because , both time and memory are limited in nature and using it efficiently hence becomes important for the developer | 2.5 |
235 | Why we need to do algorithm analysis? | A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm. | We need to do algorithm analysis to solve the problem statement into sub problems. | 0 |
236 | Why we need to do algorithm analysis? | A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm. | it is because by algorithm analysis , we will get to know what is the procedure and approach that we have applied to solve particular problem.\nbasically a step by step approach towards given problem. | 0.5 |
237 | Why we need to do algorithm analysis? | A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm. | we use algorithm analysis to solve multiple set of problem by the methodof travelling salesman problem , coin change etc. | 0 |
238 | Why we need to do algorithm analysis? | A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm. | we need to do algorithm analysis mainly to find out about their time and space complexity.\nspace complexity is the memory/storage used up by the algorithm.\ntime complexity is the time taken by the algorithm to complete. | 2.5 |
239 | Why we need to do algorithm analysis? | A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm. | we need algo analysis to optimize the the performance of our system for getting a desirable output. | 0 |
240 | Why we need to do algorithm analysis? | A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm. | Algorithm analysis helps us keep in track with the time and space efficiency of our code. | 1 |
241 | Why we need to do algorithm analysis? | A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm. | because analysis is need time min and maxing time optimization's and storage optimization or resource optimization | 1.5 |
242 | Why we need to do algorithm analysis? | A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm. | find easy method to the problems. | 0 |
243 | Why we need to do algorithm analysis? | A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm. | we need algorithms for solving day to day problems like traveling salesman problem ,coinage problem etc and have a better understanding about data structures | 0 |
244 | Why we need to do algorithm analysis? | A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm. | we need to do algorithms analysis to determine the appropriate way to deal with the problems given. | 2 |
245 | What are the criteria of algorithm analysis? | An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm. | We determine the efficiency of an algorithm on the basis of it's time complexity and space complexity. | 2.5 |
246 | What are the criteria of algorithm analysis? | An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm. | BigOh(theta), bigoh(omega), smalloh(theta)\nasymptotic analysis | 1.5 |
247 | What are the criteria of algorithm analysis? | An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm. | its input should be given , output should be specified | 1.5 |
248 | What are the criteria of algorithm analysis? | An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm. | There are two basic criteria for algorithm analysis: 1) Time Complexity; 2) Space Complexity. Time complexity measures the amount of time taken by a particular algorithm, whereas space complexity measures the space taken by the data structures used in the algorithm | 2.5 |
249 | What are the criteria of algorithm analysis? | An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm. | We consider time complexity, space complexity and the various data structures that are required with a particular approach. In time complexity we check how the time taken by the algorithm changes with the size of the input data. In space complexity we check how much space is used by the algorithm to store values and how it uses the stack memory. | 2.5 |
250 | What are the criteria of algorithm analysis? | An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm. | There are criteria for algorithm analysis like time and space.\nWe tried to find algorithm complexity like in best ,worst and average case .\n | 2.5 |
251 | What are the criteria of algorithm analysis? | An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm. | all algorithm must satisfy the following criteria :\n zero or more input values .\none or more output values .\n clear and unambiguous instructions . | 1.5 |
252 | What are the criteria of algorithm analysis? | An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm. | Criteria of algorithm is time and space. | 2.5 |
253 | What are the criteria of algorithm analysis? | An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm. | Criteria for algorithm analysis is that the algorithm should do the required operation in minimum time and space . | 2.5 |
254 | What are the criteria of algorithm analysis? | An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm. | 1. understand and analyze the program carefully\n2. work on how to approach the program in a particular way\n3. find out the data structures which would execute the code in the most efficient way\n4. combine your approach along with the data structures to develop the code | 1.5 |
255 | What are the criteria of algorithm analysis? | An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm. | Criteria of given problem is-\n1. study the given problem and to analyze it .\n2.prepare a approach for the given problem.\n3.find the data structure which is most suitable for the given problem.\n4.write your approach . | 1.5 |
256 | What are the criteria of algorithm analysis? | An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm. | The criteria's are :-\n1) Time complexity\n2) Space complexity \n3) Optimized solution approach\n4) Optimum answers | 2.5 |
257 | What are the criteria of algorithm analysis? | An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm. | First is to understand the problem, and generate the basic idea nd solution for it.\nWriting the solution an ideology in statements and then implementing it through code. | 1.5 |
258 | What are the criteria of algorithm analysis? | An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm. | We judge any algorithm based on the amount of time it takes to execute a task and the amount of space it requires to do the same. Thus the TIME and SPACE COMPLEXITY are the two criteria. | 2.5 |
259 | What are the criteria of algorithm analysis? | An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm. | following are the criteria for algorithm analysis:\n-time complexity\n-space complexity | 2.5 |
260 | What are the criteria of algorithm analysis? | An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm. | Space and Time Complexity. | 2.5 |
261 | What are the criteria of algorithm analysis? | An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm. | 1. start by first analyzing the loops since the loops take the maximum time \n2. try to reduce the number of approximations you take\n3. don't leave out any piece of code while analysis\n4. | 2 |
262 | What are the criteria of algorithm analysis? | An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm. | The criteria of algorithm analysis are as follows:-\n1. Code must compile and run successfully.\n2. We must know all the basic technical terms and procedure of calculating it. | 1.5 |
263 | What are the criteria of algorithm analysis? | An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm. | Algorithms can be detected using the space complexity and time complexity ,whether it covers all the cases in best efficient manner.\nthe shortness of code also helps to reduce cache | 2.5 |
264 | What are the criteria of algorithm analysis? | An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm. | Criteria of algorithm analysis are time and space complexity | 2.5 |
267 | What are the criteria of algorithm analysis? | An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm. | The criteria for algorithm analysis is to check time complexities,space compllexities ,to check the optimisation and the algorithm is meeting the desired condition. | 2.5 |
268 | What are the criteria of algorithm analysis? | An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm. | Algorithms that give us the solution in minimum time and acquire minimum space are better for our use. Hence, algorithms with less space and time complexity are considered more useful over those with high time complexity or space complexity. | 2.5 |
269 | What are the criteria of algorithm analysis? | An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm. | Time complexity , space complexity , optimised solution | 2.5 |
270 | What are the criteria of algorithm analysis? | An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm. | Time complexity, Space complexity | 2.5 |
271 | What are the criteria of algorithm analysis? | An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm. | The algorithm should | 0 |
272 | What are the criteria of algorithm analysis? | An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm. | WE need to find an optimal solution to the given problem and use the least time and space to implement our solution. This leads to finding an efficient approach. | 2.5 |
273 | What are the criteria of algorithm analysis? | An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm. | algorithm are analyzed on the bases of : \n1) Time complexity\n2) space complexity\n3) its accuracy \n4) its efficiency. | 2.5 |
274 | What are the criteria of algorithm analysis? | An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm. | The criteria of algorithm analysis are time complexity and space complexity. | 2.5 |
275 | What are the criteria of algorithm analysis? | An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm. | time complexity\nspace complexity | 2.5 |
276 | What are the criteria of algorithm analysis? | An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm. | The basic criteria is :\n1) time complexity\n2) space requirement\n3)time require to provide output (suppose we design an algorithm that is providing output in 2 days then I don't think this is a good algorithm. we always focus on providing output in lesser time ) | 2.5 |
277 | What are the criteria of algorithm analysis? | An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm. | algorithm analysis is done on majorly two basis :-\n1) in terms of time :- time complexity.\n2) in terms of space :- space complexity\n | 2.5 |
278 | What are the criteria of algorithm analysis? | An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm. | time complexity\nspace complexity | 2.5 |
279 | What are the criteria of algorithm analysis? | An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm. | The criteria of Algorithm is \n1. Best Time complexity\n2. Space Complexity\n | 2.5 |
280 | What are the criteria of algorithm analysis? | An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm. | The criteria for algorithm analysis is that while analyzing, we should focus on wither reducing the time complexity or the space complexity. | 2.5 |
281 | What are the criteria of algorithm analysis? | An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm. | the criteria of algorithm analysis is its efficiency , time complexity and space complexity. | 2.5 |
282 | What are the criteria of algorithm analysis? | An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm. | The criteria of Algorithm analysis is Time and Space complexity. | 2.5 |
283 | What are the criteria of algorithm analysis? | An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm. | there are two criteria of algorithm analysis: \n1. Time complexity. \n2. Space complexity | 2.5 |
284 | What are the criteria of algorithm analysis? | An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm. | algorithms are analysed on the basis of space and time complexities. A good algorithm uses less time and space combination. | 2.5 |
285 | What are the criteria of algorithm analysis? | An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm. | Algorithms are analyzed by checking time and space complexities. It is in terms of the variables (for example n, where n is the length of the given problem). | 2.5 |
286 | What are the criteria of algorithm analysis? | An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm. | The criteria of Algorithm analysis lies with :\n1) Amount of time required - Few algorithms require constant time while some take exponential time. The prior takes less time , hence more efficient.\n2)Space consumed - Few Algorithms require more space while others take constant space. The latter works more efficiently in comparison as they allow space for other algorithm to work simultaneously accessing the remaining spaces. | 2.5 |
287 | What are the criteria of algorithm analysis? | An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm. | While analyzing the algorithm, you should take care of the time complexity, efficiency, | 2.5 |
288 | What are the criteria of algorithm analysis? | An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm. | Criteria of Algorithm Analysis:\n- through which do we receive an optimal solution\n- less time and space complexity\n | 2.5 |
289 | What are the criteria of algorithm analysis? | An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm. | There are three different criteria for the algorithm analysis:\n(i)Time basis\n(ii)Space complexity\n(iii)consistency | 2.5 |
290 | What are the criteria of algorithm analysis? | An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm. | Criteria for algorithm analysis:\n1. Time complexity\n2. Space complexity | 2.5 |
291 | What are the criteria of algorithm analysis? | An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm. | Criteria in order to analyse a Algorithm are as follow:\nTime Complexity, Space complexity. | 2.5 |
292 | What are the criteria of algorithm analysis? | An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm. | The criteria of algorithm analysis is that the program must be executed within minimum time and space complexity.\nThe program should be most optimum one in respect of time and space complexity. | 2.5 |
293 | What are the criteria of algorithm analysis? | An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm. | The basic criteria of algorithm analysis are: time should be minimum\n space should be minimum\n program should achieve the given task | 2.5 |
294 | What are the criteria of algorithm analysis? | An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm. | The criteria of algorithm analysis is that the time taken should be minimum and space complexity should be minimized. | 2.5 |
295 | What are the criteria of algorithm analysis? | An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm. | Algorithm analysis has following criteria: \nIt should be time and space efficient i.e it should be less time and space consuming. \nIt should take a finite input and then generate a finite output.\nIt should not produce infinite output.\nIt should always produce the desired output in a finite amount of time. \nIt should be language independent as well. | 2.5 |
296 | What are the criteria of algorithm analysis? | An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm. | Algorithm should take finite time to complete,\nit should take finite space\nit should take finite input from user and\nshould return finite output. | 2.5 |
297 | What are the criteria of algorithm analysis? | An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm. | An algorithm is a finite set of instructions that, if followed, accomplishes a particular task. \nAll algorithms must satisfy the following criteria:\nInput. An algorithm has zero or more inputs, taken from a specified set of objects.\nOutput. An algorithm has one or more outputs, which have a specified relation to the inputs.\nDefiniteness. Each step must be precisely defined; Each instruction is clear and \nunambiguous.\nFiniteness. | 2 |
298 | What are the criteria of algorithm analysis? | An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm. | the algorithm should have zero or more well-defined inputs. | 1 |
299 | What are the criteria of algorithm analysis? | An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm. | the criteria of algorithm analysis is time and space complexity. The algorithm having least time and space complexity is fastest and most efficient. | 2.5 |
300 | What are the criteria of algorithm analysis? | An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm. | There are two criteria of algorithm analysis - time complexity and space complexity. Time complexity refers to the amount of the the computations take in an algorithm whereas space complexity refers to the total memory which all the data structures in an algorithm occupies during it's execution. | 2.5 |
301 | What are the criteria of algorithm analysis? | An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm. | getting the optimal solution for a problem where by the solution obtained is optimized in time and space complexities,\nthereafter for some approached like greedy, the solution may or may not be optimized but it is simpler to understand an goes with the flow | 2.5 |
302 | What are the criteria of algorithm analysis? | An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm. | Firstly, the algorithm is written to get the solution of a particular problem. Also check if the solution we get is complete and optimal. \nSecond step is to find the time required for each step and then summing them up to find time complexity. \nThird step is to find how much space the algorithm takes to solve and finding the space complexity. \nOn these basis, we analysis if the algorithm is effective or not. | 2.5 |
303 | What are the criteria of algorithm analysis? | An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm. | Algorithm analysis include following parameters:\nTime complexity\nSpace complexity\nInplace or not\nStable algorithm or not\netc. | 2.5 |
304 | What are the criteria of algorithm analysis? | An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm. | 1)feasibility\n2)optimality | 1 |