CS8451 Important 16 mark Questions Design and Analysis Of Algorithms
CS8451 Important 16 mark Questions Design and Analysis Of Algorithms Regulation 2017 Anna University free download. Design and Analysis Of Algorithms Important Questions CS8451 pdf free download.
Sample CS8451 Important 16 mark Questions Design and Analysis Of Algorithms:
4. Discuss Fundamentals of the analysis of algorithm efficiency elaborately.
Algorithm‘s efficiency
Three notations
Analyze of efficiency of Mathematical Analysis of Recursive Algorithms
Analyze of efficiency of Mathematical Analysis of non-Recursive Algorithms
Analysis of algorithms means to investigate an algorithm’s efficiency with respect to
resources: running time and memory space. CS8451 Important 16 mark Questions Design and Analysis Of Algorithms
Time efficiency: how fast an algorithm runs.
Space efficiency: the space an algorithm requires.
Measuring an input‘s size
Measuring running time
Orders of growth (of the algorithm‘s efficiency function)
Worst-base, best-case and average efficiency
Measuring Input Sizes
Efficiency is defined as a function of input size.
Input size depends on the problem.
Example 1, what is the input size of the problem of sorting n numbers? CS8451 Important 16 mark Questions Design and Analysis Of Algorithms
Example 2, what is the input size of adding two n by n matrices?
Units for Measuring Running Time
Measure the running time using standard unit of time measurements,
such as seconds, minutes? CS8451 Important 16 mark Questions Design and Analysis Of Algorithms
Depends on the speed of the computer.
count the number of times each of an algorithm‘s operations is
executed.
Difficult and unnecessary
count the number of times an algorithm‘s basic operation is executed.
Basic operation: the most important operation of the algorithm, the
operation contributing the most to the total running time.
For example, the basic operation is usually the most time-consuming CS8451 Important 16 mark Questions Design and Analysis Of Algorithms
operation in the algorithm‘s innermost loop.
Orders of Growth
consider only the leading term of a formula
| Subject name | Design and Analysis Of Algorithms |
| Short Name | DAA |
| Semester | 4 |
| Subject Code | CS8451 |
| Regulation | 2017 regulation |
CS8451 Design and Analysis Of Algorithms Important 16 mark Questions Click Here To Download
CS8451 Design and Analysis Of Algorithms Important 2 mark Questions
CS8451 Design and Analysis Of Algorithms Syllabus
CS8451 Design and Analysis Of Algorithms Notes
CS8451 Design and Analysis Of Algorithms Question Bank