Scribd
Upload
6 views1 page

Theory of Computation

The CS3401 Algorithms syllabus covers various topics including algorithm analysis, graph algorithms, algorithm design techniques, state space search algorithms, and NP-complete and approximation algorithms. Key concepts include time and space complexity, searching and sorting algorithms, graph traversal, dynamic programming, and backtracking methods. The course also addresses tractable and intractable problems, NP-hardness, and approximation algorithms.

Uploaded by

s28903445
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
6 views1 page

Theory of Computation

The CS3401 Algorithms syllabus covers various topics including algorithm analysis, graph algorithms, algorithm design techniques, state space search algorithms, and NP-complete and approximation algorithms. Key concepts include time and space complexity, searching and sorting algorithms, graph traversal, dynamic programming, and backtracking methods. The course also addresses tractable and intractable problems, NP-hardness, and approximation algorithms.

Uploaded by

s28903445
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

CS3401 ALGORITHMS

Syllabus

UNIT I INTRODUCTION

Algorithm analysis: Time and space complexity - Asymptotic Notations and its properties
Best case, Worst case and average case analysis – Recurrence relation: substitution method -
Lower bounds – searching: linear search, binary search and Interpolation Search, Pattern
search: The naïve string-matching algorithm - Rabin-Karp algorithm - Knuth-Morris-Pratt
algorithm. Sorting: Insertion sort – heap sort

UNIT II GRAPH ALGORITHMS

Graph algorithms: Representations of graphs - Graph traversal: DFS – BFS - applications -


Connectivity, strong connectivity, bi-connectivity - Minimum spanning tree: Kruskal’s and
Prim’s algorithm- Shortest path: Bellman-Ford algorithm - Dijkstra’s algorithm - Floyd-
Warshall algorithm Network flow: Flow networks - Ford-Fulkerson method – Matching:
Maximum bipartite matching

UNIT III ALGORITHM DESIGN TECHNIQUES

Divide and Conquer methodology: Finding maximum and minimum - Merge sort - Quick
sort Dynamic programming: Elements of dynamic programming — Matrix-chain
multiplication - Multi stage graph — Optimal Binary Search Trees. Greedy Technique:
Elements of the greedy strategy - Activity-selection problem –- Optimal Merge pattern —
Huffman Trees.

UNIT IV STATE SPACE SEARCH ALGORITHMS

Backtracking: n-Queens problem - Hamiltonian Circuit Problem - Subset Sum Problem –


Graph colouring problem Branch and Bound: Solving 15-Puzzle problem - Assignment
problem - Knapsack Problem - Travelling Salesman Problem

UNIT V NP-COMPLETE AND APPROXIMATION ALGORITHM

Tractable and intractable problems: Polynomial time algorithms – Venn diagram


representation - NP-algorithms - NP-hardness and NP-completeness – Bin Packing problem -
Problem reduction: TSP – 3-CNF problem. Approximation Algorithms: TSP - Randomized
Algorithms: concept and application - primality testing - randomized quick sort - Finding kth
smallest number

You might also like