LECTURE PLAN

Subject: Data Structure Paper Code: FYCYS 202 (T)

Stream: B.Sc Cyber Security Year & Sem: 1st Year, 2nd SEM
Credits: 3T + 2 P Session: Even Semester, 2023-24
Faculty: Prof. SAYAN MAJUMDER
………………………………………………………………………………………………………

A. Course Type: CC1

I. Objective: The course offers a first-hand learning experience to 1st year UG students in solving
general and complex problems closely matched real-life scenarios through the lens of a
programming language. The basic offering of this course as follows:
 Understanding Basic of Data Structures
 Understanding code organization
 Building problem-solving skills
 Preparing for future courses
II. Prerequisites: Programming for Problem-Solving using C
III. Add-ons: Understanding the latest of GCC standards.
IV. Target Audience: 1st Year 2nd Semester Students
B. Course Outcome (CO)

Sl. Course Outcome (CO)

1 Remember & Understand how the choice of data structures and
No. algorithm designmethods impacts the performance of programs.
2 Remember & Understand how to solve problems using data structures
such aslinear lists, stacks, queues, hash tables, binary trees
Understand and identify the ability to design, implement, and evaluate a
3 computer-based system, process, component, or program to meet
desired needs

4 Understand & Apply the appropriate data structure and algorithm design
Method for a specified application

5 Relate the ability to apply design and development principles in the

constructionof software systems of varying complexity

6 Application & Analysis using guided competitive programming laboratory

work

Sayan Majumder 2023-24 Even Semester FYCYS 202 Page 1

 C. Course-Module Mapping
THEORY- FYCYS 202
CO Modules Questions %age Total Hrs. Blooms Level
CO1 M1 10 6 1,2
CO2 M2 20 6 1,2
CO3 M3 20 6 1,2
CO4 M4 20 6 1,2
CO5 M5 10 6 1,2
CO6 M6 20 10 1,2
Total 100 40 1,2

D. Program Outcomes

Program Outcomes (POs) Level

PO1 Apply the knowledge of algorithmic principles, and computing
fundamentals in the modeling and design of computer-based 2
systems of varying complexity.
PO2 Able to critically analyze, categorize, formulate and solve the
problems that emerge in the field of computer science. 2
PO3 Logical reasoning and experiences in Programming.
3
PO4 Algorithm Development and Application Development to detect Cyber 3
Vulnerabilities

PO5 Use contemporary techniques, skills and tools necessary for 3

integrated solutions.
PO6 Able to identify the best algorithm to solve a computational task, 3
and write solutions using appropriate programming languages.
PO7 Function effectively as a member or leader on multidisciplinary 2
teams to accomplish a common objective.
PO8 Able to communicate effectively with diverse types of audiences 2
and also able to prepare and present technical documents to
different groups.
PO9 Able to understand and learn the latest technologies developed in 2
the area of Cyber Security
PO10 Ability to resolve new Cyber Threats and Progress in Research 3
Area.

Sayan Majumder 2023-24 Even Semester FYCYS 202 Page 2

 E. Program Educational Objectives

Program Educational Objectives (PEOs) Level

PEO1 Students will acquire new ideas, problem-solving & programming
skills in the diverse domains of Information Technology and its 2
applications.
PEO2 Students will be able to develop specialized skills by undergoing
extensive practical sessions, industry-oriented projects, and internships to
prepare them as competent Cyber Security professionals. 2
PEO3 Students will be able to develop and realize practical applications of cyber
3
security.
PEO4 Students will develop effective communication skills & develop an
2
attitude that will help them to lead the same group and pass on their
learning to their peers and subordinates in the group.
PEO5 Students will have a holistic understanding of risk management,
3
network security, security operations.

F. CO PO MAPPING

Course Articulation Matrix (CAM)

CO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10
FYCYS202.1 3 2 3 2 2 2 2 - - -
FYCYS202.2 3 3 3 2 2 3 - - - -
FYCYS202.3 3 3 3 3 3 3 2 2 - -
FYCYS202.4 3 3 3 3 3 3 - - - 2
FYCYS202.5 2 2 2 3 3 3 - - - 3
FYCYS202.6 3 3 3 3 3 3 - - 2 3
CO_avg 2.8 2.7 2.8 2.7 2.7 2.8 1.0 1.0 1.0 1.3

Strength of correlation between CO-PO: 3-High, 2-Moderate, 1-Low

% of students attaining 60%

Score
marks
COA Level >= 40 1
>= 50 2
>= 60 3

Sayan Majumder 2023-24 Even Semester FYCYS 202 Page 3

 G. Syllabus
Module I: Concepts of Abstract data type
Concept of abstract data types, Structure, union, enum, pointer to structure, Self-referential
structure, Pointer to pointer
Module II: Data Structure using Array
stack, queue, circular queue, priority queue, dequeue and their operations and applications.
Module III: Searching and Sorting
Searching: linear search, Binary search, their comparison, Sorting: insertion sort,
Selection sort. Quick sort, Bubble sort Heap sort, Comparisonof sorting methods ,
Analysis of algorithm, complexity using big 'O' notation
Module IV: Linked List
Linear link lists, doubly linked lists, stack using linked list, queue using linked list, circular
linked list and their operations and applications.
Module V: Trees
Binary trees, binary search trees, representations and operations, thread representations,
sequential representations, B tree B+ tree,
Module VI: Graphs & Hashing
Introduction to graphs, Definition, Terminology, Directed, Undirected & Weighted graph,
Representation of graphs, Graph Traversal: Depth first search and Breadth first search.
Spanning Trees, minimum spanning Tree, Shortest path algorithm. Definition of hashing,
Hashing functions, Load factor and collision, open addressing.

H. Lesson Plan
Module 1 Day wise Lecture Sub Topics

Day 1: 1L Concept of abstract data types

Structure, union
Day 2: 1L
Concepts of Abstract
enum
data type Day 3: 1L
Self-referential structure

Day 4: 1L pointer to structure

Sayan Majumder 2023-24 Even Semester FYCYS 202 Page 4

 Day 5: 1L Pointer
Day 6: 1L Pointer to pointer
Module 2 Sub Topics
Day 7: 1L Stack
Day 8: 1L Queue
Day 9: 1L Circular queue
Data Structure using
Array Day 10: 1L Priority queue
Day 11: 1L Dequeue and their operations
Day 12: 1L Applications.
Module 3 Lecture Sub Topics
Day 13: 1L Searching: linear search
Day 14: 1L Binary search, their comparison
Day 15: 1L Sorting: insertion sort
Day 16: 1L Selection sort. Quick sort
Searching and Sorting
Day 17: 1L Bubble sort Heap sort, Comparison of
sorting methods
Day 18:1L Analysis of algorithm, complexity using
big 'O' notation
Module 4 Lecture Sub Topics
Day 19: 1L Linear link lists
Day 20: 1L doubly linked lists
Day 21:1L stack using linked list
Linked List Day 22: 1L queue using linked list
Day 23: 1L Circular linked list
Day 24: 1L operations and applications.
Module 5 Lecture Sub Topics
Day 25: 1L Binary trees
Day 26: 1L binary search trees
Day 27: 1L representations and operations
Trees
Day 28: 1L thread representations

Sayan Majumder 2023-24 Even Semester FYCYS 202 Page 5

 Day 29: 1L sequential representations

Day 30: 1L B tree B+ tree

Module 6 Lecture Sub Topics
Day 31: 1L Introduction to graphs
Day 32: 1L Definition, Terminology
Day 33: 1L Directed, Undirected & Weighted graph
Day 34: 1L Representation of graphs
Day 35: 1L Graph Traversal: Depth first search and
Graphs & Hashing
Breadth first search.
Day 36: 1L Spanning Trees, minimum spanning
Tree
Day 37: 1L Shortest path algorithm
Day 38: 1L Definition of hashing, Hashing functions
Day 39: 1L Load factor and collision
Day 40: 1L open addressing.
Total 40Hrs.

University Recommended Text Books & Reference Books

Text Books
1. Expert Data Structures With C++ - R.B. Patel
2. Data structure using c and c++ - Tanenbaum
Reference Books
1. Fundamentals of Data structure in c++ - E.Horwitz,Sahni, D.Mehta

Sayan Majumder 2023-24 Even Semester FYCYS 202 Page 6