Biju Patnaik University of Technology, Odisha, Computer Engineering Semester 4, Design and Analysis of Algorithms Syllabus

Design and Analysis of Algorithms 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

1.1 Characteristics of algorithm

1.2 Analysis of algorithm

1.3 Asymptotic analysis of complexity bounds – best average and worstcase behaviour

1.4 Performance measurements of Algorithm

1.5 Time and space tradeoffs

1.6 Analysis of recursive algorithms through recurrence relationsSubstitution method

1.7 Recursion tree method and Masters’ theorem.

Unit - 2 Fundamental Algorithmic Strategies

2.1 BruteForce

2.2 Linear search selection sort Greedy

2.3 Huffman coding

2.4 Fractional knapasack problem

2.5 Activity selection Problem

2.6 Dynamic Programming

2.7 Matrix chain multiplication

2.8 Longest common subsequence

2.9 Travelling Salesman Problem

2.10 BranchandBound and Backtracking methodologies for the design of algorithms

2.11 Illustrations of these techniques for ProblemSolving

2.12 Bin Packing

2.13 Knapsack TSP

2.14 Heuristics – characteristics and their application domains.

Unit - 3 Graph and Tree Algorithms

3.1 Traversal algorithms Depth First Search DFS and Breadth First Search BFS

3.2 Shortest path algorithms

3.3 Transitive closure Minimum Spanning Tree

3.4 Topological sorting

3.6 Network Flow Algorithm

Unit - 4 Tractable and Intractable Problems

4.1 Computability of Algorithms

4.2 Computability classes – P

4.3 NPclass

4.4 NPcomplete

4.5 NPhard

4.6 Cook’s theorem

4.7 Standard NPcomplete problems Clique Decision Node cover Decision and Chromatic Number Decision problem and Reduction techniques

Unit - 5 Advanced Topics

5.1 Approximation algorithms

5.2 Node cover problem

5.3 Travelling sales man problem

5.4 Randomized algorithms

5.7 Quick sort

5.8 nqueen problem

5.9 Min cut

5.10 Class of problems beyond NP – P SPACE

Download CSE Sem 4 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-2
Discrete mathematics
Constitution of india
Organisational behaviour
Analog electronic circuits
Microprocessor and microcontroller
Computer organization and architecture
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