Program Outcomes

PO1 Engineering An ability to apply knowledge of mathematics (including

knowledge probability, statistics and discrete mathematics), science, and
engineering for solving Engineering problems and modeling
PO2 Problem analysis An ability to design, simulate and conduct experiments, as well as to
analyze and interpret data including hardware and software
components
PO3 Design / An ability to design a complex system or process to meet desired
development of specifications and needs
solutions
PO4 Conduct An ability to identify, formulate, comprehend, analyze, design
investigations of synthesis of the information to solve complex engineering problems
complex and provide valid conclusions.
problems
PO5 Modern tool An ability to use the techniques, skills and modern engineering tools
usage necessary for engineering practice
PO6 The engineer An understanding of professional, health, safety, legal, cultural and
and society social responsibilities
PO7 Environment The broad education necessary to understand the impact of
and engineering solutions in a global, economic, environmental and
sustainability demonstrate the knowledge need for sustainable development.

PO8 Ethics Apply ethical principles, responsibility and norms of the engineering
practice
PO9 Individual and An ability to function on multi-disciplinary teams.
team work
PO10 Communication An ability to communicate and present effectively

PO11 Project An ability to use the modern engineering tools, techniques, skills and
management management principles to do work as a member and leader in a team,
and finance to manage projects in multi-disciplinary environments
PO12 Life-long A recognition of the need for, and an ability to engage in, to resolve
learning contemporary issues and acquire lifelong learning
 ICFAI Foundation for Higher Education
Faculty of Science and Technology (IcfaiTech)
Second Semester, 2022 - 2023
Course Handout

L P U
Course No: CS102 Course Title: Data Structures 2 4 4

Instructor In-charge: Dr. P Rohini

Instructors: Ms. Sathya A R, Dr. Rashmi Sahay, Mr. K. Brahma Naidu

Learning Outcomes:

After successful completion of the course, students will be able to

1. Understand how to use data structure concepts for real-life applications.

2. Ability to identify appropriate data structures for solving computing problems in the
respective language.
3. Ability to solve complex problems independently and think critically.

Text books
T1 Fundamentals of Data structures in C, 2nd Edition, E. Horowitz, S. Sahni and
Susan Anderson-Freed, Universities Press
T2 Data Structures, S. Lipscutz, Schaum’s Outlines, TMH
Reference
books
R1 Data structures: A Pseudo code Approach with C, 2nd edition, R. F. Gilberg
And B. A.Forouzan, Cengage Learning.
R2 Data structures A Programming Approach with C, D. S. Kushwaha and A.K.
Misra, PHI.
R3 Understanding Pointers in C, Yashavant kanetkar, BPB Publications.

Lecture-wise Plan

Lecture Learning Objective Topics to be covered Reference

Nos Book(s)

1  To understand the Need and advantages of data T2(Ch.1)

role and need of structure.
Data Structures

2  To learn about Basics of Array, operations on array, T1 (Ch.2)

operations that can be inserting, deleting and traversing. T2( Ch.4 )
performed on arrays

3-5  To understand the Basics of pointer, pointer with T1 (Ch.1 )

concept of Pointers function, array of pointers, pointer to
  To implement functions array, Dynamic memory Allocation,
and arrays using applications, advantages and
pointers. disadvantages of pointer.

6-9  To learn the concept of Fundamentals, stack T1(Ch.3)

Stack and its operations implementation using array and
 To explore various linked list,
applications of stack Stack operations: traversing,
 To illustrate the insertion, deletion.
applications of stack Infix to postfix conversion and vice
versa, postfix expression evaluation,
and recursion.
10-13  To understand the Fundamentals, queue implementation T1(Ch.3)
working of Queue, using array and linked list.
operations on queues Queue operations: traversing, insertion
and types of queues. and deletion.
 To demonstrate the Double-ended queue: Basics,
queue operations implementation, operations.
Circular queue: Basics,
implementation, operations.
Application of queue
14-18  To get exposed to Single linked list: basics, T1(Ch.4)
various types of linked representation, operations: insertion,
lists , representations deletion, traversing.
and operations Double linked list: basics,
representation, operations: insertion,
deletion, traversing.
Circular linked list: basics,
representation, operations: insertion,
deletion, traversing.

19-22  To know and analyze Searching: Linear search and Binary T1 (Ch.7)
searching and sorting search T2 (Ch.4)
techniques Sorting: Insertion sort, selection
sort, bubble sort, merge sort, quick
sort.
23-25  To understand the Fundamentals, representation of T1(Ch.5)
concept of trees and its Tree and Binary tree: complete
properties binary tree, tree, traversals: In order,
 To implement various preorder, post order traversal.
tree traversal
techniques.

26-29  To learn how to create Binary search tree: Basics, tree T1

binary search tree and representation, in order, pre order, (Ch.5, Ch.10)
AVL tree. post order traversal. AVL tree:
  To perform various Representation and operations
operations on trees.

30-31  To learn the Representation of graph, cyclic graph, T1(Ch.6)

properties of graphs and its acyclic graph, adjacency matrix.
representation.

32-33  To understand graph Traversal: Depth first search, Breadth T1

traversal methods. first search. Minimum spanning tree, (Ch.6 , Ch. 8)
 To get exposed to shortest path
(Dijkstra algorithm), Prim’s algorithm.
various shortest path Hashing.
algorithms.

Data Structures Lab

S.No Name of the Experiment

1 Implementation of Array and accessing the arrays using pointers

2. Implementation of Stack using arrays & linked list using C

3 Implementation of Infix to postfix conversion using C

4 Implementation of post-fix expression evaluation using C

5 Implementation of Queue using C

6 Implementation of Circular Queue using C

7 Implementation of Single Linked List using C

8 Implementation of Double Linked List using C

9 Implementation of Circular Linked List using C

10 Implementation of Linear Search and Binary Search using C

11 Implementation of Insertion Sort , Selection Sort& Merge Sort using C

12 Implementation of Bubble Sort & Quick Sort using C

13 Implementation of Binary Tree using C

14 Implementation of Binary Search Tree & Traversals using C

15 Implementation of AVL Tree using C

16 Implementation of Graph traversals using C

Evaluation Scheme:

Student evaluation is based on a series of Assessment Tests and Tests conducted during the course of
the semester followed by a comprehensive examination.

Evaluation Syllabus
Duration Weightage Date Remarks
Component (Lec. No.)
Test 1 60 Minutes 15 02.03.2023 1-13 CB
Test 2 60 Minutes 15 13.04.2023 14-22 CB
13th -17th
Lab Mid
90 Minutes 10 March (during Lab 1-7 CB
Evaluation
lab slots )
Lab 8th -12th May
Comprehensive 90 Minutes 15 (during lab Lab 8 -16 CB
Evaluation slots )
Attendance - 5* Through out - -

Comprehensive 180 Minutes 07.06.2023

40 1- 33 CB
Exam

*Attendance marks will be awarded as per the slabs given below

 <=75 -> 0M
 >75 and <=80% -> 2M
 >80 and <=90% -> 3M
 >90% -> 5M

Make-up Policy: Make–up will be given only under genuine circumstances for Tests Only.
However prior and proper intimation to the concerned instructor is a must.

General: It shall be the responsibility of individual students to attend all sessions, to take prescribed
Assessment Tests, Tests and Comprehensive Examinations, etc.

COURSE OUTCOMES:

COURSE OUTCOME EXPLANATION

CO1 : KNOWLEDGE Understand the concept of Abstract Data Types.
CO2 : Ability to select the data structures that efficiently model the information
COMPREHENSION in a problem.
CO3 : APPLICATION Ability to assess efficiency trade-offs among different data structure
implementations or combinations.
CO4 : ANALYSIS Ability to compare the efficiency of various algorithms for a given
problem in terms of time and space complexity.
CO5 : SYNTHESIS Implement and know the application of algorithms for linear and non-
linear data structures.
CO6 : EVALUATION Design programs using a variety of data structures, including hash tables,
binary and general tree structures, search trees, graphs, and AVL-trees
CO-PO MAPPING:

CO/PO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 2 1
CO2 2 2
CO3 3 2 1
CO4 1 2 2 1
CO5 2 3 1
CO6 2

The various correlation levels are:

● “1” – Slight (Low) Correlation
● “2” – Moderate (Medium) Correlation
● “3” – Substantial (High) Correlation
● “-” indicates there is no correlation.

GAPS IN THE SYLLABUS - TO MEET INDUSTRY/PROFESSION REQUIREMENTS:

SNO DESCRIPTION PROPOSED ACTIONS

1 Competitive Coding Students are encouraged to register in
competitive coding platforms like code
chef, hacker rank
2 Algorithm visualization Students are exposed to visualization tools

TOPICS BEYOND SYLLABUS/ADVANCED TOPICS/DESIGN:

S.No. ADVANCED TOPICS

1 B, B+ Trees
2 Red Black Tree
3 Threaded Binary Tree

WEB SOURCE REFERENCES:

S.No. Web links

1 https://onlinecourses.swayam2.ac.in/cec23_cs09/previewData Structures - Course
(swayam2.ac.in)
2 https://www.cs.usfca.edu/~galles/visualization/ (Link for Algorithm Visualization)

DELIVERY/INSTRUCTIONAL METHODOLOGIES:

  
BOARD STUD. ASSIGNMENT WEB RESOURCES

STUD. SEMINARS  

ICT ENABLED CLASSES LCD

ASSESSMENT METHODOLOGIES-DIRECT:


 MINI/MAJOR
TESTS/COMPRE. PROJECTS
EXAMS ASSIGNMENT

 

STUD. SEMINARS STUD. LAB PRACTICES STUD. VIVA

ASSESSMENT METHODOLOGIES-INDIRECT:


ASSESSMENT OF COURSE OUTCOMES 
(BY FEEDBACK, ONCE) STUDENT FEEDBACK ON FACULTY
(TWICE)


OTHERS
ASSESSMENT OF MINI/MAJOR
PROJECTS
 Justification for CO-PO MAPPING:

CO/P PO PO PO
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO10 PO12
O 8 9 11
Understanding Understanding Application of
ADT helps in ADT enhances the appropriate
applying ability to design storage and
appropriate data dynamic functions manipulation
CO1
storage and access that may be used to mechanism on
mechanism solve complex data of various
problems types, orders and
size
Ability to model Selection of
raw information suitable data
into a form that structures for
CO2
can be accessed capturing
and manipulated requirements
by software
Ability to compare Ability to compare Ability to identify
and comprehend and comprehend appropriate
algorithms for data algorithms that criteria for
CO3
access and meet the design algorithm
manipulation requirements selection for
problem-solving
Ability to Ability to compare Ability to identify Models for
apply and comprehend appropriate efficiency
some models for models for computation are
models efficiency efficiency use applicable
CO4
for computation computation for problems
efficiency that may be
computati solved through
on
 software
implementation

Model linear and Apply efficient

nonlinear data manipulation
CO5 using appropriate mechanisms to
storage mechanism linear and
nonlinear data
Applying more
than one data
CO6 structure for
complex problem
solving

Dr. P Rohini
Instructor-In-charge