DAA Syllabus (Design and Analysis of Algorithms) presents the detailed syllabus for B.Tech III year I sem. This also gives the details about credits, number of theory hours and other details along with reference books for the course.
Kindly visit JNTUH Academic Calendar for all updated academic schedule for the current year, JNTUH Syllabus (up-to-date) for all the courses and semesters offered by JNTUH at one place including current and previous regulations syllabus, JNTUH Time Table for most updated examination schedule, JNTUH Result Direct Link for updated Exam Results for all courses and semesters.
DAA Syllabus JNTUH (R16)
B.Tech. III Year I Sem. L/T/P/C
Course Code:*MC500HS 3/0/0/0
Course Objectives:
- To analyze performance of algorithms.
- To choose the appropriate data structure and algorithm design method for a specified application.
- To understand how the choice of data structures and algorithm design methods impacts the performance of programs.
- To solve problems using algorithm design methods such as the greedy method, divide and conquer, dynamic programming, backtracking and branch and bound.
- To understand the differences between tractable and intractable problems.
- To introduce P and NP classes.
Course Outcomes:
- Ability to analyze the performance of algorithms.
- Ability to choose appropriate algorithm design techniques for solving problems.
- Ability to understand how the choice of data structures and the algorithm design methods impact the performance of programs.
UNIT – I: Introduction-Algorithm definition, Algorithm Specification, Performance Analysis-Space complexity, Time complexity, Randomized Algorithms. Divide and conquer- General method, applications – Binary search, Merge sort, Quick sort, Strassen’s Matrix Multiplication.
UNIT – II: Disjoint set operations, union and find algorithms, AND/OR graphs, Connected Components and Spanning trees, Bi-connected components Backtracking-General method, applications The 8-queen problem, sum of subsets problem, graph coloring, Hamiltonian cycles.
UNIT – III: Greedy method- General method, applications- Knapsack problem, Job sequencing with deadlines, Minimum cost spanning trees, Single source shortest path problem.
For the complete and detailed Syllabus, Class Timetable, Examination updates, Results and many other University related updates on time, kindly download the iStudy App. It is a lightweight, easy to use, no images, and no pdfs platform to make students’ lives easier.
.
TEXT BOOKS:
- Fundamentals of Computer Algorithms, 2nd Edition, Ellis Horowitz, Sartaj Sahni and S. Rajasekharan, Universities Press.
- Design and Analysis of Algorithms, P. H. Dave, H. B. Dave, 2nd edition, Pearson Education.
REFERENCE BOOKS:
- Algorithm Design: Foundations, Analysis and Internet examples, M. T. Goodrich and R. Tomassia, John Wiley and sons.
- Design and Analysis of Algorithms, S. Sridhar, Oxford Univ. Press
- Design and Analysis of algorithms, Aho, Ullman and Hopcroft, Pearson Education.
- Foundations of Algorithms,, R. Neapolitan and K. Naimipour, 4th edition, Jones and
Bartlett Student edition. - Introduction to Algorithms, 3rd Edition, T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, PHI
For all other B.Tech 3rd Year 1st Sem syllabus go to JNTUH B.Tech Computer Science and Engineering 3rd Year 1st Sem Course Structure for (R16) Batch.
All details and yearly new syllabus will be updated here time to time. Subscribe, like us on facebook and follow us on google plus for all updates.
Do share with friends and in case of questions please feel free drop a comment.