B.E. (Computer Engineering) Data Structure Lab Syllabus - Mumbai University 2026
The University has moved this degree onto NEP 2020 one year at a time. The first and second years are NEP 2020 syllabi; the third and fourth years are still examined on the REV-2019 'C' Scheme, which is what the University sets for them this year.
Loading syllabus...
Syllabus for Data Structure Lab
Module 0: Prerequisite
- Constructs of C like Functions, Recursion, Arrays, Structures and Pointers.
Module I: Introduction
- Overview of Data Structure, Elementary Data Structure Organization, Classification of Data Structures, Operations on Data Structures and Abstract Data Type, recursion.
Module II: Stack
- Introduction to Stacks, Array representation of Stacks, Operations on a Stack.
Module III: Queue
- Introduction to Queues, Array representation of Queues, Types of Queues, Operations on Queue, Applications of Queues.
Module IV: Linked list
- Basics of Linked list, ADT Operations Singly Linked Lists, Circular Linked Lists, Doubly Linked Lists, Linked representation of Stacks, and Linked representation of Queues.
Module V: Tree
- Basic Terminology, Types of Trees, Binary Tree traversal, Operations on Binary Search Trees.
Module VI: Applications of Data Structures
- Stack: Reversing a list/String, Implementing Parentheses Checker, Evaluation of Arithmetic Expressions, Tree: Evaluating the expressions using expression tree and implementation of Huffman Encoding.
Module 1*: Implementation of Insertion and deletion in a specific position in an Array using Function.
Module 2: Implementation of recursive program.
Module 3*: Array Implementation of Stack.
Module 4*: Array Implementation of Linear Queue.
Module 5: Array Implementation of Circular Queue.
Module 6*: Implement Singly Linked List.
Module 7: Implement Doubly Linked List.
Module 8*: Implementation of Double Ended Queue using Linked List.
Module 9: Implementation of Stack using Linked list
Module 10*: Implementation of Binary Search Tree and its traversal methods.
Module 11: Program to count Number of leaf nodes, find the biggest and smallest and height of the tree.
Module 12: Implementation of Reversing a List using Stack.
Module 13: Convert an Infix expression to Postfix expression using stack ADT.
Module 14*: Program to Evaluate Postfix Expression using Stack ADT.
List of Assignments / Tutorials
Module 1: Assignment covers the topics from first three units (Introduction, Stack and Queue) limited to three Questions
Module 2
- Assignment covers the topics from Last three units (Linked list, Tree and Application of Data Structures) limited to three Questions
Text Books
- 1 Reema Thareja, “Data Structures using C”, Oxford Press.
- 2 Aaron M Tenenbaum, Yedidyah Langsam, Moshe J Augenstein, “Data Structures Using C”, Pearson Publication.
- 3 Ellis Horowitz, Sartaj Sahni, Fundamentals of Data Structures, Galgotia Publications; 2010.
- 4 E. Balagurusamy, “Data Structure Using C”, Tata McGraw-Hill Education India.
- 1 Narasimha Karumanchi, Data Structures And Algorithms, 5th Edition,CareerMonk, 2016.
- 2 Jean Paul Tremblay, P. G. Sorenson, “Introduction to Data Structure and Its Applications”, McGraw-Hill Higher Education.
- 3 Robert Kruse, C. L. Tondo, Bruce Leung, “Data Structures and Program Design in C”, Pearson Edition.
Reproduced from the University of Mumbai syllabus for B.E. (Computer Engineering) under NEP 2020, in force from the academic year 2024-25. Wording is as printed in that syllabus. Module numbering is as printed there too.
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.