DSA

SYLLABUS

ALOGRITHMS:

1. Analysing Algorithm (TC & SC).
2. Asymptotic Notation.
3. Recursion.
   • Recurrence relation.
   • Recurrence relation Solving.
4. Divide & Conquer.
   • i. Maximum & Minimum.
   • ii. Binary Search.
   • iii. Merge Sort.
   • iv. Quick Sort.
   • v. Selection Prosedure.
   • vi. Countinus Maximum Subarray Sum.
5. Gready Technique.
   • i. KnapSack Problem.
   • ii. Single Source Shortest Path.
     • i. Dijkstra's Algorithm.
     • ii. Bellman-Ford Algorithm.
     • iii. BFT Algorithm.
   • iii. Minimum Cost Spanning Tree (MCST).
     • i. Prim's Algorithm.
     • ii. Kruskal's Algorithm.
   • iv. Job Sequencing with Deadlines.
   • v. Halfman Coding.
6. Dynamic Programming.
   • i. Fibonacci Series.
   • ii. Longest Common Subsequence (LCS).
   • iii. Matrix Chain Multiplication.
   • iv. 0/1 Knapsack Problem.
   • v. Sum of Subsets.
7. Some Algorithms.
   • i. Sum left out Algorithm.
   • ii. Graph Algorithms.
   • iii. Hashing Algorithm.

DATA STRUCTER: