Categories
Important question

CS8451 Important Questions Design and Analysis Of Algorithms Regulation 2017 Anna University

CS8451 Important Questions Design and Analysis Of Algorithms

CS8451 Important 2 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 Questions Design and Analysis Of Algorithms:

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.
o Understand the problem
o Decide onComputational DeviceExact Vs Approximate Algorithms
o Algorithm Design Techniques
o Design an algorithms
o Prove Correctness
o Analyze the Algori thm
o Code the Algorithm CS8451 Important Questions Design and Analysis Of Algorithms
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? CS8451 Important Questions Design and Analysis Of Algorithms
• 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? CS8451 Important Questions Design and Analysis Of Algorithms
Sorting algorithm is rearrange the items of given list descending/ascending order. Sorting
algorithms classified into
• Stable Sorting Algorithm
• Non-Stable Algorithm
9.What is Searching Problem?
Finding a given value, called search key given set. Searching Algorithms needs more CS8451 Important Questions Design and Analysis Of Algorithms
memory space and sorted array.

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 Questions Click Here To Download

CS8451 Design and Analysis Of Algorithms Important 16 mark Questions


CS8451 Design and Analysis Of Algorithms Syllabus


CS8451 Design and Analysis Of Algorithms Notes


CS8451 Design and Analysis Of Algorithms Question Bank


CS8451 Design and Analysis Of Algorithms Question Paper

 

Leave a Reply

Your email address will not be published. Required fields are marked *