L T P S J C

24CSEN2261 DATA STRUCTURES AND ALGORITHMS

2 0 2 0 0 3

Pre-requisite 00000000

Co-requisite None

Preferable Exposure None

Course Description:
The study of data structures, a fundamental component of a computer science education, serves as the foundation upon which
many other computer science applications are built. Knowledge of data structures is a must for students who wish to work in the
design and implementation of any software system. The organization of data in an efficient way for application is the major focus
of the course.

Course Educational Objectives:

• To introduce the students to ADT techniques
• To familiarize the students with linear data structures and operations on them
• To expose the concepts of stack and Queue and their applications
• To edify non-linear data structure graph and its applications
• To exemplify representation and manipulation of data using non-linear data structure trees to design algorithms for various
applications

MODULE 1 INTRODUCTION AND ALGORITHM ANALYSIS 9 Hrs

Algorithm Analysis, Mathematical Background, Model, What to Analyze, Running Time Calculations, General Rules.

MODULE 2 LISTS, STACKS AND QUEUES 11 Hrs

Abstract Data Types(ADT), The List ADT: Simple Array Implementation of Lists, Linked Lists, Programming Details, Common
Errors.
The Stack ADT: Stack Model, Implementation of Stacks: Linked List Implementation of Stacks, Array Implementation of Stacks ;
Applications: Postfix Expressions , Infix to Postfix Conversion
The Queue ADT: Queue Model, Array Implementation of Queues, Applications of Queues.

MODULE 3 TREES 9 Hrs

Trees: Preliminaries, Implementation of Trees, Tree Traversals with an Application; Binary Trees: Implementation, Expression
Trees;
The Search Tree ADT-Binary Search Trees: Make_null, Find, Find_min and find_max , Insert, Delete, Average Case Analysis
(intuition)

MODULE 4 SEARCHING AND SORTING 9 Hrs

Searching: Linear Search and Binary Search.

Sorting: Preliminaries, Insertion sort:The Algorithm, Merge sort, Quick sort: Picking the Pivot, Partitioning Strategy, Small Files,
Actual Quicksort Routines.

(c) - page 1 of 3
MODULE 5 GRAPHS 7 Hrs

Graph Algorithms: Definitions, Representation of Graphs, Graph Traversals

Shortest-Path Algorithms: Single Source Shortest Paths Problem, Unweighted Shortest Paths, Dijkstra's Algorithm,
All-Pairs Shortest Path, Minimum Spanning Tree, Prim's Algorithm, Kruskal’s Algorithm.

List of Experiments
S.no Topic Type
1 Perform Linear Search on an array. Experiment
2 Perform Binary Search on a list stored in an array. Experiment
3 Develop a program to implement insertion sort technique. Experiment
4 Develop a program to implement a quick sort technique. Experiment
5 Develop a program to implement merge sort technique. Experiment
Design a program to create a singly linked list for the following operations Insert a Node at
6 Beginning, at Ending and at a given Position Delete a Node at Beginning, at Ending and at a Experiment
given Position Search, Count the Number of Nodes and Display
7 Create a stack and perform various operations on it. Experiment
8 Create a queue and perform various operations on it. Experiment
9 Construct a binary tree and perform various traversals. Experiment
10 Implement Depth First Search, Breadth First Search traversals on a graph. Experiment
11 Implement Dijkstra’s Shortest Path Algorithm Experiment
Textbook(s):
1. Mark Allen Weiss, Data Structures and Algorithm Analysis in C , 2nd Edition, Pearson, 2002 ,978-8131714744
2. Alfred V.Aho, John E.HopCroft Jeffrey D.Ullman, Data Structures and Algorithms, 1st Edition, Pearson, 2002
,978-8178081021

Reference(s):
1. Seymour Lipschutz, Data Structures , 2nd Edition, McGraw Hill Education, 2014 ,978-1259029967
2. G. A. V. Pai2017, Data Structures and Algorithms: Concepts - Techniques and Applications, 1st Edition, McGraw Hill
Education, 2017 ,978-0070667266
3. Ellis Horowitz, Sartaj Sahni, Susan Anderson Freed,, Fundamentals of Data structures in C, 1st Edition, W.H.Freeman &
Co Ltd, ,978-0716782506

Course Outcomes:
1. Understand the complexity of algorithms (L2)
2. Demonstrate operations on linear data structures (L3)
3. Illustrate the mechanisms for creating, altering, and traversing various types of trees (L2)
4. Perform searching in and sorting of given data. (L3)
5. Summarize the representations, traversals, and applications of graphs.(L2)

Course Articulation Matrix:

POs PSOs

CO 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 1 2 3 4

1 1 2 1

2 1 2 2 2 1 2

3 1 2 2 2 1 2 1

(c) - page 2 of 3
 4 1 2 2 2 1 2 1

3 – High, 2 – Medium & 1 – Low Correlation

APPROVED IN MEETINGS HELD ON:

BOS : 03-02-2024 Academic Council Number: 27 Academic Council : 06-07-2023

SDG No(s). & Statement(s) :

4 & Quality Education : Ensure inclusive and equitable quality education and promote lifelong learning opportunities for
all.Ensure inclusive and equitable quality education and promote lifelong learning opportunities for all.

SDG Justification(s):
SDG 4: The modules provide efficiency, reusability and abstraction. These modules play a crucial part of designing efficient
software. They also play a critical role in algorithm design and how those algorithms are used within computer programs.

(c) - page 3 of 3