CS6402 Important Questions Design and Analysis of Algorithms
CS6402 Important Questions Design and Analysis of Algorithms Regulation 2013 Anna University free download. Design and Analysis of Algorithms Important Questions pdf free download.
Sample CS6402 Important Questions:
1. Define Algorithm.
An algorithm is a sequence of unambiguous instructions for solving a problem in a finite amount of time.
2.Write a short note on Algorithm Design and Analysis of Process.
Understand the problem
Decide onComputational DeviceExact Vs Approximate Algorithms
Algorithm Design Techniques
Design an algorithms
Prove Correctness
Analyze the Algori thm
Code the Algorithm
3. What are the 2 kinds of Algorithm Efficiency Time Efficiency-How fast your algorithm runs?
Space Efficiency-How much extra memory your algorithm needs?
4. How can you specify Algorithms?
Algorithms can be specified natural language or pseudo code.
5. What is Pseudo Code?
Pseudo Code is a mixture of Natural Language and Programming Language Constructs such as functions, loops, decision making statements..etc
6. What are the Important Problem Types?
• Sorting
• Searching
• String Processing
• Graph Problem
• Combinatorial Problem
• Geometric Problem
• Numerical Problem
7.How can you Classify Algorithms
Among several ways to classify algorithms, the 2 principal alternatives are
• To group algorithms according to types of problem they solve com
• To group algorithms according to underlying design techniques they are based upon
8. What is Sorting Problem?
Sorting algorithm is rearrange the items of given list descending/ascending order. Sorting
algorithms classified into
• Stable Sorting Algorithm
• Non-Stable Algorithm
| Subject Name | Design and Analysis of Algorithms |
| Subject code | CS6402 |
| Regulation | 2013 |
CS6402 Important Questions click here to download
CS6402 Syllabus click here
Design and Analysis of Algorithms Notes click here
CS6402 Question Bank click here