JKKN COLLEGE OF ARTS & SCIENCE

(AUTONOMOUS)
(ACCREDITED BY NAAC, APPROVED BY AICTE,
AFFILIATED TO PERIYAR UNIVERSITY, SALEM-11)
KOMARAPALAYAM- 638 183, NAMAKKAL (Dt).

B.Sc COMPUTER SCIENCE WITH CYBER SECURITY PROGRAMME

OBE UNDER CHOICE BASED CREDIT SYSTEM
(With effect from the academic year 2025-2026 onwards)
Programme: B.SC COMPUTER SCIENCE CYBER SECURITY SCHEME OF LEARNING
AND EVALUATION
(For the students admitted in the academic year 2025 – 2026 onwards) Outcome Based Curriculum
Framework with CBCS
FIRST SEMESTER
Exam Hours Max. Marks
Course (Hrs) Credit
Part Title of the Course
Code s L P Total CIA ESE Total

Part- I 25UGTA01 General Tamil-I 3 3 5 - 5 40 60 100

Part- II 25UGEN01 General English-I 3 3 5 - 5 40 60 100
25UCYC01 Core – I – Programming in C 3 5 5 - 5 40 60 100
25UCYCP01Core Practical – I - Programming in C
3 3 - 4 4 40 60 100
Part- Lab
III Generic Elective – I : NSS I/Sports -
25UMAGE I/First Aid & Safety/ Swayam 3 5 7 - 7 40 60 100

NME –I - Digital advertising and 3 2 2 - 2 40 60 100

25UCYNM1
Part- IV strategies
SEC – I Cybersecurity with AI 3 2 2 - 2 40 60 100
25UCYS01 Acceleration - Foundations
TOTAL 23 26 4 30 700
SECOND SEMESTER
Part- I 25UGTA02 General Tamil-II 3 3 5 - 5 40 60 100
Part- II 25UGEN02 General English-II 3 3 5 - 5 40 60 100
Core – II – Data Structures and -
25UCYC02 3 5 5 5 40 60 100
Algorithms
Core Practical – II - Data Structures
25UCYCP02 3 3 - 4 4 40 60 100
and Algorithms Lab
Part- III Generic Elective-II :NSS
25UMAGE II/Sports-II/Women’s 3
3 4 - 4 40 60 100
Right/Swayam
Generic Elective-II Practical:NSS
25UMAGE II/Sports - II/Women’s 3 2 - 3 3 40 60 100
Right/Swayam
25UCYNM2 NME - II - Digital skills for 3 2 2 - 2 40 60 100
Part- IV Employability
25UCYS02 SEC – II - Cybersecurity with AI 3 2 2 - 2 40 60 100
Acceleration - Implementation
TOTAL 23 23 7 30 800

Signature of the Board Chairman Signature of the CD Co-ordinator

Signature of the Principal
18
 SEMESTER – I

Core - I Programming in C
Course
Total Hours Contact Hours Credits
code
25UCYC01 5 5 5
Course Objectives
The main objectives of this course are
1 To Understand the concept of data types
2 To familiarize the students with the understanding of code organization
3 To Demonstrate the concept of Structure and its applications
4 To improve the programming skills
5 Learning the basic programming constructs.
Expected Course Outcome:
CO
On the successful completion of the course, student will be able to:
numbers

Outline the fundamental concepts of C programming languages,

CO 1
andits features
CO 2 Demonstrate the programming methodology.
K1, K2, K3,
CO 3 Identify suitable programming constructs for problem solving.
K4, K5, & K6
Select the appropriate data representation, control structures,
CO 4
functions and concepts based on the problem requirement.
CO 5 Evaluate the program performance by fixing the errors.
K1 - Foundational Knowledge, K2 - Application, K3 - Integration,
K4 - Human Dimension, K5 - Caring, K6 - Learning How to Learn
Course content
Studying Concepts of Programming Languages- Language Evaluation Criteria -
Language design - Language Categories - Implementation Methods – Programming
Environments - Overview of C: History of C- Importance of C- Basic Structure of C
I
Programs- Executing a C Program- Constants, Variables and Data types -
Operators and Expressions - Managing Input and Output Operations - Modern C
Standards (C11, C18) and their enhancements over ANSI C
Decision Making and Branching: Decision Making and Looping - Arrays -
II Character Arrays and Strings - Memory Efficiency with Arrays and Cache
Performance
User Defined Functions: Elements of User Defined Functions- Definition of
III Functions- Return Values and their Types- Function Call- Function Declaration-
Categories of Functions- Nesting of Functions- Recursion
Structures and Unions: Introduction- Defining a Structure- Declaring Structure
Variables Accessing Structure Members- Structure Initialization- Arrays of
IV
Structures- Arrays within Structures- Unions- Size of Structures - Self-referential
Structures and Linked Data Structures (Linked List, Tree Nodes)

23
 Pointers: Understanding Pointers- Accessing the Address of a Variable- Declaring
Pointer Variables- Initializing of Pointer Variables- Accessing a Variable through its
Pointer- Chain of Pointers- Pointer Expressions- Pointer and Scale Factor- Pointer
V
and Arrays- Pointers and Character Strings- Array of Pointers- Pointer as Function
Arguments- Functions Returning Pointers- Pointers to Functions- File
Management in C (Student must be submit the report )-Memory Debugging Tools.
1. Robert W. Sebesta, (2012), ―Concepts of Programming Languages‖, Fourth
Edition, Addison Wesley (Unit I : Chapter – 1)
Text Books
2. E. Balaguruswamy, (2010), ―Programming in ANSI C‖, Fifth Edition, Tata
McGraw Hill Publications.
1. Ashok Kamthane, (2009), ―Programming with ANSI & Turbo C‖, Pearson
Reference Education.
Books 2. Byron Gottfried, (2010), ―Programming with C‖, Schaums Outline Series,
Tata McGraw Hill Publications
1. http://www.tutorialspoint.com/cprogramming/
Web
2. http://www.cprogramming.com/
Resources
3. http://www.programmingsimplified.com/c-program-examples

Pedagogy

Lecture by Chalk and talk, Power point presentation, E-content, Simulation, Group discussion,
Assignment, quiz and Seminar.

Verified by BoS Chairman

Course Designer

Name and Designation :

Signature :

MAPPING WITH PROGRAMME OUTCOMES

COs PSO1 PSO2 PSO3 PSO4 PSO5 PO1 PO2 PO3 PO4 PO5
CO1 H H H M H S H H M L
CO2 H H M M H H H M M L
CO3 H H M M H H H M M H
CO4 H H M H M H H M H M
CO5 L H M H M H H M H S
H-High;M-Medium;L-Low

24
 Core
Programming in C Lab
Practical - I
Course code Total Hours Contact Hours Credits
25UCYCP01 4 4 3
Course Objectives
The main objectives of this course are
1 The Course aims to provide exposure to problem-solving through C
programming
2 It aims to train the student to the basic concepts of the C -Programming language
3 Apply different concepts of C language to solve the problem
4 Compare the pros and cons of procedure oriented language with the concepts of
object Oriented language.
5 Be able to read and write files in Programming
CO numbers Expected Course Outcome:
On the successful completion of the course, student will be able to:
Demonstrate the understanding of syntax and semantics of C
CO 1
programs.
Identify the problem and solve using C programming
CO 2
techniques.
Identify suitable programming constructs for problem K1, K2, K3,
CO 3
solving. K4, K5, & K6
Analyze various concepts of C language to solve the problem
CO 4
in an efficient way.
Develop a C program for a given problem and test for its
CO 5
correctness.
K1 - Foundational Knowledge, K2 - Application, K3 - Integration,
K4 - Human Dimension, K5 - Caring, K6 - Learning How to Learn
Course content
1. Write a C program to Programs using Input/ Output functions
2. Write a C program to Programs on conditional structures.
3. Write a C program to Command Line Arguments
4. Write a C program using Arrays.
5. Write a C program to String Manipulations.
6. Write a C Program using Functions.
7. Write a C Program to Recursive Functins.
8. Write a C Program using Pointers.
Write a C Program to create a File and to display the contents of that file with
9.
line numbers.
10. Write a C Program using structure & Unions.

25
 1. Ellis Horowitz, SartajShani, Data Structures, Galgotia Publication.
2. Ellis Horowitz, SartajShani, SanguthevarRajasekaran, Computer
Algorithms, Galgotia Publication.
3. Michael T. Goodrich, Roberto Tamassia, and Michael H. Goldwasser,
Text Books ―Data Structures & Algorithms in Python‖, John Wiley & Sons Inc., 2013.
4. Lee, Kent D., Hubbard, Steve, ―Data Structures and Algorithms with
Python‖ Springer Edition 2015.
5. Aho, Hopcroft, and Ullman, ―Data Structures and Algorithms‖, Pearson
Education.
1. Jean-Paul, Tremblay & Paul G .Sorenson , An Introduction to Data structures
with Applications Tata McGraw Hill Company 2008, 2ndEdition.
Reference 2. Samanta.D , Classic Data Structure Prentice Hall of India Pvt Ltd 2007, 9th
Books Edition.
3. Seymour Lipschutz, Data Structures McGraw Hill Publications, 2014, 1st
Edition.
Web 1. https://www.tutorialspoint.com/data_structures_algorithms/index.htm
Resources 2. https://techdevguide.withgoogle.com/paths/data-structures-and-algorithms/

Pedagogy

Lecture by Chalk and talk, Power Point Presentation andAssignment.

Course Designer Verified by BoS Chairman

Name and Designation :

Signature :

MAPPING WITH PROGRAMME OUTCOMES

COs PSO1 PSO2 PSO3 PSO4 PSO5 PO1 PO2 PO3 PO4 PO5
CO1 H H H H H S H H H H
CO2 H H L H M H H L H M
CO3 H H H H M H H H M M
CO4 H H H H M H H H H L
CO5 H M H H H H M H H H

H-High;M-Medium;L-Low

26