B.Sc. (Data Science) Design and Analysis of Algorithms Syllabus - Mumbai University 2026
This is the SY BSc Data Science 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 Design and Analysis of Algorithms
Module I: Introduction: What Is an Algorithm, Fundamentals of Algorithmic
- Problem Solving, Important Problem Types, Fundamental Data Structures.
- Fundamentals of the Analysis of Algorithm Efficiency: The Analysis Framework, Asymptotic Notations and Basic Efficiency Classes, Mathematical Analysis of Non recursive Algorithms, Mathematical Analysis of Recursive Algorithms.
- Linked Lists: What is a Linked List?, Linked Lists ADT, Why Linked Lists?, Arrays Overview, Comparison of Linked Lists with Arrays & Dynamic Arrays, Singly Linked Lists, Doubly Linked Lists, Circular Linked Lists.
- Stacks: What is a Stack?, How Stacks are used, Stack ADT, Applications, Implementation, Comparison of Implementations.
Module II: Queues: What is a Queue?, How are Queues Used?, Queue ADT, Exceptions, Applications, Implementation
- Trees: What is a Tree?, Glossary, Binary Trees, Types of Binary Trees, Properties of Binary Trees, Binary Tree Traversals, Generic Trees (N-ary Trees), Threaded Binary Tree Traversals (Stack or Queue-less Traversals), Expression Trees, XOR Trees, Binary Search Trees (BSTs), Balanced Binary Search Trees, AVL (Adelson-Velskii and Landis) Trees.
- Graph Algorithms: Introduction, Glossary, Applications of Graphs, Graph Representation, Graph Traversals, Topological Sort, Shortest Path Algorithms, Minimal Spanning Tree.
- Sorting: What is Sorting?, Why is Sorting Necessary?, Classification of Sorting Algorithms, Other Classifications, Bubble Sort, Selection Sort, Insertion Sort, Merge Sort, Heap Sort, Quick Sort, Tree Sort, Comparison of Sorting Algorithms.
- Searching: What is Searching?, Why do we need Searching?, Types of Searching, Unordered Linear Search, Sorted/Ordered Linear Search, Binary Search, Interpolation Search, Comparing Basic Searching Algorithms.
- Textbooks / Reference Books and 1. Introduction to Design and Analysis of Algortithms by Anany Levitin 3 rd Ed Publisher: Pearson Data Structures and Algorithms Made Easy by Narasimha Karumanchi Publisher:
- CareerMonk Internal Continuous Assessment: 40% Semester End Examination: 60% Continuous Evaluation through: Format of Question Paper:
- Research Paper presentation at college External Examination (30 Marks) – 1 level = 15 marks + SLM Submission 05 hour duration marks Total = 20 marks OR Paper Presentation at Conference / Publication in journal = 20 marks Format of Question Paper: (Semester End Examination: 30 Marks.
- Duration:1 hour) Q1: Attempt any two (out of four) from Module 1 (15 marks) Q2: Attempt any two (out of four) from Module 2 (15 marks) Or Q1: Attempt any three (out of five) from Module 1 (15 marks) Q2: Attempt any three (out of five) from Module 2 (15 marks)
Reproduced from the University of Mumbai syllabus for B.Sc. (Data Science) 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.