B.Sc. (Information Technology) Data Structures Syllabus - Mumbai University
This is the SY BSc IT syllabus under NEP 2020, in force from the academic year 2025-26. The University still sets the earlier Choice Based papers alongside it for ATKT candidates, so check which scheme your exam form names before you revise.
Loading syllabus...
Syllabus for Data Structures
Module I: Introduction
- Basic terminology: data, information, data structure, abstract data type (ADT) Classification of data structures: linear, non-linear Algorithm analysis: time complexity, Big O notation
- Arrays and Linked Lists Array representation and operations (traversal, insertion, deletion, searching) Linked lists: singly linked lists (representation, insertion, deletion, traversal) Comparison of arrays and linked lists, advantages and disadvantages.
- Stacks and Queues Stack ADT: push, pop, peek operations Array implementation of stacks Applications of stacks: expression evaluation (infix to postfix conversion) Queue ADT: enqueue, dequeue, peek operations Array implementation of queues Applications of queues: basic scheduling scenarios
- Recursion Concept of recursion, base case, recursive step Examples: factorial, Fibonacci sequence
Module II: Trees
- Binary trees: representation, traversal (inorder, preorder, post order) Binary search trees: insertion, deletion, search Applications of trees: basic hierarchical data representation 2.Hashing Hash functions and hash tables Collision handling: separate chaining Applications of hashing: dictionaries
- Sorting and Searching Sorting algorithms: bubble sort, insertion sort, selection sort Searching algorithms: linear search, binary search
Books and References
- 1 Data Structures and Algorithms made Easy: Data Structures and Algorithmic Puzzles, Narasimha Karumanchi ,5 th Edition 2017
- 2 A Simplified Approach to Data Structures, Lalit Goyal, Vishal Goyal, Pawan Kumar SPD,1 st 2014
- 3 Problem Solving in Data Structures & Algorithms Using C by Hemant Jain ,1st Edition, BPB Publications, 2018
- 4 Introduction to Algorithms, Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein, 4 th Edition, MIT Press,2022
Reproduced from the University of Mumbai syllabus for B.Sc. (Information Technology) under NEP 2020, in force from the academic year 2025-26. 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.
Use FYBSc IT, SYBSc IT, or TYBSc IT first so your syllabus check matches the semester you are preparing for.
Use the syllabus to confirm topics, then open BSc IT notes for the same semester.
Move to BSc IT question papers after reviewing the module scope.