CS603PC: Design and Analysis of Algorithms CSE Syllabus for B.Tech 3rd Year 2nd Sem R18 Regulation JNTUH

Design and Analysis of Algorithms detailed Syllabus for Computer Science & Engineering (CSE), R18 regulation has been taken from the JNTUH official website and presented for the students affiliated to JNTUH course structure. For Course Code, Subject Names, Theory Lectures, Tutorial, Practical/Drawing, Credits, and other information do visit full semester subjects post given below. The Syllabus PDF files can also be downloaded from the universities official website.

For all other CSE 3rd Year 2nd Sem Syllabus for B.Tech R18 Regulation JNTUH, do visit CSE 3rd Year 2nd Sem Syllabus for B.Tech R18 Regulation JNTUH Subjects. The detailed Syllabus for design and analysis of algorithms is as follows.

Pre-requisite:

For the complete Syllabus, results, class timetable, and many other features kindly download the iStudy App
It is a lightweight, easy to use, no images, and no pdfs platform to make students’s lives easier.
.

Course Objectives:

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

Course Outcomes:

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

Unit I

For the complete Syllabus, results, class timetable, and many other features kindly download the iStudy App
It is a lightweight, easy to use, no images, and no pdfs platform to make students’s lives easier.
.

Unit II

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

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.

Unit IV

For the complete Syllabus, results, class timetable, and many other features kindly download the iStudy App
It is a lightweight, easy to use, no images, and no pdfs platform to make students’s lives easier.
.

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, Cooks theorem.

Text Books:

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

Reference Books:

For the complete Syllabus, results, class timetable, and many other features kindly download the iStudy App
It is a lightweight, easy to use, no images, and no pdfs platform to make students’s lives easier.
.

For detail Syllabus of all other subjects of B.Tech 3rd Year Computer Science & Engineering, visit CSE 3rd Year Syllabus Subjects.

For all B.Tech results, visit JNTUH B.Tech all years, and semester results from direct links.