NOORUL ISLAM COLLEGE OF ENGINEERINGDEPARTMENT OF COMPUTER SCIENCE AND ENGINEERINGCS1151 DATA STRUCTURESTWO MARKS QUESTIONS AND ANSWERSUNIT I1.What is an Algorithm?An algorithm is clearly specified set of simple instructions to be followed tosolve a problem. The algorithm forms a base for program.2.What are the properties of an Algorithm?
Takes zero or more inputs
Results in one or more outputs
All operations are carried out in a finite time
Efficient and flexible
Should be concise and compact to facilitate verification of theircorrectness.3.Define Program?It is an instruction and it is written according to the instructions, which is givenin the algorithm.4. What is Complexity analysis?It is the analysis of the amount of memory and time an algorithm requires tocompletion.There are two types of ComplexitySpace Complexity and Time Complexity5. Explain the performance analysis of the algorithm?The analysis of the performance of an algorithm based on specification iscalled performance analysis. It is loosely divided intoa. Priori estimatesb. Posterior Testing6. Explain Space complexity?Space complexity of an algorithm is the amount of memory it needs to run tocompletion.7. Explain Time complexity?Time complexity is the amount of computer time an algorithm requires to runto completion.8. List out the components that are used for space complexity?a. Instruction Spaceb. Environment Stackc. Data Space.9. What do asymptotic notation means?Asymptotic notations are terminology that is introduced to enable us to makemeaningful statements about the time and space complexity of an algorithm.The different notations areBig – Oh notationOmega notationTheta notation.10. Define Efficiency of an algorithm?It denotes the rate at which an algorithm solves a problem of size n. It ismeasured by the amount of resources it uses, the time and the space.