1 - Bca

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 of Credits Contact Internal End Total Duration
Type 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 3 10 20 30 3
CC-M3 To be taken
from other
department
MDC-3 To be taken
from other
department
SEC-3 To be taken
3
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
Practical 1 2 10 20 30 3
CC- To be taken
M5(V) from VOC
Pool
SEC-4 Internship @
4 Credits
4
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 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 Databases 4 4 30 70 100 3
Or
B23-CAP-705 Cyber Security 4 4 30 70 100 3
PC-H1 B23-CAP-706 Practical 4 8 30 70 100 6
CC-HM1 B23-CAP-707 Cloud Computing 4 4 30 70 100 3
8 CC-H4 B23-CAP-801 Design & Analysis 4 4 30 70 100 3
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
5
PC-H2 B23-CAP-806 Practical 4 8 30 70 100 6
CC-HM2 B23-CAP-807 Internet of Things 4 4 30 70 100 3
(IoT)
OR
CC-H4 B23-CAP-801 Design & Analysis 4 4 30 70 100 3

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

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

(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)
(For the Batches Admitted From 2023-2024)
7
KURUKSHETRA UNIVERSITY, KURUKSHETRA
Session: 2023-24
Part A - Introduction
Subject BCA
Semester I
Name of the Course Problem Solving through C
Course Code B23-CAP-101 (Common with B23-CAI-101, B23-CDS-
101, B23-CTS-101)
Course Type: CC
(CC/MCC/MDC/CC-
M/DSEC/VOC/DSE/PC/AEC/
VAC)
Level of the course (As per 100-199
Annexure-I
Pre-requisite for the course (if
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,
union 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
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
8
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
I Overview of C: History, Importance, Structure of C Program, 10
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, 10
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 10
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 10
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; difference between Structure and Union.
V* Practicum: 25
Students are advised to do laboratory/practical practice not limited
to, but including the following types of problems:
 To read radius of a circle and to find 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 keyboard continuously till the user
presses 999 and to find the sum of only positive numbers
 To read percentage of marks and to display appropriate
message (Demonstration of else-if ladder)
 To find the roots of quadratic equation
 To read marks scored by n students and find the average of
9
marks (Demonstration of single dimensional array)
 To remove Duplicate Element in a single dimensional Array
 To perform addition and subtraction of Matrices
 To find factorial of a number
 To generate Fibonacci series
 To remove Duplicate Element in a single dimensional Array
 To find the length of a string without using 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: 5
 Seminar/Demonstration/Viva-voce/Lab records etc.: 5
 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.
 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.
10
Session: 2023-24
Subject BCA
Semester I
Name of the Course Foundations of Computer Science
101, B23-CTS-101)
Course Type: CC
(CC/MCC/MDC/CC-
VAC)
Annexure-I
any)
1. understand the basics of computer
2. learn about I/O devices and operating systems
3. understand internet and its services
4. learn about the threats and security concepts on
computers
____________________________________________
5*. to understand the working of operating system,
internet and security related concepts.
3 1 4
Contact Hours 3 2 5
11
Unit Topics Contact
Hours
I Computer Fundamentals: Evolution of Computers through 10
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, concept of 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 Desk Top Computer, Device Controller, 10
Device Driver. Input Devices: classification and use, keyboard,
pointing devices - mouse, touch pad and track ball, joystick, magnetic
stripes, scanner, digital camera, and microphone Output Devices:
speaker, monitor, printers: classification, laser, ink jet, 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, 10
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, Virus, Worm, Trojan, 10
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.
V* Practicum: 25
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
12
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.
practicum.
➢ Practicum

 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.
13
Session: 2023-24
Subject BCA
Semester I
Name of the Course Logical Organization of Computer
101, B23-CTS-101)
Course Type: CC
(CC/MCC/MDC/CC-
VAC)
Annexure-I
Pre-requisite for the course (if Basic Knowledge of Mathematics (10th Level)
any)
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 working of logic gates and design various
combinational circuits using these logic gates.
4. understand working of different types of flip-flops
and design different types of registers.
____________________________________________
5*. to understand the practical aspects of logical
organization of computer.
3 1 4
Contact Hours 3 2 5
14
Unit Topics Contact
Hours
I Number Systems: Binary, Octal, Hexadecimal etc. Conversions from 10
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 10
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 – 10
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 Subtracor, Multiplexers, Demultiplexers,
Decoder, Encoder, Comparators, Code Converters.
IV Sequential Circuits: Basic Flip- Flops and their working. 10
Synchronous 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),
Serial-In Parallel-Out (SIPO), Parallel-In Serial-Out
(PISO) Parallel-In Parallel-Out (PIPO) and shift registers.
V* Practicum: 25
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.
15
 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.
practicum.
➢ Practicum

 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.
16
Session: 2023-24
Subject BCA
Semester I
Name of the Course Mathematical Foundations for Computer Science-I
101, B23-CTS-101)
Course Type: CC-M
(CC/MCC/MDC/CC-
VAC)
Annexure-I
any)
Course Learning Outcomes (CLO): After learning this course student will be able:
1. Gain the 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. Have the knowledge of 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 learnt concepts
of Introductory Mathematics in multidisciplinary
learning contexts and to know their applications
1 1 2
Contact Hours 1 2 3
End Term Exam Marks:35(20(T)+15(P))
Part B-Contents of the Course
17
Unit Topics Contact
Hours
I Sets and their representations, Empty set, Finite and infinite 4
sets, Subsets, Equal sets, Power sets, Universal set, 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,
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. 4
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, Use of differentiation for solving problems related to
real-life situations. Differentiation of simple algebraic,
trigonometric and exponential functions.
V* Practicum: 25
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 following topics will be worked out and record of
those will be maintained in the Practical Note Book:
 Problems related to union, intersection, difference and
complement of sets.
 Problems based on De Morgan’s Laws.
 Problems related to Venn diagrams.
 Problems to find inverse of a matrix.
 Problems to find determinant of a square matrix of
order 3.
 Problems to find nth term of A.P., G.P. and H.P.
 Problems to find 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 first derivatives of functions.
 Class Participation: 4 A three hour exam
18
 Seminar/presentation/assignment/quiz/class test etc.: NA for both theory and
 Mid-Term Exam: 6 practicum.
➢ Practicum
 Class Participation: NA
PartC-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
19
Session: 2023-24
Subject BCA
Semester III
Name of the Course Java OOP Foundations
301, B23-CTS-301)
Course Type: CC
(CC/MCC/MDC/CC-
VAC)
Annexure-I
Pre-requisite for the course (if Knowledge of any Computer Programming Language
any)
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.

3 1 4
Contact Hours 3 2 5
20
Unit Topics Contact
Hours
I Object Oriented Programming and Java Fundamentals: Structure of 10
Java programs, Classes and Objects, Data types, Type Casting,
Looping Constructs.
II Interfaces: Interface basics; Defining, implementing and extending 10
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: 10
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 10
sources, Event classes, Event Listeners, Relationship between Event
sources and Listeners, Delegation event model, Creating GUI
applications using AWT.
V* Practicum: 25
 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.
 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 Java Program to generate
Even numbers and Odd Numbers in TextField “T1 and T2
respectively” while pressing Button “Even” and “Odd”.
 Write a program to Copy the text from one file to another
using byte stream.
21
practicum.
➢ Practicum

 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.
22
Session: 2023-24
Subject BCA
Semester III
Name of the Course Linux and Shell Programming
302, B23-CTS-302)
Course Type: CC
(CC/MCC/MDC/CC-
VAC)
Annexure-I
Pre-requisite for the course (if Must have basic knowledge of computer
any)
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.
3 1 4
Contact Hours 3 2 5
23
Unit Topics Contact
Hours
I Introduction to Linux: Linux distributions, Overview of Linux 10
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 10
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, 10
file system components, standard file system, file system types.
Processes in Linux: Starting and Stopping Processes, Initialization
Processes, Mechanism of process creation, Job control in linux using
at, batch, cron & time.
IV Shell Programming: vi editor, shell variables, I/O in shell, control 10
structures, loops, subprograms, creating & executing shell scripts in
linux.
V* Practicum: 25
 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,
rectangle, circle and triangle.
 Write a shell script to print integer numbers from 1 to 20.
practicum.
➢ Practicum
24

 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.
25
Session: 2023-24
Subject BCA
Semester III
Name of the Course Data Base Technologies
303, B23-CTS-303)
Course Type: CC
(CC/MCC/MDC/CC-
VAC)
Annexure-I
Pre-requisite for the course (if Basic Knowledge of computer
any)
1. understand the concepts of problem solving on
computer
2. understand the basics of C programming along with
various I/O functions
3. understand various operators and branching
statements in C
4. understand loops, functions and arrays in C
____________________________________________
5*. to design programs based on theoretical concepts of
C.
3 1 4
Contact Hours 3 2 5
Unit Topics Contact
Hours
I Basic Concepts – Data, Information, Records, Files, Schema 10
and Instance etc. Limitations of File Based Approach,
26
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 10
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 10
Components: DDL, DML, DCL and DQL, Basic Queries,
Join Operations and Sub-queries, Views, Specifying Indexes.
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. Relational Algebra Vs. Relational Calculus.
IV Relational Model: Functional Dependency, Characteristics, 10
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,
Domain Key Normal Form.
V* The following activities be carried out/ discussed in the lab 25
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.
 Class Participation: 5 A three hour exam
 Seminar/presentation/assignment/quiz/class test etc.: 5 for both theory and
 Mid-Term Exam: 10 practicum.
27
➢ Practicum

 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.
28

1 - Bca

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

1 - Bca

Uploaded by

Copyright:

Available Formats

Kurukshetra University, Kurukshetra

(Established by the State Legislature Act XII of 1956)

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

Scheme of Examination for Under-Graduate Programmes

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

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

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

Research B23-CAP-808 Project/ 12 300

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

Part C-Learning Resources

*Applicable for courses having practical component.

Part C-Learning Resources

*Applicable for courses having practical component.

Part C-Learning Resources

*Applicable for courses having practical component.

*Applicable for courses having practical component.

5* develop the project using java.

Part C-Learning Resources

*Applicable for courses having practical component.

Part C-Learning Resources

*Applicable for courses having practical component.

Part C-Learning Resources

*Applicable for courses having practical component.

You might also like