B.E. (Artificial Intelligence and Data Science) Data Structure Syllabus - Mumbai University
This is the FY BE AI and DS syllabus under NEP 2020, in force from the academic year 2024-25. The third and fourth years of this degree are still taught on the earlier CBCS REV-2019 'C' Scheme, because the University has published no NEP syllabus for Semesters V to VIII of any engineering branch.
Loading syllabus...
Syllabus for Data Structure
Module 0: Prerequisite
- Concepts of Functions, Recursion, Arrays, Pointers, Structures and C programming constructs.
Module I: Introduction 2 hours
- Introduction to Data Structures, Concept of ADT, Types of Data Structures- Linear, Nonlinear, Static, Dynamic and operations on Data Structures.
Module II: Stack 4 hours
- Introduction to Stack, Stack as ADT, ADT Operations on Stack, Array Implementation of Stack, Multiple Stacks, Evaluation of Arithmetic Expressions.
Module III: Queue 5 hours
- Introduction to Queue, ADT operations on Queue, Array Implementation of Queue, Types of Queues: Circular Queue, Priority Queue, Double Ended Queue and Multiple Queues
Module IV: Linked List 6 hours
- Concept of Linked Lists, Linked List v/s Array, Types of Linked List- Singly linked lists, doubly linked lists and circular linked lists. Insertion, deletion, update and copying operations with Singly linked lists, doubly linked lists. Implementation of Stack and Queue using linked list. Reversing a singly linked list.
Module V: Tree 5 hours
- Introduction to Trees, Tree Terminologies, Binary Tree, Binary Tree Representation, Types of Binary Tree, Binary Tree Traversals, Binary Search Tree, Insert, Delete, Search Operations on Binary Search Tree.
Module VI: Applications of Data Structures 4 hours
- Stacks: Conversion of Arithmetic Expressions using Infix, Prefix and Postfix Notations, Reversing a String/List, Parentheses Checker. Trees: Representing expressions using of Expression
- tree and Huffman Encoding.
Text Books
- 1 Aaron M Tenenbaum, Yedidyah Langsam, Moshe J Augenstein, "Data Structures Using C", Pearson Publication. 2. Reema Thareja, " Data Structures using C", Oxford Press. 3. E. Balagurusamy, "Data Structure Using C", Tata McGraw-Hill Education India. 4. Richard F. Gilberg and Behrouz A. Forouzan, "Data Structures: A Pseudocode Approach with C", 2ndEdition, CENGAGE Learning.
References
- 1 Sahni Horowitz, Fundamentals of data structures in C, computer science press, 2008. 2. Jean Paul Tremblay, P. G. Sorenson, "Introduction to Data Structure and Its Applications", McGraw-Hill Higher Education 3. Narasimha Karumanchi, Data Structures And Algorithms, 5th Edition,CareerMonk, 2016. 4. Robert Kruse, C. L. Tondo, Bruce Leung, "Data Structures and Program Design in C", Pearson Publication.
Online References
- Sr. No. Website Name
- 3 https://nptel.ac.in/courses/106/102/106102064/
- 4 Data Structure using C Programming - Course (swayam2.ac.in)
Reproduced from the University of Mumbai syllabus for B.E. (Artificial Intelligence and Data Science), item 7.7 (R-A), under NEP 2020, in force from the academic year 2024-25. Wording, module numbering and hours are as printed in that syllabus.
The complete syllabus
This subject is cut from the University circular for its year. Open a document here if you want the whole thing rather than a single subject.