SVKM’s NMIMS University
Mukesh Patel School of Technology Management & Engineering
Program: B Tech CSBS Semester: III
B Tech and MBA Tech (All programs except Civil and
Mechanical)
B Tech Computer Science and Engineering (Data Science)
Course: Data Structures and Algorithms Code: 702CO0C060
Teaching Scheme Evaluation Scheme
Lecture Tutorial
Practical Internal Continuous Term End Examinations
(Hours (Hours
(Hours per Credit Assessment (ICA) (TEE)
per per
week) (Marks - 50) (Marks- 100 )
week) week)
3 2 0 4 Marks Scaled to 50 Marks Scaled to 50
Prerequisite: Programming for Problem Solving
Course Objective
This course imparts knowledge of data structures and algorithms so as to identify and implement
appropriate data structure and determine the computational complexity of the given application.
Course Outcomes
After completion of the course, students will be able to -
1. Understand the concept of data structures and computational complexity
2. Identify and implement appropriate linear data structure for the given problem.
3. Identify and implement appropriate non-linear data structure for the given problem.
4. Differentiate various searching and sorting algorithms.
Detailed Syllabus
Unit Description Duration
1 Introduction 04
Introduction to data structure and its importance, Classification of data structures,
Basic operations., Abstract data type, Performance analysis- time and space
complexity, Asymptotic Notations.
2 Linear Data Structure I 10
Representation of arrays in memory, Operations on arrays -Traversal, Insertion,
Deletion. Introduction to Stacks, Operations on Stacks, Applications of stacks -
Expression conversion and evaluation (Polish notation), Balanced parenthesis
checker, Recursion, Introduction to Queue,
Operation on Queues, Linear queue Circular queue, Priority queue, Application
of Queues.
3 Linear Data Structure II 07
Introduction to linked list, Representation of linked list in memory, Singly linked
list and its operations, Introduction to Doubly Linked list Linked list
Signature
(Head of the Department) AY 2025-26
SVKM’s NMIMS University
Mukesh Patel School of Technology Management & Engineering
representation of Stack and Queues, Applications of linked list – Polynomial
Addition
4 Non-Linear Data Structures - I 10
Introduction, Binary tree terminologies, Representation of Binary trees in
memory, Binary Tree traversal algorithms, Construction of Binary Tree from
traversals, Binary Search Tree: Insertion, Deletion, Applications of tree data
structure: Expression trees, Huffman trees.
5 Non- Linear Data Structures - II 06
Introduction, Graph theory terminology, Representation of graph: Adjacency
Matrix, Adjacency List, Graph Traversal: Breadth first search, Depth first search,
Applications of Graphs (Problem Solving): Shortest path (Dijkstra’s algorithm),
Minimum Spanning Tree.
6 Searching and Sorting 08
Linear Search, Binary Search, Selection Sort, Insertion sort, Merge sort,
Introduction to Hashing
Total 45
Text Books
1. Seymour Lipschutz, “Data structures with C”, Schaum’s Outlines, 1st Edition, 2017. ISBN-13 : 978-
0070701984.
2. Reema Thareja, “Data Structures using C”, Oxford University Press, 3rd Edition, 2023.
3. Y. Langsam, M.J. Augenstein, A.M. Tenenbaum, “Data Structures using C and C++”, PHI 2nd
Edition, Pearson Education, 2015. ISBN 9789332549319
Reference Books
1. Richard F. Gillberg, Behrouz A. Forouzen, “Data Structures – A Pseudo Approach with C”, Cengage
Publication, 2nd Edition 2004. (Classic)
2. Mark Allen Weiss, “Data Structures and Algorithm analysis in C++”, PHI, 4th Edition, 2013. ISBN-13:
9780132847377 Data Structures and Algorithm Analysis in C++ ([Link])
[Link], H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein, “Introduction to
Algorithms”, MIT Press, 3rd Edition 2009.
Laboratory Work
8 to 10 experiments (and a practicum where applicable) based on the syllabus.
Signature
(Head of the Department) AY 2025-26