Course Title: Data Structures and Algorithms using
Course Code: 23EVI301
Python
Course Category: Multi-Disciplinary Course Level: Intermediate
L:T:P(Hours/Week) 2:0 : 2 Credits:3 Total Contact Hours: 60 Max Marks:100
Course Objectives:
The course is intended to teach students to create and implement required linear and non-
linear data structures for given applications. Also, the course is intended to provide ability to
apply suitable searching and sorting techniques to solve a given problem.
Module I 16 Hours
Linear Data structure: Data Structures types - Abstract Data Types - List ADT: Array and
Linked List Implementation - Stack ADT: Implementation of Stack – Queue ADT:
Implementation of Queue. Non-Linear Data Structure: Tree - Preliminaries - Binary tree -
Tree traversal - Applications - Binary search tree. Data Structures for Switching Functions:
Binary Decision trees - Introduction to Ordered Binary decision trees (OBDD) - Boolean
functions - Boolean algebra - Switching functions - Subfunctions and Shannon’s expansion -
Visual representation.
Module II 14 Hours
Non Linear Data Structure: Graph Representation - Graph Traversals: Depth first and
Breadth first traversal - Topological sort - Shortest path algorithms: Weighted Graphs -
Dijkstra‘s algorithms - Minimum Spanning Tree: Prim's and Kruskal's algorithms. Searching:
Linear Search – Binary Search. Sorting: Bubble sort- Insertion Sort - Merge sort – Quick
Sort.
List of experiments 30 Hours
1. Implementation of stack and queue
2. Implementation of linked list
3. Applications of stack
a. Infix to post fix conversion
b. Evaluation of postfix expression
4. Implementation of Binary search tree
5. Implementation of searching - linear, Binary
6. Implementation of sorting technologies, Merge and Quick sort
Course Outcomes
Cognitive Level
At the end of this course, students will be able to:
CO 1: Identify the appropriate data structures as per the specified
Apply
problem definition using Python.
CO 2: Develop Tree data structure for the given Scenario. Apply
CO 3: Develop graph data structure for the given application. Apply
CO 4: Demonstrate searching and sorting techniques for any given
Apply
problem with an oral presentation.
Course Articulation Matrix
CO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 3 - - - 2 - - - - - - - - -
CO2 - - 3 - - - - - - - - - - -
CO3 - - 3 - - - - - - - - - - -
CO4 - 2 - - - - - - 2 2 - - - -
High-3; Medium-2; Low-1
Text Book(s):
T1.Michael T. Goodrich, Roberto Tamassia, Michael H. Goldwasser, “Data Structures
andAlgorithms in Python”, Wiley, July 2021.
T2.Christoph Meinel and Thorsten Theobald, “Algorithms and Data Structures in VLSI
Design”, Springer 1998.
Reference Book(s):
R1. John Canning, Alan Broder, Robert Lafore, “Data Structures & Algorithms in Python”,
Addison-Wesley Professional, October 2022.
R2. Dr. Basant Agarwal, “Hands-On Data Structures and Algorithms with Python”, Packt
Publishing, July 2022.
R3. Mark Allen Weiss, “Data Structures and Algorithm Analysis in C”, 2nd Edition,
Pearson Education Asia, New Delhi, 2011.
Web References:
1. https://www.udemy.com/course/data-structures-and-algorithms-bootcamp-in-python/
2. https://www.udemy.com/course/data-structures-using-python/
3. https://onlinecourses.nptel.ac.in/noc24_cs78/
