Today we are with the ADA hand written Notes specially for the Baddi University students.You need adobe reader to open these files as they are in PDF format. You can download Adobe reader from adobe website OR by searching in the google. These notes are written by our experts special for back bencher students who never make notes or attend classes.

What we have covered in these Notes-
UNIT 1-
Introductory Concepts: The notation of algorithm, fundamentals of algorithmic problem solving, analyzing algorithms, Review of fundamental data structures (Arrays, Stacks, Queue, Linked list).

Fundamentals of analysis of algorithms efficiency: Asymptotic notation and standard efficiency classes, mathematical analysis of recursive and non-recursive algorithms

Divide and Conquer: General Method, Merge sort, Quick sort, Selection sort.

Sorting in Linear time: Counting sort, Radix sort and Bucket sort.

Search: Linear Search, Binary search Unit-II                                                                                  Graphs: Review of Graphs, Representation of Graphs, Breadth-first search, Depth-first Search, Topological Sort, Strongly connected Components.

Trees: Review of Trees, Minimum spanning tree, Kruskal and Prim’s algorithms, Single source shortest paths, Bellaman-Ford algorithm, Single source shortest path in directed acyclic graphs, Dijkstra’s algorithm, All pairs shortest paths, Shortest paths and matrix multiplication, Floyd-Warshall algorithm, Johnson’s algorithm

Unit-III                                                                                                          Dynamic Programming: Introduction, Elements of Dynamic Programming, Matrix Chain Multiplication, Longest Common Subsequence, Optimal binary search tree, Knapsack problem, the Travelling sales person problem.

Greedy Method: An activity selection problem, Elements of Greedy Programming, Huffmann codes, A task scheduling problem.

Backtracking and Branch and Bound: The 8 Queens problem, Graph coloring, Hamiltonian cycles, Least Cost Search(LC), The 15 puzzle, Bounding, fifo branch and bound, LC branch and bound.

Unit-IV Maximum Flow: Flow Networks, The Ford-Fulkerson method, Maximum Bipartite matching. 1. Rohit

Thanks brother helped me a lot

2. Manasa.G.M

Thank you

3. Nidhi

Thanku ….supb notes…easy to understand