[go: up one dir, main page]
Scribd
Upload
6 views2 pages

ADSSYLLABUS

The document outlines the course structure for 'Advanced Data Structures' for B. Tech III-Semester students in Computer Science & Engineering (AI & ML), detailing the teaching and examination schemes, course learning objectives, and outcomes. It covers various data structures including trees, graphs, and sorting algorithms, along with practical applications and project assignments. Additionally, it includes a list of textbooks and reference materials for further study.

Uploaded by

varshithlucky99
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
6 views2 pages

ADSSYLLABUS

The document outlines the course structure for 'Advanced Data Structures' for B. Tech III-Semester students in Computer Science & Engineering (AI & ML), detailing the teaching and examination schemes, course learning objectives, and outcomes. It covers various data structures including trees, graphs, and sorting algorithms, along with practical applications and project assignments. Additionally, it includes a list of textbooks and reference materials for further study.

Uploaded by

varshithlucky99
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

U18AI306R22 ADVANCED DATA STRUCTURES

Class:B. Tech III-Semester Branch:Computer Science & Engineering (AI & ML)

Teaching Scheme: Examination Scheme:


L T P C Continuous Internal Evaluation 40 marks
3 - - 3 End Semester Examination 60 marks

Course Learning Objectives (LOs):


This course will develop student’s knowledge in/on
LO1: organizing and retrieving the data using binary tree, binary search trees.
LO2: organizing and retrieving the data using AVL trees, B-Trees, Red black trees and Splay trees.
LO3: organizing and retrieving the data using Interval tree, Hash tree, Tries, sorting and searching.
LO4: organizing and retrieving the data using graphs and spanning trees.

UNIT – I (9)
Trees: Introduction, types of trees.
Binary Tree: Creating a binary tree, traversing a binary tree: preorder, inorder, postorder
and spiral order recursive traversals.
Binary Search Tree: Operations- Insertion, deletion, search, recursive and non-recursive
traversal.Threaded binary trees.

UNIT – II (9)
AVL Trees: AVL trees operations–Insertion, Deletion and Traversal.
Multiway Search Trees: Introduction tom-way search trees. Operations on B-Trees-
Insertion, deletion, search. B+-trees.
Red-Black Trees: Properties, operations, applications.splay trees.

UNIT - III (9)


Interval Tree, Hash tree.
Tries: Trie structure. Operations on Tries, Applications of Tree indexing.
Searching and Internal Sorting:Fibonacci search, quick sort, merge sort, heap
sort,bitonicgenerator sort; time complexities of above searching and sorting techniques.

UNIT – IV (9)
Graphs:Introduction, graph terminology, representation of graphs.
Application of Graph Structures: Topological sorting. Minimum Spanning Trees: Prim’s
algorithm, Kruskal’s algorithm. Graphs traversal methods- breadth first search, depth first
search. Kosaraju’s algorithm.
String manipulations, String compression -Run Length Encoding.
String Matching Algorithms-Naive Algorithm, (Knuth Morris Pratt) Algorithm, Boyer
Moore Algorithm, Rabin Karp Algorithm.

Text Book(s):
[1] DebasisSamanta, Classic Data Structures, 2nd ed., New Delhi: Prentice Hall India, 2009.

Page 14 of 136
Reference Books:
[1] Reema Thareja, Data Structures Using C, 2nded., New Delhi: Oxford University
Press,2014.
[2] Richard F. Gilberg and Behrouz A. Forouzan, Data Structures: A Pseudo code Approach with
C, 2nd ed., New Delhi: Cengage Learning 2007.
[3] Adam Drozdek, Data Structures and Algorithms in C++,3rd ed., New Delhi, Thomson,
2006.
[4] Samir Kumar Bandyopadhyay Kashinath Dey, Data Structures Using C, Pearson
India,2008.

Course Research Paper (CRP): Research papers (Indexed journal/conference papers)


relevant to the course content by the course faculty in Course Web page. Students have to
write a twopage summary on CRP and submit as part of special assignment.
Course Patent (CP): Patents relevant to the course content will be posted by the course
faculty in Course Web page. Students have to write a twopage summary on CP and submit
as part of special assignment.
Course Projects: Course project is an independent project carried out by the student during
the course period, the supervision of course faculty. Course faculty will post few course
projects titles in Course Webpage. Students are encouraged to come up and experiment with
the ideas that interest them

Course Learning Outcomes (COs):


On completion of this course, students' will be able to
CO1: develop programs using binary trees, binary search trees to optimize database queries.
CO2: utilize balanced search trees such as B-trees, B+-trees, red black and Splay trees in solving the problems
on Database management.
CO3: organize and retrieve the data using Interval tree, Hash tree, Tries, sorting and searching in solving the
problems like auto-complete.
CO4: organize and retrieve the data using Graphs and different types of spanning trees used for GPS
navigation.

Course Articulation Matrix (CAM):U18AI306R22 ADVANCED DATA STRUCTURES


Course Outcomes PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
CO1 U18AI306R22.1 2 2 2 2 1 1 - 1 1 1 - 1 2 2 2
CO2 U18AI306R22.2 2 2 2 2 1 1 - 1 1 1 - 1 2 2 2

CO3 U18AI306R22.3 2 2 2 2 1 1 - 1 1 1 - 2 2 2 2
CO4 U18AI306R22.4 2 2 2 2 1 1 - 1 1 1 - 2 2 2 2
U18AI306R22 2 2 2 2 1 1 - 1 1 1 - 1.5 2 2 2

Page 15 of 136

You might also like