JNTUK B.Tech Advanced Data Structures gives you detail information of Advanced Data Structures R13 syllabus It will be help full to understand you complete curriculum of the year.
(Note: C++ and Java implementation is not included in the syllabus)
Objectives: Exposed to hashing approaches, variants of trees , heaps, queues, implementation of graph algorithms, analysis of sorting algorithms with respect to bounds and file organizations and operations
UNIT I
- Objectives: Comprehensive understanding of dictionaries, hashing mechanism which supports faster retrieval and skip lists
- Dictionaries : Sets, Dictionaries, Hash Tables, Open Hashing, Closed Hashing (Rehashing Methods), Hashing Functions( Division Method, Multiplication Method, Universal Hashing), Skip Lists, Analysis of Skip Lists. (Reference 1)
UNIT II
- Objectives: Illustartion of Balanced trees and their operations
- AVL Trees: Maximum Height of AVL Tree, Insertions and Deletions. 2-3 Trees : Insertion, Deletion.
UNIT III
- Objectives: Comprehension of heaps, queues and their operations
- Priority Queues :
- Binary Heaps : Implementation of Insert and Delete min, Creating Heap.
- Binomial Queues : Binomial Queue Operations, Binomial Amortized Analysis, Lazy Binomial Queues
UNIT IV
- Objectives: Detailed knowledge of nonlinear data structures and various algorithms using them Graph algorithms : Minimum-Cost Spanning Trees- Prim’s Algorithm, Kruskal’s Algorithm Shortest Path
- Algorithms: Dijkstra’s Algorithm, All Pairs Shortest Paths Problem: Floyd’s Algorithm, Warshall’s Algorithm,
UNIT V
- Objectives: Analysis of complexities in various sorting techniques along with their lower bounds
- Sorting Methods : Order Statistics: Lower Bound on Complexity for Sorting Methods: Lower Bound on Worst Case Complexity, Lower Bound on Average Case Complexity, Heap Sort, Quick Sort, Radix Sorting, Merge Sort.
UNIT VI
- Objectives: Illustration of tries which share some properties of table look up, various issues related to the design of file structures
- Pattern matching and Tries : Pattern matching algorithms- the Boyer –Moore algorithm, the Knuth- Morris-Pratt algorithm
- Tries: Definitions and concepts of digital search tree, Binary trie, Patricia , Multi-way trie
- File Structures: Fundamental File Processing Operations-opening files, closing files, Reading and Writing file contents, Special characters in files. Fundamental File Structure Concepts- Field and record organization, Managing fixed-length, fixed-field buffers. ( Reference 5)
Text Books
- Data Structures, A Pseudocode Approach, Richard F Gilberg, Behrouz A Forouzan, Cengage.
- Fundamentals of DATA STRUCTURES in C: 2nd ed, , Horowitz , Sahani, Anderson-freed, Universities Press
- Data structures and Algorithm Analysis in C, 2nd edition, Mark Allen Weiss, Pearson
Reference Books
- Web : http://lcm.csa.iisc.ernet.in/dsa/dsa.html
- http://utubersity.com/?page_id=878
- http://freevideolectures.com/Course/2519/C-Programming-and-Data-Structures
- http://freevideolectures.com/Course/2279/Data-Structures-And-Algorithms
- File Structures :An Object oriented approach with C++, 3rd ed, Michel J Folk, Greg Riccardi, Bill Zoellick
- C and Data Structures: A Snap Shot oriented Treatise with Live examples from Science and Engineering, NB Venkateswarlu & EV Prasad, S Chand, 2010.
For more information about all JNTU updates please stay connected to us on FB and don’t hesitate to ask any questions in the comment.