BTITC502: Design and Analysis of Algorithms Syllabus for IT 5th Sem 2019-20 DBATU

Design and Analysis of Algorithms detailed syllabus scheme for B.Tech Information Technology (IT), 2019-20 onwards has been taken from the DBATU official website and presented for the Bachelor of Technology students. For Subject Code, Course Title, Lecutres, Tutorials, Practice, Credits, and other information, do visit full semester subjects post given below.

For all other DBATU Syllabus for Information Technology 5th Sem 2019-20, do visit IT 5th Sem 2019-20 Onwards Scheme. The detailed syllabus scheme for design and analysis of algorithms is as follows.

Design and Analysis of Algorithms Syllabus for Information Technology (IT) 3rd Year 5th Sem 2019-20 DBATU

Course Objectives:

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 pdf platform to make students’s lives easier.
.

Course Outcomes:

After learning the course the students should be able:

1. Develop efficient algorithms for simple computational tasks.
2. Gain understanding of concepts of time and space complexity, worst case, average case and best case complexities and the big-O notation.
3. Design standard algorithms such as sorting, searching, and problems involving graphs.
4. Compute complexity measures of algorithms, including recursive algorithms using recurrence relations.

UNIT I

Introduction: Instruction counts, Growth functions, Necessity of time and space analysis of algorithms, Order notations (O, 0, Q notations), Problem instance size, frequently occurring recurrence relations in analysis of algorithms.

UNIT II

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 pdf platform to make students’s lives easier.
.

UNIT III

Design Techniques-II: Dynamic Programming: Multistage graphs, All pairs shortest paths, 0/1 Knapsack, Travelling salesman problem.

UNIT IV

Design Techniques: Backtracking: 8-Queens Problems, Sum of subsets, Graph coloring. Branch-and-bound: Least cost (LC) search, Control abstractions for LC search, FIFO branch and bound, LC branch and bound.

UNIT V

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 pdf platform to make students’s lives easier.
.

UNIT VI

Complexity Theory: Lower-bound arguments, NP-completeness: Introduction to NP-Complete, Reducibility (SAT, Independent Set, 3VC, Subset Sum and Partition, Hamiltonian Circuit).

Text Books:

1. Thomas Cormen, Charles Leiserson, Ronald Rivest and Cliford Stein, Introduction to Algorithms, MIT Press, 3rd Edition, 2009.
2. E. Horowitz, S. Sahni and S. Rajsekaran, ComputerAlgorithms, Silicon Press, 2nd Edition, 2008.

Reference Books:

1. B. K. Joshi, Data Structures and Algorithms in C++, Tata McGraw Hill Education, 2010.
2. G. T. Heineman, Gary Pollice, Stanley Selkow, Algorithms in a Nutshell, Shroff Publication, 1st Edition, 2008.
3. Kyle Loudon, Mastering Algorithms with C, Shroff Publication, 1st Edition, 2008.

For detail syllabus of all other subjects of Information Technology (IT) 5th Sem 2019-20 regulation, visit IT 5th Sem Subjects syllabus for 2019-20 regulation.