# JNTUH B.TECH R18 4-1 Syllabus For Design and analysis of algorithms PDF 2022

### Get Complete Lecture Notes for Design and analysis of algorithms on Cynohub APP

You will be able to find information about Design and analysis of algorithms along with its Course Objectives and Course outcomes and also a list of textbook and reference books in this blog.You will get to learn a lot of new stuff and resolve a lot of questions you may have regarding Design and analysis of algorithms after reading this blog. Design and analysis of algorithms has 5 units altogether and you will be able to find notes for every unit on the CynoHub app. Design and analysis of algorithms can be learnt easily as long as you have a well planned study schedule and practice all the previous question papers, which are also available on the CynoHub app.

All of the Topic and subtopics related to Design and analysis of algorithms are mentioned below in detail. If you are having a hard time understanding Design and analysis of algorithms or any other Engineering Subject of any semester or year then please watch the video lectures on the official CynoHub app as it has detailed explanations of each and every topic making your engineering experience easy and fun.

### Design and analysis of algorithms Unit One

#### UNIT – I

Introduction: Algorithm, Performance Analysis-Space complexity, Time complexity, Asymptotic Notations- Big oh notation, Omega notation, Theta notation and Little oh notation.
Divide and conquer: General method, applications-Binary search, Quick sort, Merge sort, Strassen’s matrix multiplication.

### Design and analysis of algorithms Unit Two

#### UNIT – II

Disjoint Sets: Disjoint set operations, union and find algorithms
Backtracking: General method, applications, n-queen’s problem, sum of subsets problem, graph coloring

### Design and analysis of algorithms Unit Three

#### UNIT – III

Dynamic Programming: General method, applications- Optimal binary search trees, 0/1 knapsack problem, All pairs shortest path problem, Traveling sales person problem, Reliability design.

### Design and analysis of algorithms Unit Four

#### UNIT – IV

Greedy method: General method, applications-Job sequencing with deadlines, knapsack problem, Minimum cost spanning trees, Single source shortest path problem.

### Design and analysis of algorithms Unit Five

#### UNIT – V

Branch and Bound: General method, applications – Travelling sales person problem, 0/1 knapsack problem – LC Branch and Bound solution, FIFO Branch and Bound solution.
NP-Hard and NP-Complete problems: Basic concepts, non deterministic algorithms, NP – Hard and NP-Complete classes, Cook’s theorem.

### Design and analysis of algorithms Course Objectives

Introduces the notations for analysis of the performance of algorithms.
Introduces the data structure disjoint sets.
Describes major algorithmic techniques (divide-and-conquer, backtracking, dynamic programming, greedy, branch and bound methods) and mention problems for which each technique is appropriate;
Describes how to evaluate and compare different algorithms using worst-, average-, and best- case analysis.
Explains the difference between tractable and intractable problems, and introduces the problems that are P, NP and NP complete.

### Design and analysis of algorithms Course Outcomes

Ability to analyze the performance of algorithms
Ability to choose appropriate data structures and algorithm design methods for a specified application
Ability to understand how the choice of data structures and the algorithm design methods impact the performance of programs

### Design and analysis of algorithms Text Books

1. Fundamentals of Computer Algorithms, Ellis Horowitz, Satraj Sahni and Rajasekharan, University Press.

### Design and analysis of algorithms Reference Books

Design and Analysis of algorithms, Aho, Ullman and Hopcroft, Pearson education.
Introduction to Algorithms, second edition, T. H. Cormen, C.E. Leiserson, R. L. Rivest, and C. Stein, PHI Pvt. Ltd./ Pearson Education.
Algorithm Design: Foundations, Analysis and Internet Examples, M.T. Goodrich and R. Tamassia, John Wiley and sons.