# Aktu Design and Analysis of Algorithm (KCS-503) Btech Syllabus

Learn about the AKTU B.Tech syllabus for Design and Analysis of Algorithms, which examines the concepts of complexity analysis, optimisation, and algorithmic design. Make use of effective problem-solving strategies.

```Dudes 🤔.. You want more useful details regarding this subject. Please keep in mind this as well.

Important Questions For Design and Analysis of Algorithm:
* Aktu Quantum          * B.tech-Syllabus
* Circulars                     * B.tech AKTU RESULT
* Btech 3rd Year           * Aktu Solved Question Paper```

## UNIT-1: INTRODUCTION

• Algorithms,
• Analyzing Algorithms,
• Complexity of Algorithms,
• Growth of Functions,
• Performance Measurements,
• Sorting and Order Statistics
• Shell Sort,
• Quick Sort,
• Merge Sort, Heap Sort,
• Comparison of Sorting Algorithms,
• Sorting in Linear Time.

## UNIT-2: ADVANCED DATA STRUCTURE

• Red-Black Trees,
• B  Trees,
• Binomial Heaps,
• Fibonacci Heaps,
• Tries,
• Skip List.

## UNIT-3: GRAPH ALGORITHMS

• Divide and Conquer with Examples Such as Sorting,
• Matrix Multiplication,
• Convex Hull and Searching.
• Greedy Methods with Examples Such as Optimal Reliability Allocation,
• Knapsack,
• Minimum Spanning Trees
• Prim’s and Kruskal’s Algorithms,
• Single Source Shortest Paths
• Dijkstra’s and Bellman Ford Algorithms.

## UNIT-4: DYNAMIC PROGRAMMING

• Dynamic Programming with Examples Such as Knapsack.
• All Pair Shortest Paths
• Warshal’s and Floyd’s Algorithms,
• Resource Allocation Problem.
• Backtracking,
• Branch and Bound with Examples Such as Travelling Salesman Problem,
• Graph Coloring n-Queen Problem,
• Hamiltonian Cycles and Sum of Subsets.

## UNIT-5: SELECTED TOPICS

• Algebraic Computation,
• Fast Fourier Transform,
• String Matching,
• Theory of NP-Completeness,
• Approximation Algorithms and Randomized Algorithms.