Data Structures syllabus

MDM-221-INC · Second Year Instrumentation and Control Engineering, SPPU 2024 pattern. Every unit, the marks scheme, course outcomes and books, copied from the official syllabus PDF.

MDM-221-INC2 h/week theoryCCE 30 + End-sem 70

04.units

02.credits

Unit-wise syllabus

UNIT I

Python Basics

4 hours

Variables, Data Types, Loops and Conditionals, Functions, Lambda Expressions, List Comprehension, Python Modules (Collections, Queue, Etc.).

UNIT II

Linked List and Sorting Algorithms

6 hours

Linked List - Node Creation, Node Structure, Insert, Delete, Traverse, Singly Linked List, Doubly Linked, Reversing a Linked List, List, Circular Linked List, Comparison to Python Lists and Applications of Linked Lists.

UNIT III

Recursion, Searching and Sorting Algorithms

8 hours

Recursion- Base Case and Recursive Case, Call Stack Visualization, Examples Like Factorial, Fibonacci, Reverse String, Tower of Hanoi, Recursion Vs Iteration. Sorting & Searching Algorithms - Bubble Sort, Insertion Sort, Merge Sort, Quicksort, Stable Sorting, Linear Search and Binary Search.

UNIT IV

Trees & Graphs

8 hours

Trees - Tree Terminology: Root, Leaf, Height, Depth, Binary Tree Structure Binary Search Tree: Insert, Search, Delete, Traversal Methods: In order, Preorder, Post order, Level-Order (Using Queue) Graphs: What is a Graph, Representation: Adjacency Matrix, Adjacency List (Dictionary of Lists), Directed Vs Undirected, Weighted Vs Unweighted. Graph Traversal - Depth-First Search (DFS), Breadth-First Search (BFS)

Marks and credits

Head	Marks	Credit
CCE (continuous comprehensive evaluation)	30	2
End-semester exam	70	2

Prerequisite: Python programming, looping statements, conditional statements, functions..

Course outcomes

CO1Implement various data structures and algorithms using Python programming language effectively.
CO2Implement various operations on linked lists such as insert, delete, traverse, and reversal.
CO3Analyse sorting algorithms like Bubble Sort, Insertion Sort, Merge Sort, and Quicksort, demonstrating the ability to choose the most appropriate algorithm for a given scenario.
CO4Design and implement binary search trees, traverse graphs using DFS and BFS, and apply these concepts to develop efficient solutions for graph-related problems.

Books

Text books

Data Structures and Algorithms in Python by Michael Goodrich, Roberto Tamassia, Michael Goldwasser, Wiley Publication.
Open Data Structures (in pseudocode), Pat Mortin https://opendatastructures.org/ods-python/
Hands-On Data Structures and Algorithms with Python, Dr. Basant Agarwal, Packt publication.

Reference books

A First Course on Data Structures in Python, Donald R. Sheehy. https://donsheehy.github.io/datastructures/fullbook.pdf
Data Structures and Algorithms with Python, Kent D. Lee, Steve Hubbard, Springer Publication.

FAQ

How many units are in Data Structures?

Data Structures (MDM-221-INC) has 4 units: Unit I Python Basics (4 h); Unit II Linked List and Sorting Algorithms (6 h); Unit III Recursion, Searching and Sorting Algorithms (8 h); Unit IV Trees & Graphs (8 h).

What is the marks scheme for Data Structures?

The official Instrumentation and Control Engineering 2024 pattern syllabus lists continuous comprehensive evaluation (CCE) for 30 marks and the end-semester exam for 70 marks, for 2 credits.

What should I know before Data Structures?

Prerequisite listed in the syllabus: Python programming, looping statements, conditional statements, functions..