munotes®

B.E. (Computer Engineering) Data Structure 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.

Data-Structure.pdf
Semester 2 · First Year CE

Loading syllabus...

Syllabus for Data Structure

Semester 2 · First Year CE

Module 0: Prerequisite

  • Concepts of Functions, Recursion, Arrays, Pointers, Structures and C programming constructs.

Module I: Introduction

  • Introduction to Data Structures, Concept of ADT, Types of Data Structures- Linear, Nonlinear, Static, Dynamic and operations on Data Structures.

Module II: Stack

  • Introduction to Stack, Stack as ADT, ADT Operations on Stack, Array Implementation of Stack, Multiple Stacks, Evaluation of Arithmetic Expressions.

Module III: Queue

  • 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

  • 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

  • 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

  • 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.
  • 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, 5 th Edition,CareerMonk, 2016.
  • 4 Robert Kruse, C. L. Tondo, Bruce Leung, “Data Structures and Program Design in C”, Pearson Publication.

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.

PDF 7.9 (R-A) B.E. (Computer Engineering) Sem I & II (Revised, NEP 2020) NEP 2020 syllabus Read full PDF Read
PDF 6.24 (N) B.E. (Computer Engineering) Sem III & IV (NEP 2020) NEP 2020 syllabus Read full PDF Read
PDF 6.15 B.E. (Computer Engineering) Third Year, Sem V & VI (REV-2019 'C' Scheme) REV-2019 'C' Scheme syllabus Read full PDF Read
PDF 6.41 (R) B.E. (Computer Engineering) Fourth Year, Sem VII & VIII (REV-2019 'C' Scheme) REV-2019 'C' Scheme syllabus Read full PDF Read
Report or request
Done!