SWAMI VIVEKANAND SUBHARTI UNIVERSITY

MEERUT

Syllabus
For
Bachelor in Computer Application
Under
National Education Policy-2020/
Four Year Undergraduate Program (FYUP)
Effective From
2024-25

DEPARTMENT OF COMPUTER APPLICATION

KERAL VERMA SUBHARTI COLLEGE OF SCIENCE
 Department of Computer Application
Keral Verma Subharti College of Science
SWAMI VIVEKANAND SUBHARTI UNIVERSITY
Meerut

Syllabus of BCA (Bachelor in Computer Application)/BCA-Hons Program

Four Year Degree Program
as per
National Education Policy-2020

Proposed Titles for Theory and Practical Papers

Under Graduate Program

Bachelor in Computer Application

2024-25
 Semester-Wise Titles of the Major Course (MJC) Papers in BCA
Year Sem. Course Code Paper Title Theory/Practical Credits
BCA-101 Computer Concepts & Programming in C Theory 04
BCA-102 Operating System Theory 04
1
I
1- C-Programming Lab Practical 04
BCA-151 2- OS Lab
II BCA-201 Object-Oriented Programming with C++ Theory 04
BCA-202 Computer Graphics Theory 04
BCA-251 COMPUTER LAB USING C++ AND COMPUTER Practical 04
GRAPHICS
III BCA-301 Data Structures Using C Theory 04
BCA-302 Computer Network Theory 04
BCA-351 Data Structure Lab Practical 04
IV Database Management System Theory 04
BCA-401
2
BCA-402 Web designing using Scripting Language Theory 04
BCA-451 DBMS Lab & Web Designing Practical 04
V BCA-501 Design & Analysis of Algorithm Theory 04
BCA-502 Data Mining & Data Warehousing Theory 04
BCA-503 Fundamentals of IOT Theory 04
BCA-551 Algorithm Lab Practical 04
3 VI BCA-601 Software Engineering Theory 04
BCA-602 .Net Framework with VB.net Theory 04
BCA-603 Cloud Computing
BCA-651 S/w Engg & VB.Net Lab Practical 04
Theory 04

OR
BCA-501-H Software Project Management Theory 04
V BCA-502-H Fog Computing Theory 04
VII
BCA-503-H Data Analytics Theory 04
BCA-504-H Programming in Python Theory 04
BCA-551-H Python Lab Practical 04
3 VI BCA-601-H AI & Machine Learning Theory 04
Hons Degree BCA-602-H Cloud Computing and Cyber Security Theory 04
program
BCA-603-H Cyber Security Theory 04
BCA-604-H Java Programming Theory 04
BCA-651-H Java Programming Lab Practical 04
 Semester-Wise Titles of the Minor Multidisciplinary Course (MDC) Papers in
BCA
Year Sem. Course Code Paper Title Theory/Practical Credits
1 I/II MMDC-101 Introduction to computer system Theory 06
2 III/IV MMDC-102 Management Information System Theory 06

Semester-Wise Titles of the Vocational Skill Enhancement Course (SEC)

Papers in BCA
Year Sem. Course Code Paper Title Theory/Practical Credits
1 I VOC-1-CHI Computer Hardware & Installation Theory 03
2 II VOC-2-DOT Data Entry/Application of office Tools Theory 03
III VOC-3-GD 1. Graphics Designing Theory 03
2. UGC & PKMVY 4.0 Affiliated Course
(Online/Offline)

Semester-Wise Titles of the Ability Enhancement Course (AEC) Papers in BCA

Year Sem. Course Code Paper Title Theory/Practical Credits
1 I First Aid and Basic Health Theory 02
II Human Values and Environmental Studies Theory 02
2 III Physical Education and Yoga Theory 02
IV Regional and Indian Language Theory 02

Semester-Wise Titles of the Research Project /Dissertation/Internship/Survey

Works in BCA (major Category)
Three Years Plain Degree
Year Sem. Course Code Paper Title Theory/Practical Credits
1 IV INT-01 Research project /Dissertation/Internship/Survey Works Practical 03
V INT-02 Research project /Dissertation/Internship/Survey Works Practical 04
2 VI INT-03 Research project /Dissertation/Internship/Survey Works Practical 04

Semester-Wise Titles of the Research project /Dissertation/Internship/Survey

Works in BCA (major Category)
Three Years Hon’s Degree
Year Sem. Course Code Paper Title Theory/Practical Credits
1 IV INT-H-01 Research project /Dissertation/Internship/Survey Works Practical 03
V INT-H-02 Research project /Dissertation/Internship/Survey Works Practical 05
2 VI INT-H-03 Research project /Dissertation/Internship/Survey Works Practical 05
 Detailed Syllabus
Major Courses
Syllabus for BACHELOR IN COMPUTER APPLICATION (BCA)
Semester: First
Programme/Class: BCA Year: First
Subject: Computer Application
Course Code: BCA-101 Course Title: Computer Concepts & Programming in C
Course outcomes:
1. Introduction to computers, classification of computers, anatomy of computer, constituents and architecture,
microcontrollers.
2. Operating systems, functions of operating systems, classification of operating systems, kernel, shell, basics of
Unix, shell programming, booting.
3. Databases, why databases are used, users, SQL, data types in SQL, introduction of queries - select, alter,
update, delete, truncate, using where, and or in not in.
4. Describe the components of a Central Processing Unit (CPU) and memory (RAM and ROM).
5. Understand office packages including Word, Excel and PowerPoint.

Credits: 4 Major

Max. Marks: 25+75 Min. Passing Marks: 40

Total No. of Lectures-Tutorials-Practical (in hours per week): 4-0-0

No
Unit Topic . of
Lect
ures
Fundamentals of Computers: Introduction to Computers - Computer
I Definition, Characteristics of Computers, Evolution and History of Computers, 10
Types of Computers, Basic Organization of a Digital Computer; Number
Systems – different types, conversion from one number system to another;
Computer Codes – BCD, Gray Code, ASCII and Unicode; Boolean Algebra –
Boolean Operators with Truth Tables; Types of Software – System Software
and Utility Software; Computer Languages - Machine Level, Assembly Level &
High Level Languages, Translator Programs – Assembler, Interpreter and
Compiler; Planning a Computer Program - Algorithm, Flowchart and Pseudo
code with Examples. Characteristics of computers, Classification of Digital
Computer Systems: Microcomputers, Minicomputers, Mainframes, Super
computers.
Anatomy of Computer: Introduction, Functions & Components of a
II Computer, Central Processing Unit, Microprocessor, Storage units, Input 18
and output Devices. How CPU and memory works. Program execution
with illustrative examples. Introduction to microcontrollers.
Editors and Word Processors
Basic Concepts, Examples: MS-Word, Introduction to desktop publishing.
Spreadsheets and Database packages
 Purpose, usage, command, MS-Excel, Creation of files in MS-Access,
Switching between application, MS-PowerPoint.
Introduction to C Programming: Overview of C; History and Features of
C; Structure of a C Program with Examples; Creating and Executing a C 10
III
Program; Compilation process in C. C Programming Basic Concepts: C
Character Set; C tokens - keywords, identifiers, constants, and variables;
Data types; Declaration & initialization of variables; Symbolic constants.
Input and output with C: Formatted I/O functions - printf and scanf,
control stings and escape sequences, output specifications with printf
functions; Unformatted I/O functions to read and display single
character and a string - getchar, putchar, gets and puts functions.
C Operators & Expressions: Arithmetic operators; Relational operators;
Logical operators; Assignment operators; Increment & Decrement
operators; Bitwise operators; Conditional operator; Special operators;
Operator Precedence and Associatively; Evaluation of arithmetic
expressions; Type conversion.
Simple Arithmetic Problems
IV Addition / Multiplication of integers, Determining if a number is +ve / - 8
ve / even / odd, Maximum of 2 numbers, 3 numbers, Sum of first n
numbers, given n numbers, Integer division, Digit reversing, Table
generation for n, ab, Factorial, sine series, cosine series, nCr , Pascal
Triangle, Prime number, Factors of a number, Other problems such as
Perfect number, GCD numbers etc (Write algorithms and draw
flowchart), Swapping.

Control Structures: Decision making Statements - Simple if, if_else,

nested if_else, else_if ladder, Switch Case, goto, break & continue 14
V statements; Looping Statements - Entry controlled and exit
controlled statements, while, do-while, for loops, Nested loops.
Functions
Basic types of function, Declaration and definition, Function call,
Types of function, Parameter passing, Call by value, Call by reference,
Scope of variable, Storage classes, Recursion.
Arrays: One Dimensional arrays - Declaration, Initialization and
Memory representation; Two Dimensional arrays - Declaration,
Initialization and Memory representation.
Strings: Declaring & Initializing string variables; String handling
functions - strlen, strcmp, strcpy and strcat; Character handling
functions – to ascii, to upper, to lower, is alpha, is numeric etc

Introduction C Preprocessor
Definition of Preprocessor; Macro substitution directives; File
inclusion directives; Conditional compilation ,Bitwise Operators
Bitwise operators; Shift operators; Masks; Bit field.

File handling
Definition of Files, Opening modes of files; Standard function:
fopen(), fclose(), feof(), fseek(), fewind();Using text files: fgetc(),
fputc(), fscanf() ,Command line arguments
 Text Books:
1. Pradeep K. Sinha and Priti Sinha: Computer Fundamentals (Sixth Edition), BPB Publication
2. David Riley and Kenny Hunt, Computational thinking for modern solver, Chapman & Hall/CRC
3. C: The Complete Reference, By Herbert Schildt.
4. M.T Somashekara, D.S Guru and K.S. Manjunatha: Problem solving with C, PHI publication
5. C Programming Language, By Brain W. Kernighan

Reference:
1. J. Glenn Brook shear,” Computer Science: An Overview”, Addision-Wesley, Twelfth Edition,
2. R.G. Dromey, “How to solve it by Computer”, PHI
3. Yashwant Kanitkar: Let us C
4. S. Byron Gottfried: Programming with C (TMH)

Semester: First
Programme/Class: BCA Year: First
Subject: Computer Application
Course Code: BCA-102 Course Title: Operating System
Course outcomes: By the end of this course, students should be able to:
1. Understand role, responsibilities, features, and design of operating system.
2. Analyze memory management schemes and process scheduling algorithms.
3. Apply process synchronization techniques to formulate solution for critical section
problems.
4. Illustrate concept of disk scheduling.
5. Evaluate process deadlock handling techniques.

Credits: 4 Major

Max. Marks: 25+75 Min. Passing Marks:

Total No. of Lectures-Tutorials-Practical (in hours per week): 4-0-0
No. of
Unit Topic Lectures
Introduction
I Operating system and functions, Classification of Operating systems: Batch,
Interactive, Time sharing, Real Time System, Multiprocessor Systems, Multiuser
Systems, Multithreaded Systems, Operating System Structure, System 7
Components, Operating System Services, Kernels, Monolithic and
Microkernel Systems.
Process Management
II Process Concept, Process States, Process Synchronization, Critical Section,
Mutual Exclusion, Classical Synchronization Problems, Process Scheduling, 8
Process States, Process Transitions, Scheduling Algorithms Interprocess
Communication, Threads and their management, Security
Issues.
CPU Scheduling
III Scheduling Concepts, Techniques of Scheduling, Preemptive and Non- 8
Preemptive Scheduling: First-Come-First-Serve, Shortest Request Next,
Highest Response Ration Next, Round Robin, Least Complete Next,
Shortest Time to Go, Long, Medium, Short Scheduling, Priority Scheduling.
Deadlock: System model, Deadlock characterization,
Prevention, Avoidance and detection, Recovery from deadlock.
Memory Management
IV
Memory allocation, Relocation, Protection, Sharing, Paging, 7
Segmentation, Virtual Memory, Demand Paging, Page
Replacement Algorithms, Thrashing.
I/O Management and Disk Scheduling & File System:
I/O devices, and I/O subsystems, I/O buffering, Disk storage and disk 8
V scheduling, RAID.

File concept, File organization and access mechanism, File directories, and File
sharing, File system implementation issues, File system
protection and security.
Suggested Readings:
1. Andrew S. Tanenbaum and Herbert Bos,"Modern Operating Systems," Fourth Edition, Pearson,
2014.
2. Abraham Silberschatz, Greg Gagne, and Peter B. Galvin, "Operating System Concepts," Tenth
Edition, Wiley, 2018.
3. William Stallings, "Operating Systems: Internals and Design Principles," Seventh Edition, Prentice
Hall, 2011.
4. Dhanjay Dhamdhere, "Operating Systems," First Edition, McGraw-Hill, 2008
Milan Milankovic "Operating systems, Concepts and Design" McGraw Hill

Semester: First
Programme/Class: BCA Year: First
Course Code: BCA-151 Course Title: OS & C-Programming Lab
Course outcomes:
By the end of this course, students should be able to:
1. Understand the basic programming concepts and syntax of the C language.
2. Design and implement algorithms to solve simple programming problems.
3. Write, compile, and execute C programs using integrated development environments (IDEs).

Credits: 4 Major

Max. Marks: 25+75 Min. Passing Marks:40

Total No. of Lectures-Tutorials-Practical (in hours per week): 0-0-4

OS Lab

1. Detailed study of Window operating system

2. Detailed study of DOS
3. Perform all the operations in Window
4. Perform all the operations in DOS

Programming Lab

1. Write a C Program to read radius of a circle and to find area and circumference.
2. Write a C Program to read three numbers and find the biggest of three.
3. Write a C Program to check for prime.
4. Write a C Program to generate n primes.
5. Write a C Program to read a number, find the sum of the digits, reverse the number and check it for
palindrome.
6. Write a C Program to read percentage of marks and to display appropriate message (Demonstration of
else-if ladder)
7. Write a C program to read marks scored by n students and find the average of marks (Demonstration of
single dimensional array)
8. Write a C Program to remove Duplicate Element in a single dimensional Array.
9. Program to perform addition, subtraction and multiplication of Matrices.
10. Program to perform transpose of two dimensional Matrices.
11. Write a C Program to find the length of a string .
12. Write a C Program to demonstrate string functions.
13. Write a C Program to demonstrate pointers in C.
14. Write a C Program to read, display and to find the trace of a square matrix .
15. Write a C Program to read, display and multiply two matrices using functions .
16. Write a C Program to read a string and to find the number of alphabets, digits, vowels, consonants,
spaces and special characters.
17. Write a C Program to Reverse a String using Pointer.
18. Write a C Program to Swap Two Numbers using Pointers
19. Write a C Program to demonstrate student structure to read & display records of n students.
20. Write a C Program to demonstrate structure.
 Semester: Second
Programme/Class: Certificate Year: First
Subject/Stream: Computer Application
Course Code: BCA-201 Course Title: Object Oriented Programming with C++
Course outcomes: By the end of this course, students should be able to:
1. Understand the fundamental concepts of object-oriented programming.
2. Design and implement C++ programs using classes, objects, and inheritance.
3. Apply polymorphism and templates to develop reusable code.
Utilize advanced features of C++ to develop efficient and modular programs.

Credits: 4 MAJOR COURSE

Max. Marks: 25+75 Min. Passing Marks:40

Total No. of Lectures-Tutorials-Practical (in hours per week): 4-0-0
No. of
Unit Topic Lectures
Introduction to Object-Oriented Programming (OOP)
I 10
OOP concepts: Abstraction, Encapsulation, Inheritance, Polymorphism,
Procedural Vs. Object Oriented Programming, Principles of OOP and their
benefits.

C++ Programming Basics

II Program structure and basic syntax in C++, Namespaces, Identifiers, Variables, 10
Constants, Enums, Operators and typecasting in C++.

Classes and Objects

10
III Classes and Objects in C++, Access specifiers: Public, Private, Protected,
Constructors and Destructors in classes.

Inheritance and Polymorphism

IV
Concept of Inheritance and its types, Polymorphism and function overloading, 10
Virtual functions and abstract classes.

Exception Handling and File I/O

10
Introduction to exception handling, try-catch blocks, Exception propagation,
V File input and output operations in C++.

Semester: Second
Programme/Class: Degree Year: First
Subject: Computer Science
Course Code: BCA-251 Course Title: Computer Lab using C++ & Computer Graphics Lab
 Course outcomes:
1: Describe the procedural and object oriented paradigm with concepts of streams, classes, functions, data and
objects.
2: Develop solutions for a range of problems using objects and classes.
3: Programs to demonstrate the implementation of constructors, destructors and operator overloading.
4: Apply fundamental algorithmic problems including type casting, inheritance, and polymorphism.
5: Understand generic programming, templates, file handling.

Credits: 4 MAJOR COURSE

Max. Marks: 25+75 Min. Passing Marks: 40

Total No. of Lectures-Tutorials-Practical (in hours per week): 0-0-4
List of Practical:
1. Write a C++ program to find the sum of individual digits of a positive integer.
2. A Fibonacci sequence is defined as follows: the first and second terms in the sequence are 0 and 1. Subsequent
terms are found by adding the preceding two terms in the sequence. Write a C++ program to generate the first n
terms of the sequence.
3. Write a C++program to generate all the prime numbers between 1 and n , where n is a
value supplied by the user.
4. Write a C++program to find the factorial of a given integer
5. Write a C++program to find the GCD of two given integers
6. Write a C++program to implement call by value and call by reference parameters passing
7. Write a C++ program to implement function templates
8. Write a program to implement Overloading and Overriding
9. Write C++programs that illustrate how the Single inheritance, Multiple inheritance
10. Multi level inheritance and Hierarchical inheritance forms of inheritance are
supported
11. Write a C++program that illustrates the order of execution of constructors and
destructors when new class is derived from more than one base class
List of CG practical
1. Program to create simple geometric objects.
2. Program to implement the DDA technique to draw line.
3. Program to implement the Bresenham’s technique to draw line.
4. Program to implement the DDA technique to draw Circle.
5. Program to implement the midpoint circle algorithm.
6. Program to implement 2 Dimensional basic transformations.
7. Program to implement various attributes of Graphics primitives.
8. Program to implement animation.
9. Implement blinking of eyes using Graphics
10. Draw a circle.

Semester: Second
Programme/Class: Certificate Year: First
Subject: Computer Application
Course Code: BCA-202 Course Title: Computer Graphics
Course outcomes:
CO 1: Understand the basics of computer graphics, different graphics systems and applications of computer
graphics.
CO 2: Discuss various algorithms for scan conversion and filling of basic objects and their comparative analysis..
CO 3: Use of geometric transformations on graphics objects and their application in composite form.
CO 4: Extract scene with different clipping methods and its transformation to graphics display device.
CO 5: Explore projections and visible surface detection techniques for display of 3D scene on 2D screen.
CO 6: Render projected objects to naturalize the scene in 2D view and use of illumination models for this.

Credits: 4 MAJOR COURSE

Max. Marks: 25+75 Min. Passing Marks: 40%

Total No. of Lectures-Tutorials-Practical (in hours per week): 4-0-0

No. of
Unit Topic Lectures
Introduction: Interactive Computer Graphics, Advantages of Interactive
Graphics, Representative Uses of Computer Graphics, Conceptual 08
I
Framework for Interactive Graphics, Classification of Application
Development of Hardware and software for computer Graphics.
Scan Conversion: Scan Converting Lines, Scan Converting Circles, Scan
II Converting Ellipses. Clipping: point clipping, Cohen-Sutherland line 12
clipping Algorithm, Midpoint Subdivision Algorithm, polygon clipping
(Sutherland-Hodgeman)
Geometrical Transformation: 2D Transformation (translation,
rotation, scaling, reflection and shearing), Homogeneous Coordinates 10
III and Matrix Representation of 2D Transformations, Successive and
composite 2D Transformations, the Window-to-Viewport
Transformations, Introduction to 3D Transformations Matrix.
Curves & Surfaces: Polygon Surfaces and polygon meshes, Quadratic
VI and super quadrics surfaces, Spline curve and representation. 10

Computer Animation: introduction, Application of animation,

Morphing, Keyframe system, Motion specifications in Animation, 10
V Types of animation, Sequencing of Animation Design and
Fundamental principles of animation.

Suggested Readings:
1. Foley, Van Dam, Feiner, Hughes, Computer Graphics Principles& practice,2000.
2. D.J. Gibbs & D.C. Tsichritzs: Multimedia programming Object Environment& Frame work, 2000
3. Ralf Skinmeiz and Klana Naharstedt, Multimedia: computing, Communication and Applications,
Pearson, 2001 4. D. Haran & Baker. Computer Graphics Prentice Hall of India,1986.
Syllabus for BCA : Subject: Computer
Application
 Semester: Third
Programme/Class: Degree Year: Second
Subject: Computer Application
Course Code: BCA-301 Course Title: Data Structure using C
Course outcomes: By the end of this course, students should be able to:
1. To impart the basic concepts of data structures and algorithms
2.To understand concepts about searching and sorting techniques
3.To Understand basic concepts about stacks , queues , lists , trees and graphs
4. To understanding about writing algorithms and step by step approach in solving problems with the help
of fundamental data structures

Credits: 4 MAJOR COURSE

Max. Marks: 25+75 Min. Passing Marks:40

Total No. of Lectures-Tutorials-Practical (in hours per week): 4-0-0

No. of
Unit Topic Lectures
C-Language Programming
I Data types, I/O functions, Logical Operators, Control structures 10
of C, Conditional Statements, Switch Statement, Arrays.

Pointers, Functions, Recursion, Structures & Unions, Operations on 08

II bits, File Handling & C Preprocessor.

Introduction to Algorithm Design and Data Structure : Design &

analysis of algorithm, Topdown and Bottom-up approaches to algorithm 12
III
design, Analysis of algorithm, Frequency count, Complexity measures in
terms of time and space.
Arrays; Stacks and Queues : Representation of array (single &
IV multi dimensional arrays), Address alculation using column & row 10
major ordering, representation of stacks & Queues using arrays
and their operations, circular queues, Applications of arrays, stacks
& queues, conversions from Infix to postfix & prefix and
evolution of prefix expressions using stack.Linked list: Singly linked list
(Operations on list), Linked stacks and queues, polynomial
representation and manipulation using linked list.
Trees : Logical level of binary search tree, BST transversal methods
(Preorder, Postorder and Inorder), Recursive and non-recursive 10
V algorithms for traverse method, Insertion into and deletion from a
BST and their implementation, preorder and Postorder, traversal,
Insertion in Threaded tree, B-tree (Insertion and Deletion
algorithms).Searching and Sorting: Sequential and binary searches,
Indexed search, Hashing schemes, Sorting methods (Insertion,
Selection, Bubble, Quick, Merge and Heap Sorts).
Suggested Readings:
1. Data Structures and Algorithms, 2008, G. A. V. Pai, TMH
2. Classic Data Structures, 2/ e, Debasis , Sarnanta,PHI,2009
3.Fundamentals of Data Structure in C, 2le,' Horowitz, Sahni, Anderson Freed, University Prees

Semester: Third
Programme/Class: Degree Year: Second
Subject: Computer Application
Course Code: BCA-351 Course Title: Data Structure Lab
Course outcomes:
1 : Analyze algorithms and algorithm correctness
2: summarize searching and sorting techniques
3: Describe stack, queue and linked list operation
4: Ability to have knowledge of tree and graphs concepts
5 To develop application using data structures

Credits: 4 MAJOR COURSE

Max. Marks: 25+75 Min. Passing Marks:40

Total No. of Lectures-Tutorials-Practical (in hours per week): 0-0-4
List of Practical
1. Write Programs to implement the Stack operations using an array.
2. Write Programs to implement the Queue operations using an array.
3. Write Programs to implement the Stack operations using Pointers.
4. Write Programs to implement the Queue operations using Pointers.
5. Write a program for arithmetic expression evaluation.
6. Write a program for Binary search Tree Traversals
7. Write a program to implement dequeue using a doubly linked list.
8. Write a program to search an item in a given list using (i) Linear Search (ii) Binary Search.
9. Write a program for (i)Bubble Sort (ii) Quick Sort (iii)Merge Sort.
10. Write a program for polynomial addition using SLL
 Semester: Third
Programme/Class: BCA Year: Second
Course Code: BCA-302 Course Title: Computer Network
Course outcomes:
By the end of this course, students should be able to:
1. Understand the fundamentals of data communication and networking concepts.
2. Analyze and design network architectures and topologies.
3. Configure and troubleshoot network devices and protocols.
4. Apply network security measures to protect data transmission.
5. Understand emerging trends and technologies in data communication and networks.

Credits: 4 Minor

Max. Marks: 25+75 Min. Passing Marks:40

Total No. of Lectures-Tutorials-Practical (in hours per week): 4-0-0

No. of
Unit Topic Lectures
: Introduction to Data Communication & Networks
I Components of a data communication system, Types of networks, Network
topologies and communication protocols.

Network Architecture and OSI Model

II Network architecture: client-server, peer-to-peer, OSI model layers and their
functions, TCP/IP protocol suite.

Data Link Layer and Network Devices

III Data link layer: framing, error detection, flow control, Network devices: switches,
routers, bridges, etc., MAC addressing and Ethernet standards.

Network Management and Emerging Technologies

IV
Network management and monitoring tools, Cloud computing and
virtualization, Internet of Things (IoT).

Suggested Books:
1. "Computer Networking: A Top-Down Approach" by James F. Kurose and Keith W. Ross.
2. "Data Communications and Networking" by Behrouz A.Forouzan and Sophia Chung Fegan
 Semester: Fourth
Programme/Class: Degree Year: Second
Subject: Computer Application
Course Code: BCA-401 Course Title: Database Management System

Course outcomes: By the end of this course, students should be able to:
1. Understands the basic concepts of data base management systems.
2. Design E-R diagrams for real world applications.
3. Formulate relational algebraic expressions using relational data models and languages.
4. Apply normalization transaction properties and concurrency control to design database.
5. Analyze the security algorithms for database protection.

Credits: 4 MAJOR COURSE

Max. Marks: 25+75 Min. Passing Marks:40

Total No. of Lectures-Tutorials-Practical (in hours per week): 4-0-0
No. of
Unit Topic Lectures
Overview of Database Management System
I Elements of Database System, DBMS and its architecture, Advantage of DBMS
(including Data independence), Types of database users, Role of Database 10
administrator.

Data Models
II Brief overview of Hierarchical and Network Model, Detailed study of Relational
Model (Relations, Properties, Key & Integrity rules), Comparison of 12
Hierarchical, Network and Relational Model ,CODD’s rules for Relational
Model,E-R diagram.
Normalization 12
III Normalization concepts and update anomalies ,Functional
dependencies,Multivalued and join dependencies.
Normal Forms: (1 NF, 2 NF, 3NF, BCNF, 4NF, and 5NF)
SQL
IV
SQL Constructs, SQL Join: Multiple Table Queries, Build-in functions, Views and 14
their use, Overviews of ORACLE: (Data definition and manipulation)
Database Security, Integrity and Control 10
V
Security and Integrity threats, Defense mechanism, Integrity, Auditing and
Control, Recent trends in DBMS- Distributed and Deductive Database.
Suggested Readings:
1. Henry F. Korth and Abraham Silberschatz, "Database System Concepts," Second Edition, McGraw
Hill, 1991.
2. AtulKahate, "Introduction to Database Management Systems," Pearson India, 2004.
3. Raghu Ramakrishnan and Johannes Gehrike, "Database Management Systems," Third McGraw
 Hill, Edition, 2003.
4. R. Elmasri, S.B. Navathe Database Systems Models, Languages, Design and application
Programming, 6 Edition, Pearson Education,2013.
th
5. A. Silberschatz, H.F. Korth, S. Sudarshan, Database System Concepts 6 Edition, McGraw
Hill, 2010. C.J Date " An Introduction to Database Systems", Addison Wesley

Semester: Fourth
Programme/Class: Degree Year: Second
Subject: Computer Application
Course Code: BCA-451 Course Title: DBMS Lab & Web Designing
Course outcomes:
Use an SQL interface of a multi-user relational DBMS package to create, secure, populate, maintain, and query a
database. Use a desktop database package to create, populate, maintain, and query a database. Demonstrate a
rudimentary understanding of programmatic interfaces to a database and be able to use the basic functions of
one such interface

Credits: 4 MAJOR COURSE

Max. Marks: 25+75 Min. Passing Marks: 40

Total No. of Lectures-Tutorials-Practical (in hours per week): 0-0-4
List of Practicals

1. The Order Tracking Database consists of the following defined six relation schemas.
Employees(eno,ename,zip,hdate)
Parts(pno,pname,qoh,price,level) (hint: qoh: quality on hand)
Customers(cno,cname,street,zip,phone)
Orders(ono,cno,eno,received date,shipped date)
Odetails(ono,pno,qty)
Zipcodes(zip,city)
Solve the following queries

2. Get all pairs of customer numbers for customers based on same zip code.
3. Get part numbers for parts that have been ordered by at least two different customers.
4. For each odetail row, get ono,pno,pname,qty and price values along with the total price for the item. (total
price=price*qty)
5. Get customer name and employee pairs such that the customer with name has placed an order through the
employee
6. Get customer names living in fort dodge or liberal.
7. Get cname values of customers who have ordered a product with pno 10506.
8. Get pname values of parts with the lowest price.
List of Web designing practicals
1.Write a HTML program to create a webpage about the different art forms of India, with
appropriate title on the title bar. Use different heading tags for the headings, and list them using
ordered list.
2. Write a HTML program to create sections in the document using appropriate tags and apply
different color as background to them. Use internal hyperlinks to move to different points within the
page.
3. Write a HTML program to insert a picture on the webpage, giving description for the picture in a
paragraph. Use properties of height, width, hspace, vspace and align, with different values.
4. Write a HTML Program, to create a profile of 2 pages, the First page containing the applicant’s
picture with personal details using unordered lists, and the second containing Educational details
using tables. Use hyperlinks to move to the next page.
5. Using Frames create an Indian Flag and insert the image of chakra in the center.
6. Create a frame like structure based on the given diagram, such that When the first link is clicked,
the contents of the first frame is filled with the corresponding information and when the second link
is clicked the second frame is filled.
7. Write a program using Javascript to do the multiplication table for a number entered by the user
in the textbox.
8. Create a sparse array using the values entered by the user in the five textboxes, and use Array
methods such as sort(),pop(),push(), reverse() and join().
9. Create a Math object and use methods ceil(),floor(), round() for rounding off the number, also use
methods such as cos(), sin(),sqrt().
10. Write a Program using Javascript to print a bill for 5 items purchased by the user.

Semester: Fourth
Programme/Class: Degree Year: Second
 Subject: Computer Application
Course Code: BCA-402 Course Title: Web designing using Scripting Language

Course outcomes: By the end of this course, students should be able to:
6. Ability to Develop and publish Web pages using Hypertext Markup Language (HTML). Ability to
optimize page styles and layout with Cascading Style Sheets (CSS)
7. Ability to Understand, analyze and apply the role of languages to create a capstone
8. Website using client-side web programming languages like HTML, DHTML, CSS, XML,
9. 4 JavaScript, and AJAX.
Credits: 4 MAJOR COURSE

Max. Marks: 25+75 Min. Passing Marks:40

Total No. of Lectures-Tutorials-Practical (in hours per week): 4-0-0
No. of
Unit Topic Lectures
HTML: HTML-Introduction-tag basics- page structure-adding comments
I working with texts, paragraphs and line break. Emphasizing test- heading and
horizontal rules-list-font size, face and color-alignment links-tables-frames 7

Forms & Images Using Html: Graphics: Introduction-How to work efficiently

II with images in web pages, image maps, GIF animation, adding multimedia,
data collection with html forms textbox, password, list box, combo box, text 7
area, tools for building web page front page.
XML & DHTML: Cascading style sheet (CSS)-what is CSS-Why we use CSS- 7
III adding CSS to your web pages-Grouping styles-extensible markup language
(XML). Dynamic HTML: Document object model (DCOM)-Accessing HTML & CSS
through DCOM Dynamic content styles & positioning-Event bubbling-data
binding.
JavaScript : Client side scripting, What is JavaScript, How to develop JavaScript,
IV
simple JavaScript, variables, functions, conditions, loops and repetition, 7
Advance script, JavaScript and objects, JavaScript own objects, the DOM and
web browser environments, forms and validations
Ajax: Introduction, advantages &disadvantages, Purpose of it, ajax based web 7
V
application, alternatives of ajax Java Script & AJAX: Introduction to array-
operators, making statements-date & time-mathematics strings-Event
handling-form properties. AJAX. Introduction to jQuery and AngularJS.
Suggested Readings:
1. Pankaj Sharma, “Web Technology”, Sk Kataria & Sons Bangalore 2011.(UNIT I, II, III & IV).
2. Mike Mcgrath, “Java Script”, Dream Tech Press 2006, 1st Edition. (UNIT V: JAVASCRIPT)
3. Achyut S Godbole & Atul Kahate, “Web Technologies”, 2002, 2nd Edition. (UNIT V: AJAX)
 Semester: Fourth
Programme/Class: Degree Year: Second
Subject: Computer Application
Course Code: BCA-403 Course Title: Web designing using Scripting Language

Course outcomes:
By the end of this course, students should be able to:
1. Understand the fundamental concepts of management information systems.
2. Analyze business requirements and design effective information systems.
3. Evaluate and select appropriate technologies for information system implementation.
4. Apply information systems principles to support business operations and decision-making.
5. Understand the ethical and security considerations in managing information systems.

Credits: 6 Minor

Max. Marks: 30+70 Min. Passing Marks:40

Total No. of Lectures-Tutorials-Practical (in hours per week): 6-0-0

No. of
Unit Topic Lectures
Introduction to Management Information System
I 6
Definition and scope of Management Information System (MIS), Components
and characteristics of MIS, Role of MIS in decision-making, Types of
Information Systems: TPS, DSS, EIS, ERP, etc
Information Technology and Business Processes
II Business processes and their analysis, Business process reengineering and 7
automation, Information Technology infrastructure for MIS.

Database and Data Management

8
III Database concepts and design, Data modeling and normalization, Data
storage, retrieval, and security
Decision Support Systems and Business Intelligence
IV 6
Introduction to Decision Support Systems (DSS), Data Warehousing and Data
Mining, Business Intelligence tools and analytics.

Recommended Books:
1. "Management Information Systems: Managing the Digital Firm" by Kenneth C. Laudon and Jane
P. Laudon.
2. "Information Systems Today: Managing in the Digital World" by Joseph Valacich, Christoph
Schneider, and Robert M. Pearlson.
 Syllabus for BCA.: Subject: Computer
Application

Semester: Fifth
Programme/Class: Degree Year: Third
Subject: Computer Application
Course Code: BCA-501 Course Title: Design and Analysis of Algorithms
Course outcomes:
CO 1: Ability to analyze the performance of algorithms in terms of their time and space complexities.
CO 2: Reinforce basic design concepts (e.g., pseudocode, specifications, top-down design).
CO 3: To understand the different algorithm designing technique for solving problems.
CO 4: Assess how the choice of data structures and algorithm design methods impacts the performance of
programs.
CO 5: Solve problems using algorithm design strategies like the greedy method, divide and conquer, dynamic
programming, backtracking, and branch and bound etc.

Credits: 4 MAJOR COURSE

Max. Marks: 25+75 Min. Passing Marks: 40%

Total No. of Lectures-Tutorials-Practical (in hours per week): 4-0-0

No. of
Unit Topic Lectures
Introduction: Algorithm Specification-Simple example of design and
analysis of time complexity-Performance Analysis: Space Complexity 11
I
and Time complexity, Asymptotic Notation - Polynomial Vs Exponential
Algorithm
Divide and Conquer algorithm: Introduction to Divide and Conquer
II Algorithms - Master Theorem – Sorting - Insertion Sort, Merge Sort 13
using links, Quick Sort- Analysis of linear and binary search algorithm.
Horner's method of evaluation a polynomial at a given point, Strassen’s
Matrix Multiplication.
Dynamic programming: Design and analysis, Computing a Binomial
Coefficient, Multistage graphs, Traveling salesman problem. Greedy 13
III approach: General method, Dijkstra’s Algorithm, Knapsack problem,
Minimum cost Spanning trees, Single source shortest path problem.

Back tracking: General method - Sum of subsets - 4-Queen Problem

VI using backtracking. Branch and Bound method- 4-queens - Least Cost 12
Search, Traveling Salesman problem using Branch and Bound
method.

Limitations of Algorithm- Introduction to lower bound theory,

Decision trees, Introduction to P, NP and NP complete problems, NP 11
V hard problems.
Suggested Readings:
REFERENCES:
1. Ellis Horowitz, Sartaj Sahni SanguthevarRajasekaran. Fundamentals of Computer Algorithms. Universities
Press (India) Private Limited. Second edition.
2. AnanyLevitin. Introduction to the design and Analysis of Algorithms. Dorling Kindersley (India) Pvt.Ltd. Second
edition
3. Gav PAI, Data Structures and Algorithms, Tata McGraw Hill, Jan 2008.
4. Donald E. Knuth. The art of Computer Programming,Volume 1: Fundamental Algorithms.Addison Wesley.
 Syllabus for BCA.: Subject: Computer
Application

Semester: Fifth
Programme/Class: Degree Year: Third
Subject: Computer Application
Course Code: BCA-502 Course Title: Data Mining & Data Warehousing
Course outcomes:
CO 1: Demonstrate knowledge of Data Warehouse and its components.
CO 2: Discuss the process of Warehouse Planning and Implementation.
CO 3: Discuss and implement various supervised and non-supervised learning algorithms on data.
CO 4: Explain the various process of Data Mining and decide best according to type of data.
CO 5: Explain process of knowledge discovery in database (KDD). Design Datan Mining model.

Credits: 4 MAJOR COURSE

Max. Marks: 25+75 Min. Passing Marks: 40%

Total No. of Lectures-Tutorials-Practical (in hours per week): 4-0-0

No. of
Unit Topic Lectures
Data Warehousing: Overview, Definition, Data Warehousing
Components, building a Data Warehouse, Warehouse Database, Mapping 08
I
the Data Warehouse to a Multiprocessor Architecture, Difference
between Database System and Data Warehouse, Multi-Dimensional Data
Model, Data Cubes, Stars, Snow Flakes, Fact Constellations, Concept.

Data Warehouse Process and Technology: Warehousing Strategy,

II Warehouse /management and Support Processes, Warehouse Planning 12
and Implementation, Hardware and Operating Systems for Data
Warehousing, Client/Server Computing Model & Data Warehousing.
Parallel Processors & Cluster Systems, Distributed DBMS
implementations, Warehousing Software, Warehouse Schema Design
Data Mining: Overview, Motivation, Definition & Functionalities,
Data Processing, Form of Data Pre-processing, Data Cleaning: 10
III Missing Values, Noisy Data, (Binning, Clustering, Regression,
Computer and Human inspection), Inconsistent Data, Data
Integration and Transformation. Data Reduction: -Data Cube
Aggregation, Dimensionality reduction, Data Compression,
Numerosity Reduction, Discretization and Concept hierarchy
generation, Decision Tree
Classification: Definition, Data Generalization, Analytical
VI Characterization, Analysis of attribute relevance, Mining Class 10
 comparisons, Statistical measures in large Databases, Statistical-Based
Algorithms, Distance-Based Algorithms, Decision Tree-Based
Algorithms.

Clustering: Introduction, Similarity and Distance Measures,

Hierarchical and Partitional Algorithms. Hierarchical Clustering- CURE
and Chameleon. Density Based Methods DBSCAN, OPTICS. Grid Based
Methods- STING, CLIQUE. Model Based Method – Statistical Approach,
Association rules: Introduction, Large Item sets, Basic Algorithms,
Parallel and Distributed Algorithms, Neural Network approach.
Data Visualization and Overall Perspective: Aggregation, Historical
information, Query Facility, OLAP function and Tools. OLAP Servers, 10
V ROLAP, MOLAP, HOLAP, Data Mininginter face, Security, Backup and
Recovery, Tuning Data Warehouse, Testing Data Warehouse.
Warehousing applications and Recent Trends: Types of Warehousing
Applications, Web Mining, Spatial Mining and Temporal Mining

Suggested Readings:
Text Book:
1. Alex Berson, Stephen J. Smith “Data Warehousing, Data-Mining & OLAP”,TMH.
2. Mark Humphries, Michael W. Hawkins, Michelle C. Dy, “Data Warehousing: Architecture and
Implementation”, Pearson.
3. I.Singh, “Data Mining and Warehousing”, Khanna Publishing House.

Referential Books:
1. Margaret H. Dunham, S. Sridhar,” Data Mining: Introductory and Advanced Topics” Pearson Education 5. Arun
K. Pujari, “Data Mining Techniques” Universities Press.
2. Pieter Adriaans, Dolf Zantinge, “Data-Mining”, Pearson Education
 Syllabus for BCA.: Subject: Computer
Application

Semester: Fifth
Programme/Class: Degree Year: Third
Subject: Computer Application
Course Code: BCA-503 Course Title: Fundamentals of IOT
Course outcomes: By the end of this course, students should be able to:
1. Demonstrate basic concepts, principles and challenges in IoT.
2. Illustrate functioning of hardware devices and sensors used for IoT.
3. Analyze network communication aspects and protocols used in IoT.
4. Apply IoT for developing real life applications using Ardunio programming.
5. To develop IoT infrastructure for popular applications.

Credits: 4 MAJOR COURSE

Max. Marks: 25+75 Min. Passing Marks:40%

Total No. of Lectures-Tutorials-Practical (in hours per week): 4-0-0

No. of
Unit Topic Lectures
Introduction: IOT - What is the IoT and why is it important? Elements of an
I IoT ecosystem, Technology drivers, Business drivers, Trends and implications,
Overview of Governance, Privacy and Security Issues
IOT PROTOCOLS - Protocol Standardization for IoT – Efforts – M2M and WSN
Protocols – SCADA and RFID Protocols – Issues with IoT Standardization – 15
Unified Data Standards – Protocols – IEEE802.15.4–BACNet Protocol– Modbus
– KNX – Zigbee– Network layer – APS layer – Security
IOT ARCHITECTURE - IoT Open source architecture (OIC)- OIC Architecture &
II Design principles- IoT Devices and deployment models- IoTivity : An Open
source IoT stack - Overview- IoTivity stack architecture- Resource model and
15
Abstraction.
WEB OF THINGS - Web of Things versus Internet of Things – Two Pillars of
the Web – Architecture StandardizationforWoT– Platform Middleware for 15
WoT – Unified Multitier WoT Architecture – WoT Portals and Business
III
Intelligence.
 IOT APPLICATIONS - IoT applications for industry: Future Factory Concepts,
VI Brownfield IoT, Smart Objects, Smart Applications. Study of existing IoT 15
platforms /middleware, IoT- A, Hydra etc.

Introduction: IOT - What is the IoT and why is it important? Elements of an

IoT ecosystem, Technology drivers, Business drivers, Trends and implications,
Overview of Governance, Privacy and Security Issues
V
IOT PROTOCOLS - Protocol Standardization for IoT – Efforts – M2M and WSN
Protocols – SCADA and RFID Protocols – Issues with IoT Standardization – 15
Unified Data Standards – Protocols – IEEE802.15.4–BACNet Protocol– Modbus
– KNX – Zigbee– Network layer – APS layer – Security

Suggested Readings:
REFERENCES:
1. 1 Honbo Zhou, “The Internet of Things in the Cloud: A Middleware Perspective”, CRC Press,2012.
2. Dieter Uckelmann, Mark Harrison, Michahelles, Florian (Eds), “Architecting the Internet ofThings”,
Springer, 2011
3. 3. David Easley and Jon Kleinberg, “Networks, Crowds, and Markets: Reasoning About a HighlyConnected
World”, Cambridge University Press, 2010.
4. 4. Olivier Hersent, David Boswarthick, Omar Elloumi , “The Internet of Things – Key applicationsand
Protocols”, Wiley, 2012.
 Syllabus for BCA.: Subject: Computer
Application

Semester: Fifth
Programme/Class: Degree Year: Third
Subject: Computer Application
Course Code: BCA-551 Course Title: Algorithm Lab
Course outcomes:
1. Students will be able to calculate the time complexity of algorithm.
2. Students will be able to sort the given numbers using various sorting algorithms.
3. Students will be able to write programs for the problems using Divide and Conquer.
4. Students will be able to write programs for the problems using Greedy Method.
5. Students will be able to write programs for the problems using Dynamic programming.
6. Students will be able to write programs for the problems using Backtracking..
Credits: 4 MAJOR COURSE

Max. Marks: 25+75 Min. Passing Marks:40%

Total No. of Lectures-Tutorials-Practical (in hours per week): 0-0-4
List of Practical:
1. Write a program to perform operation count for a given pseudo code
2. Write a program to perform Bubble sort for any given list of numbers.
3. Write a program to perform Insertion sort for any given list of numbers.
4. Write a program to perform Quick Sort for the given list of integer values.
5. Write a program to find Maximum and Minimum of the given set of integer values.
6. Write a Program to perform Merge Sort on the given two lists of integer values.
7. Write a Program to perform Binary Search for a given set of integer values recursively and non-
recursively.
8. Write a program to find solution for knapsack problem using greedy method.
9. Write a program to find minimum cost spanning tree using Prim’s Algorithm.
10. Write a program to find minimum cost spanning tree using Kruskal’s Algorithm.
11. Write a program to perform Single source shortest path problem for a given graph.
12. Write a program to find solution for job sequencing with deadlines problem.
 13. Write a program for all pairs shortest path problem.
14. Write a program to solve N-QUEENS problem.
15. Write a program to solve Sum of subsets problem for a given set of distinct numbers.

Syllabus for BCA: Subject: Computer

Application

Semester: Six
Programme/Class: Degree Year: Third
Subject: Computer Application
Course Code: BCA-601 Course Title: Software Engineering
Course outcomes:
CO1: Select and implement different software development process models.
CO2: Extract and analyze software requirements specifications for different projects.
CO3: Develop some basic level of software architecture/design.
CO4: Define the basic concepts and importance of Software project management concepts like cost
Estimation, scheduling and reviewing the progress.
CO5: Apply different testing and debugging techniques and analyzing their effectiveness.

Credits: 4 MAJOR COURSE

Max. Marks: 25+75 Min. Passing Marks: 40%

Total No. of Lectures-Tutorials-Practical (in hours per week): 4-0-0

No. of
Unit Topic Lectures
Introduction: Software- Characteristics and Applications, Software
Engineering, Software Engineering Layers, Software Process Framework, CMM, 10
I
Software Quality Attribute and Metrics, Software Development Life Cycle,
Software Process Models Water Fall Model, Prototyping Model, RAD Model,
Spiral Model, Evolutionary Models, Component-based Development Model.
Software Requirements Engineering and Analysis Modeling: Software
II Requirements, Requirement Engineering Process, Elicitation Requirements, 10
Analysis and Negotiating Requirements, Requirement Specification, System
Modeling, Requirements Validation, Requirement Management, Creating a
Software Requirements Specification Document, IEEE Standards for SRS,
Feasibility Study, Elements of Analysis Model, Data Modeling- ER Diagram,
Information Modeling- DFD, Behavioral Modeling, Control Specification,
Process Specification, Data Dictionary, Software Quality Framework, Quality
 Metrics for Analysis Model.
Software Design and Implementation: Design Process, Principles, and
Design Concepts-Abstraction, Architecture, Refinement, Modularity, Data 10
III Structure, Information Hiding, Functional Independence, Cohesion,
Coupling; Design Documentation, Design Strategies-Top Down and Bottom
Up Design; Design Model Data Design Elements, Architectural Design, User
Interface Design, Component-Level Design, Deployment-Level Design,
Implementation Issues and Programming Support Environment, Quality
Metrics for Design Model and Source Code
Software Testing: Verification, Validation, Testing Objectives, Unit Testing,
VI Integration Testing, Validation Testing, System Testing, Acceptance Testing, 10
Regression Testing, Test Characteristics, White Box Testing, Basic Path
Testing, Control Structure Testing, Black Box Testing, Test Plan, Test Case
Design, Quality Metrics for Testing.
Software Maintenance: Nature and Need of Maintenance, Types of
Maintenance (Perceptive, Preventive, Adoptive, Corrective), Cost of 10
V Maintenance, Evolution of Software, Software Maintenance Process,
Software Maintenance Techniques Reverse Engineering, Reengineering;
Factors affecting Software Maintenance, Key Issues in Maintenance,
Software Configuration Management, Version and Release Control, Change
Control, Configuration Audit, Metrics for Maintenance

Suggested Readings:
Text Books:
1. Roger S. Pressman, “Software Engineering: A Practitioner's Approach”, Addison Wesley
2. Pankaj Jalote, “An Integrated Approach to Software Engineering”, Springer

Reference:
1. K. K. Aggarwal & Yogesh Singh “Software Engineering”, New Age International.
2. I. Sommerville, “Software Engineering”, Pearson Education.
3. James Peter, W. Pedrycz, “Software Engineering: An Engineering Approach”, John Wiley & Sons.
4. Subramanian Chandramouli, Saikat Dutt, ChandramouliSeetharaman, B. G Geetha, “Software Engineering”,
Pearson Education India

Semester: Six
Programme/Class: Degree Year: Third
Subject: Computer Application
Course Code: BCA-602 Course Title: .Net Framework with VB.net
Course outcomes:
CO 1: Explain the core concepts of the CLR , CLS , .NET features.
CO 2: Apply the fundamental concepts in .NET programing
CO 3: Apply the fundamental concepts of conditional statement in .NET programing
CO 4: Apply the fundamental concepts of in ASP.NET and ADO.NET programing
CO 5: Apply the fundamental concepts of SQL connectivity.

Credits: 4 MAJOR COURSE

Max. Marks: 25+75 Min. Passing Marks:40

Total No. of Lectures-Tutorials-Practical (in hours per week): 4-0-0

No. of
Unit Topic Lectures
Introduction to .net framework -Features, Common Language
I Runtime (CLR), Framework Class Library(FCL). Common Language 10
Specification (CLS), Common Type System (CTS), Intermediate
Language (IL) and Just-In-Time (JIT) Compilation, Visual
Studio.Net – IDE, Languages Supported, Components. VB.Net
Features, IDE- Menu System, Toolbars, Code Designer, Solution
Explorer, Object Browser, Toolbox, Class View Window,
Properties Window, Server Explorer, Task List, Output Window,
Command Window.
VB.Net Creating Applications with Visual Basic.NET, Variables, Constants,
II and Calculations, Making Decisions and Working with Strings, Lists, Loops, 10
Validation, Sub Procedures and Functions, Multiple Forms, Standard
Modules, and Menus, Arrays, Timers, Form Controls, File Handling,
Exception Handling, Working with Databases, Advanced Database
Programming using ADO.net, Classes, Generics, Collections, Inheritance,
Custom Controls, Packaging & deployment, Using Crystal Reports.
Programming in Visual basic: .Net Data Types, Keywords, Declaring
Variables and Constants, Operators, Understanding Scope and 10
III
accessibility of variables, Conditional Statements- If- Then, If-Then-Else,
Nested If, Select Case, Looping Statement- Do loop, For Loop, For Each-
Next Loop, While Loop, Arrays-Static and Dynamic. - Creating MDI
Parent and Child, Functions and Procedures- Built-In Functions-
Mathematical and String Functions, User Defined Functions and
Procedures.
ASP.NET Building :a Web Application, Examples Using Standard
IV Controls, Using HTML Controls, Validating Form Input Controls using 10
Validation Controls, Understanding Applications and State, Applying
Styles, Themes, and Skins, Creating a Layout Using Master Pages,
Binding to Databases using Controls, Data Management with ADO.net,
Creating a Site Navigation Hierarchy, Navigation Controls , Membership
and Role Management, Login Controls, Securing Applicatio
 Databases: Introduction, Using SQL to work with database, retrieving
and manipulating data with SQL, working with ADO.NET, ADO.NET 10
V architecture, ASP.NET data control, data source control, deploying
the web site. Crystal reports. LINQ: Operators, implementations,
LINQ to objects, XML, ADO.NET, Query Syntax. Stored Procedures

Suggested Readings:
Text Books:
1. Visual Basic.Net Black Book by Steven Holzner Dreamtech Press
2. The Complete Reference Visual Basic .NET Jeffery R. Shapiro Tata McGraw Hills

Reference Books:
1. Visual studio 2010 - A beginners guide - Joseph Mayo
2. Murach’s Beginning Visual basic .Net By Anne Bohem
3. Programming Visual Basic .NET Dave Grundgeiger Publisher: O'Reilly First Edition January 2002

Semester: Six
Programme/Class: Degree Year: Third
Subject: Computer Application
Course Code: BCA-603 Course Title: Cloud Computing
Course outcomes:
CO 1: Explain the core concepts of the CLR , CLS , .NET features.
CO 2: Apply the fundamental concepts in .NET programing
CO 3: Apply the fundamental concepts of conditional statement in .NET programing
CO 4: Apply the fundamental concepts of in ASP.NET and ADO.NET programing
CO 5: Apply the fundamental concepts of SQL connectivity.

Credits: 4 MAJOR COURSE

Max. Marks: 25+75 Min. Passing Marks:40

Total No. of Lectures-Tutorials-Practical (in hours per week): 4-0-0

No. of
Unit Topic Lectures
Introduction: Cloud-definition, benefits, usage scenarios, History of Cloud
I Computing, Cloud Architecture, Types of Clouds, Players in Cloud Computing, 10
issues in Clouds .

Types of Cloud services, Software as a Service, Platform as a Service,

II Infrastructure as a Service, Database as a Service, Monitoring as a Service, 10
Communication as services. Service Providers- Google, Amazon, Microsoft
Azure, IBM, Sales force.
Collaborating Using Cloud Services Email Communication over the Cloud, CRM
Management, Project Management, Event Management, Task Management, 10
III
Calendar, Schedules, Word Processing, Presentation, Spreadsheet, Databases,
Desktop, Social Networks and Groupware

Virtualization for Cloud Need for Virtualization, Pros and cons of

IV Virtualization, Types of Virtualizations, System VM, Process VM, Virtual 10
Machine monitor, Virtual machine properties, HLL VM, Hypervisors, Xen,
KVM, VMWare, Virtual Box, Hyper-V

Cloud Security: Infrastructure Security- Network level security, Host

level security, Applicationlevel security, Data security, Authentication 10
V in cloud computing, Cloud security challenges.
Suggested Readings:
1. "Cloud Computing: Concepts, Technology & Architecture" by Thomas Erl, Ricardo Puttini, and Zaigham
Mahmood
2. "Cloud Computing: A Practical Approach" by Anthony T. Velte, Toby J. Velte, and Robert Elsenpeter
 Syllabus for BCA.: Subject: Computer Application

Semester: Six
Programme/Class: Degree Year: Third
Subject: Computer Application
Course Code: Course Title: VB.Net Lab & Software Engineering
Course outcomes:
1. Create Simple application using web controls
2. Work with States of ASP.NET Pages & Adrotator Control
3. Use of calendar control, Treeview control & Validation controls
4. Query textbox and Displaying records & Display records by using databa

Credits: 4 MAJOR COURSE

Max. Marks: 25+75 Min. Passing Marks:40%

Total No. of Lectures-Tutorials-Practical (in hours per week): 0-0-4
List of Practical:
1. Write a program to generate the factorial of a given number.
2. Write a program to perform money conversion.
3. Write a program to find out roots of the quadratic equation
4. Write a program to convert temperature from Fahrenheit to Celsius or vice versa.
5. Write a program to generate/develop the login control.
6. Write a program to create an Advertisement using Ad rotator.
7. Write a program to display the holiday in calendar.
8. Write a program to display the vacation in calendar.
9. Write a program to display the selected date in the calendar
10. Implement a program that display the difference between two dates.
List of S/W practical
11. Development of Problem Statements.
12. Preparation of Software Requirement Specification Document, Design Documents and
Testing Phase related documents.
13. Preparation of Software Configuration Management and Risk Management related
documents.
14. Study and usage of any Design phase CASE tool
15. Performing the Design by using any Design phase CASE tools.
16. Develop test cases for unit testing and integration testing
17. Develop test cases for various white box and black box testing techniques.
 Syllabus for BCA(Hons): Subject:
Computer Application

Semester: Fifth
Programme/Class: Degree Year: Third
Subject: Computer Application
Course Code: BCA-501-H Course Title: Software Project Management
Course outcomes:
CO1: Identify project planning objectives, along with various cost/effort estimation models.
CO2: Organize & schedule project activities to compute critical path for risk analysis
CO3: Monitor and control project activities.
CO4: Formulate testing objectives and test plan to ensure good software quality under SEI
CO5: - CMM Configure changes and manage risks using project management tools.

Credits: 4 MAJOR COURSE

Max. Marks: 25+75 Min. Passing Marks: 40%

Total No. of Lectures-Tutorials-Practical (in hours per week): 4-0-0

No. of
Unit Topic Lectures
Project Evaluation and Project Planning: Importance of Software Project
Management – Activities – Methodologies – Categorization of Software 08
I
Projects – Setting objectives – Management Principles – Management
Control – Project portfolio Management – Cost-benefit evaluation
technology – Risk evaluation–Strategic program Management – Stepwise
Project Planning.
Project Life Cycle and Effort Estimation: Software process and Process
II Models – Choice of Process models – Rapid Application development – 12
Agile methods – Dynamic System Development Method – Extreme
Programming– Managing interactive processes – Basics of Software
estimation – Effort and Cost estimation techniques–COSMIC Full function
points–COCOMOII–a Parametric Productivity Model.
Activity Planning and Risk Management: Objectives of Activity
planning – Project schedules – Activities – Sequencing and 10
III scheduling – Network Planning models – Formulating Network
Model – Forward Pass & Backward Pass techniques – Critical path
(CRM) method – Risk identification – Assessment – Risk Planning –
Risk Management – – PERT technique – Monte Carlo simulation –
Resource Allocation– Creation of Critical paths – Cost schedules.
Project Management and Control: Framework for Management and
VI control – Collection of data–Visualizing progress–Costmonitoring– 10
arned Value Analysis –Prioritizing Monitoring– Project tracking–
Change control Software.
Configuration Management – Managing contracts – Contract
Management.
 Staffing in Software Projects: Managing people – Organizational
behavior – Best methods of staff selection – Motivation – The Oldham 10
V – Hackman job characteristic model – Stress – Health and Safety –
Ethical and Professional concerns – Working in teams – Decision
making – Organizational structures – DispersedandVirtualteams–
Communicationsgenres–Communicationplans– Leadership.

Suggested Readings:
Text Book:
1. Bob Hughes, Mike Cotterell and Rajib Mall: “Software Project Management” – Fifth Edition, McGraw Hill, New
Delhi,2012.
2. Robert K. Wysocki ― “Effective Software Project Management” – Wiley Publication, 2011.
3. Walker Royce: ― “Software Project Management” - Addison-Wesley, 1998.
4. Gopalaswamy Ramesh, ― “Managing Global Software Projects” – McGraw Hill Education (India), Fourteenth
Reprint 2013.

Referential Books:
1. Koontz Harold & Weihrich Heinz, "Essentials of Management", McGraw Hill 5th Edition 2008.
2. Robbins and Coulter, "Management", Prentice Hall of India, 9th edition.
3. James A. F., Stoner, "Management", Pearson Education Delhi.
4. P. D. Chaturvedi, "Business Communication", Pearson Educatio
 Syllabus for BCA(Hons): Subject:
Computer Application

Semester: Fifth
Programme/Class: Degree Year: Third
Subject: Computer Application
Course Code: BCA-502-H Course Title: Fog Computing
Course outcomes:
CO1: Become familiar with the concepts of Fog.
CO 2: Understand the architecture and its components and working of components and its performance.
CO 3: Explore Fog on security, multimedia and smart data.
CO 4: Model the fog computing scenario.

Credits: 4 MAJOR COURSE

Max. Marks: 25+75 Min. Passing Marks: 40%

Total No. of Lectures-Tutorials-Practical (in hours per week): 4-0-0
No. of
Unit Topic Lectures
Introduction to Fog Computing: Fog Computing, Characteristics,
Application Scenarios,Issues andchallenges. Fog Computing Architecture: 12
I
Communication and Network Model, Programming Models, Fog
Architecture for smart cities, healthcare and vehicles. Fog Computing
Communication Technologies: Introduction, IEEE 802.11, 4G, 5G
standards, WPAN, Short-Range Technologies,LPWAN and other medium
and Long-Range Technologies.
Management and Orchestration of Network Slices in 5G, Fog, Edge, and
II Clouds: Introduction,Background, Network Slicing in 5G, Network Slicing 12
in Software-Defined Clouds, Network SlicingManagement in Edge and
Fog, Middleware for Fog and Edge Computing, Need for Fog and
EdgeComputing Middleware, Clusters for Lightweight Edge Clouds, IoT
Integration, Security Managementfor Edge Cloud Architectures.Fog
Computing Realization for Big Data Analytics: Introduction to Big Data
Analytics, Data Analytics inthe Fog, Prototypes and Evaluation.
Fog computing requirements when applied to IoT: Scalability,
Interoperability, Fog-IoT architecturalmodel, Challenges on IoT Stack 10
III Model via TCP/IP Architecture, Data Management, filtering,
EventManagement, Device Management, cloudification, virualization,
security and privacy issues. IntegratingIoT, Fog, Cloud Infrastructures:
Methodology, Integrated C2F2T Literature by Modeling Technique
byUse-Case Scenarios, Integrated C2F2T Literature by Metrics.
Exploiting Fog Computing in Health Monitoring: An Architecture of a
VI Health Monitoring IoT BasedSystem with Fog Computing, Fog 15
Computing Services in Smart E-Health Gateways, Discussion
ofConnected Components. Fog Computing Model for Evolving Smart
Transportation Applications:Introduction, Data-Driven Intelligent
Transportation Systems, Fog Computing for Smart Transportation,
Applications Case Study: Intelligent Traffic Lights Management (ITLM)
 System.

Suggested Readings:
Text Book:
1. Fog Computing: Theory and Practice by Assad Abbas, Samee U. Khan, Albert Y. Zomaya.
2. Fog and Edge Computing: Principles and Paradigms (Wiley Series on Parallel and DistributedComputing) by Rajkumar
Buyya and Satish Narayana Srirama.
3. Amir Vahid Dastjerdi and Rajkumar Buyya, ―Fog Computing: Helping the Internet of ThingsRealize its Potential,
University of Melbourne.

Semester: Seven
Programme/Class: Degree Year: Fourth
Subject: Computer Application
Course Code: BCA-503-H Course Title: Data Analytics
Course outcomes:
CO1: Explain the importance of and be able to formulate a data analysis problem
CO2: Explain various data types, and data formats , and identify and appropriately acknowledge sources of
various types of data
CO3: Gain an ability to apply mathematical and statistical methods in data science applications
CO4: Apply basic data cleaning techniques to prepare data for analysis
CO5: Demonstrate proficiency in using appropriate tools and technology to collect, process, transform,
summarize, and visualize data.

Credits: 4 MAJOR COURSE

Max. Marks: 30+70 Min. Passing Marks: 40%

Total No. of Lectures-Tutorials-Practical (in hours per week): 4-0-0

No
Unit Topic . of
Lect
ures
Introduction Of Data Analysis: Evolution of Data Analytics, Data Analytics
Overview, Types of Data Analytics -Descriptive Analytics -Diagnostic Analytics - 08
I
Predictive Analytics -Prescriptive Analytics, Importance and Benefits of Data
Analytics. Different Applications of Analytics in Business, Text Analytics and Web
Analytics, Skills for Business Analytics..
Probability : Sample Space, Types of Events, Measures of probability, conditional
II probability, Bayes’ theorem, Random variable, Probability Distributions- Binomial, 12
Poisson and Normal, Sampling Distributions,.

Statistical Methods: Estimation and Hypothesis Testing- t-test, Analysis of variance

III (ANOVA) and Chi-square test, Correlation Analysis-Simple Correlation coefficient,
Interpretation, Scatter plot. Linear Regression-Simple and Multiple, Polynomial
Regression, Logistic Regression- with one variable and with multiple variables,
Logistic Regression vs. Linear Regression
Data Visualization : Introduction to data visualization, Visualization
foundations, Introduction to Power BI, Power BI – Advantages and Scalable 15
IV Options, Power BI Architecture and Data Access, Visualization Techniques for
Spatial Data, Geospatial Data, Time-Oriented Data, Multivariate Data, Trees,
Graphs, and Networks, Text and Document Visualization, Power Query & M
Language.
Case Study : Importance and types of case studies: case study of Amazon,
V Twitter, Netflix, Uber, COVID- 19: for understanding business scenarios and 15
how they applied the analytics to improve their decision making, cost
reduction, logistics planning and other benefits
Suggested Readings:
Text Book:
1. Kumar, U.D. :Business Analytics – The Science of Data – Driven Decision Making, Wiley.
2. Dr Anil Maheshwari, Data Analytics Made Accessible, Publisher: Amazon.com Services LLC.
3. Johnson, R.A., Miller, I. and Freund, . :Probability and Statistics for Engineers, Pearson..

Referential Books:
1. Gert, H.N., Thorlund, L. and Thorlund, J :Business Analytics for Managers – Taking Business Intelligence
Beyond Reporting, Wiley.
2. Data Analytics: Principles, Tools, and Practices: A Complete Guide for Advanced Data Analytics Using the
Latest Trends, Tools, and Technologies by Dr. Gaurav Aroraa (Author), Chitra Lele (Author),
 Syllabus for BCA(Hons): Subject:
Computer Application

Semester: Fifth
Programme/Class: Degree Year: Third
Subject: Computer Application
Course Code: BCA-504-H Course Title: Programming in Python
Course outcomes:
CO 1: To introduce the basic features of python programming and impart skills in an t Industry
standard programming language.
CO 2: Understand fundamental programming concepts of Python programming and its Libraries..
CO3: Work with common Python data types, like integers, floats, strings as well as pandas Data frames.
CO4: Use basic flow control including for loops and conditionals.
CO5: Obtain basic summary statistics from data files.

Credits: 4 MAJOR COURSE

Max. Marks: 25+75 Min. Passing Marks: 40%

Total No. of Lectures-Tutorials-Practical (in hours per week): 4-0-0

No. of
Unit Topic Lectures
Introduction of Python: Installing Python in Windows/Linux/Mac OS, Using
Python interpreter, Execute a Script, Structuring with Indentation, Editors. Data 08
I
types and Variables: Variables, Variables v/s identifiers, Naming convention of
variables, Keywords. Data Structure: List, Tuples, Sets, Dictionaries
I nput And Output: Input function, Input with raw input(),Output with old string
II format, Python format function Control Flow: If/Else Statements, For/while 10
Statements, Range() function, Break and continue statements, Else clauses on
Loops.
Functions: Defining Function, Default Argument, Keyword Argument, Arbitrary
Arguments List. 10
III File Handling: Reading from the file, Writing to the file, Methods of file objects.
Error And Expectation: Syntax Errors, Exceptions, Handling Exceptions (try,
except)
IV Module: Creating Modules, import a module, Import the names, Executing
modules as scripts. Class Concept: Class Syntax, Class Objects, Instance Objects,
12
Method Objects, Class and Instance Variables.

V Advanced Modules: Regular Expressions, date time - date and time libraries,
Dealing with Excel, GUI, Web Scrapping. Advanced Modules: Regular
10
Expressions date time - date and time libraries. Dealing with Excel GUI Web
Scrapping
Suggested Readings:
1. P. K. Sinha & Priti Sinha , “Computer Fundamentals”, BPB Publications, 2007.
2. Dr. Anita Goel, Computer Fundamentals, Pearson Education, 2010.
3. T. Budd, Exploring Python, TMH, 1st Ed, 2011
4. Python Tutorial/Documentation www.python.or 2010
5. Allen Downey, Jeffrey Elkner, Chris Meyers , How to think like a computer scientist :
learning with Python , Freely available online.2012
6. Rober Sedgewick, K Wayne -Introduction to Programming in Python: An
interdisciplinary Approach" Pearson India
 Syllabus for BCA(Hons): Subject: Computer Application

Semester: Fifth
Programme /Class: Degree Year: Third
Subject: Python Lab
Course Code: BCA-551-H Course Title: Python Lab
Course outcomes:
CO1: To be able to introduce core programming basics and various Operators of Python programming
language
CO2: To demonstrate about Python data structures like Lists, Tuples, Sets and dictionaries.
CO3: To understand about Functions, Modules and Regular Expressions in Python Programming.

Credits: 4 Core Compulsory

Max. Marks: 25+75 Min. Passing Marks: 50%

Total No. of Lectures-Tutorials-Practical (in hours per week): 0-0-4

No. of
Unit Topic Lectures
I Write a python script to check whether a given number is even or
odd.
II Write a Python script to add two integers’ values taken from user.

III Write a python script to calculate area of circle where radius is

taken from user
IV Write a program to copy the content of one file to another file.

V Write a Python Program to find the sum of series: 1 + 1/2 + 1/3.

VI Write a program to find the sum of n natural numbers.

VII Write a program to find factorial of a given number.

VIII Write a program to find whether a given number is Armstrong

number or not.
IX Write a program takes a number and computes the prime
factors of the integer
X Program to check whether a given number is a palindrome.
 Syllabus for BCA(Hons): Subject: Computer Application

Semester: Six
Programme/Class: Degree Year: Third
Subject: Computer Application
Course Code: BCA-601-H Course Title: AI & Machine Learning
Course outcomes:
CO 1. Understand the various characteristics of problem solving agents and apply problem solving
through search for AI applications.

CO 2. Appreciate the concepts of knowledge representation using Propositional logic and Predicate
calculus and apply them for inference/reasoning.

CO 3. Obtain insights about Planning and handling uncertainty through probabilistic reasoning and fuzzy
systems. CO4: Use basic flow control including for loops and conditionals.

Credits: 4 MAJOR COURSE

Max. Marks: 25+75 Min. Passing Marks: 40%

Total No. of Lectures-Tutorials-Practical (in hours per week): 4-0-0

No.
Unit Topic of
Lectur
es
Introduction to Al: What is AI? Intelligent Agents: Agents and environment,
the concept of Rationality, the nature of the environment, the structure of 08
I
agents; Problem-solving: Problemsolving agents; Uninformed search
strategies: DFS, BFS; Informed Search: Best First Search, A* search, AO*
search, Means End Analysis. Adversarial Search & Games: Two-player zero-
sum games, Minimax Search, Alpha-Beta pruning.
Knowledge-based Agents, The Wumpus world as an example world, Logic,
II Propositional logic, First-order predicate logic, Propositional versus first- 10
order inference, Unification and lifting, Forward chaining, Backward chaining,
Resolution, Truth maintenance systems. Knowledge in Learning, What is
learning? Types of Learning,: Rote Learning, Learning by Taking Advice,
Learning in Problem Solving, Learning from Examples, Winston’s Learning
Program, Decision Trees.
Introduction to Planning: Blocks World problem, Strips; Handling
Uncertainties: Nonmonotonic reasoning, Probabilistic reasoning, Fuzzy 15
III logic; Robotics: Fundamentals of Robotics, Robot Kinematics; Computer
Vision: Introduction to image processing and classification, object
detection.
Fundamentals of Machine Learning Introduction to Machine Learning and its
importance, Types of Machine Learning: Supervised, Unsupervised, and 15
Reinforcement Learning, Basic concepts: features, labels, training data, etc.,
 IV Popular Machine Learning algorithms: Linear Regression, Logistic Regression,
Decision Trees, kNearest Neighbors, etc., Evaluation metrics for Machine
Learning models: accuracy, precision, recall, F1-score, etc.
Natural Language Processing: Introduction, Syntactic Processing, Semantic
Analysis, Discourse and Pragmatic Processing; Expert Systems: Architecture
15
and role of expert systems, two case studies of Expert Systems; Introduction
to Machine learning: Supervised learning, unsupervised learning,
reinforcement learning; Neural Networks: Introduction, basics of ANN, Deep
Learning with basics of CNN, RNN, LSTM and their applications.
Suggested Readings:
1. Russell, S. and Norvig, P., “Artificial Intelligence - A Modern Approach”, 3rd edition, Prentice Hall
2. Nilsson Nils J, “Artificial Intelligence: A new Synthesis, Morgan Kaufmann Publishers Inc. San Francisco,
CA, ISBN: 978-1-55-860467-4.
 Syllabus for BCA(Hons): Subject: Computer Application

Semester: Six
Programme/Class: Degree Year: Third
Subject: Computer Application
Course Code: BCA-602-H Course Title: Cloud Computing and Cyber Security (Cloud)

Course outcomes:
CO1: Understand the concepts of Cloud Computing, key technologies, strengths and limitations of cloud
computing.
CO2: Develop the ability to understand and use the architecture to computeand storage cloud, service and
models.
CO3: Understand the application in cloud computing.
CO4: Understand the various tools and methods used in cybercrime.
CO5: Identify risk management processes, risk treatment methods, organization of information security.

Credits: 4 MAJOR COURSE

Max. Marks: 25+75 Min. Passing Marks: 40%

Total No. of Lectures-Tutorials-Practical (in hours per week): 4-0-0

No.
Unit Topic of
Lect
ures
Introduction: Cloud Computing – Definition of Cloud – Evolution of Cloud
Computing – Underlying Principles of Parallel and Distributed, History of Cloud 08
I
Computing - Cloud Architecture - Types of Clouds - Business models around Clouds
– Major Players in Cloud Computing-issues in Clouds - Eucalyptus - Nimbus - Open
Nebula, Cloud Sim.
Cloud Services: Types of Cloud services: Software as a Service- Platform as a
II Service–Infrastructure as a Service-Database as a Service - Monitoring as a Service– 10
Communication as services. Service providers- Google, Amazon, Microsoft Azure,
IBM, Sales force.
Collaborating Using Cloud Services: Email Communication over the Cloud -
CRM Management – Project Management-Event Management - Task 15
III Management – Calendar - Schedules - Word Processing – Presentation –
Spreadsheet - Databases – Desktop - Social Networks and Groupware.

Introduction to Ethical Hacking: Key issues plaguing the information security world,
incident management process, and penetration testing, Footprinting and 12
IV
Reconnaissance: Various types of footprints, footprints tools, and countermeasures.

V Scanning Network: Network scanning techniques and scanning countermeasure.

10
Suggested Readings:
Text Books:
1. Rajkumar Buyya, “Mastering Cloud Computing”, Tata Mc. Graw-Hill Education.
2. Rajkumar Buyya, James Broberg & Andrzej Goscinski, “Cloud Computing: Principles and Paradigms”, Wiley.
3. K. Kumar,” Cyber Laws: Intellectual property & E Commerce, Security”, 1st Edition, Dominant Publisher,2011.
4. Rodney D. Ryder, “Guideto Cyber Laws”, Second Edition, Wadhwa and Company, New Delhi, 2007.
 Syllabus for BCA(Hons): Subject: Computer Application
Semester: Fifth
Programme/Class: BCA Year: Third
Course Code: BCA-603-H Course Title: Cyber Security
Course outcomes:
By the end of this course, students should be able to:
1. Understand the importance of cybersecurity and the impact of cyber-attacks on organizations and individuals.
2. Recognize different types of cyber threats and attacks, such as malware, viruses, and ransomware, and understand how
to mitigate them.
3. Identify and evaluate various cybersecurity technologies and tools, including intrusion detection and prevention
systems, security information and event management, endpoint protection tools, and vulnerability assessment and
penetration testing.
4. 4. Develop information security policies and procedures, incident response planning and management, security
awareness and training, and physical security considerations to ensure the security of organizational assets.

Credits: 4 Monor

Max. Marks: 30+70 Min. Passing Marks:40

Total No. of Lectures-Tutorials-Practical (in hours per week): 4-0-0
No. of
Unit Topic Lectures
Introduction to Cybersecurity: Definition of Cybersecurity ,Importance of
I Cybersecurity, Cybersecurity threats and attacks, Overview of Cybersecurity 6
frameworks and standards ,Basic principles of Cybersecurity

Network Security: Fundamentals of network security, Types of network

II security threats, Network security protocols and technologies, Network 7
security best practices

Cybersecurity Technologies and Tools: Intrusion detection and prevention

systems (IDS/IPS), Security Information and Event Management (SIEM), 6
III
Endpoint protection tools ,Vulnerability assessment and penetration testing,
Security Operations Center (SOC) tools
Future of Cybersecurity: Emerging Cybersecurity threats and trends, Advances
IV in Cybersecurity technologies, Ethical considerations in Cybersecurity 6

Cybersecurity Policies and Procedures: Information security policies and procedures,

V Incident response planning and management, Security awareness and training, 6
Physical security considerations, Compliance and regulatory requirements

Suggested Books:
1. Ciampa, M. (2021). Security+ guide to network security fundamentals. Cengage Learning.
2. Pfleeger, C. P., & Pfleeger, S. L. (2018). Security in computing. Pearson
 Syllabus for BCA(Hons): Subject: Computer Application

Semester: Sixth
Programme/Class: BCA Year: Third
Course Code: BCA-604-H Course Title: Java Programming
Course outcomes:
Objectives:Understand fundamentals of object-oriented programming in Java, including defining classes,
invoking methods, using class libraries and also be aware of the important topics and principles of software
development.
1: Identify and analyze classes, objects, members of a class and relationships among them needed for a specific
problem.
2: Demonstrate the concepts of polymorphism and inheritance.
3 : Understand the principles of inheritance, packages and interfaces.
4: Understand the fundamentals of object-oriented programming in Java, including defining classes , objects,
invoking methods etc and exception handling mechanisms.

Credits: 4 Major

Max. Marks: 30+70 Min. Passing Marks:40

Total No. of Lectures-Tutorials-Practical (in hours per week): 4-0-0
No. of
Unit Topic Lectures
Java Programming: Data types, control structured, arrays, strings, and
I vector, classes (inheritance, package, exception handling) multithreaded 6
programming.
Java applets, AWT controls (Button, Labels, Combo box, list and other
II Listeners, menu bar) layout manager, string handling (only main functions) 7

Networking (datagram socket and TCP/IP based server socket) event

6
III handling, JDBC: Introduction, Drivers, Establishing Connection,
Connection Pooling.

Java Servlets: Introduction, HTTP Servlet Basics, The Servlet Lifecycle,

IV 6
Retrieving Information, Sending HTML Information, Session Tracking,
Database Connectivity
Java Server Pages: Introducing Java Server Pages, JSP Overview, Setting Up the JSP
V Environment, Generating Dynamic Content, Using Custom Tag Libraries and the
6
JSP Standard Tag Library, Processing Input and Output.

Suggested Books:
1: Java: The Complete Reference (Ninth Edition): Schildt,Herbert 5th Edition
2: Programming: Black Book
3: Java Programming and Website Design 2011 by Lalit Arora
4: Object Oriented System with Java 2012 by Lalit Arora
 Syllabus for BCA(Hons): Subject: Computer Application

Semester: Sixth
Programme/Class: BCA Year: Third
Course Code: BCA-651-H Course Title: Java Programming Lab
Course outcomes:
1. To build software development skills using java programming for real world applications.
2. To implement frontend and backend of an application
3. To implement classical problems using java programming.

Credits: 4 Major

Max. Marks: 30+70 Min. Passing Marks:40

Total No. of Lectures-Tutorials-Practical (in hours per week): 0-0-4

Topic
1. Write a JAVA program to implement the concept of inheritance.
2. Write a JAVA program to find the largest number from two numbers.
3. Write a JAVA program of constrauctor.
4. Write a JAVA program using command line argument.
5. Write a JAVA program to implement the concept of interface.

6. Write JAVA program to implement the concept of super.

7. Write a JAVA program to creation single dimensional Array.

8. Write a JAVA program to find out the addition and multiplication of two numbers.

9. Write a JAVA program to create a simple Applet.

13. QWrite JAVA program to connect Ms-Access database with Java application.

14. Write JAVA program to implement the concept the Multithreading.

15. Write JAVA program tom implements the concept of Exception Handling.

Suggested Books:

1: Java: The Complete Reference (Ninth Edition): Schildt,Herbert 5th Edition

2: Programming: Black Book
3: Java Programming and Website Design 2011 by Lalit Arora
4: Object Oriented System with Java 2012 by Lalit Arora
Programme/Class: Year: First Semester: First
Certificate
Subject: ZOOLOGY
Course Code: BVAC01 Course Title: Indian Knowledge System (IKS)

Course outcomes:
By studying this course, students will be able to:
 Explain the evolution of Indian Knowledge system.
 Identify the characteristics of various era’s in History of IKS.
 Identify the Nature of Indian Knowledge System.
 Enlist the key characteristics of IKS.
 Identify Key aspects of the epistemology of the Indian Knowledge System.
 Explain the knowledge framework & classification.
 List the ancient scripts of India.
 Outline the influence of ancient sacred texts on Indian Society.
 List the ancient scripts of India.
 Outline the influence of ancient sacred texts on Indian Society.
Credits: 3 Core: Compulsory
Max. Marks: 30+70=100 Min. Passing Marks: 45
Total No. of Lectures-Tutorials-Practical (in hours per week): L-T-P: 3-1-0
Unit Topics Total No. of
Lectures (60)
I History of Indian Knowledge System
 Genesis of Bhartiya Knowledge System
 History of IKS
II India’s characteristic knowledge & India’s epistemology
 IKS: Nature, Philosophy and Character
 India’s Epistemology Knowledge Frameworks & Classification
III Ancient Scriptures
• Ancient Scriptures
IV Ancient Education System
• Ancient Education
• Educating Sciences
V Scientific approaches of IKS & Torch-bearers
• Khagol Vijnana (Astronomy)
• Vastukala (Architecture)
• Ayurveda Krishi Vijnana (Agricultural) Practices
VI Scientific approaches of IKS & Torch-bearers
• Dhatu Vijnana (Metallurgy)
• Ganita: Mathematics in India
• Yuddha Vidhya (Military Sciences)
• Niyuddha Kala (Martial Arts)
 • Environmental Sciences
VII Literary Aspects of IKS & Torch-bearers.
• Chandashastra (Prosody)
• Bhasa Va Vyakarana (Language and Grammar)
• Bharata’s Natyashastra (Science of Drama, Dance and Music)
VIII Governance in IKS & Way Forward
• Science of Consciousness in Ancient India (Cognitive Science)
• Anviksiki (Logic and Disputation)
• Governance & Public Administration
• IKS way forward
SUGGESTED READINGS:
1. Introduction to Indian Knowledge System: Concepts and Applications, Archak, K.B. (2012). Kaveri Books,
New Delhi.ISBN-13:978-9391818203
2. Introduction To Indian Knowledge System: Concepts and Applications, Mahadevan, B.Bhat, Vinayak
Rajat,Nagendra Pavana R.N.PHI, ISBN: 9789391818203
3. Glimpse into Kautilya’s Arthashastra Ramachandrudu P. (2010), Sanskrit Academy, Hyderabad
ISBN:9788380171074
4. “Introduction” in Studies in Epics and Purāṇas, (Eds.), KM Munshi and N Chandrashekara Aiyer Bhartiya
Vidya Bhavan

Suggested Continuous Evaluation Methods:

Total Marks: 30
One Mid Semester written Test (1x15): 15 Marks
Project /Seminar/ Quiz / Presentation/ 10 Marks
Assignment: 05 Marks
Attendance & Conduct:
 Programme/Class: Degree Year: Second Semester: Forth
Co-Curricular Course
Course Code: BSEC520404 Course Title: First Aid and First Aid and Health
Course outcomes:
 Learn the skill needed to assess the ill or injured person.
 Learn the skills to provide CPR to infants, children and adults.
 Learn the skills to handle emergency child birth
 Learn the Basic sex education help young people navigate thorny questions responsibly and with confidence.
 Learn the Basic sex education help youth to understand Sex is normal. It’s a deep, powerful instinct at the core of
our survival as a species. Sexual desire is a healthy drive.
 Help to understand natural changes of adolescence
 Learn the skill to identify Mental Health status and Psychological First Aid
Credits: 2 (1Theory+1 Practical) Compulsory
Max. Marks: 25+75 Min. Passing Marks:
Total No. of Lectures-Tutorials-Practical (in hours per week): L-T-P: 2-0-0
No. of
Lectures
Unit Topics Total=
15 Theory+
30 Practical
A. Basic First Aid
 Aims of first aid & First aid and the law.
 Dealing with an emergency, Resuscitation (basic CPR).
 Recovery position, Initial top to toe assessment.
 Hand washing and Hygiene 2
 Types and Content of a First aid Kit (Theory)
I B. First AID Technique 10
 Dressings and Bandages. (Practical)
 Fast evacuation techniques (single rescuer).
 Transport techniques.
C. First aid related with respiratory system
 Basics of Respiration.
 No breathing or difficult breathing, Drowning, Choking, Strangulation and hanging,
 Swelling within the throat, Suffocation by smoke or gases and Asthma.
D. First aid related with Heart, Blood and Circulation
 Basics of The heart and the blood circulation.
 Chest discomfort, bleeding.
D. First aid related with Wounds and Injuries
 Type of wounds, Small cuts and abrasions
 Head, Chest, Abdominal injuries
 Amputation, Crush injuries, Shock
E. First aid related with Bones, Joints Muscle related injuries
 Basics of The skeleton, Joints and Muscles.
 Fractures (injuries to bones).
F. First aid related with Nervous system and Unconsciousness
 Basics of the nervous system.
 Unconsciousness, Stroke, Fits – convulsions – seizures, Epilepsy.
G. First aid related with Gastrointestinal Tract
 Basics of The gastrointestinal system.
 Diarrhea, Food poisoning.
H. First aid related with Skin, Burns
 Basics of The skin.
 Burn wounds, Dry burns and scalds (burns from fire, heat and steam).
  Electrical and Chemical burns, Sun burns, heat exhaustion and heatstroke.
 Frost bites (cold burns), Prevention of burns, Fever and Hypothermia.
I. First aid related with Poisoning 2
 Poisoning by swallowing, Gases, Injection, Skin
(Theory) 10
J. First aid related with Bites and Stings
II  Animal bites, Snake bites, Insect stings and bites (Practical)
K. First aid related with Sense organs
 Basic of Sense organ.
 Foreign objects in the eye, ear, nose or skin.
 Swallowed foreign objects.
L. Specific emergency satiation and disaster management
 Emergencies at educational institutes and work
 Road and traffic accidents.
 Emergencies in rural areas.
 Disasters and multiple casualty accidents.
 Triage.
M. Emergency Child birth
Basic Sex Education
 Overview, ground rules, and a pre-test
 Basics of Urinary system and Reproductive system.
 Male puberty — physical and emotional changes
 Female puberty — physical and emotional changes
 Male-female similarities and differences
9
III  Sexual intercourse, pregnancy, and childbirth (Theory)
 Facts, attitudes, and myths about LGBTQ+ issues and identities
 Birth control and abortion
 Sex without love — harassment, sexual abuse, and rape
 Prevention of sexually transmitted diseases.

Mental Health and Psychological First Aid

 What is Mental Health First Aid?
 Mental Health Problems in the India
 The Mental Health First Aid Action Plan
2
 Understanding Depression and Anxiety Disorders
(Theory) 10
 Crisis First Aid for Suicidal Behavior & Depressive symptoms
IV  What is Non-Suicidal Self-Injury? (Practical)
 Non-crisis First Aid for Depression and Anxiety
 Crisis First Aid for Panic Attacks, Traumatic events
 Understanding Disorders in Which Psychosis may Occur
 Crisis First Aid for Acute Psychosis

Suggested Readings:
 Indian First Aid Mannual-https://www.indianredcross.org/publications/FA-manual.pdf
 Red Cross First Aid/CPR/AED Instructor Manual
• https://mhfa.com.au/courses/public/types/youthedition4
• Finkelhor, D. (2009). The prevention of childhood sexual abuse. Durham, NH: Crimes Against Children Research Center.
www.unh.edu/ccrc/pdf/CV192. pdf
• Kantor L. & Levitz N. (2017). Parents’ views on sex education in schools: How much do Democrats and Republicans agree? PLoS
ONE, 12 (7): e0180250.
• Orenstein, P. (2016). Girls and sex: Navigating the complicated new landscape. New York, NY: Harper.
• Schwiegershausen, E. (2015, May 28). The Cut. www.thecut.com/2015/05/most-women-are-catcalled-before-they-turn-17.html
• Wiggins, G. & McTighe, J. (2008). Understanding by design. Alexandra, VA: ASCD.
• https://marshallmemo.com/marshall-publications.php#8
Suggested Continuous Evaluation Methods:
Assignments, Presentation, Group Discussion, and MCQ
Suggested equivalent online courses:
 https://www.redcross.org/take-a-class/first-aid/first-aid-training/first-aid-online
 https://www.firstaidforfree.com/
 https://www.coursera.org/learn/psychological-first-aid
 https://www.coursera.org/learn/mental-health
Further Suggestions:………………………………………………………………………………………………..