INDIAN INSTITUTE OF INFORMATION TECHNOLOGY,
UNA [HP]
An Institute of National Importance under MoE
Saloh, Una, Himachal Pradesh- 177 209.
Website: [Link]
Courseplan/1ST YEAR/II Sem/ITMC103/2025 07, Jan.’25
AY 2024-25: EVEN SEMESTER
COURSE PLAN-PART I
NAME OF THE PRO- B. Tech. (I.T)
GRAMME AND SPE-
CIALIZATION
COURSE TITLE Data Structures and Algorithms
COURSE CODE ITMC103 NO. OF CREDITS 04
SESSION AY 2024-2025 SEMESTER II
NAME OF FACULTY Dr. Neha Sharma DEPARTMENT School of
Computing
E-MAIL neha@[Link] TELEPHONE NO. 9418646314
COURSE TYPE Program Core
SYLLABUS (APPROVED IN BOS)
As Per The Syllabus Curriculum of IIIT UNA
COURSE OBJECTIVES
1. To impart the basic concepts of data structures and algorithms.
2. To solve real-world problems with the help of fundamental data structures.
3. To understand concepts about searching and sorting techniques.
4. To be familiar with basic techniques of algorithm analysis.
5. To learn and implement various data structures and algorithms.
COURSE OUTCOMES (CO)
After successful completion of the course, the learners would be able to
1. Explain the fundamentals of data structures and algorithms (K2).
2. Build data structures for a given problem (K3).
3. Illustrate applications and use of tree data structures (K3).
4. Compare algorithms for graph data structures (K4).
4. Compare the basic algorithmic techniques and choose a suitable for a given problem (K5).
1
COURSE PLAN – PART II
COURSE OVERVIEW
This course will focus on data structures and algorithms. Data structures for storing information in
tables, lists, stacks, queues, trees, and graphs will be covered. Basic algorithms for creating,
manipulating and using these structures will also be discussed. Different types of searching and
sorting techniques will also be introduced and will be compared. Students will carry out a number
of programming assignments, which will emphasize various aspects of data organization and
manipulation process.
COURSE TEACHING AND LEARNING ACTIVITIES
LectureNo. Topic Remarks
Motivation Green Chalk Board,
Lecture 1
Presentation
Lecture 2 Data types Green Chalk Board,
Presentation
Lecture 3 Abstract data types Green Chalk Board,
Presentation
Lecture 4 Characteristics of data Structures Green Chalk Board,
Presentation
Lecture 5 Operations on data structures Green Chalk Board,
Presentation
Lecture 6 Numerical Problems and Types of data structures Green Chalk Board,
Presentation
Lecture 7 The running time of a program Green Chalk Board,
Presentation
Lecture 8 Asymptotic notations and Analysis of Algorithms Green Chalk Board,
Presentation
Lecture 9 Time and Space Complexity Green Chalk Board,
Presentation
Lecture 10 Stacks Green Chalk Board,
Presentation
Lecture 11 Implementation of stacks Green Chalk Board,
Presentation
Lecture 12 Operations on stacks Green Chalk Board,
Presentation
Lecture 13 Applications of Stacks Green Chalk Board,
Presentation
Lecture 14 Conversion and evaluation of arithmetic expressions Green Chalk Board,
Presentation
Lecture 15 Queues: Implementation of queues, array, and linked list Green Chalk Board,
Presentation
Lecture 16 Operations on queues Green Chalk Board,
Presentation
Lecture 17 Conversion and evaluation of arithmetic expressions Green Chalk Board,
Presentation
Lecture 18 Notations and Analysis Green Chalk Board,
Presentation
Lecture 19 Problem Solving Session Green Chalk Board,
2
Presentation
Lecture 20 Sparse matrices Green Chalk Board,
Presentation
Lecture 21 Structures and arrays of structures Green Chalk Board,
Presentation
Lecture 22 Singly linked lists Green Chalk Board,
Presentation
Lecture 23 Operations on Polynomials Green Chalk Board,
Presentation
Lecture 24 Doubly Linked Lists Green Chalk Board,
Presentation
Lecture 25 Circularly Linked Lists Green Chalk Board,
Presentation
Lecture 26 Operations on linked lists Green Chalk Board,
Presentation
Lecture 27 Insertion, deletion and traversal Green Chalk Board,
Presentation
Lecture 28 Basic terminology Green Chalk Board,
Presentation
Lecture 29 General Trees Green Chalk Board,
Presentation
Lecture 30 Binary Trees and Tree Traversing Green Chalk Board,
Presentation
Lecture 31 Building a binary search tree Green Chalk Board,
Presentation
Lecture 32 Problem Solving Session and Operations on Binary Trees Green Chalk Board,
Presentation
Lecture 33 Height Balanced Trees (AVL) Green Chalk Board,
Presentation
Lecture 34 B-trees and B+ -trees Green Chalk Board,
Presentation
Lecture 35 Graphs, Data Structures for Graphs Green Chalk Board,
Presentation
Lecture 36 Breadth First Search and its applications Green Chalk Board,
Presentation
Lecture 37 Depth First Search and its applications Green Chalk Board,
Presentation
Lecture 38 Single-source shortest path problem Green Chalk Board,
Presentation
Lecture 39 All-pair shortest path problem Green Chalk Board,
Presentation
Lecture 40 Strong components and Minimum cost spanning tress Green Chalk Board,
Presentation
Lecture 41 Problem Solving Session, Articulation points Green Chalk Board,
Presentation
Lecture 42 Applications and Pragmatics of Sorting Green Chalk Board,
Presentation
Lecture 43 Bubble sort Green Chalk Board,
Presentation
3
Lecture 44 Insertion sort, Selection sort and Heap Sort Green Chalk Board,
Presentation
Lecture 46 Sorting by Bucketing and Binary Search and Related Green Chalk Board,
Algorithms Presentation
Lecture 47 Green Chalk Board,
Problem Solving Session
Presentation
No. of Theory Lectures:47
Tutorials: Nil
Theory Total: 47
COURSE PLAN – PART II
Lab No. Experiment Way of Execution
Lab 1 Implement array operations sorting and searching Using C/C++
Lab 2 Implement a stack with push and pop operations. Using C/C++
Lab 3 Implement a queue with enqueue and dequeue Using C/C++
operations.
Lab 4 Implement singly, doubly, and circular linked list with Using C/C++
insertion, deletion, and traversal operations.
Lab 5 Convert infix to postfix expression using stack data Using C/C++
structure.
Lab 6 Implement tree traversal algorithms of trees. Using C/C++
Lab 7 Create a binary search tree of given integers and Using C/C++
perform different traversal operations.
Lab 8 Perform insertion into a B-tree. Using C/C++
Lab 9 Implement Knuth-Morris- Pratt pattern matching Using C/C++
algorithm.
Lab 10 Implement Depth First Search. Using C/C++
Lab 11 Implement Breadth-First Search Using C/C++
Lab 12 Reverse the elements in the stack using recursion. Using C/C++
4
COURSE ASSESSMENT METHODOLOGY
S. No. Mode of Assessment Week/Date Duration %
Weightage
1. MidTerm Exam 03-05, Mar.’25 One hour 20
2. One hour 20
3. TP a) Unit Test 2nd Week April.’ 25 20
Assessm b) Viva- voce 1st Mar. ’ 2025
ent c) Problem 3rd Week March.’ 2025
Assignment
4. End Semester Examination 05 May.’25-09, May.’25 Three hours 40
Total Theory 100
5. Lab Report 10
6. Demo 15
7. Viva – Voce I (Internal) 1st week Mar.’ 25 Lab Hours 25
8. Viva – Voce II (Internal) Between 23-30 Apr.’ Lab Hours 25
25
9. External Viva - voce 13 May.’25-17, May.’25 Lab Hours 25
Total Lab 100
Final Total = 60% of Theory+ 40% of Lab
COURSE ATTENDANCE POLICY
As per Institute Policy.
COURSE EXIT SURVEY
Student feedback form will be collected at the end of the course. Further the feedback from
the students will be collected in the class committee meetings.
MODE OF CORRESPONDENCE (Email/Phone)
Email: neha@[Link], Phone: 9418646314
TEXT BOOKS
Text Books:
1. Skiena Steven S., “The Algorithm Design Manual”, Springer, 2nd edition, 2008.
2. Cormen, T., Lieserson, C., Rivest, R., and Stein, C., “Introductions to Algorithms”, Prentice-
Hall India, 3rd edition, 2009.
Reference Books:
1. Dasgupta, Sanjoy, Papadimitriou, Christos H. and Vazirani, Umesh V. “Algorithms”, Tata
McGraw-Hill, 2008.
2. Kruse, Tondo and Leung, “Data Structures and Program Design in C”, 2nd edition,
Prentice-Hall, 1997.
3. Lipschutz, Seymour, “Data structures”, McGraw Hill revised first edition, 2014.
5
4. 4. Skiena Steven S., “The Algorithm Design Manual”, Springer, 2nd edition, 2008.
FOR APPROVAL
Faculty: Dr. Neha Sharma Convener DUGC Director
