Design and Analysis of Algorithms (DAA) Notes can be easily downloaded from EduTechLearners in PDF format. The special in these notes is that these are handwritten notes made by some expert student in simple and easy language covering diagrams and configurations. These notes cover the whole syllabus of the B.tech (3rd Year) Students with computer Science Stream.
These notes will provide immense knowledge of algorithms which are mainly asked in an interview also for placements in MNCs. It will definitely help us in getting good marks also and this subject is considered as one of the most important subjects for the Computer Science B.tech Students.
The notes are divided into eight different units. The particular units covers following topics:-
UNIT-1: INTRODUCTION: Notion of Algorithm, Review of Asymptotic Notations, Mathematical Analysis of Non-Recursive and Recursive Algorithms. Brute Force Approaches, Introduction, Selection Sort and Bubble Sort, Sequential Search and Brute Force String Matching.
UNIT-2: DIVIDE AND CONQUER: Divide and Conquer: General Method, Defective Chess Board, Binary Search, Merge Sort, Quick Sort and its performance.
UNIT-3: THE GREEDY METHOD: The General Method, Knapsack Problem, Job Sequencing with Dep and lines, Minimum-Cost Spanning Trees: Prim’sAlgorithm, Kruskal’s Algorithm; Single Source Shortest Paths.
UNIT-4: DYNAMIC PROGRAMMING: The General Method, Warshall’s Algorithm, Floyd’s Algorithm for the All-Pairs Shortest Paths Problem, Single-Source Shortest Paths: General Weights, 0/1 Knapsack, The Traveling Salesperson problem.
UNIT-5: DECREASE-AND-CONQUER APPROACHES, SPACE-TIMETRADEOFFS: Decrease-and-Conquer Approaches: Introduction, Insertion Sort, Depth First Search and Breadth First Search, Topological Sorting Space-Time Tradeoffs: Introduction, Sorting by Counting, Input Enhancement in String Matching.
UNIT-6: LIMITATIONS OF ALGORITHMIC POWER AND COPING WITH THEM: Lower-Bound Arguments, Decision Trees, P, NP, and NP-Complete Problems, Challenges of Numerical Algorithms.
UNIT-7: COPING WITH LIMITATIONS OF ALGORITHMIC POWER: Backtracking: n – Queens problem, Hamiltonian Circuit Problem, Subset –Sum Problem.Branch-and-Bound: Assignment Problem, Knapsack Problem, Traveling Salesperson Problem.Approximation Algorithms for NP-Hard Problems – Traveling Salesperson Problem, Knapsack Problem.
UNIT-8: PRAM ALGORITHMS: Introduction, Computational Model, Parallel Algorithms for Prefix Computation, List Ranking, and Graph Problems.
Links to other Lecture Notes:-
Contribute to EduTechLearners:-
Please write comments if you want to share more information regarding the above notes. If you want some more notes/books on any of the topics please mail to us or comment below. We will provide you as soon as possible and if you want your’s notes to be published on our site then feel free to contribute on EduTechLearners or email your content to firstname.lastname@example.org (The contents will be published by your Name).