### CS6402  DAA 2marks-16marks

Anna University Regulation 2013 Computer Science Engineering (CSE) CS6402  DAA 2marks & 16marks for all 5 units are provided below. Download link for CSE 4th SEM CS6402  DESIGN AND ANALYSIS OF ALGORITHMS Short answers, Question Bank are listed down for students to make perfect utilization and score maximum marks with our study materials.

CS6402   DESIGN AND ANALYSIS OF ALGORITHMS QUESTION BANK

UNIT-I 2-marks

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

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

9.What is Searching Problem? Finding a given value, called search key given set. Searching Algorithms needs more memory space and sorted array.

Finding a given value, called search key given set. Searching Algorithms needs more memory space and sorted array.

10. What is Graph Problem?

Graph is a collection of dg s and vertices. G=(V,E). For e.g. Traversal Algorithms, Shortest Path Algorithm, Graph Colouring Problem

11. What is Combinatorial Problem.

This problem that ask to find combinatorial object such as permutations, combinations or a subset. Combinatorial problems are most difficult to solve. For eg Travelling sales man problem

12. Differentiate Time Efficiency and Space Efficiency?

Time Efficiency measured by counting the number of times the algorithms basic operation is executed. Space Efficiency is measured by counting the number of extra memory units consumed by the algorithm.

If you require any other notes/study materials, you can comment in the below section.