neqte ere SYMBIOSIS INTERNATIONAL (DEEMED UNIVERSITY) Course name Data Structures Course Code = T7488M (UG/PG): UG,PG Number of Credits :~ 3 Level = 3 Faculty : Engineering Specialization :- Computer Science Learning Objective(s) ‘The students will be able to: + Use knowledge of dynamic data structure and construets in link list programs. plain pseudo code for different types of link list operation + Demonstrate different types of tree data structure and use algorithms for tree Araversals, operations on binary search tree and traversals of threaded binary tree. Summarizes different graph algorithms and their applications id symbol tabl + Experiential Learning Pre-requisites::- + Fundamental knowledge of C programming, Evaluation Method :- + A) Continuous A: Optional a) Quizzes b) Mini project B) End Semester Examination ritten Exam Course Outline Sr ‘i NO Topic rs 1 ked lists 10 1.1 Linear list concepts, list w/s array, C-code writing for each function of different types of linked list,1.2 Linked lists (Nodes structure 1.3 Linked lists algorithms : Create list, insert node (empty list, beginning, middle, end), delete node (first, Jast, middle), concatenation and union of link Stack and quene using link. 1.4 Circularly-linked list;Create, insert and delete operation, concatenation of 1.5 Doubly linked lis 2 |Tree 2.1 Difference in linear and non-linear data structure, trees and binary trees- ‘concept and terminology, binary tree as an ADT(Abstract Data Type), algorithm for tree traversals (recursive and non-recursive), conversion of the general tree |10 to binary tree, binary search trees, concept of threaded binary tree, threaded binary tree as ADT. pre-order, in-order traversals of threaded binary search tree. 3 | Graphs 3.1 Graph as an ADT, representation of graphs using adjacency matti adjacency list, Depth First Search and Breadth First Search, algorithms for 10 minimal spanning tree (Prim’s and Kruskal's)and shortest path-Dijkstra's ee jorithm, application of these algorithms. 4 |Symbol tables and dynamic trees 4.1 Notion of the symbol table, AVL (Adelson-Velskii and Landis) Trees, 5 5 | File organization 5.1 C files and primitive operations and implementation in C, concept of | ‘sequential, simple index file and direct access file hashing, hashing function and it's characteristics, concept of collision resolution, linear probing,chaining |10 with & without replacement, rehashing, Implementation of Sequential file ‘organisation, direct file organisation, index sequential file organisation Total 45 Books Recommended :~ + Data Structures: A pscudo code approach with C, ISBN 9780534390808.,2nd Edition October 11,.2004, Cenage Leaming R. Gilberg,B, Forouzan + Fundamentals of Data Structures in C, ISBN _10:8173716056, 2nd Edition 2007. University Press E, Horowitz, S.Sahani and S,Anderson-Freei + Letus C & Pointer in C, ISBN 9788183331630, 131hEdition 2013 . BPB Yashwant Kanitkar + Data structures & Program Design in C.ISBN TT HOLSISAI O65. 4th Edition 2009. Pearson Robert Kruse, C.L, Tondo, Bruce Lei ure using C,ISBN 9788131702291 "Sth Edition 2009 Pe India AM Tanenbaum, Y Langsam & MJ som. 8M Angnsteit + Data str = gorithm Analysis in C++, ISBN-032144146X,3rd Edition 2007, Addison Wesley Weiss, Mark Allen tical data structure and algorithm r on drawing and editing vector ‘graphics NA Information Computing and Telecommunications (YC-ICT), 2010 IEEE Youth Conference on n Prentice Hall© Research of shortest path algorithm based on the ructure NA Software Engineering and Service Science (IC 2012 IEEE 3rd Intemational Conference on Benchmarked against similar courses in other national/ international universities Jorganizations :- + Data Structures and Algorithms IIT, Bombay Data Structures and Algorithms Thapar University