COURSE PLAN

Department Computer Science and Engineering

Data Structures (CSE)

Course Name Course Code CSE 2122

Semester III Curriculum 2022

Name of the faculty Dr.T. Academic year 2023-24

SUJITHRA
No. of Contact Hours/Week L T P C: 3 1 0 4
 COURSE OUTCOMES (CO’S)

No. of
At the end of this course, the student should be able to: Marks
Hours

Illustrate the usage of user defined data types and dynamic memory 10 20
CO1
management functions.

CO2 Design applications using queues and stacks. 8 18

CO3 Develop applications using linked lists 14 26

CO4 Apply concepts of trees for hierarchical data representation. 13 25

Outline graph representations and graph traversals. 3 6

CO5

CO6 Select suitable data structure for the representation of real-

world information and problem solving. SDL 5

Total hours/ Marks 48 100

 In semester & End semester plan and schedule
(AY:2022-23)

Blooms
Component Syllabus: Topics
Max. Schedule taxonomy
Type coveredduring
Marks levels

MISAC-1 (Quiz) 5 L6 to L14 August 28 – 3 to 6

September 2
(CO1,&2)
MISAC 2 - Mid-term Exam 30 L1 to L26 Sep 25 – Sep 30 2 to 6
(CO1, 2 ,&3 )
MISAC3 - (Quiz) 5 L16 to L23 (CO2,&3) October 9-14 3 to 6

FISAC (Quiz) 10 L26 to L48, October 30 to 3 to 6

SDL(CO3,4,5&6) November 6
END Semester examination 50 L1 – L48 Nov 29 – Dec 12 2 to 6
(CO1 – CO5)
* Tentative dates, may change based on the portion covered

Blooms Taxonomy Level

No Components First year Higher semester
A QUIZ / MCQs 2 to 6 3 to 6

B Surprise Assignment 3 4
C Take home assignment 3 4
D Group Assignment 4 5
E Seminar 4 5
F Quiz based on invited talks 4 5
G Development of SW/Apps 4 5
H Mini Project 4 5
 LESSON PLAN

Lecture CO's
Topic
No. addressed
L0 Introductory class(Introduction between teacher & students. Overview of the subject). -
Recursion
L1 CO1
pointers, pointer declaration and definition, initialization of pointer variables, Accessing variables CO1
L2
through pointers
CO1
L3 Pointers for inter function communication, pointers to pointers
CO1
L4(T1) Arrays and pointers, pointer arithmetic and arrays

Passing an array to a function CO1

L5

Memory allocation functions CO1

L6

array of pointers CO1

L7
CO1
L8 Type definition, enumerated types
CO1
L9(T2) Structures: structure type declaration, initialization, accessing, operations
CO1
L10 Sparse Matrix representation
CO2
L11 Stacks

Queues CO2
L12
CO2
L13 Applica tions of stack: Evaluation of Expression
(T3)
L14 Infix, postfix, and prefix expressions CO2

Applications of stack: infix, postfix and prefix conversions CO2

L15

CO2
L16 Application of queues: Priority Queues and their representations
(T4)
CO2
L17 Input and Output Restricted queues
CO2
L18 Applications of Stacks

Singly linked list and Chains CO3u

L19

Representing Chains in C CO3

L20
(T5)
Linked Stacks CO3
L21
CO3
L22 Linked Queues

Applications of List: Polynomials CO3

L23
 L24 List representation of polynomials /
(T6)
CO3
L25 Additional list Operations

CO3
L26 Doubly Linked Lists
CO3
L27 Doubly Linked Lists

Circular Linked Lists CO3

L28
(T7)
CO3
L29 Circular Linked Lists
CO3
L30 Linked Lists with Header Node
CO3
L31 Applications using linked lists.

Applications using linked lists CO3

L32
(T8)
CO4
L33 Terminologies in trees
CO4
L34 Representation of trees
CO4
L35 Binary trees, properties

L36 Binary tree representation CO4

(T9)
CO4
L37 Binary tree traversal
CO4
L38 Binary tree traversal
CO4
L39 Traversal without a stack
CO4
L40 Additional binary tree operations
(T10)
CO4
L41 Threaded binary trees – In-order traversal , Insertion
CO4
L42 Binary Search Trees
CO4
L43 Applications of tree: Binary search tree traversal
CO4
L44 Insertion in Binary Search tree
(T11)
CO4
L45 Deletion in binary search tree
CO5
L46 Introduction, Definitions, Graph Representations
CO5
L47 Depth First Search
CO5
L48( Breadth First Search
T12)
 References:

References
Behrouz A. Forouzan, Richard F. Gilberg “A Structured Programming Approach Using C”,
1
3rd Edition, Cengage Learning India Pvt. Ltd, India, 2007.
Ellis Horowitz, Sartaj Sahni , Susan Anderson and Freed, “ Fundamentals of Data Structures in
2
C”, 2nd Edition, Universities Press, India, Reprint 2011.
Richard F. Gilberg, Behrouz A. Forouzan, “Data structures, A Pseudocode Approach with C”,
3
2nd Edition, Cengage Learning India Pvt. Ltd, India , 2009
Tenenbaum Aaron M., Langsam Yedidyah, Augenstein Moshe J., “Data structures using C”,
4
1st Edition, Pearson Prentice Hall of India Ltd., 2007.
5 Debasis Samanta, “Classic Data Structures”, 2nd Edition, PHI Learning Pvt. Ltd., India, 2010

Submitted by: SUJITHRA T

Name of the faculty

(Signature of the faculty)

Date: 10/08/2023

Approved by:
(Signature of HOD)
Date: 10/08/2023

FACULTY MEMBERS TEACHING THE COURSE (IF MULTIPLE SECTIONS

EXIST):
FACULTY NAME SECTION

Mr. Shivaprasad G. A
Mr. Venkatesh A Bhandage B
Dr.T.Sujithra C
Dr. Radhika Kamath D
 COURSE PLAN – ADDITIONAL DETAILS

Program
No. of Program Learning Blooms
At the end of this course, the student Specific
contact Marks outcomes outcomes Taxonomy
should be able to: outcomes
Hours (POs) (LOs) (BT)
(PSOs)
Illustrate the usage of user
CO1 defined data types and dynamic
memory management functions. 10 20 1,2,3,8 1 1,2,4 2,3,4
Design applications using queues
CO2 and stacks.
6 18 1,2,3,8 1 1,2,4 2,3,4
Develop applications using linked
CO3 lists
11 26 1,2,3,8 1 1,2,4 2,3,4,6
Apply concepts of trees for
CO4 hierarchical data
representation. 12 25 1,2,3,8 2 1,2,4 2,3,4
Outline graph representations and 2 1,2,4 2,3,4
CO5 graph traversals. 3 6 1,2,3,8
Select suitable data structure
for the representation of real-
CO6 world information and problem SDL 5 1,2,3,8 2 1,2,4 3,4,6
solving.
Total hours/ Marks 48 100
 Mapping of course outcomes (COs) with Program outcomes (POs) and Program Specific outcomes (PSOs)

Course outcomes (COs) PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3 PSO4
Illustrate the usage of user
defined data types and dynamic
CO1 memory management functions. 2 2 1 - - - - 1 - - - - 3 1 - 1
Design applications using
CO2 queues and stacks.
2 2 1 - - - - 1 - - - - 3 1 - 1
Develop applications using linked
CO3 lists
2 2 1 - - - - 1 - - - - 3 1 - 1
Apply concepts of trees for
CO4 hierarchical data representation.
2 2 1 - - - - 1 - - - - 3 1 - 1
CO5 Outline graph representations and 2 2 1 1 3 1 1
graph traversals.
CO6 Select suitable data structure for
the representation of real-world
information and problem solving.
Average Program Articulation Level 2 2 1 - - - - 1 - - - - 3 1 - 1
 Mapping of course learning outcomes (CLOs) with AHEP Learning outcomes (AHEP LOs)

Course Learning Outcomes (CLOs) C1 C2 C3 C4 C5 C6 C7 C8 C9 C10 C11 C12 C13 C14 C15 C16 C17 C18

CSE Illustrate the usage of user defined data

2122.1 types and dynamic memory management ✓
functions.
CSE Design applications using queues and
2122.2 stacks. ✓

CSE Develop applications using linked lists

2122.3 ✓

CSE Apply concepts of trees for hierarchical data

2122.4 representation. ✓

CSE Outline graph representations and graph

2122.5 traversals. ✓

CSE Select suitable data structure for the ✓ ✓

2122.6 representation of real-world information and
problem solving.

Abbreviations
1. CO – Course Outcome
2. PO – Program Outcome
3. PSO – Program Specific Outcome
4. LO – Learning Outcome
5. CLO – Course Learning Outcome
6. BT – Blooms Taxonomy
7. AHEP – The Accreditation of Higher Education Programmes