sc JNTUA B.TECH R 20 2-3 Syllabus For Advanced data structures & algorithms PDF 2022 – Cynohub

# JNTUA B.TECH R 20 2-3 Syllabus For Advanced data structures & algorithms PDF 2022

### Get Complete Lecture Notes for Advanced data structures & algorithms on Cynohub APP

You will be able to find information about Advanced data structures & 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 Advanced data structures & algorithms after reading this blog. Advanced data structures & algorithms has 5 units altogether and you will be able to find notes for every unit on the CynoHub app. Advanced data structures & 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 Advanced data structures & algorithms are mentioned below in detail. If you are having a hard time understanding Advanced data structures & 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.

### Advanced data structures & algorithms Unit One

#### Introduction to Algorithms

Algorithms, Pseudocode for expressing algorithms, Performance Analysis-Space complexity, Time complexity, Asymptotic Notation-Big oh, Omega, Theta notation and Little oh notation, Polynomial Vs Exponential Algorithms, Average, Best and Worst Case Complexities, Analysing Recursive Programs.

### Advanced data structures & algorithms Unit Two

#### Trees Part-I

Trees Part-I
Binary Search Trees:Definition and Operations, AVL Trees: Definition and Operations, Applications.B Trees:Definition and Operations.

### Advanced data structures & algorithms Unit Three

#### Trees Part-II

Trees Part-IIRed-Black Trees, Splay Trees, Applications.
Hash Tables:Introduction, Hash Structure, Hash functions, Linear Open Addressing, Chaining and Applications.

### Advanced data structures & algorithms Unit Four

#### Divide and conquer, Greedy method

Divide and conquer:General method, applications-Binary search, Finding Maximum and minimum, Quick sort, Merge sort, Strassen’s matrix multiplication.
Greedy method: General method, applications-Job sequencing with deadlines, knapsack problem, Minimum cost spanning trees, Single source shortest path problem.

### Advanced data structures & algorithms Unit Five

#### Dynamic Programming & Backtracking

Dynamic Programming: General method, applications-0/1 knapsack problem, All pairs shortest path problem, Travelling salesperson problem, Reliability design.
Backtracking: General method, applications-n-queen problem, sum of subsets problem, graph coloring, Hamiltonian cycles.Introduction to NP-Hard and NP-Complete problems: Basic Concepts.

### Advanced data structures & algorithms Course Objectives

•Learn asymptotic notations, and analyze the performance of different algorithms.
•Understand and implement various data structures.
•Learn and implement greedy, divide and conquer, dynamic programming and backtracking algorithms using relevant data structures.
•Understand non-deterministic algorithms, polynomial and non-polynomial problems.

### Advanced data structures & algorithms Course Outcomes

After completion of the course, students will be able to
•Analyze the complexity of algorithms and apply asymptotic notations.
•Apply non-linear data structures and their operations.
•Understand and apply greedy, divide and conquer algorithms.•Develop dynamic programming algorithms for various real-time applications.
•Illustrate Backtracking algorithms for various applications.

### Advanced data structures & algorithms Text Books

1.Data Structures and algorithms: Concepts, Techniques and Applications, G A V Pai.
2.Fundamentals of Computer Algorithms, Ellis Horowitz, Sartaj Sahni and Rajasekharam, Galgotia publications Pvt. Ltd.

### Advanced data structures & algorithms Reference Books

1.Classic Data Structures by D. Samanta, 2005, PHI
2.Design and Analysis of Computer Algorithms by Aho, Hopcraft, Ullman 1998, PEA.
3.Introduction to the Design and Analysis of Algorithms by Goodman, Hedetniemi, TMG.