Advanced Data Structures and Algorithms Syllabus for MCA 2nd Year 1st Sem R19 Regulation JNTUH

Advanced Data Structures and Algorithms detailed Syllabus for Master of Computer Applications(MCA), R19 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 MCA 2nd Year 1st Sem Syllabus for R19 Regulation JNTUH, do visit MCA 2nd Year 1st Sem Syllabus for R19 Regulation JNTUH Subjects. The detailed Syllabus for advanced data structures and 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 a variety of data structures such as hash tables, disjoint sets and Priority Queue
3. Describes major algorithmic techniques (divide-and-conquer, backtracking, dynamic programming and greedy) and mention problems for which each technique is appropriate;
4. Introduces sorting, searching and pattern matching algorithms

Course Outcomes:

1. Ability to analyze the performance of algorithms
2. Ability to select the data structures that efficiently model the information in a problem
3. Ability to choose appropriate data structures and algorithm design methods for a specified application
4. Ability to understand how the choice of data structures and the algorithm design methods impact the performance of programs
5. Design programs using a variety of data structures, including hash tables, disjoint sets, trees and graphs
6. Implement and know the application of algorithms for sorting and pattern matching

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 Greedy method: General method, applications-Job sequencing with deadlines, knapsack problem, Minimum cost spanning trees Priority Queues – Definition, Realizing a Priority Queue using Heaps, operations of priority queue

Unit III

Dynamic Programming: General method, applications- Optimal binary search trees, 0/1 knapsack problem, Travelling sales person problem, Reliability design. Backtracking: General method, applications-n-queens problem, sum of subsets problem.

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

Trees: Definition, Types of trees, Binary Trees, Binary Tree Traversal Methods, Binary search tree, AVL tree and B-Tree operations-insertion,deletion and searching Graphs: Definition, Representation of graphs, Graphs Traversal Methods.

Text Books:

1. Fundamentals of Computer Algorithms, Ellis Horowitz, Satraj Sahni and Rajasekharam, Universities Press.
2. Fundamentals of Data Structures, Ellis Horowitz, Satraj Sahni and Rajasekharam, Universities 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 Master of Computer Applications 2nd Year, visit MCA 2nd Year Syllabus Subjects.

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