Dr A.P.J. Abdul Kalam Technical University, UP (AKTU), Computer Engineering Semester 5, Design and Analysis of Algorithm Syllabus

Design and Analysis of Algorithm Lecture notes | Videos | Free pdf Download | Previous years solved question papers | MCQs | Question Banks| Syllabus
Get access to 100s of MCQs, Question banks, notes and videos as per your syllabus.
Try Now for free

Unit - 1 Introduction

Unit – 1

Introduction

1.1 Introduction Algorithms

1.2 Analyzing Algorithms

1.3 Complexity of Algorithms

1.4 Growth of Functions

1.5 Performance Measurements

1.6 Sorting and Order Statistics Shell Sort

1.7 Quick Sort

1.8 Merge Sort

1.9 Heap Sort

1.10 Comparison of Sorting Algorithms

1.11 Sorting in Linear Time

Unit - 2 Advanced Data Structures

Unit – 2

Unit - 3 Divide And Conquer

Unit – 3

Divide and Conquer

3.1 Divide and Conquer with Examples Such as Sorting

3.2 Matrix Multiplication

3.3 Convex Hull and Searching

3.4 Greedy Methods with Examples Such as Optimal Reliability Allocation

3.5 Knapsack

3.6 Minimum Spanning Trees – Prim’s and Kruskal’s Algorithms

3.7 Single Source Shortest Paths Dijkstra’s and Bellman Ford Algorithms

Unit - 4 Dynamic Programming

Unit – 4

Dynamic Programming

4.1 Dynamic Programming with Examples Such as Knapsack

4.2 All Pair Shortest Paths – Warshall’s and Floyd’s Algorithms

4.3 Resource Allocation Problem

4.4 Backtracking

4.5 Branch and Bound with Examples Such as Travelling Salesman Problem

4.6 Graph Coloring

4.7 nQueen Problem

4.8 Hamiltonian Cycles and Sum of Subsets

Unit - 5 Selected Topics

Unit – 5

Selected Topics

Download CSE Sem 5 syllabus pdf
Get access to 100s of MCQs, Question banks, notes and videos as per your syllabus.
Try Now for free
Other Subjects of Semester-1
Compiler design
Computer graphics
Database management system
Popular posts
Top 10 free online resources to learn coding
What is machine learning
What is cloud computing
What is DBMS architecture
Sorting algorithm overview
Share  
Link Copied
More than 1 Million students use Goseeko! Join them to feel the power of smart learning.
Spot anything incorrect? Contact us