Kurukshetra University, Kurukshetra

(Established by the State Legislature Act XII of 1956)

(‘A++’ Grade, NAAC Accredited)

|| योगस्थ: कुरु कर्मा णि ||

सर्बुद्धि व योग युक्त होकर कर्ा करो
(Perform Actions while Stead fasting in the State of Yoga)

Scheme of Examination for Under-Graduate Programmes

Bachelor of Computer Applications (BCA): SCHEME D
according to
Curriculum Framework for Under-Graduate Programmes
As per NEP-2020 (Multiple Entry-Exit, Internships and Choice Based
Credit System)
DEPARTMENT OF COMPUTER SCIENCE & APPLICATIONS
(For the Batches Admitted From 2023-2024)

1
 Kurukshetra University Kurukshetra
Scheme of Examination for Undergraduate programmes
Subject: BCA
According to
Curriculum Framework for Undergraduate Programmes
as per NEP 2020 (Multiple Entry-Exit, Internships, and Choice Based Credit System)

Sem Course Course Code Nomenclature Credits Contact Internal End Total Duration
Type of paper hours marks term Marks of exam
Marks (Hrs)
T+P
1 CC-A1 B23-CAP-101 Problem Solving 3 3 20 50 70 3
through C
Practical 1 2 10 20 30 3
CC-B1 B23-CAP-102 Foundations of 3 3 20 50 70 3
Computer
Science
Practical 1 2 10 20 30 3
CC-C1 B23-CAP-103 Logical 3 3 20 50 70 3
Organization of
Computer

Practical 1 2 10 20 30 3
CC-M1 B23-CAP-104 Mathematical 1 1 10 20 30 3
Foundations for
Computer
Science-I
Practical 1 2 5 15 20 3

MDC1 To be taken
from other
department

SEC1 To be taken
from SEC
Pool

VAC1 To be taken
from VAC
Pool

AEC1 To be taken
from AEC
Pool
2 CC-A2 B23-CAP-201 Object Oriented 3 3 20 50 70 3
Programming
using C++
Practical 1 2 10 20 30 3

2
 CC-B2 B23-CAP-202 Introduction to 3 3 20 50 70 3
Web
Technologies
Practical 1 3 10 20 30 3
CC-C2 B23-CAP-203 Concepts of 3 3 20 50 70 3
Operating
Systems

Practical 1 2 5 15 20 3
CC-M2 B23-CAP-204 Mathematical 1 1 10 20 30 3
Foundations for
Computer
Science-II
Practical 1 2 5 15 20 3

MDC-2 To be taken
from other
department

SEC-2 To be taken
from SEC
Pool

VAC-2 To be taken
from VAC
Pool

AEC-2 To be taken
from AEC
Pool
3 CC-A3 B23-CAP-301 Java OOP 3 3 20 50 70 3
Foundations
Practical 1 2 10 20 30 3

CC-B3 B23-CAP-302 Linux and Shell 3 3 20 50 70 3

programming
Practical 1 2 10 20 30 3
CC-C3 B23-CAP-303 Data Base 3 3 20 50 70 3
Technologies
Practical 1 2 10 20 30 3
CC-M3 B23-CAP-304 Basics of Data 3 3 20 50 70 3
Science Using
Excel

Practical 1 2 10 20 30 3

OR

3
 To be taken
from other
department
MDC-3 To be taken
from other
department

SEC-3 To be taken
from SEC
Pool

AEC-3 To be taken
from AEC
Pool
4 CC-A4 B23-CAP-401 Data Structures 3 3 20 50 70 3
and Applications
Practical 1 2 10 20 30 3
CC-B4 B23-CAP-402 Front-end 3 3 20 50 70 3
Development
Practical 1 2 10 20 30 3
CC-C4 B23-CAP-403 Computer 3 3 20 50 70 3
Graphics
Practical 1 2 10 20 30 3
AEC-4 To be taken
from AEC
Pool
VAC-3 To be taken
from VAC
Pool

CC- To be taken
M4(V) from VOC
Pool
5 CC-A5 B23-CAP-501 Software 3 3 20 50 70 3
Engineering
Practical 1 2 10 20 30 3
CC-B5 B23-CAP-502 Back-end 3 3 20 50 70 3
Development
Practical 1 2 10 20 30 3
CC-C5 B23-CAP-503 Network 3 3 20 50 70 3
Infrastructure
and Data
Communication
Technologies

4
 Practical 1 2 10 20 30 3
CC- To be taken
M5(V) from VOC
Pool
SEC-4 Internship @
4 Credits
6 CC-A6 B23-CAP-601 Programming 3 3 20 50 70 3
using Python
Practical 1 2 10 20 30 3

CC-B6 B23-CAP-602 Advanced Web 3 3 20 50 70 3

Development

Practical 1 2 10 20 30 3
CC-C6 B23-CAP-603 Artificial 3 3 20 50 70 3
Intelligence

Practical 1 2 10 20 30 3
CC-M6 B23-CAP-604 Basics of Data 3 3 20 50 70 3
Science Using
Python

Practical 1 2 10 20 30 3

OR
To be taken
from other
department
CC- To be taken
M7(V) from VOC
Pool

7 CC-H1 B23-CAP-701 Principles & 4 4 30 70 100 3

Paradigms of
Programming
Languages
CC-H2 B23-CAP-702 Software Testing 4 4 30 70 100 3
CC-H3 B23-CAP-703 Data Mining and 4 4 30 70 100 3
Warehousing

DSE-H1 B23-CAP-704 NoSQL 4 4 30 70 100 3

Databases
Or
B23-CAP-705 Cyber Security 4 4 30 70 100 3

PC-H1 B23-CAP-706 Practical 4 8 30 70 100 6

5
 CC-HM1 B23-CAP-707 Cloud 4 4 30 70 100 3
Computing
8 CC-H4 B23-CAP-801 Design & 4 4 30 70 100 3
Analysis of
Algorithms

CC-H5 B23-CAP-802 Software Project 4 4 30 70 100 3

Management
CC-H6 B23-CAP-803 Emerging Trends 4 4 30 70 100 3
in Information
Security
DSE-H2 B23-CAP-804 Big Data 4 4 30 70 100 3
Or
B23-CAP-805 Machine 4 4 30 70 100 3
Learning
PC-H2 B23-CAP-806 Practical 4 8 30 70 100 6
CC-HM2 B23-CAP-807 Internet of 4 4 30 70 100 3
Things (IoT)
OR

CC-H4 B23-CAP-801 Design & 4 4 30 70 100 3

Analysis of
Algorithms

CC-H5 B23-CAP-802 Software Project 4 4 30 70 100 3

Management

CC-HM2 B23-CAP-807 Internet of 4 4 30 70 100 3

Things (IoT)

Research B23-CAP-808 Project/ 12 300

Dissertation

6
 Kurukshetra University, Kurukshetra
(Established by the State Legislature Act XII of 1956)
(‘A++’ Grade, NAAC Accredited)

|| योग थ: कु कमािण ||
समबु व योग यु होकर कम करो
(Perform Actions while Stead fasting in the State of Yoga)

Syllabus of Examination (1st & 3rd Semester) for Under-Graduate

Programmes
Bachelor of Computer Applications (BCA)
according to
Curriculum Framework for Under-Graduate Programmes
As per NEP-2020 (Multiple Entry-Exit, Internships and Choice Based
Credit System)
DEPARTMENT OF COMPUTER SCIENCE & APPLICATIONS
(For the Batches Admitted From 2023-2024)

1
 DEPARTMENT OF COMPUTER SCIENCE & APPLICATIONS
KURUKSHETRA UNIVERSITY, KURUKSHETRA

Scheme: 2023-24, Syllabus: 2023-24

Part A - Introduction
Subject BCA
Semester I
Name of the Course Problem Solving through C
Course Code B23-CAP-101
Course Type: CC-A1
(CC/MCC/MDC/CC-
M/DSEC/VOC/DSE/PC/AEC/
VAC)
Level of the course (As per 100-199
Annexure-I
Pre-requisite for t he course (if None
any)
Course Learning Outcomes(CLO): After completing this course, the learner will be able to:
1. learn the basics of C program, data types, and
input/output statements.
2. understand different types of operators, their
hierarchies, and also control statements of C.
3. implement programs using arrays and strings.
4. get familiar with advanced concepts like structures,
unions, etc. in C language.
____________________________________________
5*. to implement the programs based on various
concepts of C.
Credits Theory Practical Total
3 1 4
Contact Hours 3 2 5
Max. Marks:100(70(T)+30(P)) Time: 3 Hrs.(T), 3Hrs.(P)
Internal Assessment Marks:30(20(T)+10(P))
End Term Exam Marks: 70(50(T)+20(P))
Part B- Contents of the Course

Instructions for Paper- Setter

2
The examiner will set a total of nine questions. Out of which first question will be compulsory.
The remaining eight questions will be set from four units, selecting two questions from each.
The examination will be of three-hour duration. All questions will carry equal marks. The first
question will comprise short answer-type questions covering the entire syllabus.
The candidate must attempt five questions, selecting one from each unit. The first question will
be compulsory.
The practicum will be evaluated by an external and an internal examiner. The examination will
be of three-hour duration.
Unit Topics Contact
Hours
I Overview of C: History, Importance, Structure of C Program, 11
Character Set, Constants and Variables, Identifiers and Keywords,
Data Types, Assignment Statement, Symbolic Constant.
Input/output: Formatted I/O Function-, Input Functions viz. scanf(),
getch(), getche(), getchar(), gets(),
output functions viz. printf(), putch(), putchar(), puts().
II Operators & Expression: Arithmetic, Relational, Logical, Bitwise, 11
Unary, Assignment, Conditional Operators and Special Operators
Operator Hierarchy; Arithmetic Expressions, Evaluation of
Arithmetic Expression,
Type Casting and Conversion. Decision making with if statement, if-
else statement, nested if statement, else-if ladder, switch and break
statement, goto statement, Looping Statements: for, while, and do-
while loop, jumps in loops.
III Arrays: One-dimensional arrays - Declaration, Initialization, and 12
Memory representation; Two-Dimensional arrays -Declaration,
Initialization and Memory representation.
Functions: definition, prototype, function call, passing arguments to a
function: call by value; call by reference, recursive functions.
Strings: Declaration and Initialization, String I/O, Array of Strings,
String Manipulation Functions: String Length, Copy, Compare,
Concatenate, etc., Search for a Substring.
IV Pointers in C: Declaring and initializing pointers, accessing address 11
and value of variables using pointers; Pointers, and Arrays.
User-defined data types: Structures - Definition, Advantages of
Structure, declaring structure variables, accessing structure members,
Structure members initialization, Array of Structures; Unions - Union
definition; the difference between Structure and Union.
V* Practicum: 30
Students are advised to do laboratory/practical practice not limited
to, but including the following types of problems:

3
  To read the radius of a circle and to find the area and
circumference
 To read three numbers and find the biggest of three
 To check whether the number is prime or not
 To read a number, find the sum of the digits, reverse the
number, and check it for palindrome
 To read numbers from the keyboard continuously till the user
presses 999 to find the sum of only positive numbers
 To read the percentage of marks and to display an
appropriate message (Demonstration of else-if ladder)
 To find the roots of the quadratic equation
 To read marks scored by n students and find the average of
marks (Demonstration of the single dimensional array)
 To remove Duplicate Elements in a single dimensional Array
 To perform addition and subtraction of Matrices
 To find the factorial of a number
 To generate Fibonacci series
 To remove Duplicate Elements in a single dimensional Array
 To find the length of a string without using the built-in
function
 To demonstrate string functions
 To read, display, and add two m x n matrices using functions
 To read a string and to find the number of alphabets, digits,
vowels, consonants, spaces, and special characters
 To Swap Two Numbers using Pointers
 To demonstrate student structure to read & display records of
n students
 To demonstrate the difference between structure & union.
Suggested Evaluation Methods
Internal Assessment: End Term
➢ Theory Examination:
 Class Participation: 5 A three-hour
 Seminar/presentation/assignment/quiz/class test etc.: 5 exam for both
 Mid-Term Exam: 10 theory and
➢ Practicum practicum.
 Class Participation: NA
 Seminar/Demonstration/Viva-voce/Lab records etc.: 10
 Mid-Term Exam: NA

Part C-Learning Resources

Recommended Books/e-resources/LMS:
 Gottfried, Byron S., Programming with C, Tata McGraw Hill.
 Balagurusamy, E., Programming in ANSI C, Tata McGraw-Hill.

4
  Jeri R. Hanly & Elliot P. Koffman, Problem Solving and Program Design in C, Addison
Wesley.
 Yashwant Kanetker, Let us C, BPB.
 Rajaraman, V., Computer Programming in C, PHI.
 Yashwant Kanetker, Working with C, BPB.

*Applicable for courses having practical component.

5
 DEPARTMENT OF COMPUTER SCIENCE & APPLICATIONS
KURUKSHETRA UNIVERSITY, KURUKSHETRA

Scheme: 2023-24, Syllabus: 2023-24

Part A - Introduction
Subject BCA
Semester I
Name of the Course Foundations of Computer Science
Course Code B23-CAP-102
Course Type: CC-B1
(CC/MCC/MDC/CC-
M/DSEC/VOC/DSE/PC/AEC/
VAC)
Level of the course (As per 100-199
Annexure-I
Pre-requisite for t he course (if None
any)
Course Learning Outcomes(CLO): After completing this course, the learner will be able to:
1. understand the basics of computer
2. learn about I/O devices and operating systems
3. understand the Internet and its services
4. learn about the threats and security concepts on
computers
____________________________________________
5*. to understand the working of the operating system,
internet, and security-related concepts.
Credits Theory Practical Total
3 1 4
Contact Hours 3 2 5
Max. Marks:100(70(T)+30(P)) Time: 3 Hrs.(T), 3Hrs.(P)
Internal Assessment Marks:30(20(T)+10(P))
End Term Exam Marks: 70(50(T)+20(P))
Part B- Contents of the Course

Instructions for Paper- Setter

Examiner will set a total of nine questions. Out of which first question will be compulsory.
Remaining eight questions will be set from four unit selecting two questions from each unit. The

6
examination will be of three-hour duration. All questions will carry equal marks. The first
question will comprise short answer-type questions covering the entire syllabus.
The candidate must attempt five questions, selecting one from each unit. The first question will
be compulsory.
The practicum will be evaluated by an external and an internal examiner. The examination will
be of three-hour duration.

Unit Topics Contact

Hours
I Computer Fundamentals: Evolution of Computers through 11
generations, Characteristics of Computers, Strengths and Limitations
of Computers, Classification of Computers, Functional Components
of a Computer System, Applications of Computers in Various Fields.
Types of Software: System software, Application software, Utility
Software, Shareware, Freeware, Firmware, Free Software.
Memory Systems: Concept of bit, byte, word, nibble, storage
locations, and addresses, measuring units of storage capacity, access
time, the concept of the memory hierarchy. Primary Memory - RAM,
ROM, PROM, EPROM. Secondary Memory - Types of storage
devices, Magnetic Tape, Hard Disk, Optical Disk, Flash Memory.
II I/O Devices: I/O Ports of a Desktop Computer, Device Controller, 12
Device Driver. Input Devices: classification and use, keyboard,
pointing devices - mouse, touchpad and trackball, joystick, magnetic
stripes, scanner, digital camera, and microphone Output Devices:
speaker, monitor, printers: classification, laser, inkjet, dot-matrix.
Plotter.
Introduction to Operating System: Definition, Functions, Features of
Operating System, Icon, Folder, File, Start Button, Task Bar, Status
Buttons, Folders, Shortcuts, Recycle Bin, Desktop, My Computer,
My Documents, Windows Explorer, Control Panel.
III The Internet: Introduction to networks and Internet, history, Internet, 11
Intranet & Extranet, Working of Internet, Modes of Connecting to
Internet.
Electronic Mail: Introduction, advantages and disadvantages, User
IDs, Passwords, e-mail addresses, message components, message
composition, mailer features. Browsers and search engines.
IV Threats: Physical & non-physical threats, Viruses, worms, Trojans, 11
Spyware, Keylogers, Rootkits, Adware, Cookies, Phishing, Hacking,
Cracking.
Computer Security Fundamentals: Confidentiality, Integrity,
Authentication, Non-Repudiation, Security Mechanisms, Security
Awareness, Security Policy, anti-virus software & Firewalls, backup
& recovery.

7
V* Practicum: 30
Students are advised to do laboratory/practical practice not limited to,
but including the following types of problems:
Operating System:
 Starting with basics of Operating Systems and its
functionalities
Computer Basics:
 Identify the various computer hardware
 Understanding the working of computer
 Understanding various types of software
Internet and E-mail:
 Using Internet for various tasks
 Creating and using e-mail.
Security:
 Understanding various threats
 How to be safe from virus threats
 Various software to get safe from virus attacks.
Suggested Evaluation Methods
Internal Assessment: End Term
➢ Theory Examination:
 Class Participation: 5 A three-hour
 Seminar/presentation/assignment/quiz/class test etc.: 5 exam for both
 Mid-Term Exam: 10 theory and
➢ Practicum practicum.
 Class Participation: NA
 Seminar/Demonstration/Viva-voce/Lab records etc.: 10
 Mid-Term Exam: NA

Part C-Learning Resources

Recommended Books/e-resources/LMS:
 Sinha, P.K. & Sinha, Priti, Computer Fundamentals, BPB.
 Dromey, R.G., How to Solve it By Computer, PHI.
 Norton, Peter, Introduction to Computer, McGraw-Hill.
 Leon, Alexis & Leon, Mathews, Introduction to Computers, Leon Tech World.
 Rajaraman, V., Fundamentals of Computers, PHI.

*Applicable for courses having practical component.

8
 DEPARTMENT OF COMPUTER SCIENCE & APPLICATIONS
KURUKSHETRA UNIVERSITY, KURUKSHETRA

Scheme: 2023-24, Syllabus: 2023-24

Part A - Introduction
Subject BCA
Semester I
Name of the Course Logical Organization of Computer
Course Code B23-CAP-103
Course Type: CC-C1
(CC/MCC/MDC/CC-
M/DSEC/VOC/DSE/PC/AEC/
VAC)
Level of the course (As per 100-199
Annexure-I
Pre-requisite for t he course (if Basic Knowledge of Mathematics (10th Level)
any)
Course Learning Outcomes(CLO): After completing this course, the learner will be able to:
1. understand number systems, error detecting
correcting code, and representations of numbers in
a computer system.
2. understand computer arithmetic and Boolean algebra
and simplification of Boolean expressions.
3. understand the working of logic gates and design
various combinational circuits using these logic gates.
4. understand the working of different types of flip-flops
and design different types of registers.
____________________________________________
5*. to understand the practical aspects of the logical
organization of computers.
Credits Theory Practical Total
3 1 4
Contact Hours 3 2 5
Max. Marks:100(70(T)+30(P)) Time: 3 Hrs.(T), 3Hrs.(P)
Internal Assessment Marks:30(20(T)+10(P))
End Term Exam Marks: 70(50(T)+20(P))
Part B- Contents of the Course

9
 Instructions for Paper-Setter
The examiner will set a total of nine questions. Out of which the first question will be
compulsory. The remaining eight questions will be set from four units, selecting two questions
from each. The examination will be of three-hour duration. All questions will carry equal marks.
The first question will comprise short answer-type questions covering the entire syllabus.
The candidate must attempt five questions, selecting one from each unit. The first question will
be compulsory.
The practicum will be evaluated by an external and an internal examiner. The examination will
be of three-hour duration.
Unit Topics Contact
Hours
I Number Systems: Binary, Octal, Hexadecimal, etc. Conversions from 11
one number system to another, BCD Number
System. BCD Codes: Natural Binary Code, Weighted Code, Self-
Complimenting Code, Cyclic Code.
Error Detecting and Correcting Codes. Character representations:
ASCII, EBCDIC, and Unicode.
Number Representations: Integer numbers - sign-magnitude, 1’s
& 2’s complement representation. Real Numbers normalized
floating point representations.
II Binary Arithmetic: Binary Addition, Binary Subtraction, Binary 11
Multiplication, Binary Division using 1’s and 2’s Compliment
representations, Addition and subtraction with BCD representations.
Boolean Algebra: Boolean Algebra Postulates, basic Boolean
Theorems, Boolean Expressions, Boolean Functions, Truth Tables,
Canonical Representation of Boolean Expressions: SOP and POS,
Simplification of Boolean Expressions using Boolean Postulates &
Theorems, Kaurnaugh-Maps (upto four variables), Handling Don’t
Care conditions.
III Logic Gates: Basic Logic Gates – AND, OR, NOT, Universal Gates – 11
NAND, NOR, Other Gates – XOR, XNOR, etc. Their symbols, truth
tables, and Boolean expressions.
Combinational Circuits: Design Procedures, Half Adder, Full Adder,
Half Subtractor, Full Subtractor, Multiplexers, Demultiplexers,
Decoder, Encoder, Comparators, Code Converters.
IV Sequential Circuits: Basic Flip-Flops and their working. Synchronous 12
and Asynchronous Flip–Flops, Triggering of Flip-
Flops, Clocked RS, D Type, JK, T type, and Master-Slave Flip-Flops.
State Table, State Diagram, and State Equations.
Flip-flops characteristics & Excitation Tables.
Sequential Circuits: Designing registers –Serial-In Serial-Out (SISO),

10
 Serial-In Parallel-Out (SIPO), Parallel-In Serial-Out
(PISO) Parallel-In Parallel-Out (PIPO) and shift registers.
V* Practicum: 30
Students are advised to do laboratory/practical practice not limited to,
but including the following types of problems:
Number System:
 Problems based on Number System and their conversion.
 Programs based on Number System conversion.
Binary Arithmetic
 Problems based on Binary Arithmetic.
 Programs based on Binary Arithmetic.
 Problems based on Boolean Expression and their
simplification
Logic Gates
 Understanding working of logic Gates.
Combinatorial Circuits:
 Designing and understanding various combinational circuits.
Sequential Circuits:
 Designing and understanding various sequential circuits.
Suggested Evaluation Methods
Internal Assessment: End Term
➢ Theory Examination:
 Class Participation: 5 A three-hour
 Seminar/presentation/assignment/quiz/class test etc.: 5 exam for both
 Mid-Term Exam: 10 theory and
➢ Practicum practicum.
 Class Participation: NA
 Seminar/Demonstration/Viva-voce/Lab records etc.: 10
 Mid-Term Exam: NA

Part C-Learning Resources

Recommended Books/e-resources/LMS:
 M. Morris Mano, Digital Logic and Computer Design, Prentice Hall of India Pvt. Ltd.
 V. Rajaraman, T. Radhakrishnan, An Introduction to Digital Computer Design, Prentice
Hall.
 Andrew S. Tanenbaum, Structured Computer Organization, Prentice Hall of India Pvt.
Ltd.
 Nicholas Carter, Schaum’s Outlines Computer Architecture, Tata McGraw-Hill.

*Applicable for courses having practical component.

11
 DEPARTMENT OF COMPUTER SCIENCE & APPLICATIONS
KURUKSHETRA UNIVERSITY, KURUKSHETRA

Scheme: 2023-24, Syllabus: 2023-24

Part A - Introduction
Subject BCA
Semester I
Name of the Course Mathematical Foundations for Computer Science-I
Course Code B23-CAP-104
Course Type: CC-M1
(CC/MCC/MDC/CC-
M/DSEC/VOC/DSE/PC/AEC/
VAC)
Level of the course (As per 100-199
Annexure-I
Pre-requisite for t he course (if None
any)
Course Learning Outcomes (CLO): After learning this course students will be able to:
1. Gain knowledge of set theory, types of sets, and
operations on sets. Understand various concepts of
matrices and determinants, and acquire the cognitive
skills to apply different operations on matrices and
determinants.
2. Know the basic concepts of complex numbers and
acquire skills to solve linear quadratic equations.
3. Gain the knowledge of the concepts of Arithmetic
progression, Geometric progression, and Harmonic
progression, and find A.M., G.M., and H.M. of
given numbers.
4. Understand the concept of differentiation
5. * Attain the skills to make use of the learned
concepts of Introductory Mathematics in
multidisciplinary learning contexts and to know their
applications
Credits Theory Practical Total
1 1 2
Contact Hours 1 2 3
Max. Marks:50(30(T)+20(P)) Time: 3 Hrs.(T), 3Hrs.(P)

12
 Internal Assessment Marks:15(10(T)+5(P))
End Term Exam Marks:35(20(T)+15(P))
Part B-Contents of the Course

Instructions for Paper-Setter

The examiner will set a total of nine questions. Out of which the first question will be
compulsory. The remaining eight questions will be set from four units, selecting two questions
from each. The examination will be of three-hour duration. All questions will carry equal marks.
The first question will comprise short answer-type questions covering the entire syllabus.
The candidate must attempt five questions, selecting one from each unit. The first question will
be compulsory.
The practicum will be evaluated by an external and an internal examiner. The examination will
be of three-hour duration.
Unit Topics Contact
Hours
I Sets and their representations, Empty sets, Finite and infinite 4
sets, Subsets, Equal sets, Power sets, Universal sets, Union and
intersection of sets, Difference of two sets, Complement of a
set, Venn diagram, De-Morgan’s laws, and their applications.
II An introduction to matrices and their types, Operations on 4
matrices, Symmetric and skew-symmetric matrices, Minors,
and Co-factors. Determinant of a square matrix, Adjoint and
inverse of a square matrix, Solutions of a system of linear
equations up to order 3.
III Quadratic equations, Solution of quadratic equations. 3
Arithmetic progression, Geometric progression, Harmonic
progression, Arithmetic mean (A.M.), Geometric mean (G.M.),
Harmonic mean (H.M.), Relation between A.M., G.M. and
H.M.
IV The concept of differentiation, differentiation of simple 4
functions, and Use of differentiation for solving problems
related to real-life situations. Differentiation of simple
algebraic, trigonometric, and exponential functions.
V* Practicum: 30
Students are advised to do laboratory/practical practice not
limited to but including the following types of problems:
Problem Solving- Questions related to the practical problems
based on the following topics will be worked out and a record
of those will be maintained in the Practical Note Book:
 Problems related to union, intersection, difference and
complement of sets.

13
  Problems based on De Morgan’s Laws.
 Problems related to Venn diagrams.
 Problems to find the inverse of a matrix.
 Problems to find the determinant of a square matrix of
order 3.
 Problems to find the nth term of A.P., G.P., and H.P.
 Problems to find the sum of n terms of A.P., G.P., and
H.P.
 Problems to find A.M., G.M., and H.M. of given
numbers.
 Problems involving formulation and solution of
quadratic equations in one variable.
 Problems to find the first derivatives of functions.
Suggested Evaluation Methods
Internal Assessment: End Term
➢ Theory Examination:
 Class Participation: 4 A three-hour exam
 Seminar/presentation/assignment/quiz/class test etc.: NA for both theory and
 Mid-Term Exam: 6 practicum.
➢ Practicum
 Class Participation: NA
 Seminar/Demonstration/Viva-voce/Lab records etc.: 5
 Mid-Term Exam: NA

Part C-Learning Resources

Text /Reference Books:
 C. Y. Young (2021). Algebra and Trigonometry. Wiley.
 S.L. Loney (2016). The Elements of Coordinate Geometry (Cartesian Coordinates) (2nd
Edition). G.K. Publication Private Limited.
 Seymour Lipschutz and Marc Lars Lipson (2013). Linear Algebra. (4th Edition)
Schaum’s Outline Series, McGraw-Hill.
 C.C. Pinter (2014). A Book of Set Theory. Dover Publications.
 J. V. Dyke, J. Rogers and H. Adams (2011). Fundamentals of Mathematics (10th Edition),
Brooks/Cole.
 A. Tussy, R. Gustafson and D. Koenig (2010). Basic Mathematics for College Students
(4th Edition). Brooks Cole

*Applicable for courses having practical component.

14
 DEPARTMENT OF COMPUTER SCIENCE & APPLICATIONS
KURUKSHETRA UNIVERSITY, KURUKSHETRA

Scheme: 2023-24, Syllabus: 2023-24

Part A - Introduction
Subject BCA
Semester III
Name of the Course Java OOP Foundations
Course Code B23-CAP-301
Course Type: CC-A3
(CC/MCC/MDC/CC-
M/DSEC/VOC/DSE/PC/AEC/
VAC)
Level of the course (As per 200-299
Annexure-I
Pre-requisite for t he course (if Knowledge of any Computer Programming Language
any)
Course Learning Outcomes(CLO): After completing this course, the learner will be able to:
1. Implement simple Java programs.
2. Implement multiple inheritance using Interfaces
3. Implement Exception Handling and File
Handling.
4. Use AWT to design GUI applications.

5* develop the project using java.

Credits Theory Practical Total
3 1 4
Contact Hours 3 2 5
Max. Marks:100(70(T)+30(P)) Time: 3 Hrs.(T), 3Hrs.(P)
Internal Assessment Marks:30(20(T)+10(P))
End Term Exam Marks: 70(50(T)+20(P))
Part B- Contents of the Course

Instructions for Paper-Setter

The examiner will set a total of nine questions. Out of which first question will be compulsory.
The remaining eight questions will be set from four units selecting two questions from each unit.
The examination will be of three-hour duration. All questions will carry equal marks. The first

15
question will comprise short answer-type questions covering the entire syllabus.
The candidate must attempt five questions, selecting one from each unit. The first question will
be compulsory.
The practicum will be evaluated by an external and an internal examiner. The examination will
be of three-hour duration.

Unit Topics Contact

Hours
I Object Oriented Programming and Java Fundamentals: Structure of 11
Java programs, Classes and Objects, Data types, Type Casting,
Looping Constructs.
II Interfaces: Interface basics; Defining, implementing, and extending 11
interfaces; Implementing multiple inheritance using interfaces
Packages: Basics of packages, Creating and accessing packages,
System packages, Creating user-defined packages
III Exception handling using the main keywords of exception handling: 11
try, catch, throw, throws, and finally; Nested try, multiple catch
statements, creating user-defined exceptions.
File Handling Byte Stream, Character Stream, File I/O Basics, File
Operations
IV AWT and Event Handling: The AWT class hierarchy, Events, Event 12
sources, Event classes, Event Listeners, Relationship between Event
sources and Listeners, Delegation event model, Creating GUI
applications using AWT.
V* Practicum: 30
Students are advised to do laboratory/practical practice not limited to
but including the following types of problems:
 WAP to find the sum of 10 numbers, entered as command
line arguments.
 WAP to find the area of rectangle and circle using Interface.
 WAP to implement multiple inheritance.
 WAP to show the concept of packages.
 WAP to handle the Exception using try and multiple catch
blocks and a finally block.
 WAP for Implementing Calculator in an Applet, use
appropriate Layout Manager.
 Write Applet code to add two integers in textbox and their
sum should appear in third textbox.
 Write AWT program in Java to find the sum, Multiplication
and average of three numbers entered in three Text fields by
clicking the corresponding Labeled Button. The result should
be appearing in fourth text field.

16
  Write Applet code to show all the activities of Mouse using
Mouselistener and MouseMotionlistener.
 What are various stream classes in Java? Write Java code to
read character from a file and write into another file.
 What are AWT Classes? Write a Java Program to generate
Even numbers and Odd Numbers in TextField “T1 and T2
respectively” while pressing Buttons “Even” and “Odd”.
 Write a program to Copy the text from one file to another
using byte stream.
Suggested Evaluation Methods
Internal Assessment: End Term
➢ Theory Examination:
 Class Participation: 5 A three-hour
 Seminar/presentation/assignment/quiz/class test etc.: 5 exam for both
 Mid-Term Exam: 10 theory and
➢ Practicum practicum.
 Class Participation: NA
 Seminar/Demonstration/Viva-voce/Lab records etc.: 10
 Mid-Term Exam: NA

Part C-Learning Resources

Recommended Books/e-resources/LMS:
 Schildt, H. (2018). Java: The Complete Reference. 10th edition. McGraw-Hill Education.
 Balaguruswamy E. (2014). Programming with JAVA: A Primer. 5th edition. India:
McGraw Hill Education
 Horstmann, C. S. (2017). Core Java - Vol. I – Fundamentals (Vol. 10). Pearson Education
 Schildt, H., & Skrien, D. (2012). Java Fundamentals - A Comprehensive Introduction.
India: McGraw Hill Education.

*Applicable for courses having practical component.

17
 DEPARTMENT OF COMPUTER SCIENCE & APPLICATIONS
KURUKSHETRA UNIVERSITY, KURUKSHETRA

Scheme: 2023-24, Syllabus: 2023-24

Part A - Introduction
Subject BCA
Semester III
Name of the Course Linux and Shell Programming
Course Code B23-CAP-302
Course Type: CC-B3
(CC/MCC/MDC/CC-
M/DSEC/VOC/DSE/PC/AEC/
VAC)
Level of the course (As per 200-299
Annexure-I
Pre-requisite for t he course (if Must have basic knowledge of computer
any)
Course Learning Outcomes(CLO): After completing this course, the learner will be able to:
1. understand Linux architecture.
2 use various Linux commands that are used to
manipulate system operations.
3 acquire knowledge of Linux File System.
4 understand and make effective use of I/O and shell
scripting language to solve problems.
____________________________________________
5*. to implement the programs based on various shell
commands and programs in Linux.
Credits Theory Practical Total
3 1 4
Contact Hours 3 2 5
Max. Marks:100(70(T)+30(P)) Time: 3 Hrs.(T), 3Hrs.(P)
Internal Assessment Marks:30(20(T)+10(P))
End Term Exam Marks: 70(50(T)+20(P))
Part B- Contents of the Course

Instructions for Paper-Setter

The examiner will set a total of nine questions. Out of which first question will be compulsory.

18
The remaining eight questions will be set from four units selecting two questions from each unit.
The examination will be of three-hour duration. All questions will carry equal marks. The first
question will comprise short answer-type questions covering the entire syllabus.
The candidate must attempt five questions, selecting one from each unit. The first question will
be compulsory.
The practicum will be evaluated by an external and an internal examiner. The examination will
be of three-hour duration.
Unit Topics Contact
Hours
I Introduction to Linux: Linux distributions, Overview of Linux 11
operating system, Linux architecture, Features of Linux, Accessing
Linux system, Starting and shutting down system, Logging in and
Logging out, Comparison of Linux with other operating systems.
II Commands in Linux: General-purpose commands, File oriented 11
commands, directory-oriented commands, Communication-oriented
commands, process-oriented commands, etc. Regular expressions &
Filters in Linux: Simple filters viz. more, wc, diff, sort, uniq, grep;
Introducing regular expressions.
III Linux file system: Linux files, inodes and structure and file system, 11
file system components, standard file system, file system types.
Processes in Linux: Starting and Stopping Processes, Initialization
Processes, Mechanism of process creation, and Job control in Linux
using at, batch, cron & time.
IV Shell Programming: vi editor, shell variables, I/O in shell, control 12
structures, loops, subprograms, creating & executing shell scripts in
Linux.
V* Practicum: 30
Students are advised to do laboratory/practical practice not limited to
but including the following types of problems:
 Basic Linux command
 Basic Shell Programming (Fibonacci Series generation,
Factorial of a given number, Checking for Armstrong
number)
 Designing an Arithmetic calculator
 Generation of Multiplication table
 Base Conversion (Decimal to Binary, Binary to Decimal)
 Finding the information about the Login name and File name.
 Write a shell script to exchange the contents of two variables.
 Write a shell script, which accepts three subject marks scored
by a student and declare the result.
 Write a shell script program to find area of a square,

19
 rectangle, circle and triangle.
 Write a shell script to print integer numbers from 1 to 20.
Suggested Evaluation Methods
Internal Assessment: End Term
➢ Theory Examination:
 Class Participation: 5 A three-hour
 Seminar/presentation/assignment/quiz/class test etc.: 5 exam for both
 Mid-Term Exam: 10 theory and
➢ Practicum practicum.
 Class Participation: NA
 Seminar/Demonstration/Viva-voce/Lab records etc.: 10
 Mid-Term Exam: NA

Part C-Learning Resources

Recommended Books/e-resources/LMS:
 Yashwant Kanetkar, Unix & Shell programming – BPB Publications.
 Richard Petersen, The Complete Reference – Linux, McGraw-Hill.
 M.G.Venkateshmurthy, Introduction to Unix & Shell Programming, Pearson
Education.
 Stephen Prata, Advanced UNIX-A Programmer’s Guide, SAMS Publication.
 Sumitabha Das, Your Unix - The Ultimate Guide, Tata McGraw-Hill.

*Applicable for courses having practical component.

20
 DEPARTMENT OF COMPUTER SCIENCE & APPLICATIONS
KURUKSHETRA UNIVERSITY, KURUKSHETRA

Scheme: 2023-24, Syllabus: 2023-24

Part A - Introduction
Subject BCA
Semester III
Name of the Course Data Base Technologies
Course Code B23-CAP-303
Course Type: CC-C3
(CC/MCC/MDC/CC-
M/DSEC/VOC/DSE/PC/AEC/
VAC)
Level of the course (As per 200-299
Annexure-I
Pre-requisite for t he course (if Basic Knowledge of computer
any)
Course Learning Outcomes(CLO): After completing this course, the learner will be able to:
1. understand the concepts of database and its
architecture
2. understand the various types of data models
3. understand various concepts in SQL and relational
algebra
4. understand the relational model and normalization in
detail.
____________________________________________
5*. to implement various SQL queries.
Credits Theory Practical Total
3 1 4
Contact Hours 3 2 5
Max. Marks:100(70(T)+30(P)) Time: 3 Hrs.(T), 3Hrs.(P)
Internal Assessment Marks:30(20(T)+10(P))
End Term Exam Marks: 70(50(T)+20(P))
Part B- Contents of the Course

Instructions for Paper- Setter

Examiner will set a total of nine questions. Out of which first question will be compulsory.

21
Remaining eight questions will be set from four unit selecting two questions from each unit. The
examination will be of three-hour duration. All questions will carry equal marks. The first
question will comprise short answer-type questions covering the entire syllabus.
The candidate will have to attempt five questions in all, selecting one question from each unit.
The first question will be compulsory.
The practicum will be evaluated by an external and an internal examiner. The examination will
be of three-hour duration.
Unit Topics Contact
Hours
I Basic Concepts – Data, Information, Records, Files, Schema 11
and Instance etc. Limitations of File-Based Approach,
Characteristics of Database Approach, Database Management
System (DBMS), Components of DBMS Environment, DBMS
Functions and Components, Database Interfaces, Advantages
and Disadvantages of DBMS.
Database Users: Data and Database Administrator, Role and
Responsibilities of Database Administrator, Database
Designers, Application Developers etc. Database System
Architecture – 1-Tier, 2-Tier & Three Levels of Architecture,
External, Conceptual, and Internal Levels, Schemas, Mappings
and Instances, Data Independence – Logical and Physical Data
Independence.
II Data Models: Hierarchical, Network, and Relational Data 11
Models.
Entity-Relationship Model: Entity, Entity Sets, Entity Type,
Attributes: Type of Attributes, Keys, Integrity Constraints,
Designing of ER Diagram, Symbolic Notations for Designing
ER Diagram,
III SQL: Meaning, Purpose, and Need of SQL, Data Types, SQL 12
Components: DDL, DML, DCL and DQL, Basic Queries,
Join Operations and Sub-queries. Constraints and its
Implementation in SQL.
Relational Algebra: Basic Operations: Select, Project, Join,
Union, Intersection, Difference, and Cartesian Product, etc.
Relational Calculus: Tuple Relational and Domain Relational
Calculus.
IV Relational Model: Functional Dependency, Characteristics, 11
Inference Rules for Functional Dependency, Types of
Functional Dependency,
Normalization: Benefits and Need of Normalization, Normal
Forms Based on Primary Keys- (1NF, 2NF, 3NF, BCNF),
Multi-valued Dependencies, 4 NF, Join dependencies, 5 NF,

22
 Domain Key Normal Form.
V* The following activities be carried out/ discussed in the lab 30
during the period of the semester.
Programming Lab:
 Performing various SQL statement. Creating various
tables and performing all possible queries based on
syllabus.
 Understanding relational model concepts
 Understanding normalization
 Understanding various concepts of databases.
Suggested Evaluation Methods
Internal Assessment: End Term
➢ Theory Examination:
 Class Participation: 5 A three-hour exam
 Seminar/presentation/assignment/quiz/class test etc.: 5 for both theory and
 Mid-Term Exam: 10 practicum.
➢ Practicum
 Class Participation: NA
 Seminar/Demonstration/Viva-voce/Lab records etc.: 10
 Mid-Term Exam: NA

Part C-Learning Resources

Recommended Books/e-resources/LMS:
 Elmasri & Navathe, Fundamentals of Database Systems, Pearson Education.
 A Silberschatz, H Korth, S Sudarshan, Database System and Concepts, McGraw-Hill.
 Thomas Connolly Carolyn Begg, Database Systems, Pearson Education.
 C. J. Date, An Introduction to Database Systems, Addison Wesley.

*Applicable for courses having practical component.

23
 DEPARTMENT OF COMPUTER SCIENCE & APPLICATIONS
KURUKSHETRA UNIVERSITY, KURUKSHETRA

Scheme: 2024-25, Syllabus: 2024-25

Part A - Introduction
Subject BCA
Semester III
Name of the Course Basics of Data Science using Excel
Course Code B23-CAP-304
Course Type: CC-M3
(CC/MCC/MDC/CC-
M/DSEC/VOC/DSE/PC/AEC/
VAC)
Level of the course (As per 200-299
Annexure-I
Pre-requisite for t he course (if Basic knowledge of mathematics and computer
any)
Course Learning Outcomes(CLO): After completing this course, the learner will be able to:
1. understand the fundamental concepts of data science
and the role of Excel in data analysis.
2. learn data cleaning, preparation, and visualization
techniques using Excel.
3. apply statistical analysis and predictive modeling using
Excel.
4. To explore advanced Excel functions and data analysis
tools.
____________________________________________
5*. Implement the various functions in Excel
Credits Theory Practical Total
3 1 4
Contact Hours 3 2 5
Max. Marks:100(70(T)+30(P)) Time: 3 Hrs.(T), 3Hrs.(P)
Internal Assessment Marks:30(20(T)+10(P))
End Term Exam Marks: 70(50(T)+20(P))
Part B- Contents of the Course

24
 Instructions for Paper-Setter
The examiner will set a total of nine questions. Out of which the first question will be
compulsory. The remaining eight questions will be set from four units selecting two questions
from each unit. The examination will be of three-hour duration. All questions will carry equal
marks. The first question will comprise short answer-type questions covering the entire syllabus.
The candidate must attempt five questions, selecting one from each unit. The first question will
be compulsory.
The practicum will be evaluated by an external and an internal examiner. The examination will
be of three-hour duration.
Unit Topics Contact
Hours
I Introduction to Data Science: Definition, importance, and 11
applications. Overview of Excel: Interface, basic functions, and
features. Data Types and Formats in Excel: Text, numbers,
dates, and custom formats. Basic Data Manipulation: Sorting,
filtering, and basic formulas (SUM, AVERAGE, COUNT).
II Data Import and Export: CSV, TXT, and Excel files. Data 11
Cleaning Techniques: Handling missing values, duplicates, and
errors. Data Transformation: Text-to-columns, concatenation,
and data validation. Data Visualization: Creating and
customizing charts (bar, line, pie).
III Descriptive Statistics: Mean, median, mode, standard 11
deviation, and variance. Inferential Statistics: Hypothesis
testing, t-tests, and chi-square tests. Regression Analysis:
Simple linear regression and multiple regression. Predictive
Modeling: Introduction to basic predictive models and their
implementation in Excel.
IV Advanced Excel Functions: VLOOKUP, HLOOKUP, INDEX- 12
MATCH, and PivotTables. Data Analysis ToolPak: Using
Excel’s built-in data analysis tools such as Descriptive
Statistics, Histograms, Correlation, and Regression. What-If
Analysis Tools: Scenario Manager, Goal Seek, and Data
Tables.
V* The following activities will be carried out/ discussed in the lab 30
during the semester.
Familiarize with Excel interface and basic operations.
 Explore Excel ribbons, toolbars, and interface.
 Practice data entry, formatting, and basic calculations.
 Create a simple spreadsheet and perform basic
functions.
Import data and perform basic cleaning tasks.

25
  Import datasets from CSV and text files.
 Identify and handle missing values.
 Remove duplicates and correct data errors.
Manipulate data through sorting and filtering.
 Apply sorting to datasets based on different criteria.
 Use filters to analyze subsets of data.
 Create custom filters to extract specific data points.
Utilize formulas for data transformation.
 Practice text functions: LEFT, RIGHT, MID,
CONCATENATE.
 Use date functions: TODAY, DATE, DATEDIF.
 Implement basic mathematical formulas: SUM,
AVERAGE, COUNT.
Calculate and interpret descriptive statistics.
 Calculate measures of central tendency: mean, median,
mode.
 Compute measures of dispersion: range, variance,
standard deviation.
 Use built-in Excel functions for statistical analysis.
Apply conditional formulas and formatting.
 Use IF, SUMIF, and COUNTIF functions for
conditional analysis.
 Apply conditional formatting to highlight data trends
and anomalies.
 Create data-based rules for formatting.
Create and customize basic charts and graphs.
 Generate line charts, bar charts, and pie charts.
 Customize chart elements: titles, labels, and legends.
 Analyse data visually through chart types.
Summarize data using PivotTables.
 Create PivotTables to aggregate data.
 Group data and create custom summaries.
 Utilize slicers to filter and analyze PivotTable data
interactively.
Apply lookup and reference functions.
 Use VLOOKUP and HLOOKUP for data retrieval.
 Implement INDEX and MATCH functions for
advanced lookups.
 Practice using the OFFSET function for dynamic data
ranges.
Perform statistical analysis using the Data Analysis Toolpak.
 Install and activate the Data Analysis Toolpak.
 Conduct regression analysis and ANOVA.
 Explore other statistical tests available in the Toolpak.

26
 Suggested Evaluation Methods
Internal Assessment: End Term
➢ Theory Examination:
 Class Participation: 5 A three-hour exam for
 Seminar/presentation/assignment/quiz/class test etc.: 5 both theory and
 Mid-Term Exam: 10 practicum.
➢ Practicum
 Class Participation: NA
 Seminar/Demonstration/Viva-voce/Lab records etc.: 10
 Mid-Term Exam: NA

Part C-Learning Resources

Recommended Books/e-resources/LMS:
 "Data Science for Business: What You Need to Know about Data Mining and Data-
Analytic Thinking" by Foster Provost and Tom Fawcett.
 "Excel Data Analysis: Modeling and Simulation" by Hector Guerrero.
 "Data Analysis Using Microsoft Excel" by Michael R. Middleton.
 "Excel 2019 Bible" by Michael Alexander, Richard Kusleika, and John Walkenbach.
 "Practical Statistics for Data Scientists: 50 Essential Concepts" by Peter Bruce and
Andrew Bruce.

*Applicable for courses having practical components.

27
 Kurukshetra University, Kurukshetra
(Established by the State Legislature Act XII of 1956)
(‘A++’ Grade, NAAC Accredited)

|| योगस्थ: कुरु कर्मा णि ||

सर्बुद्धि व योग युक्त होकर कर्ा करो
(Perform Actions while Stead fasting in the State of Yoga)

Syllabus of Examination (5th & 6th Semester) for Under-Graduate Programmes

Bachelor of Computer Applications (BCA)
Scheme D
according to
Curriculum Framework for Under-Graduate Programmes
As per NEP-2020 (Multiple Entry-Exit, Internships and Choice Based Credit System)
DEPARTMENT OF COMPUTER SCIENCE & APPLICATIONS
(For the Batches Admitted From 2023-2024)

1
 DEPARTMENT OF COMPUTER SCIENCE & APPLICATIONS
KURUKSHETRA UNIVERSITY, KURUKSHETRA

Scheme: 2023-24, Syllabus: 2024-25

Part A - Introduction
Subject BCA
Semester V
Name of the Course Software Engineering
Course Code B23-CAP-501
Course Type: CC-A5
(CC/MCC/MDC/CC-
M/DSEC/VOC/DSE/PC/AEC/
VAC)
Level of the course (As per 300-399
Annexure-I
Pre-requisite for the course (if Knowledge of any Programming language
any)
Course Learning Outcomes(CLO): After completing this course, the learner will be able to:
1. learn the various models for software
development.
2. understand how to analyze software.
3. plan a software design and the risks associated with
software.
4. test and validate software
5*. Implement the various tools and techniques
used in software engineering.
Credits Theory Practical Total
3 1 4
Contact Hours 3 2 5
Max. Marks:100(70(T)+30(P)) Time: 3 Hrs.(T), 3Hrs.(P)
Internal Assessment Marks:30(20(T)+10(P))
End Term Exam Marks: 70(50(T)+20(P))
Part B- Contents of the Course
Instructions for Paper-Setter
The examiner will set a total of nine questions. Out of which first question will be compulsory.
Remaining eight questions will be set from four unit selecting two questions from each unit. The
examination will be of three-hour duration. All questions will carry equal marks. The first question
will comprise short answer-type questions covering the entire syllabus.
Candidate will have to attempt five questions in all, selecting one question from each unit. First
question will be compulsory.
The practicum will be evaluated by an external and an internal examiner. The examination will
be of

2
three-hour duration.
Unit Topics Contact
Hours
I Introduction: Program vs. Software, Software Engineering, 11
Programming paradigms, Software Crisis – problem and causes, Phases
in Software development: Requirement Analysis, Software Design,
Coding, Testing, Maintenance, Software Development Process Models:
Waterfall, Prototype, Evolutionary and Spiral models, Role of Metrics.
II Feasibility Study, Software Requirement Analysis and Specifications: 11
SRS, Need for SRS, Characteristics of an SRS, Components of an SRS,
Problem Analysis, Information gathering tools, Requirement
specification, validation and metrics.
Structured Analysis and Tools: Data Flow Diagram, Data Dictionary,
Decision table, Decision trees, Structured English, Entity-Relationship
diagrams
III Software Project Planning: Cost estimation: COCOMO model, Project 12
scheduling, Staffing, and personnel planning, team structure, Software
configuration management, Quality assurance plans, Project
monitoring plans, Risk Management.
Software Design: Design fundamentals, problem partitioning, and
abstraction, design methodology, Cohesion & Coupling.
IV Software testing strategies: unit testing, integration testing, Validation 11
testing, System testing, Alpha and Beta testing.
Software Maintenance: Type of maintenance, Management of
Maintenance, Maintenance Process, maintenance characteristics.
V* Practicum: 30
Students are advised to do laboratory/practical practice not limited
to but including the following types of problems:
 Development of 0-level DFD
 Development of 1 level DFD
 Development of 2-level DFD
 data dictionary,
 E-R diagram for Student Teacher Relationship
 E-R diagram for Library Management,
 Draw an ER Diagram for the Hospital Management System.
 ER diagram for (ANY 5)
 Student Result Management System
 Library management system
 Inventory control system
 Accounting system
 Fast food billing system
 Bank loan system
 Blood bank system
 Railway reservation system
 Automatic teller machine
 Video library management system
 Hotel management system
 Hostel management system

3
  E-ticking
 Share online trading
 Hostel management system
 Resource management system
 Court case management system
Suggested Evaluation Methods
Internal Assessment: End-Term
➢ Theory Examination:
 Class Participation: 5 A three-hour
 Seminar/presentation/assignment/quiz/class test etc.: 5 exam for both
 Mid-Term Exam: 10 theory and
practicum.
➢ Practicum
End Term
 Class Participation: NA
Exam Marks:
 Seminar/Demonstration/Viva-voce/Lab records etc.: 10
70(50(T)+20(P
 Mid-Term Exam: NA ))
Part C-Learning Resources
Recommended Books/e-resources/LMS:
 Pressman R. S., “Software Engineering – A Practitioner’s Approach”, Tata McGraw Hill.
 Jalote P., “An Integrated Approach to Software Engineering”, Narosa.
 Sommerville, “Software Engineering”, Addison Wesley.
 Fairley R., “Software Engineering Concepts”, Tata McGraw Hill.
 James Peter, W Pedrycz, “Software Engineering”, John Wiley & Sons.

*Applicable for courses having practical components.

4
 DEPARTMENT OF COMPUTER SCIENCE & APPLICATIONS
KURUKSHETRA UNIVERSITY, KURUKSHETRA

Scheme: 2023-24, Syllabus: 2024-25

Part A - Introduction
Subject BCA
Semester V
Name of the Course Back-end Development
Course Code B23-CAP-502
Course Type: CC-B5
(CC/MCC/MDC/CC-
M/DSEC/VOC/DSE/PC/AEC/
VAC)
Level of the course (As per 300-399
Annexure-I
Pre-requisite for t he course (if B23-CAP-202
any)
Course Learning Outcomes(CLO): After completing this course, the learner will be able to:
1. Understand the principles of back-end development.
2. Gain proficiency in back-end programming languages
and frameworks.
3. Learn to design and manage databases.
4. Develop skills to create and use back-end
applications.
____________________________________________
5*. to equip with the knowledge of back-end
programming.
Credits Theory Practical Total
3 1 4
Contact Hours 3 2 5
Max. Marks:75(50(T)+25(P)) Time: 3 Hrs.(T), 3Hrs.(P)
Internal Assessment Marks:20(15(T)+5(P))
End Term Exam Marks: 55(35(T)+20(P))
Part B- Contents of the Course

Instructions for Paper-Setter

The examiner will set a total of nine questions. Out of which first question will be compulsory.
The remaining eight questions will be set from four units selecting two questions from each unit.
The examination will be of three-hour duration. All questions will carry equal marks. The first
question will comprise short answer-type questions covering the entire syllabus.
The candidate must attempt five questions, selecting one from each unit. The first question will
be compulsory.

5
The practicum will be evaluated by an external and an internal examiner. The examination will
be of three-hour duration.
Unit Topics Contact
Hours
I Introduction to back-end Development: Overview of 11
backend, Client-server architecture, Introduction to web servers
and database
Programming Languages and Tools: Introduction to server-
side languages (e.g., Node.js), Syntax and semantics of chosen
server-side language
II Programming Languages: Version control with Git, 11
Introduction to IDEs (Integrated Development Environments)
of chosen language, Writing and executing basic server-side
scripts
Performance Optimization and Security: Caching strategies,
Query optimization
III Database Management: Introduction to databases and DBMS 11
(SQL and NoSQL), Designing a database schema, CRUD
operations (Create, Read, Update, Delete), Connecting
applications to a database
IV Server-Side Frameworks: Overview of popular server-side 12
frameworks (e.g., Express.js), Building a simple application
using a framework.
API Development: RESTful API concepts, Designing and
documenting APIs, Authentication and authorization basics
Web security best practices (SQL injection, XSS, CSRF)
V* The following activities be carried out/ discussed in the lab 30
during the initial period of the semester.
Programming Lab:
 Introduction to Backend Technologies: Objective:
Familiarize students with backend technologies and tools.
o Setup development environment (e.g., IDE, Git).
o Create a simple “Hello World” backend application
in Node.js.
 Working with Databases (SQL): Objective: Learn basic
SQL operations and database interactions.
o Set up MySQL/PostgreSQL database.
o Perform CRUD operations using SQL queries
(Create, Read, Update, Delete).
 Working with NoSQL Databases: Objective: Introduce
students to NoSQL databases.
o Set up MongoDB database.
o Implement CRUD operations using NoSQL
commands.
 Building RESTful APIs: Objective: Develop skills in
designing and implementing RESTful APIs.
o Create endpoints for CRUD operations.

6
 o Implement basic authentication and authorization.
 Web Frameworks (Choose one: Node.js or Express.js):
Objective: Gain practical experience with backend
frameworks.
o Setup Node.js/Express.js project.
o Implement a simple web application (Express.js or
Node.js).
 Integrating Frontend and Backend: Objective: Understand
frontend-backend interaction.
o Create API endpoints to serve JSON data.
o Develop a frontend (HTML/CSS/JavaScript) to
consume backend API.
 Data Validation and Error Handling: Objective: Learn
techniques for validating input data and handling errors.
o Implement input validation using middleware
(Express.js) or Node.js forms.
o Handle errors and exceptions gracefully.
 Security Best Practices: Objective: Implement security
measures in backend applications.
o Implement HTTPS/SSL configuration.
o Prevent common security vulnerabilities (e.g., SQL
injection, XSS).
Suggested Evaluation Methods
Internal Assessment: End Term
➢ Theory Examination:
 Class Participation: 5 A three-hour exam
 Seminar/presentation/assignment/quiz/class test etc.:5 for both theory and
 Mid-Term Exam: 10 practicum.
➢ Practicum
 Class Participation: NA
 Seminar/Demonstration/Viva-voce/Lab records etc.:10
 Mid-Term Exam: NA

Part C-Learning Resources

Recommended Books/e-resources/LMS:
 "Node.js Design Patterns" by Mario Casciaro and Luciano Mammino
 "Learning PHP, MySQL & JavaScript" by Robin Nixon
 Online documentation and tutorials for the chosen programming language and
frameworks
 “Clean Code: A Handbook of Agile Software Craftsmanship” by Robert C. Martin
 “Designing Data-Intensive Applications: The Big Ideas Behind Reliable, Scalable, and
 Maintainable Systems” by Martin Kleppmann
 “SQL Cookbook: Query Solutions and Techniques for Database Developers” by Anthony
Molinaro
 “High-Performance Browser Networking: What every web developer should know about
networking and web performance” by Ilya Grigorik

*Applicable for courses having practical component.

7
 DEPARTMENT OF COMPUTER SCIENCE & APPLICATIONS
KURUKSHETRA UNIVERSITY, KURUKSHETRA

Scheme: 2023-24, Syllabus: 2024-25

Part A - Introduction
Subject BCA
Semester V
Name of the Course Network Infrastructure and Data Communication
Technologies
Course Code B23-CAP-503
Course Type: CC-C5
(CC/MCC/MDC/CC-
M/DSEC/VOC/DSE/PC/AEC/
VAC)
Level of the course (As per 300-399
Annexure-I
Pre-requisite for the course (if Basic Knowledge of computer
any)
Course Learning Outcomes(CLO): After completing this course, the learner will be able to:
1. Understand the basic concepts and principles of
computer networks.
2. Describe the analog and digital communication
concepts.
3. Evaluate different data link layer designs and LAN
technologies.
4. Analyze the various routing algorithms and know
about the application layer.

5*. Use networking infrastructure and its applications.

Credits Theory Practical Total
3 1 4
Contact Hours 3 2 5
Max. Marks:100(70(T)+30(P)) Time: 3 Hrs.(T), 3Hrs.(P)
Internal Assessment Marks:30(20(T)+10(P))
End Term Exam Marks: 70(50(T)+20(P))
Instructions for Paper-Setter
The examiner will set a total of nine questions. Out of which first question will be compulsory.
Remaining eight questions will be set from four unit selecting two questions from each unit. The
examination will be of three-hour duration. All questions will carry equal marks. The first question
will comprise short answer-type questions covering the entire syllabus.
The candidate must attempt five questions in all, selecting one question from each unit. The first
question will be compulsory.
The practicum will be evaluated by an external and an internal examiner. The examination will be
of three-hour duration.

8
 Part B- Contents of the Course
Unit Topics Contact
Hours
I Introduction to Data Communication and Computer Networks; Uses of 11
Computer Networks; Types of Computer Networks and their Topologies;
Network Hardware Components: Connectors, Transceivers, Repeaters,
Hubs, Network Interface Cards and PC Cards, Bridges, Switches, Routers,
Gateways;
Network Software: Network Design issues and Protocols; Connection-
Oriented and Connectionless Services; OSI Reference Model; TCP/IP
Model
II Analog and Digital Communications Concepts: Analog and Digital data 11
and signals; Bandwidth and Data Rate, Capacity, Baud Rate; Guided and
Wireless Transmission Media; Communication Satellites; Switching and
Multiplexing; Modems and modulation techniques
III Data Link Layer Design issues; Error Detection and Correction methods; 11
Sliding Window Protocols: One-bit, Go Back N, and Selective Repeat;
Media Access Control: ALOHA, Slotted ALOHA, CSMA, Collision
free protocols;
Introduction to LAN technologies: Ethernet, Switched Ethernet, Fast
Ethernet, Gigabit Ethernet; Token Ring; Introduction to Wireless LANs
and Bluetooth;
IV Routing Algorithms: Flooding, Shortest Path Routing, Distance Vector 12
Routing; Link State Routing, Hierarchical Routing; Congestion Control;
Traffic shaping; Choke packets; Load shedding;
Application Layer: Introduction to DNS, E-Mail, and WWW services;
Network Security Issues: Security attacks; Encryption methods;
Firewalls; Digital Signatures;
V* The following activities be carried out/ discussed in the labduring 30
the semester.
Programming Lab:
 Experiment Study of different types of Network cables and
Practically implement the cross-wired cable and straight-through
cable using a clamping tool.
 Study of Network Devices in Detail.
 Study of network IP.
 Connect the computers to the Local Area Network.
 Performing an Initial Switch Configuration Performing an Initial
Router Configuration
 To study about components and specifications of Laptops and
Desktop.
 Familiarization with networking components and devices LAN
adapter, Hub, Switches, Routers, etc.
 Familiarization with Transmission media and tools: Co-axial
cable, UTP cable, Crimping tool, Connectors, etc.
 Introduction to various interior and exterior routing protocols.
 Study of various LAN topologies and their creation using
network devices, cables, and Computer.
 Configuration of TCP/IP protocols in Window/LINUX.

9
 Suggested Evaluation Methods
Internal Assessment: End Term
➢ Theory Examination:
 Class Participation: 5 A three-
 Seminar/presentation/assignment/quiz/class test etc.: 5 hour exam
 Mid-Term Exam: 10 for both
theory and
➢ Practicum practicum.
 Class Participation: NA End Term
 Seminar/Demonstration/Viva-voce/Lab records etc.: 10 Exam
 Mid-Term Exam: NA Marks:
70(50(T)+2
0(P))
Part C-Learning Resources
Recommended Books/e-resources/LMS:
 Andrew S. Tanenbaum, “Computer Networks”, Pearson Education.
 Michael A. Gallo, William M. Hancock, “Computer Communications and Networking
Technologies”, CENGAGE Learning.
 Behrouz A Forouzan, “Data Communications and Networking”, McGraw Hill.

*Applicable for courses having practical components.

1
0
 DEPARTMENT OF COMPUTER SCIENCE & APPLICATIONS
KURUKSHETRA UNIVERSITY, KURUKSHETRA

Scheme: 2023-24, Syllabus: 2024-25

Part A - Introduction
Subject BCA

Semester VI
Name of the Course Programming using Python
Course Code B23-CAP-601
Course Type: CC-A6
(CC/MCC/MDC/CC-
M/DSEC/VOC/DSE/PC/AEC/
VAC)
Level of the course (As per 300-399
Annexure-I
Pre-requisite for the course (if Knowledge of any Computer Programming Language
any)
Course Learning Outcomes(CLO): After completing this course, the learner will be able to:
1. understand the basic concepts of Python
programming
2. learn various data structures used in Python
programming.
3. develop the simple programs of Python using arrays
and functions.
4. illustrate the process of data file manipulations
using python
5* develop the programs using Python.
Credits Theory Practical Total
3 1 4
Contact Hours 3 2 5
Max. Marks:100(70(T)+30(P)) Time: 3 Hrs.(T), 3Hrs.(P)
Internal Assessment Marks:30(20(T)+10(P))
End Term Exam Marks: 70(50(T)+20(P))
Part B- Contents of the Course
Instructions for Paper- Setter
The examiner will set a total of nine questions. Out of which first question will be compulsory.
Remaining eight questions will be set from four unit selecting two questions from each unit.
Examination will be of three-hour duration. All questions will carry equal marks. First question
will comprise of short answer type questions covering entire syllabus.
Candidate will have to attempt five questions in all, selecting one question from each unit. First
question will be compulsory.
Practicum will be evaluated by an external and an internal examiner. Examination will be of three-
hour duration.
Unit Topics Contact
Hours

1
1
 I Introduction to Python: Python Interpreter, Python as calculator, 11
Python shell, Indentation, identifier and keywords, literals, strings,
Operators: Arithmetic, Relational, Logical, comparison, Bitwise,
Assignment, Identity operator and Membership operator; Input &
output statements; Control statements: Branching, looping,
Conditional statement, Exit function
II String Manipulations: Subscript operator, indexing, slicing a string, 11
other functions on strings, string module. Strings and number system:
Format functions, converting strings to numbers & Vice Versa. List,
Tuples, Sets, Dictionaries: Basic list operators, replacing, inserting,
removing an element, searching, Sorting lists, dictionary literals,
adding & removing keys, accessing & replacing values, traversing
dictionaries.
III Array in Python, Design with Functions: hiding redundancy, 11
complexity, arguments & return values; Formal/Actual arguments,
named arguments, program structure and design, Recursive functions,
scope & Global statements, Importing modules, Math modules &
Random modules.
IV Exception Handling: Exceptions, except clause, try and finally clause, 12
user-defined exceptions.
File Handling: Manipulating files & directories, OS & SYS modules,
Reading, writing text & numbers from/to file.
Graphics: “Turtle” module, drawing colors, shapes, digital images,
image file formats.
V* Practicum: 30
Students are advised to do laboratory/practical practice not limited
to but including the following types of problems:
 WAP to find the roots of a quadratic equation.
 WAP to accept a number ‘n’ and (a). Check if ’n’ is prime (b).
Generate all prime numbers till ‘n’ (c). Generate first ‘n’ prime
numbers (d). This program may be done using functions.
 WAP that accepts a character and performs the following: (a).
print whether the character is a letter, numeric digit, or special
character (b). if the character is a letter, print whether the letter
is uppercase or lowercase (c). if the character is a numeric digit,
print its name in the text (e.g., if the input is 9, the output is
NINE)
 WAP to perform the following operations on a string (a). Find
the frequency of a character in a string. (b). Replace a character
by another character in a string. (c). Remove the first
occurrence of a character from a string. (d). Remove all
occurrences of a character from a string.
 WAP to swap the first n characters of two strings.
 Write a function that accepts two strings and returns the indices
of all the occurrences of the second string in the first string as
a list. If the second string is not present in the first string, then
it should return -1.
 WAP to create a list of the cubes of only the even integers
appearing in the input list (may have elements of other types
also) using the following: (a). 'for' loop (b). list comprehension
1
2
  WAP to read a file and (a). Print the total number of characters,
words, and lines in the file. (b). Calculate the frequency of each
character in the file. Use a variable of dictionary type to
maintain the count. (c). Print the words in reverse order. (d).
Copy even lines of the file to a file named ‘File1’ and odd lines
to another file named ‘File2’.
 Write a function that prints a dictionary where the keys are
numbers between 1 and 5 and the values are cubes of the keys.
 Consider a tuple t1= (1, 2, 5, 7, 9, 2, 4, 6, 8, 10). WAP to
perform the following operations: (a). Print half the values of
the tuple in one line and the other half in the next line. (b). Print
another tuple whose values are even numbers in the given tuple.
(c). Concatenate a tuple t2= (11,13,15) with t1. (d). Return
maximum and minimum values from this tuple
 WAP to accept a name from a user. Raise and handle the
appropriate exception(s) if the text entered by the user contains
digits and/or special characters.
Suggested Evaluation Methods
Internal Assessment: End-Term
➢ Theory Examination: A
 Class Participation: 5 three-hour exam
 Seminar/presentation/assignment/quiz/class test etc.: 5 for both theory
 Mid-Term Exam: 10 and practicum.
➢ Practicum End Term
Exam Marks:
 Class Participation: NA
70(50(T)+20(P)
 Seminar/Demonstration/Viva-voce/Lab records etc.: 10
)
 Mid-Term Exam: NA
Part C-Learning Resources
Recommended Books/e-resources/LMS:
 Sheetal Taneja, Naveen Kumar, Python Programming: A Modular approach, 5th
Impression, Pearson.
 Reema Thareja, Python Programming Using Problem Solving Approach, Oxford
University Press.
 Mark Lutz, Learning Python (available online at pdf derive).
 Guttag John V, Introduction to Computation and Programming Using Python with
Application to Understanding Data, PHI.
 Charles Diorbach, Introduction to Computer Science using Python, Wiley.
 Balaguruswamy E., Introduction to Computing and Problem Solving using Python, 2nd
edition, McGraw Hill Education, 2018.
 Brown, Martin C., Python: The Complete Reference, 2nd edition, McGraw Hill
Education, 2018.

* Applicable for courses having practical components.

1
3
 DEPARTMENT OF COMPUTER SCIENCE & APPLICATIONS
KURUKSHETRA UNIVERSITY, KURUKSHETRA

Scheme: 2023-24, Syllabus: 2024-25

Part A - Introduction
Subject BCA
Semester VI
Name of the Course Advanced Web Development
Course Code B23-CAP-602
Course Type: CC-B6
(CC/MCC/MDC/CC-
M/DSEC/VOC/DSE/PC/AEC/
VAC)
Level of the course (As per 300-399
Annexure-I
Pre-requisite for t he course (if B23-CAP-202, B23-CAP-402, B23-CAP-502
any)
Course Learning Outcomes(CLO): After completing this course, the learner will be able to:
1. gain proficiency in advanced web development
frameworks and tools.
2. understand the principles of responsive design and
progressive web apps.
3. learn best practices for database management and
full-stack development.
4. know about optimization and devops.

5* To work on real-world projects and develop a

comprehensive web application.
Credits Theory Practical Total
3 1 4
Contact Hours 3 2 5
Max. Marks:100(70(T)+30(P)) Time: 3 Hrs.(T), 3Hrs.(P)
Internal Assessment Marks:30(20(T)+10(P))
End Term Exam Marks: 70(50(T)+20(P))
Part B- Contents of the Course

Instructions for Paper- Setter

Examiner will set a total of nine questions. Out of which first question will be compulsory.
Remaining eight questions will be set from four unit selecting two questions from each unit.
Examination will be of three-hour duration. All questions will carry equal marks. First question
will comprise of short answer type questions covering entire syllabus.

1
4
Candidate will have to attempt five questions in all, selecting one question from each unit. First
question will be compulsory.
Practicum will be evaluated by an external and an internal examiner. The examination will be of
three-hour duration.

Unit Topics Contact

Hours
I Advanced Front-End Development: Advanced HTML5 & CSS3: 11
Semantic HTML, CSS Grid and Flexbox, CSS Preprocessors
(Sass/LESS)
JavaScript ES6+: Advanced JavaScript concepts (Promises,
Async/Await), ES6+ features (Arrow functions, Template literals,
Destructuring)
II Front-End Frameworks: Introduction to React, Angular, Component- 11
based architecture, State management with Redux
Advanced Back-End Development: Server-Side Programming:
Express.js, GraphQL, Middleware, and Authentication (JWT, OAuth)
III Database Management: Advanced SQL concepts, NoSQL databases 11
(Firebase), ORMs (Sequelize)
Full-Stack Development: Integrating Front-End and Back-End:
Building a full-stack application, Handling asynchronous operations,
Real-time applications with WebSockets
IV Performance Optimization: Code splitting and lazy loading, 12
Caching strategies, Optimizing images and assets
Deployment and DevOps: Deployment Strategies: CI/CD pipelines,
Containerization with Docker, Deployment platforms (Heroku, AWS,
Netlify)
DevOps and Monitoring: Infrastructure as code (Terraform, Ansible),
Monitoring and logging (Prometheus, Grafana)
V* Practicum: 30
Students are advised to do laboratory/practical practice not limited to
but including the following types of problems:
 Front-End Projects: Develop a responsive web application
using React/Angular.
 Back-End Projects: Build and deploy a RESTful API using
Node.js and Express.js.
 Full-Stack Projects: Create a full-stack application
integrating front-end and back-end.
 Optimization Projects: Implement performance
optimization techniques on existing projects.
 Deployment Projects: Set up a CI/CD pipeline and deploy a
web application to a cloud platform.
Suggested Evaluation Methods
Internal Assessment: End Term
➢ Theory Examination:
 Class Participation: 5 A three-hour

1
5
  Seminar/presentation/assignment/quiz/class test etc.: 5 exam for both
 Mid-Term Exam: 10 theory and
➢ Practicum practicum.
 Class Participation: NA
 Seminar/Demonstration/Viva-voce/Lab records etc.: 10
 Mid-Term Exam: NA

Part C-Learning Resources

Recommended Books/e-resources/LMS:
 "JavaScript: The Good Parts" by Douglas Crockford
 "You Don't Know JS" by Kyle Simpson
 "Learning React" by Alex Banks and Eve Porcello

*Applicable for courses having practical components.

1
6
 DEPARTMENT OF COMPUTER SCIENCE & APPLICATIONS
KURUKSHETRA UNIVERSITY, KURUKSHETRA

Scheme: 2023-24, Syllabus: 2024-25

Part A - Introduction
Subject BCA
Semester VI
Name of the Course Artificial Intelligence
Course Code B23-CAP-603
Course Type: CC-C6
(CC/MCC/MDC/CC-
M/DSEC/VOC/DSE/PC/AEC/
VAC)
Level of the course (As per 300-399
Annexure-I
Pre-requisite for the course (if Basic understanding of computer systems and
any) programming.
Course Learning Outcomes(CLO): After completing this course, the learner will be able to:
1. learn the basic Artificial Intelligence (AI) concept and its
application areas.
2. acquire the knowledge of heuristic search and approaches
for knowledge representations.
3. understand the idea of natural language processing and
predicate logic
4. gain the knowledge of learning technologies & build
expert systems.
5*. Understand the practical aspects of artificial
intelligence.
Credits Theory Practical Total
3 1 4
Contact Hours 3 2 5
Max. Marks:100(70(T)+30(P)) Time: 3 Hrs.(T), 3Hrs.(P)
Internal Assessment Marks:30(20(T)+10(P))
End Term Exam Marks: 70(50(T)+20(P))
Part B- Contents of the Course
Instructions for Paper-Setter
The examiner will set a total of nine questions. Out of which the first question will be compulsory.
The remaining eight questions will be set from four units selecting two questions from each unit.
The examination will be of three-hour duration. All questions will carry equal marks. The first
question will comprise short answer-type questions covering the entire syllabus.
The candidate will have to attempt five questions in all, selecting one question from each unit. The
first question will be compulsory.

1
7
The practicum will be evaluated by an external and an internal examiner. The examination
will be of three-hour duration.
Unit Topics Contact
Hours
I Introduction to Artificial Intelligence (AI), Importance of AI, AI and 11
its Related Field, AI Techniques, Criteria for success. Problem Space
and Search: Problem as a State Space Search, Production System and
its Characteristics, Issues in the Design of the Search Problem.

II Heuristic search techniques: Generate and test, hill climbing, best first 11
search technique, problem reduction, constraint satisfaction.
Knowledge Representation: Definition and Importance of Knowledge,
Knowledge Representation, Various Approaches Used in Knowledge
Representation, Issues in Knowledge Representation.
III Using Predicate Logic: Representing Simple Facts in Logic, 11
Representing Instances and is-a Relationship, Computable Function
and Predicate, Natural Language Processing: Introduction, Syntactic
Processing, Semantic Processing, Discourse and Pragmatic
Processing.
IV Learning: Introduction to Learning, Rote Learning, Learning by Taking 12
Advice, Learning in Problem-Solving, Learning from Example-
Induction, Explanation-Based Learning. Expert System: Introduction,
Representing Using Domain-Specific Knowledge, Expert System
Shells.
V* Practicum: 30
Students are advised to do laboratory/practical practice not limited to
but including the following types of problems:
Problem Solving and Search Algorithms
 Implementing uninformed search algorithms (Breadth-First
Search, Depth-First Search)
 Implementing informed search algorithms (A*, Greedy Best-
First Search)
Knowledge Representation and Reasoning
 Implementing basic logic representation (Propositional and
Predicate Logic)
 Building simple inference engines
 Developing rule-based systems for decision-making
Introduction to Expert Systems
 Understanding the components of expert systems
 Designing knowledge bases using rule-based systems
Expert Systems Applications
 Developing expert systems for specific domains (e.g., medical
diagnosis, financial advisory)
 Case studies of successful expert systems
Suggested Evaluation Methods
Internal Assessment: End-Term
➢ Theory Examination:
 Class Participation: 5 A three-hour
 Seminar/presentation/assignment/quiz/class test etc.: 5 exam for both
  Mid-Term Exam: 10 theory and
practicum.
➢ Practicum
End Term
 Class Participation: NA Exam Marks:
 Seminar/Demonstration/Viva-voce/Lab records etc.: 10 70(50(T)+20(P
 Mid-Term Exam: NA ))
Part C-Learning Resources
Recommended Books/e-resources/LMS:
 E. Rich and K. Knight, Artificial Intelligence, TMH.
 D.W. Patterson, Introduction to AI and Expert Systems, PHI.
 Nils J Nilsson, Artificial Intelligence -A new Synthesis, Harcourt Asia Ltd.

*Applicable for courses having practical components.

 DEPARTMENT OF COMPUTER SCIENCE & APPLICATIONS
KURUKSHETRA UNIVERSITY, KURUKSHETRA

Scheme: 2024-25, Syllabus: 2024-25

Part A - Introduction
Subject BCA
Semester VI
Name of the Course Basics of Data Science using Python
Course Code B23-CAP-604
Course Type: CC-M6
(CC/MCC/MDC/CC-
M/DSEC/VOC/DSE/PC/AEC/
VAC)
Level of the course (As per 300-399
Annexure-I
Pre-requisite for t he course (if Must have basic knowledge of computer
any)
Course Learning Outcomes(CLO): After completing this course, the learner will be able to:
1. understand the fundamental concepts of data
science and the role of Python in data analysis.
2. To learn data cleaning, preparation, and
visualization techniques using Python.
3. To apply statistical analysis and predictive
modeling using Python.
4. To explore advanced Python libraries and data
analysis tools.
____________________________________________
5*. to implement the programs based on data science in
Python.
Credits Theory Practical Total
3 1 4
Contact Hours 3 2 5
Max. Marks:100(70(T)+30(P)) Time: 3 Hrs.(T), 3Hrs.(P)
Internal Assessment Marks:30(20(T)+10(P))
End Term Exam Marks: 70(50(T)+20(P))
Part B- Contents of the Course

Instructions for Paper- Setter

Examiner will set a total of nine questions. Out of which first question will be compulsory.
Remaining eight questions will be set from four unit selecting two questions from each unit. The
examination will be of three-hour duration. All questions will carry equal marks. The first question
will comprise short answer-type questions covering the entire syllabus.
The candidate will have to attempt five questions in all, selecting one question from each unit.
The first question will be compulsory.
The practicum will be evaluated by an external and an internal examiner. The examination will be
of three-hour duration.

Unit Topics Contact

Hours
I Introduction to Data Science: Definition, importance, and applications. 11
Overview of Python: Python programming basics, data types, and
structures. Introduction to Python Libraries: NumPy, pandas, and
matplotlib. Basic Data Manipulation: Reading and writing data files,
basic operations with pandas DataFrame.
II Data Import and Export: Handling CSV, Excel, and other file formats. 11
Data Cleaning Techniques: Handling missing values, duplicates, and
data inconsistencies. Data Transformation: Data type conversion,
normalization, and scaling. Data Visualization: Creating and
customizing plots using matplotlib and Seaborn.
III Descriptive Statistics: Calculating mean, median, mode, standard 11
deviation, and variance using pandas. Inferential Statistics:
Conducting hypothesis testing, t-tests, and chi-square tests.
Regression Analysis: Implementing simple linear regression and
multiple regression using scikit-learn. Predictive Modeling:
Introduction to basic predictive models such as decision trees and
logistic regression.
IV Advanced Python Libraries: Exploring advanced pandas, NumPy, and 12
scikit-learn features. Data Analysis Tools: Time series analysis,
clustering, and classification using scikit-learn. What-If Analysis
Tools: Sensitivity analysis and scenario analysis using Python.
V* Practicum: 30
Students are advised to do laboratory/practical practice not limited to
but including the following types of problems:
Introduction to Python for Data Science
 Setting up the Python environment (Anaconda, Jupyter
Notebook)
 Introduction to libraries: NumPy, pandas, Matplotlib, and
Seaborn
Data Manipulation with pandas
 Importing and exporting data
 Data cleaning and preprocessing
 Data transformation and aggregation
Data Visualization
 Creating basic plots with Matplotlib
 Advanced visualization with Seaborn
Exploratory Data Analysis (EDA)
 Descriptive statistics and data summarization
  Detecting and handling missing values
 Identifying patterns and correlations in data
Descriptive Statistics
 Implementing regression using Sci-kit learn
 Implementing predictive modelling and decision tress
 Implementing basic statistics and various tests used in
statistics
 Implementing various data analysis tools
Suggested Evaluation Methods
Internal Assessment: End Term
➢ Theory Examination:
 Class Participation: 5 A three hour
 Seminar/presentation/assignment/quiz/class test etc.: 5 exam for both
 Mid-Term Exam: 10 theory and
➢ Practicum practicum.
 Class Participation: NA
 Seminar/Demonstration/Viva-voce/Lab records etc.: 10
 Mid-Term Exam: NA

Part C-Learning Resources

Recommended Books/e-resources/LMS:
 "Python Data Science Handbook: Essential Tools for Working with Data" by Jake
VanderPlas.
 "Python for Data Analysis: Data Wrangling with pandas, NumPy, and IPython" by Wes
McKinney.
 "Hands-On Machine Learning with Scikit-Learn, Keras, and TensorFlow" by Aurélien
Géron.
 "Data Science from Scratch: First Principles with Python" by Joel Grus.
 "Think Stats: Exploratory Data Analysis" by Allen B. Downey.

*Applicable for courses having practical component.