Scribd
Upload
3 views

Design Analysis

The document outlines a course on the design and analysis of algorithms, divided into five units covering topics such as sorting, searching, dynamic programming, and NP-complete problems. It includes various algorithm design techniques like brute force, divide and conquer, greedy methods, and backtracking, along with their applications. The course aims to equip students with the skills to analyze and develop algorithms, focusing on performance and optimization.

Uploaded by

wooyoung654
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
3 views

Design Analysis

The document outlines a course on the design and analysis of algorithms, divided into five units covering topics such as sorting, searching, dynamic programming, and NP-complete problems. It includes various algorithm design techniques like brute force, divide and conquer, greedy methods, and backtracking, along with their applications. The course aims to equip students with the skills to analyze and develop algorithms, focusing on performance and optimization.

Uploaded by

wooyoung654
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/ 2

Design analysis of algorithm

UNIT I 07 hours
Introduction: Notion of Algorithm, Methods of specifying algorithm, Important problem types:Sorting
searching string processing, graph problems,combinatorial problems,, Asymptotic Notations and Basic
efficiency classes: Informal introduction ,O- notation, Ω-notation ,ϴ- notation, Basic efficiency classes,
Mathematical Analysis of Non-Recursive and RecursiveAlgorithms
Brute Force:Introduction, Bubble Sort, Sequential search
Text Book 1:Chapter 1: 1.1,1.3 Chapter 2:2.2,2.3.2.4, Chapter 3:3.1,3.2
UNIT II 08 hours
Divide and conquer: General Method, Binary search,Recurrence equation for DAC, Finding
Minimum and maximum,Merge Sort, Quick Sort
Decrease-and-conquer: Introduction, Depth First Search,Breadth First Search,Topological Sorting.
Text Book 1 : Chapter 4, 4.1,4.2,4.3 Chapter 5:5.2,5.3
UNIT III 09 hours
Greedy method: The General Method, Knapsack Problem, Minimum cost spanning trees : Prim’s
Algorithm, Kruskal’sAlgorithm, Single Source Shortest Paths: Dijikstras Algorithm, Huffman trees
Transform and Conquer:Heaps and Heapsort
Text Book 2: Chapter 4 :4.1,4.2,4.4; Text Book 1: Chapter 9 : 9.1,9.2,9.3,9.4 Chapter 6 : 6.4
UNIT IV 07 hours
Dynamic Programming: Computing binomial coefficient,Warshall's and Floyds algorithms,
Knapsack problem, Travelling Sales person problem
Backtracking:N-Queen problem, sum of Subset Problem
Text Book 1:Chapter 8 : 8.1,8.2,8.4, Ch 12:12.1 Text Book 2: Chapter 5: 5.9
UNIT V 08 hours
Branch-and-Bound: Assignment Problem, Traveling Sales man Problem
Space and Time Tradeoffs: Sorting by Counting : Comparison Counting sort ,Distribution Counting
Horspool’s algorithm
NP-Complete and NP Hard problems: P and NP problems,NP complete problems

Text Book 1: Chapter 11: 11.2 , Chapter 7:7.1,7.2 Chapter 10: 10.3 :

TEACHING LEARNING PROCESS: Chalk and Talk, power point presentation, animations, videos

COURSE OUTCOMES: On completion of the course, student should be able to:

CO1: Determine performance of recursive and non- recursive algorithms.


CO2: Develop and analyze algorithms to solve problems using various design techniques.
CO3: Apply different design techniques to solve problems.
CO4: Determine solutions to optimization problems by applying suitable algorithm.
CO5: Solve problems associated with space–time tradeoffs

TEXT BOOK:
1. Anany Levitin: Introduction to the Design and Analysis of Algorithms, Second
Edition,Pearson Education, 2009.
2. Ellis Horowitz, Sartaj Sahni, Sanguthevar Rajasekaran: Computer Algorithms/
C++, 2ndEdition, University press, 2014
REFERENCE BOOKS:
1. Thomas H. Cormen, Charles E. Leiserson, Ronal L. Rivest, Clifford Stein:
Introduction toAlgorithms, 2nd Edition, PHI, 2006.
2. Design and Analysis of Algorithms , S. Sridhar, Oxford (Higher Education

You might also like