### CS6402  DAA Notes

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

CS6402 – DESIGN AND ANALYSIS OF ALGORITHMS

1.1 Introduction
An algorithm is a sequence of unambiguous instruction for solving a problem, for obtaining a required output for any legitimate input in a finite amount of time.
Definition
“Algorithmic is more than the branch of computer science. It is the core of computer science, and, in all fairness, can be said to be relevant it most of science, business and technology”
Understanding of Algorithm
An algorithm is a sequence of unambiguous instruction for solving a problem, for obtaining a required output for any legitimate input in a finite amount of time.

In most cases, selecting such a parameter is quite straightforward. For example, it will be the size of the list for problems of sorting, searching, finding the list’s smallest element, and most other problems dealing with lists. For the problem of evaluating a polynomial p(x) = a n x n + . . . + a 0 of degree n, it will be the polynomial’s degree or the number of its coefficients, which is larger by one than its degree

There are situations, of course, where the choice of a parameter indicating an input size does matter.

Example – computing the product of two n-by-n matrices.

There are two natural measures of size for this problem. The matrix order n. The total number of elements N in the matrices being multiplied. Since there is a simple formula relating these two measures, we can easily switch from one to the other, but the answer about an algorithm’s efficiency will be qualitatively different depending on which of the two measures we use

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