BCA NEP Core Syllabus

Vivekananda Global University, Jaipur
First Year
Syllabus
1
Semester I
UGCSA102: Introduction to Computers & Programming

in C
3L+0T+2P+4C MM:100
1. Department offering the course Computer Science and Application

2. Course Code BCA 101
3. Course Title Introduction to Computers & Programming in C
4. Credits (L:T:P:C) 3:0:2:4
5. Contact Hours (L:T:P) 3:0:2
6. Prerequisites (if any) -
7. Course Category Discipline Core
COURSE OBJECTIVES
This course introduces computer concepts, including fundamental functions and
operations of the computer. Topics include identification of hardware components, basic
computer operations, algorithms, and flowcharts. The course also provides complete
knowledge of C language. Students will be able to develop logics which will help them to
create programs, applications in C. By learning the basic programming constructs they
can easily switch over to any other language in future.
COURSE OUTCOMES
On successful completion of the course, students will be able to:
CO1: Understand a broad perspective about the uses of computers in engineering industry.
CO2: Develop basic understanding of computers, the concept of algorithm and
programming.
CO3: Develop the ability to analyze a problem, develop an algorithm to solve it.
CO4: Implement the C programming language for various
algorithms.
CO5: Learn the more advanced features of the C language
OUTLINE OF THE COURSE
Unit No. Title of Unit Time Required for

Unit (Hours)
1 Introduction to Computer, Programming & algorithms 6
2 C Basics, Operators, Loops 6
3 Arrays & Functions 7
4 Structure and Union 6
5 Pointers & File handling 6
2
COURSE CONTENT
Unit 1: Introduction to Computer, Programming & algorithms (6L)
Introduction to Computer and components of a computer system, Architecture,
Definition of software and hardware, types of programming languages, assembler,
compiler, interpreter, linker, and loader.
Algorithm- Definition, characteristics, complexity notations. Flowchart-definition,
Symbols used in writing the flowchart. Writing algorithms and flow-charts of simple
problems.
Unit 2: C Basics, Operators, Loops (6L)

Introduction to C, features of C, basic C program structure, C tokens, data types, C
Operators and precedence, Type conversion. Control Structures: if, if-else, nested if, switch-
case, while, do-while and for statements. Unconditional control statements- break, continue.
Unit 3: Arrays & Functions (7L)

Arrays: Arrays (1-D, 2-D), Character arrays and Strings.
Functions: Types of functions, Formal and Actual arguments, Parameter passing in
functions, call by value, call by reference, passing arrays to functions. Nested functions and
Recursion.
Unit 4: Structure and Union (6L)

Introduction, types of storage classes, Introduction to structures, Advantages of structures,
accessing elements of a structure, nested structures, array of structures, functions and
structures, Unions, bit- fields, enumerated data types.
Unit 5: Pointers & File handling (6L)

Pointers: Idea of pointers, Defining pointers, Use of Pointers. File handling:
different modes of opening a file in C, reading, writing from files.
TEXT BOOKS:
1. Byron Gottfried, “Schaum's Outline of Programming with C”, 2nd edition 2006, McGraw-Hill.
2. E. Balaguruswamy, “Programming in ANSIC”, 8th Edition 2019, McGraw-Hill Education India.
REFERENCE BOOKS
1. Forouzon A Behrouz, Gilberg F Richard, “A Structured Programming Approach
using C”, 3rd Edition, BPB Publication, New Delhi
2. Yashwanth Kanetkar, “ Let us C”, Sixth Edition, BPB Publication, New Delhi
3. Deitel, H M and Deitel P J, “C How to Program”, 2nd Edition, Prentice-Hall
CO-PO Mapping
COs
and POs PO-1 PO-2 PO-3 PO-4 PO- 5 PO-6 PO-7 PO-8 PO-9 PO-10
CO1 2 - 2 3 2 ─ 3 2 2 2
CO2 1 3 3 2 3 ─ 2 3 2 1
CO3 3 3 2 3 2 ─ 2 3 - -
CO4 1 2 1 3 ─ 1 3 - -
CO5 2 1 2 1 2 ─ 1 3 3 3
3
CO-PSO Mapping
COs and
PSO-1 PSO-2 PSO-3
PSOs
CO-1 1 1 1
CO-2 2 1 1
CO-3 2 - 1
CO-4 2 1 ─
CO-5 2 1 1
LIST OF EXPERIMENTS:
S. NO. MODULE EXPERIMENT NAME

Familiarization with programming environment.
1 Module 1
Programming for Simple computational problems using arithmetic expressions.
2 Module 1
Programming for Problems involving if-then-else structures.
3 Module 2
Programming for Iterative problems e.g. sum of series etc.
4 Module 2
Programming for one-dimensional Array manipulation.
5 Module 2
Programming for Matrix problems, String operations.
6 Module 2
Programming for Simple functions
7 Module 3
Programming for Recursive functions.
8 Module 3
Programming for Pointers and structures.
9 Module 4, 5
Programming for File operations
10 Module 5
4
UGCSA104: Web Page Design and Development
3L+0T+2P+4C MM: 100

2. Course Code BAC 102
3. Course Title Web Page Design and Development
4. Credits (L:T:P:C) 3:0:2:4
6. Prerequisites (if any) Basics of Computers
COURSE OBJECTIVES
This course will introduce students to web technologies such as HTML, CSS, XML, Java
Script to create static and simple dynamic web pages or applications using these technologies
and to understand web application deployment and software architectures.
COURSE OUTCOME
On completion of this course the learner should be able to:
CO1: Design and implement a variety of Websites
CO2: Use and recognize commonly used HTTP request and response
messages
CO3: Understand and use CSS and Java Script
CO4: Differentiate and create both static and dynamic web
applications
CO5: Learn the advanced techniques and tools

Unit (Hours)
1. Introduction to the Internet and 5
the World Wide Web
2. Developing Web pages 8
using HTML
3. Cascading Style sheet CSS 6
4. Working with Java Script 6
5. Practical Web Development using 5
Advanced techniques and tools
5
COURSE CONTENT
Unit 1: Introduction to the Internet and WWW (5L)
Introduction, History of internet, Internet Design Principles, Internet Protocols - FTP,

TCP/IP, SMTP, Telnet, HTTP etc., Client Server Communication, Web System architecture.
Web clients and Web servers, Static and Dynamic Web Applications, Idea of front end
and back end web development. Introduction to HTML, CSS, JS, and XML. Five
Golden rules of web designing. Organizing Home page and other web pages.
Unit 2: Developing Web pages using HTML (8L)
Introduction to HTML, HTML Documents, Basic structure of an HTML document.

Creating an HTML document, Mark up Tags and attributes. Heading-Paragraphs, Line
Breaks, Designing simple page - Head tag, Body tag. Working with Lists, Tables and
Frames, Working with Hyperlinks, Images and Multimedia, Working with Forms and
controls.
Unit 3: Introduction to Cascading Style Sheets (6L)

Concept of CSS, creating Style Sheets, CSS Properties, CSS Styling (Background, Text
Format, Controlling Fonts). Working with block elements and objects, Working with Lists
and Tables, CSS Id and Class, Box Model (Introduction, Border properties, Padding
Properties, Margin properties), CSS Advanced (Grouping, Dimension, Display,
Positioning, Floating, Align, Pseudo class, Navigation Bar, Image Sprites, Attribute
sector). Creating page Layout and Site Designs.
Unit 4: Working with Java Script (6L)
Introduction to JavaScript: Data types, variables, operators, expressions, statements,

functions, objects, arrays, date, math, error handling, flow control, loops. Document Object
Model (DOM).
Unit 5: Practical Web Development using Advanced techniques and tools (6L)
Introduction to HTML5, CSS3, New features, Local storage, Web Sockets, Canvas,
Audio & Video. Commonly used web authoring tools. Web hosting and website
maintenance.
TEXT BOOKS
1. Adrian W. West, “Practical Web Design for Absolute Beginners”, Apress, 2016
2. Thomas Powell, “HTML & CSS: The Complete Reference”, 5th Edition, McGraw Hill
3. Alexis Goldstein, Estelle W., Louis Lazaris, “HTML5 & CSS3 for the Real
World”, 2nd, Edition, Apress
6
CO-PO Mapping
COs
CO1 2 - 2 3 2 ─ 3 2 2 2
CO2 1 3 3 2 3 ─ 2 3 2 1
CO3 3 3 2 3 2 ─ 2 3 - -
CO4 1 2 1 3 ─ 1 3 - -
CO5 2 1 2 1 2 ─ 1 3 3 3
CO-PSO Mapping
COs and
PSO-1 PSO-2 PSO-3
PSOs
CO-1 2 ─ 3
CO-2 ─ ─ ─
CO-3 2 ─ 2
CO-4 2 ─ ─
CO-5 ─ ─ 3

Module 1 Design a simple web page with head, body and footer, with heading tags,
1
image tag.
Module 1,2 Design a web site for book information, home page should contain books list,
2 when particular book is clicked, information of the books should display in the
next page.
Module 2 Design a page to display the product information such as name, brand, price
3 and etc with table tag
Module 3 Design a web site for book information using frames, home page should
4 contain two parts, left
part should contain books list, and right part should contain book information.
Module 3 Design a web page with nice formatting like background image, text colors
5 and border for text using external CSS.
Module 4 Design a web page to perform mathematical calculations such as addition,

6
subtraction, multiplication, and division using form elements and Java Script.
Module 4 Design a web page to capture the user information such as name, gender,
mobile number, mail id, city, state, and country using form elements and
7
display them into
other pages using Java Script.
Module 4,5 Design a web page to display timer in the left side of the web page using Java
8
Script.
Module 5 Design a web page to capture the student details such as student number,
9
name, age, marks using Java Script Object.
Module Design a web site for online purchase using CSS and JS, web site should
10 2,3,4,5 contain the following web pages (Home page, Login page, Signup page,
Product details page)
7
UGMAT103: MATHEMATICAL FOUNDATION

3L+1T+0P+4C MM:100
COURSE OVERVIEW:
The main objectives of this course to introduce the mathematical fundamentals and develop an
understanding of a wide range of concepts in mathematics which are necessary for the students of
BCA.
COURSE OBJECTIVES:
CO1: Capable of inquiring and understanding a wide range of concepts in mathematics.

CO2: Able to understand the algebraic concepts of mathematics in sets, relations, functions, and
Matrices.
CO3: Able to understand the concepts of analytical geometry and
vectors. CO4: Analyze propositions and arguments in logic using truth
tables.
CO5: Relate and integrate analytical geometry and vectors into real life contexts.
Unit No. Title of the unit Time required for the Unit
1. Sets, relations and functions 5
2. Mathematical Logic 6
3. Matrices and Determinants 6
4. Vectors 6
5. Coordinate Geometry 7
COURSE CONTENT
Unit 1: (5L)
Sets: Sets, Subsets, Equal sets, Universal sets, Finite and Infinite sets, Union, Intersection and
Complement of sets, Cartesian product, cardinality of a set, De-Morgan’s Laws(with proof).
Relations: Properties of relations, Equivalence Relation Functions: Types of functions, Composite and
Inverse functions.
(Illustrative examples and problems)
Unit 2: (6L)
Mathematical Logic: Proposition and Truth Values, Logical Connectives and their truth tables,
Converse, Inverse and Contra positive, Tautology and Contradiction, Logical Equivalence.
Normal forms: Disjunctive normal forms, Conjunctive normal forms, Principal Disjunctive normal
forms and Principal Conjunctive normal forms.
Unit 3: (6L)
Matrices: Review of fundamentals: Definition of a Matrix, order, Types of matrices: Zero, row,
column, square, diagonal, scalar, unit, symmetric, skew-symmetric. Determinant: Value of
determinant of order 2x2, 3x3, minors, cofactors, adjoint, inverse of a matrix. Eigen values and Eigen
vectors ( without any theorems) only of order 2x2 matrices. Cayley Hamilton theorem (only
8
statement) – Verification of Cayley Hamilton theorem ( only for 2x2 matices), Inverse of a matrix
using Cayley- Hamilton theorem.(only for 2x2 matrices)
Unit 4: (6L)
Vectors: Definition of vector and scalar, vector addition, dot and cross product, projection of a vector
on the other vector, area of parallelogram, area of a triangle, scalar triple product, volume of
parallelepiped, vector triple product. (only Problems)
Unit 5: (7L)
Analytical Geometry in Two Dimensions: Coordinates, Distance formula, Section Formula, Area of
the Triangle formula (no derivation), Locus of point. Straight Line: Slope of a line and angle between
two lines, Various forms of equations of lines – Derivation and Problems. Equation of a line passing
through the point of intersection of two lines, Distance of a point from a line (only problems).
Text Books:
1. Grewal, B.S., “Higher Engineering Mathematics”, 36th Edition
2. Satyrs S.S, “Engineering Mathematics”.
3. Peter V.O’Neil, “Advanced Engineering Mathematics”, 5th Edition.
Referential Books:
1. H.K. Dass, “Advanced Engineering Mathematics”, S. Chand & Comp
2. J.P. Chauhan, “BCA Mathematics Volume -1”, Krishna Publications.
CO-PO Mapping
COs
CO1 2 - 2 3 2 ─ 3 2 2 2
CO2 1 3 3 2 3 ─ 2 3 2 1
CO3 3 3 2 3 2 ─ 2 3 - -
CO4 1 2 1 3 ─ 1 3 - -
CO5 2 1 2 1 2 ─ 1 3 3 3
CO-PSO Mapping
COs and PSOs PSO-1 PSO-2 PSO-3

CO-1 1 3 1
CO-2 ─ ─ ─
CO-3 1 3 1
CO-4 ─ ─ ─
CO-5 1 3 1
9
Semester II
UGCSA112: Data Structures Using C

3L+0T+2P+4C MM: 100
1. Department offering Computer Science and Application

the course
2. Course Code
3. Course Title Data Structures
4. Credits (L:T:P:C) 3:0:1:4
6. Prerequisites (if any) Basics of C Programming
COURSE OBJECTIVES
This course gives the basic understanding of Data Structures and its usage in programming
principles. The main objective of this course is to introduce the concept of data structure, how
to choose a particular data structure, and how the choice of a data structure impacts the
performance of algorithms. It also covers the time and space complexity analysis of different
searching and sorting techniques.
COURSE OUTCOME
On successful completion of the course, students will be able to achieve the following:
CO1: The student will develop an ability to read, write, and analyze the time and space complexity of
any algorithms.
CO2: Able to describe the properties, behavior, and implementation of basic data structures like
Stacks, Queues, Linked List, Trees, and Graphs.
CO3: Able to convert pseudocode to its appropriate C code implementation.
CO4: Able to compare different searching and sorting techniques.
CO5: Able to design and implement different hash functions, and hash tables.
Unit No Title of Unit Time Required for Unit

(Hours)
1 Introduction to data structures 5
2 Stacks, queues and lists 7
3 Trees & graphs 8
4 Sorting searching algorithms 8
5 Analysis of quick sort, picking 6
a pivot
10
COURSE CONTENT
Unit 1: Introduction to Algorithms & Data Structure (5L)
Introduction: Data types, Abstraction, Concept of data structure, Types of data structures,
Operations on Data Structures, Introduction to Algorithms, Writing Pseudocodes, Algorithm
analysis, Complexity of algorithms and Time space trade-off, Arrays, Address calculation in a
single and multidimensional array. Searching: Linear and Binary search algorithms and their
complexity analysis.
Unit 2: Stacks, Queues and Lists (7L)
Definition, Array based implementation of stacks, Linked List based implementation of
stacks, Examples: Infix, postfix, prefix representation, Applications: Mathematical expression
Evaluation Queues: Array based implementation of Queues, Linked List implementation of
Queues, Circular implementation of Queues, Double ended queues.
Linked List: Singly linked Lists, doubly linked list, Straight / circular implementation of
doubly linked Lists, Operations on linked lists, Priority queues, Applications.
Unit 3: Trees (8L)
Nonlinear data structure, Trees: Basic Tree terminologies, Types of Trees: Binary Tree,
Binary Search Tree (BST), AVL Tree, B-Tree, and Heap. Representation and Implementations
of different types of trees, Tree Traversal algorithms, Operation on trees: Insert, Delete, etc .,
Applications of Tress.
Unit 4: Graphs (6L)
Graphs: Introduction to Graph and their Terminologies, Types of Graph, Representations of
Graph, Adjacency matrix, Spanning tree, Minimum Spanning Tree, Weighted graphs, Shortest
Path Algorithms, Graph Traversal – Breadth first Traversal, Depth first Traversal, Connectivity
of graphs.
Unit- 5: Sorting & Hashing: (8L)
Sorting Algorithms and their Analysis: Selection Sort, Bubble sort, Insertion sort, Quick sort,
Merge sort, Heap Sort. Performance Analysis and Comparison of all sorting techniques.
Hashing: Hash Functions and its type, Hash Table construction, Collision Resolution,
Universal Addressing, Open Hashing.
TEXT BOOK (S)

1. Aaron M. Tenenbaum, Yedidyah Langsam, Moshe J. Augenstein, “
Data Structures using C“, Pearson.1st Edition.2019
2. Schaum’s outline series , “Data structures with C” , McGraw Hill Education;
1st edition (July 2017)
REFERENCE BOOKS
1. Horowitz and Sahani, “Fundamentals of Data Structures”, Galgotia Publication,
2nd Edition. 2008.
2. Robert Kruse, “Data Structures and Program Design in C”, PHI.2nd Edition.2006.
3. Kyle Loudon, “Mastering Algorithms with C”, O’Reily Publication, 1st Edition, 1999
11
CO-PO Mapping
COs
CO1 2 - 2 3 2 ─ 3 2 2 2
CO2 1 3 3 2 3 ─ 2 3 2 1
CO3 3 3 2 3 2 ─ 2 3 - -
CO4 1 2 1 3 ─ 1 3 - -
CO5 2 1 2 1 2 ─ 1 3 3 3
CO-PSO Mapping
CO and PSO PSO1 PSO2 PSO3

CO1 3 - 3
CO2 2 - 3
CO3 2 - 2
CO4 3 - 2
CO5 2 - 2

1 Module 1 Program to insert element at desire position, replacing element, deletion in
array.
2 Module 1 Program on various matrices operations.
3 Module 1,2 Program on array searching (Linear and Binary)
4 Module 2 Implementation of stack and queue using array and basic operations
5 Module 2 Implementation of stack and queue using link lists
6 Module 2 Implementation of circular queue using link lists.
7 Module 2 Infix to postfix/prefix conversion.
8 Module 2 Singly and Doubly linked lists
9 Module 5 Implementation of Sorting Techniques
12
UGCSA113: Computer Systems Organization
3L+1T+0P+4C MM: 100

3. Course Title Computer Systems Organization
4. Credits (L:T:P:C) 3:1:0:4
6. Prerequisites (if any) Basics of Computers
COURSE OBJECTIVES
This course will facilitate the students to learn the fundamentals of computer organization
and its relevance to classical and modern problems of computer design.
COURSE OUTCOMES –
On successful completion of the course students will be able to -

CO1: Understand the hardware components and concepts related to the control
design
CO2: Familiarize with addressing modes, different types of instruction
formats
CO3: Learn about various I/O devices and the I/O
interface. CO4: Gain the concepts related to the memory
organization.
CO5: Understand the theoretical concept of parallel processing and multiprocessing.
Unit No. Title of Unit Time Required for Unit (Hours)
1 Fundamental of Computer Design 6

2 Instruction set, Assembly language 7
and input/output Organization
3 The Memory System 6
4 Arithmetic for Computers 7
5 Pipelining and Parallel Processing 6
13
COURSE CONTENT
Unit 1: Fundamental of Computer Design (6L)

Basic Structure of Computers: Computer Types; Functional Units; Bus structure;
Performance- Processor Clock, Basic Performance Equation, Clock rate; Historical
Perspective; Machine Instructions and Programs: Numbers, Arithmetic Operations and
Characters; Memory Location and Addresses; Memory Operations; Instructions and
Instruction Sequencing
Unit 2: Instruction set, Assembly language and input/output Organization (7L)
Machine Instructions and Programs: Addressing Mode; Assembly Language; Basic
input and Output Operations; Stacks and Queues; Subroutines; Encoding
of Machine Instructions; Accessing I/O Devices; Interrupts-
Interrupt Hardware; Enabling and Disabling Interrupts; Handling Multiple
Devices; Controlling Device Requests; Exceptions; Direct Memory Access; Standard
I/O Interfaces-PCI Bus, SCSIBus, USB.
Unit 3: The Memory System (6L)
Basic Concepts: Semiconductor RAM Memories, Read only memories, speed, size, and
cost, cache memories- mapping functions, replacement algorithms; cache performance;
cache optimization; Virtual memory; Protection: Virtual memory and virtual machines.
Unit 4: Arithmetic for Computers (7L)
Addition and subtraction of signed numbers, design of fast adders, multiplication of
positive numbers, signed operand multiplication, fast multiplication, integer division,
floating-point numbers and operations.
Unit 5: Pipelining and Parallel Processing (6L)
Introduction to Pipelining; Implementation of pipeline; Instruction level parallelism
concepts and challenges: Overcoming data hazards with dynamic scheduling;
hardware-based speculation; Exploiting ILP using multiple issue and static
scheduling; Introduction to multicore architecture.
TEXT BOOKS:
1. John P. Hayes, “Computer Architecture and Organization”, 3rd Edition, McGraw Hill, 2012
2. M. Morris Mano, “Computer System Architecture”, 3rd Ed, Pearson Education, 2017
3. Carl Hamacher, Zvonko V., Safwatzaky, “Computer Organization”, 5th Edition, TMH 2011
REFERENCE BOOKS:
1. John L. Hennessey and David A. Patterson, “Computer Architecture, A
Quantitative Approach”, 4thEdition, Morgan Kaufmann;2006
2. Kai Hwang, “Advanced Computer Architecture Parallelism,
Scalability, Programmability”, 2ndEdition, Tata Mc Graw Hill, 2010
14
CO-PO Mapping
COs
CO1 2 - 2 3 2 ─ 3 2 2 2
CO2 1 3 3 2 3 ─ 2 3 2 1
CO3 3 3 2 3 2 ─ 2 3 - -
CO4 1 2 1 3 ─ 1 3 - -
CO5 2 1 2 1 2 ─ 1 3 3 3
CO-PSO Mapping
COs and
PSO-1 PSO-2 PSO-3
PSOs
CO-1 2 ─ ─
CO-2 - 2 ─
CO-3 ─ 1 ─
CO-4 2 ─ ─
CO-5 ─ 2 ─
15
UGCSA117: Object oriented Programming in JAVA

3L+0T+2P+4C MM:100

3. Course Title Object Oriented Programming in Java
4. Credits (L:T:P:C) 3:0:1:4
6. Prerequisites (if any) Programming in C
COURSE OBJECTIVES
This course covers Java and fundamental object oriented programming techniques. Java is
an object-oriented programming language that uses abstraction, encapsulation,
inheritance, and polymorphism to provide great flexibility, modularity, and reusability in
developing software. Students will learn programming with objects and classes, class
inheritance, polymorphism, exception handling, abstract classes, interfaces, Text I/O and
binary I/O.
COURSE OUTCOMES
CO1: Understand and implement fundamental object oriented programming techniques
and data types, variables, constants, assignments, expressions, and operators of Java
programming language. CO2: Understand and implement selection statements, loops,
mathematical functions, characters, and strings.
CO3: Understand and implement methods, arrays and recursion using Java.
CO4: Understand and implement object-oriented paradigm using abstraction,
encapsulation, inheritance, and polymorphism.
CO5: Understand and implement the inheritance, exception handling, abstract classes,
interfaces, Text I/O and binary I/O.
Unit No. Title of Unit Time Required for Unit (Hours)
1 Introduction to object 6
oriented programming
Techniques
2 Selection and Control statements 6
3 Objects Methods, 8
Arrays, Recursion
4 OOP Paradigm, String handling 6
5 Interfaces, Concurrency 6
16
COURSE CONTENT
Unit 1: Introduction to object oriented programming Techniques
(6L) Introduction, the Java Language Specification, API, JDK, and IDE, Creating, Compiling,
and Executing a Java Program, Developing Java Programs Using Net Beans/Creator.
Identifiers, Variables, Assignment Statements and Assignment Expressions, Named
Constants, Naming Conventions, Numeric Data Types and Operations, Numeric Literals,
Evaluating Expressions and Operator Precedence, Increment and Decrement Operators,
Numeric Type Conversions.
Unit 2: Selection Statements, Loops, Characters and Strings (6L)
Boolean Data Type, if Statements, Two-Way if-else Statements, Nested if and Multi-Way
if-else Statements, Logical Operators, switch Statements,
Conditional Expressions Operator Precedence and Associativity.
Common Mathematical Functions, Character Data Type and Operations,
the String Type. The while Loop, the do-while Loop, The for Loop, Nested Loops,
Keywords break and continue.
Unit 3: Methods, Arrays and Recursions (8L)
Defining a Method, Calling a Method, Passing Arguments by Values, Modularizing Code,
Overloading Methods, The Scope of Variables, Method Abstraction and Stepwise
Refinement.
Array Basics, Copying Arrays, Passing Arrays to Methods, Returning an Array from a
Method, Searching Arrays, Sorting Arrays, Two-Dimensional Array Basics,
Multidimensional Arrays. Recursion, writing recursive codes in Java.
Unit 4: Object Oriented Paradigm (6L)
Class Abstraction and Encapsulation, Thinking in Objects, Processing Primitive Data
Type Values as Objects, Types and, The Big Integer and Big Decimal Classes, The
String Class, The String Builder and String Buffer Classes. Superclass and Subclasses,
Using the super Keyword, Overriding Methods, Overriding vs. Overloading, The Object
Class and Its to String() Method, Polymorphism, Dynamic Binding, Casting Objects and
the instance of Operator, The Object’s equals Method, The Array List Class.
Unit 5: Abstract Classes and Interfaces, Threading (6L)
Exception- Handling Overview, Exception Types, the finally Clause, Defining Custom
Exception Classes. Abstract Classes, Interfaces, The Comparable Interface, Interfaces vs.
Abstract Classes. Text I/O Handled in Java, Text I/O vs. Binary I/O, Binary I/O
Classes Motivations and Benefits Defining Generic Classes and
Interfaces, Generic Methods. Processes and Threads, Thread Objects, Defining
and Starting a Thread, Pausing Execution with Sleep, Interrupts, Joins, Synchronization.
APPLET: Applet Fundamentals, designing and developing Applets.
TEXT BOOKS
1. Y. Daniel Liang, “Intro to Java Programming (Comprehensive Version)”, Pearson

Education; Tenth edition (2018), ISBN-10: 935306578X, ISBN-13: 978-9353065782
REFERENCE BOOKS
17
1. Herbert Schildt, “Java - The Complete Reference”, McGraw Hill Education;

Tenth edition (2017), ISBN-10: 9789387432291, ISBN-13: 978-9387432291
18
2. Joseph O’Neil and Herb Schildt, “Teach Yourself JAVA”, Publisher: TMH, Delhi.
3. Deitel and Deitel, “How to Program JAVA”, Publisher: PHI
CO-PO Mapping
COs
CO1 2 - 2 3 2 ─ 3 2 2 2
CO2 1 3 3 2 3 ─ 2 3 2 1
CO3 3 3 2 3 2 ─ 2 3 - -
CO4 1 2 1 3 ─ 1 3 - -
CO5 2 1 2 1 2 ─ 1 3 3 3
CO-PSO Mapping

CO1 1 - -
CO2 2 - -
CO3 3 - -
CO4 2 - -
CO5 1 - -
List of Experiments:

Module 1 Program in Java to design simple calculator for (+, -, *, and /) using switch
1
case
Module 1 Program in Java to design accounts class and two functions withdraw
2
() and deposit ().
3 Module 2 Program in Java to search a particular element in a one dimensional array.
Module 2 Program in Java to the concept of polymorphism by designing functions
4 to sum different type of numbers
Module 3 Program to show the concept of method overriding in Java.
5
Module 4 Program in Java that import the user define package and access the
6 Member variable of classes that Contained by Package.
7 Module 4 Program in Java to handle the Exception using try and multiple catch block.
8 Module 4 Program in Java demonstrating text I/O and binary I/O.
9 Module 5 Program in Java using Multi-threading
10 Module 5 Program in Java demonstrating Applet
19
Second
Year
Syllabus
20
BCA : Database Management System

3L+0T+2P+4C MM:100

3. Course Title Database Management System
4. Credits (L:T:P:C) 3:0:2:4
6. Prerequisites (if any) Programming in C/Python/Java
COURSE OBJECTIVES
This course aims to teach students on the role of a well-structured relational database
management system (RDBMS) to the efficient functioning of an organization. This
course covers theory and practice in designing a relational database management system
with example of a current database product of RDBMS. Students also learn about the
important concepts of database integrity, security and availability with techniques like
normalization, concurrency control and recoverability control.
COURSE OUTCOMES
On successful completion of the course, students will be able to achieve the
following:
CO1: Apply and create Relational Database Design process.

CO2: Analyze and design database using E-R data model by identifying entities, attributes
and relationships.
CO3: Experience on working in Relational database management system.
CO4: Able to create database and query the database for information
retrieval.
CO5: Able to design a database using Normalization and handling concurrency.
Unit No Title of Unit Time Required for

Unit (Hours)
1 Introduction 6
2 Relational Database Design 6
3 SQL 7
4 Normalization 7
5 Transaction and Concurrency 6
COURSE CONTENT
Unit 1: Introduction to Database System
(6L) Introduction: Data base System Applications, data base System VS file System,
Data Abstraction, Instances and Schemas, Relational Model & Other Models , Database
21
Languages, data base Users and Administrator, data base System Structure, Storage
Manager, the Query Processor, Two/Three tier architecture.
Unit 2: E-R modeling Data Base Design (6L)
E-R model: Basic concepts, Design Issues, Mapping Constraints, Attributes and
Entity sets, Relationships and Relationship sets, Keys, Entity-Relationship
Diagram, Weak Entity Sets, Extended E-R features.
Unit 3: Relational Model & SQL (7L)
Relational Model: Structure of relational Databases, Relational Algebra, Relational
Calculus, Extended Relational Algebra. SQL: Form of Basic SQL Query, Nested Queries,
Aggregative Operators, NULL values, Logical operators, Outer Joins, Complex Integrity
Constraints in SQL.
Unit 4: Database Design Concepts (7L)
Database Design: Schema refinement, Different anomalies in designing a Database,
Decompositions, Problem related to decomposition, Functional Dependency, Normalization
using functional dependencies,1NF, 2NF, 3NF & BCNF, Lossless join decomposition,
Dependency preserving Decomposition , Schemarefinement in Data base Design, Multi
valued Dependencies Closer properties of Multivalued dependency, Join dependency,
4NF, 5NF.
Unit 5: Transaction Management (6L)
Transaction-concepts, states, ACID property, schedule, serializability of schedules,
concurrency control techniques - locking, timestamp, deadlock handling, recovery- log
based recovery, shadow paging.
TEXT BOOKS
1. Raghurama Krishnan, and Johannes Gehrke, “Data base Management Systems”,
TATA Mc Graw Hill 3rd Edition,2014
2. Silberschatz, and Korth, “Data base System Concepts”, McGraw hill, 6th edition, 2013
3. Elmasri Navate, “Fundamentals of Database Systems”, Pearson Education,7th edition 2016
REFERENCE BOOKS
1. Peter Rob & Carlos Coronel, “ Data base Systems design,
Implementation, and Management” Course Technology Inc,
7thEdition, 2006.
2. C.J. Date, “Introduction to Database Systems”, Pearson Education, 8th edition, 2012
3. Hoffer J., Venkataraman, R. and Topi, H., “Modern Database Management”,
Pearson (2016) 12th edition.
22
List of Experiments
S. NO. EXPERIMENT NAME
1 Implementation of Data Definition language in Query Language.

2 Implementation of Data Manipulation in Query Language.
3 Insertion & Updation of records in Database table
4 Implementation of GROUP functions (avg, count, max, min, sum).
5 Execution of the various type of SET OPERATORS (Union, Intersect, Minus).
6 Apply the various types of Integrity Constraints on table.
7 Creation of various types of JOINS.
8 Implementation of Views and Indices in database.
9 Implementation of foreign key on database.
10 Modify the database structure and drop the record with structure.
CO-PO Mapping
CO PO1 PO2 PO3 PO4 PO5 PO6 PO7

and
PO
CO1 3 - - - - - -
CO2 2 - - - - - -
CO3 - 1 1 - 2 - -
CO4 - - - 2 - - -
CO5 - 1 2 - - - -
CO-PSO Mapping

CO1 2 - -
CO2 - 1 -
CO3 - 3 -
CO4 - 2 -
CO5 1 - -
23
MAT Probability and Statistics

L:3:T:1:P0:C:4 Max. Marks: 100
COURSE OBJECTIVES: Acquisition of the basic concepts of probability and statistical inference.
Probability provides an introduction to probability and its applications. Statistics provides an
introduction to statistical inference and its applications. The student will be able to analyze the
problems of engineering & industry using the techniques of testing of hypothesis, curve fitting and
draw appropriate inferences.
COURSE OUTCOME: The student would be able to:

CO1: Statistics provides an introduction to statistical inference and its
applications CO2: To understand the description of data using statistical
techniques
CO3: To understand the statistical methods involved in hypothesis testing
CO4: To understand the random variables, statistical expectation and its statistical and mathematical
properties.
CO5: To understand the concepts of regression and correlation analysis.
COURSE CONTENT
Unit 1: Introduction to Probability (7L)
History and evolution of statistics, types of data, important terminologies, contingency table, Random
variables, statistical properties of random variables, probability, trial, events, types of events, apriori
probability, limitations of classical probability, statistical or empirical probability, axiomatic approach
to probability, probability function, theorems on probabilities of events, law of probability theory,
Bayes theorem, application of Bayes Theorem.
Unit 2: Distribution (6L)

Binomial, Poisson and Normal distribution – related properties. Sampling Distribution: Populations
and samples-Sampling distributions of mean (known and unknown) proportions, sums and
differences.
Unit 2: Measures of Central Tendency and Dispersion (6L)

Descriptive Statistics, Mean: Arithmetic, Geometric and Harmonic means, mathematical relationship
among different means, median for raw data and grouped data, mode for raw data and grouped data,
relationship among mean, median and mode, measure of dispersion – standard deviation, variance,
covariance and its properties, coefficient of variation, quartiles, quartile deviation and mean deviation,
Mean absolute deviation.
Unit 4: Testing of Hypothesis: (6L)

Introduction to testing of hypothesis, Statistical assumptions, Level of significance, confidence level,
Type I Error, Type II error, Critical value, power of the test, Application of small sample test – t and
F test, Large Sample test – Z test in Data Science Industry with small use cases (application oriented).
Unit 5: Applied Statistics (7L)
24
Curve fitting: The method of least squares – Interfaces based on the least squares estimations –
Curvilinear regression – multiple regressions- correlation for univariate and bivariate distributions.
properties of correlation coefficients, significance of single correlation coefficient, significance of
multiple correlation coefficients, concepts of multiple correlation and partial correlation.
Text Book:
1. Fundamentals of mathematical statistics – SC Gupta and VK Kapoor, Sultan Chand & Sons
Publication, New Delhi
2. Introduction to probability Models, Ninth Edition – Sheldon M. Ross, ElsevierPublication,
Academic Press, UK
Reference Book:
1. Introduction to Probability and Statistics for Engineers and Scientists, Third Edition - Sheldon
M. Ross, Elsevier Publication, Academic Press, UK.
2. An introduction to Probability and Statistical Inference – George Roussas, Academic Press.
CO-PO Mapping
CO and PO1 PO PO3 PO4 PO5 PO6 PO7
PO 2
CO1 1 2 3 - - - -
CO2 - - 2 - - - -
CO3 - 2 - - - - -
CO4 2 - - - - - -
CO5 - 1 - - - - -
CO-PSO Mapping
CO1 1 - -
CO2 2 - -
CO3 2 - -
CO4 2 - -
CO5 1 - -
25
26
BCA : Operating Systems

3L+0T+2P+4C MM:100

3. Course Title Operating System
4. Credits (L:T:P:C) 3:0:1:4
6. Prerequisites (if any) Data Structures
COURSE OBJECTIVES
This course will introduce the core concepts of operating systems, such as processes and
threads, scheduling, synchronization, memory management, file systems, input and
output device management and security.
COURSE OUTCOMES
On successful completion of the course, students will be able:

CO1: Learn the general architecture & functioning of computers with operating system.
CO2: Describe, contrast and compare differing structures for operating systems.
CO3: Understand and analyze theory and implementation of: processes, and resource
control.
CO4: Understands physical and virtual memory, scheduling, I/O and files.
CO5: Use system calls for managing processes, memory and the file system.
Unit No Title of Unit Time Required for Unit (Hours)
1 OS concepts 6
2 Process management 6
3 Concurrent Processes 6
4 Memory management 7
5 File System and 7
IO Management
27
COURSE CONTENT
Unit 1: Introduction to Operating System. (6L)
Introduction: Components of a computer System, Operating system: User view & System
view, Evolutionof operating system, Single Processor & Multiprocessor systems, Real Time
System, Distributed Systems,Multimedia Systems, Handheld Systems.
Operating System Structure: Operating System Services, User Operating System Interfaces:
Command-Line and GUI, System Calls.
Unit 2: Management & Scheduling (6L)
Process Management: Process Concept, Process States, Process Transition Diagram,

Process Control Block (PCB).
CPU Scheduling: Scheduling Concepts, Performance Criteria, Scheduling Queues,
Schedulers, Scheduling Algorithms: Preemptive & Non Preemptive: FCFS, SJF, Priority,
Round-Robin
Unit 3: Concurrent Processes & Deadlocks (6L)
Concurrent Processes: Principle of Concurrency, Producer / Consumer Problem, Co-

operating Processes, Race Condition, Critical Section Problem, Peterson’s solution,
Semaphores, Classical Problem in Concurrency- Dining Philosopher Problem; Inter Process
Communication models and Schemes.
Deadlock: System Model, Deadlock Characterization, Prevention, Avoidance and Detection,
Recovery from deadlock.
Unit 4: Memory Management (7L)
Memory Management: Bare machine, Resident monitor, Multiprogramming with fixed

partition, Multiprogramming with variable partition, Multiple base register, Paging,
Segmentation, Virtual memoryconcept, Demand paging, Performance, Paged replaced
algorithm, Allocation of frames, Cache memory.
Unit 5: File Systems & I/O Management (7L)
File System: Different types of files and their access methods, various allocation methods.
I/O Management and Disk Scheduling: I/O Devices, Organization of I/O functions, Disk
Structure, Disk Scheduling (FCFS, SSTF, SCAN, C-SCAN, LOOK).
TEXT BOOKS
1. Silberschatz, Galvin and Gagne, “Operating Systems Concepts”, Wiley, 9th Edition 2018.
REFERENCES
1. Harvey M. Dietel, “An Introduction to Operating System”, Pearson Education ,1st
Edition 2009.
2. D M Dhamdhere, “Operating Systems: A Concept based Approach”, PHI. 3rd
Edition.2017.
3. Andrew S. Tenenbaum, “Modern Operating Systems”, Pearson Education Asia / PHI
28
CO-PO Mapping

and
PO
CO1 1 - - - - - -
CO2 2 - - - - - -
CO3 - 3 - - - - -
CO4 - - 2 - - - -
CO5 - - - - - 1 -
CO-PSO Mapping

CO1 2 - -
CO2 - - 2
CO3 2 - -
CO4 1 - -
CO5 2 - -
List of Experiments
S. No. EXPERIMENT NAME

1 Shell programming: - command syntax, write simple functions
- basic tests
2 Shell programming: – loops, patterns, – expansions, - substitutions
3 Write programs using the following system calls of UNIX operating system:
fork, exec, getpid, exit, wait, close, stat, opendir, readdir
4 Write programs using the I/O system calls of UNIX operating system (open, read,
write, etc)
Write a C/ Java programs to simulate UNIX commands like ls, grep, etc.
5 Write a program to simulate the concept of Dining Philosopher’s problem.
6 Write a program to simulate Banker’s algorithm.
29
Semester IV
BCA : Software Engineering

3L+0T+2P+4C MM:100

3. Course Title Software Engineering
4. Credits (L:T:P:C) 3:0:2:4
6. Prerequisites (if any) Programming in C/Python/Java
COURSE OBJECTIVES
Software Engineering (SE) comprises the core principles consistent in software construction and
maintenance: fundamental software processes and life-cycles. Knowledge of basic SW
engineering methods and practices, and their appropriate applications is necessary to ensure good
quality software.
COURSE OUTCOMES
CO1: Understand Software Life cycle models.
CO2: Methods and tools for requirement specifications, test, document and
maintenance.
CO3: Apply empirical technique and problem solving approaches for developing software.
CO4: Ability to manage developing large-scale software.
CO5: Ability to apply software testing principles and techniques.
Unit No Title of Unit Time Required for Unit(Hours)

1 SDLC Models 6
2 Software requirement specification 6
3 System design 8
4 Software project management 6
5 Testing 6
30
COURSE CONTENT
Unit 1: Software Development Life Cycle Models (6L)
Software Characteristics, Software Crisis, Software Engineering Processes, Software
Development Life Cycle (SDLC) Models: Water Fall Model, Prototype Model, Spiral Model,
Evolutionary Development Models, Iterative Enhancement Models, Agile Models. Computer-
aided software engineering (CASE), software reuse, component-based software development,
extreme programming.
Unit 2: Software Requirement Analysis and Specifications (6L)
Requirement Engineering Process: Elicitation, Analysis, Documentation, Review and
Management of User Needs, Data Flow Diagrams, Data Dictionaries, UML diagrams,
Software Requirement and Specifications, Functional and non-Functional requirements,
Software Prototyping, Feasibility Study, Information Modeling, Decision Tables, SRS
Document.
Unit 3: Software Design (8L)
Design: Basic Concept of Software Design, Architectural Design, Low Level Design:
Modularization, Design Structure Charts, Pseudo Codes, Flow Charts, Coupling and Cohesion
Measures, Design Strategies: Function Oriented Design, Object Oriented Design, Top-Down
and Bottom-Up Design. Software Measurement and Metrics: Various Size Oriented Measures:
Halestead’s Software Science, Function Point (FP) Based Measures, Cyclomatic Complexity
Measures.
Unit 4: Software Project Management (6L)
Project planning and Project scheduling, Software Metrics: Size Metrics like LOC, Token
Count, Function Count. Cost estimation using models like COCOMO. Software Reliability and
Quality Assurance: Reliability issues, Reliability metrics, reliability models, Software quality,
ISO 9000 certification for software industry, SEI capability maturity model.
Unit 5: Software Testing (6L)
Testing objectives, Testing Tools & Standards. Unit Testing, Integration Testing, Acceptance
Testing, Regression Testing, Top-Down and Bottom-Up Testing Strategies: Test Drivers and
Test Stubs, Path Testing, Structural Testing (White Box Testing), Functional Testing (Black
Box Testing).
Maintenance: Corrective and Perfective Maintenance, Maintenance Process, Maintenance
Models, Maintenance Cost, Software Re-Engineering, Reverse Engineering.
TEXT BOOKS
3. R. S. Pressman, “Software Engineering – A practitioner’s approach”, McGraw Hill Education.
4. K.K. Aggarwal & Yogesh Singh, “Software Engineering”, New Age International, 2nd Ed. 2006.
5. Pankaj Jalote, “Software Engineering”, Wiley India,2010
REFERENCE BOOKS
1. Rajib Mall, “Fundamentals of Software Engineering”, PHI Publication, 4th Edition, 2014.
2. Ian Sommerville, “Software Engineering”, Addison Wesley, 10th Edition, 2015
3. James Peter, W Pedrycz, “Software Engineering”, John Wiley & Sons, 2000
31
In this lab, students can use any open source CASE tool as per choice. Take any case study on any
automation system e.g. library management system, billing system, payroll system, bus reservation
system, gas agency management system, book-shop management system, students management
system etc. Then perform and document the following tasks:
1. Perform the feasibility study

2. Prepare and Document all the requirements as Software Requirement Specification
3. Design Sequence diagrams for project
4. Design Collaboration diagram
5. Design Data Flow Diagram for the project
6. Design Entity Relation Diagram for the project
7. Design Class diagram
8. Design at least 10 test cases for each module.
CO-PO Mapping

and
PO
CO1 - - 2 2 3 - -
CO2 - - - - 2 - -
CO3 - - - 2 - - -
CO4 - - 1 - - - -
CO5 - 1 - - - - -
CO-PSO Mapping

CO1 - 1 -
CO2 - 2 -
CO3 - 2 -
CO4 - 1 -
CO5 - 3 -
32
BCA : Computer Networks

3L+0T+2P+4C MM:100

3. Course Title Computer Networks
4. Credits (L:T:P:C) 3:0:1:4
6. Prerequisites (if any) Data Structures, Operating Systems
COURSE OBJECTIVES
The course is a foundation level course and provides an in-depth description of computer
networks. The main objective of this course is to introduce the fundamental concept of
computer networks, how to build a network, what are the software & hardware
requirements, how to analyze a network for performance, and how two computers
connected to a network communicate with each other.
COURSE OUTCOMES
On successful completion of the course, students will be able to:
CO1: Develop an ability to describe the computer network and how data
communication takes place between two computers connected to a network.
CO2: Understand the protocol layering architecture and the different functions of
each layer.
CO3: Identify the requirements for network design.
CO4: Apply the IPV4 addressing technique, including subnetting and routing.
CO5: Develop an ability to analyze a network and configure the various servers.

Unit (Hours)
1 Introduction 6
2 Physical and Data link layer 7
3 Network layer 7
4 Transport layer 7
5 Application layer 5
COURSE CONTENT
Unit 1: Introduction to Computer Networks: (6L)

Data Communication and Network Fundamentals: Components of a Data
Communication System, Data Flow, Types of Computer Network, Network Topology,
Token Bus, Token Ring, FDDI, IEEE standards 802.2, 802.3, 802.5. Hubs, Bridges,
Routers and Gateways Network
33
Protocols, Network Model and Layering Architecture: Network core: Packet Switch and
Circuit Switch Network. OSI and TCP/IP model.
Unit-2: Physical and Data Link Layer: (7L)
Physical Layer: Introduction to Physical Layer, Data and Signals, Analog and Digital
Signal, Transmission Modes: Parallel and serial, Digital-to-Analog Conversion,
Analog- to-Analog Conversion, Multiplexing: FDM, WDM, TDM, Transmission
Media: Guided and Unguided Media.
Data Link Layer: Introduction to Data Link Layer, Services provided by the Data Link
Layer, Error- Detection and Correction Techniques, CRC, Checksum, Media Access
Control: Random access protocol,Controlled Access Protocol, Ethernet and Ethernet
Protocol.
Unit 3: Network Layer: (7L)
Introduction to Network Layer, Network Layer Services, Logical Addressing, IPV4
addresses: classful and classless, Subnetting, Delivery and Forwarding of Packets:
Direct Delivery, Indirect Delivery, Routing, Structure of a Router and switching
techniques, Network Layer Protocols like ARP, RARP, ICMP etc. Unicast Routing
Protocol: RIP, OSPF,BGP, Multicast Routing Protocol.
Unit 4: Transport Layer: (7L)
Introduction and Transport Layer Services: Process-to-Process Communication,
Encapsulation and Decapsulation, Datagrams and virtual circuits, Flow Control, Error
Control, Congestion Control, Connection-less and Connection-oriented services,
Transport Layer Protocol: Simple protocol, Stop-and-wait protocol, Go-back-N
protocol, Selective-repeat protocol, TCP and UDP.
Unit 5: Application Layer: (5L)
Introduction to Application Layer, Application Architecture: Client-Sever, Peer-to-Peer,
Process Communication, Client-Server communication Interface: Socket, Using the
services of Transport Layer, Application Layer Protocols: HTTP, FTP, SMTP, POP,
IMAP, DNS.
TEXTBOOK(S)
1. Behrouz Forouzan, “Data Communications, and Networking”,
McGraw Hill Education; 4thEdition (2017).
2. James F. Kurose and Keith W. Ross, “Computer Networking: A Top-Down
Approach”, Pearson Education; Sixth edition (2017)
REFERENCE BOOKS
1. Andrews S. Tanenbaum, David J Wetherall, “Computer Networks”, Pearson
Education; 5th Edition, 2013
2. Peterson, Larry L., and Bruce S. Davie, “Computer networks: a systems approach”,
Elsevier, 2007.
34
List of Experiments
S. NO. EXPERIMENT NAME

1 Familiarization with networking components and devices LAN adapter,
Hub, Switches, Routers etc.
2 Simulate a network having 4 communication nodes with one switch.
3 Familiarization with Transmission media and tools: Co-axial cable, UTP
cable, Crimping tool, Connectors etc
4 Configuration of TCP/IP protocols in Window/LINUX
5 Simulate a network using Star Topology Using Cisco packet Tracer.
6 Simulate a network using Bus Topology Using Cisco packet Tracer.
7 Introduction to various interior and exterior routing protocols using Cisco tool.
8 Troubleshooting Commands of Networking (ping, traceroute, nslookup etc.)
9 Create a DHCP server
10 Writing a TCP Client, Writing a TCP Server and Communicate some data over
TCP
CO-PO Mapping

and
PO
CO1 - 1 2 - - - 2
CO2 - 1 - - - 1 -
CO3 - - 2 - - - -
CO4 - 1 - - - - -
CO5 - - 1 - - 1 -
CO-PSO Mapping

CO1 1 - -
CO2 2 - -
CO3 3 - -
CO4 2 - -
CO5 1 - -
35
BCA : Computer Multimedia and Animation

3L+0T+2P+4C MM:100
1. Department offering the course Computer Science Applications

3. Course Title Computer Multimedia and Animation
4. Credits(L:T:P:C) 3:0:2:4
5. Contact Hours(L:T:P) 3:0:2
6. Prerequisites (if any) Introduction to Computers
7. Course Category Department Core
COURSE OBJECTIVES
This course is design to cover Designing graphic computing techniques to plan, develop, evaluate and
manage a solution to a particular problem based on graphic systems using Flash. Implement and
evaluate graphic‐system techniques to plan, develop, evaluate, and manage a solution to a particular
problem based on virtual environments by Flash. Creating amative works different design logics.
Evaluating Macromedia Motion movies using different tool mechanisms.
COURSE OUTCOMES
After completion of this course students will be able to: -
CO1: Apply the knowledge of the basic fundamental’s components of
Multimedia. CO2: To apply the animatic effects for basic multimedia formats.
CO3: Identify about compression and applying the video settings.
CO4: Effective learning about hardware components and software tool
devices. CO5: Functioning and creating of webpage with all the applications.

Unit (Hours)
1 Introduction to Multimedia 6
2 Multimedia file handling 6
3 Digital video and image compression 6
4 Hardware, software and multimedia authoring 7
tools
5 Multimedia and internet 7
36
COURSE CONTENT
Unit 1: Introduction to Multimedia (6L)

Introduction to making Multimedia‐ Multimedia Skills and training‐ Text: Using text in
Multimedia‐ Computer and Text‐ Font Editing and Design Tools‐ Hypermedia and Hypertext.
Unit 2: Multimedia file handling (6L)
Sound – Perception of sound, hearing sensitivity, frequency range, sound- wave length, the speed
of sound. Images –image file formats and how and where it is used. Animation – Principles of
animation,2D and 3D animation. Video - different types of video camera including Handy
Camera.
Unit 3: Digital video and image compression (7L)
Evaluating a compression system – Redundancy and Visibility‐Video compression techniques‐
Standardization of an algorithm – The JPEG image compression standard‐ITU –T Standards –
MPEG motion video compression standard‐DVI Technology.
Unit 4: Hardware, software and multimedia authoring tools (6L)
Multimedia Hardware: Macintosh and Windows production Platforms‐Hardware Peripherals:
Memory and Storage Devices, Input Devices, Output Devices, Communication Devices. Basic
Software Tools.
Unit 5: Multimedia and internet (6L)
Internetworking –connections –Internet services –Tools for WWW – Designing WWW.
Text Books:
1. Multimedia: Making It Work, Tay Vaughan, 7th Edition, Tata Mc‐Graw Hill., 2008.
2. Multimedia Systems, John F.Koegel Buford, Pearson edition, 2003.
3. Ranjan Parekh, Principles of Multimedia, TMH, 2006.
Reference Books:
1. Multimedia: Computing, Communication and applications, Ralf Steinmetz and Klara
Nahrstedt, Pearson Edition, 2001.
2. Multimedia: Making It Work, Tay Vaughan, 7th Edition, Tata Mc‐Graw Hill., 2008.
37
S. NO. EXPERIMENTNAME
1 Create a simple painting program using Flash or equivalent.
2 Create a simple animated banner using Flash or equivalent.
3 Design an object dragging program.
4 Prepare a photo album using Flash or equivalent.
5 Create animated buttons which is used for web design using Adobe Photoshop or
equivalent.
6 Design image mapping using Flash or equivalent.
7 Create image morphing using adobe Photoshop or equivalent.
8 Make animations using macromedia Flash or equivalent.
9 Create animated Gifs for use as banners, titles and buttons.
10 To perform image editing using basic tool, masking effect and rendering effects using
Photoshop or equivalent
CO-PO Mapping
CO and PO1 PO2 PO3 PO4 PO5 PO6 PO7

PO
CO1 - 1 2 - - - 2
CO2 - 1 - - - 1 -
CO3 - - 2 - - - -
CO4 - 1 - - - - -
CO5 - - 1 - - 1 -
CO-PSO Mapping

CO1 1 - -
CO2 2 - -
CO3 - - -
CO4 2 - -
CO5 1 - -
38
Third
Year
Syllabus
39
Semester V
BCA : Cyber Security and Cryptography
3L+0T+2P+4C MM:100

3. Course Title Information Security
4. Credits (L:T:P:C) 3:0:2:4
6. Prerequisites (if any) Basic knowledge of Computer Network
COURSE OBJECTIVES
This course aims to give an outline of information security. The course will equip students with a
vibrant view of the existing information security landscape including fundamentals of cryptography
and its application to network security.
COURSE OUTCOME
The student would be able to:
CO1: Understand and explain the risks faced by computer systems and networks.
CO2: Use cryptography algorithms and protocols to achieve computer security.
CO3: Explain how standard security mechanisms work.
CO4: Develop security mechanisms to protect computer systems and networks
CO5: Acquire background on hash functions; authentication; firewalls; intrusion detection techniques

Unit (Hours)
1 Introduction to Information Security 5
2 Conventional Cryptographic Techniques 6
3 Message Authentication 6
4 Authentication Application 6
5 Security in Networks 7
Detailed Syllabus
Unit 1: Introduction to Cyber Security (5L)

Introduction to Information Security: Attacks, Vulnerability, Security Goals, Security Services and
mechanisms. introduction to cryptography -Conventional Encryption: Conventional encryption
model, classical encryption techniques- substitution ciphers and transposition ciphers, cryptanalysis,
40
stereography, stream and block ciphers.
41
Unit 2: Conventional Cryptographic Techniques (6L)

Shannon’s theory of confusion and diffusion, Symmetric and Asymmetric Cryptographic
Techniques: DES, AES, RSA algorithms. triple DES, IDEA encryption and decryption, strength of
IDEA, confidentiality using conventional encryption, traffic confidentiality, key distribution, random
number generation.
Unit 3: Message Authentication and Hash Function (6L)
Authentication requirements, authentication functions, message authentication code, hash functions,
birthday attacks, security of hash functions and MACS, MD5 message digest algorithm, Secure hash
algorithm (SHA). Digital Signatures: Digital Signatures, authentication protocols, digital signature
standards (DSS), proof of digital signature algorithm
Unit 4: Authentication Applications (6L)
Use of Cryptography for authentication, Secure Hash function, Key management - Kerberos and
X.509, directory authentication service, electronic mail security-pretty good privacy (PGP), S/MIME.
Unit 5: Security in Networks (7L)
Network Security Controls – Architecture, Encryption, Content Integrity, Strong Authentication,
Access Controls, Firewalls – Design and Types of Firewalls, Personal Firewalls, IDS, Email Security
– PGPS/MIME.
Web Security: Secure socket layer and transport layer security, secure electronic transaction (SET).
System Security: Intruders, Viruses and related threads, firewall design principals, trusted systems
Text/Reference Books:
1. Charles P. Pfleeger, “Security in Computing”, Fourth Edition, Pearson Education
2. William Stallings, “Cryptography And Network Security Principles And Practice”, Fifth Edition,
, Pearson
3. Wenbo Mao, “Modern Cryptography: Theory and Practice”, Prentice Hall.
4. William Stallings, “Network Security Essentials: Applications and Standards” Prentice Hall.
List of Experiments
S. No. EXPERIMENT NAME
1 Implement the encryption and decryption of 8-bit data using ‘Simplified DES
Algorithm’ in ‘C’.
2 Implement RSA algorithm for encryption and decryption in ‘C’.
3 Configure a mail agent to support Digital Certificates, send a mail and verify
the correctness of this system using the configured parameters.
4 Configure SSH (Secure Shell) and send/receive a file on this connection to
verify the correctness of this system using the configured parameters.
5 Configure a firewall to block the following for 5 minutes and verify the
correctness of this system using the configured parameters: (a) Two
neighborhood IP addresses on your LAN (b) All ICMP requests (c) All TCP SYN
Packets
42
CO-PO Mapping

and
PO
CO1 2 2 - - - - -
CO2 2 2 - 1 - - -
CO3 2 2 - - - -
CO4 2 1 - - - - -
CO5 2 1 - - - 1 -
CO-PSO Mapping

CO1 1 1 -
CO2 2 2 -
CO3 2 2 -
CO4 2 2 -
CO5 - - -
43
BCA : Software Testing

3L+0T+2P+4C MM:100

3. Course Title Software Testing
6. Prerequisites (if any) Software Engineering
COURSE OBJECTIVES
The course covers the fundamentals of software testing, including testing as an engineering
activity, the testing process, and testing maturity models. By the end of the course, students will
have a solid understanding of the principles and practices of software testing, and will be prepared
to apply that knowledge to real-world software development projects. They will also have gained
valuable skills in test case design, test management, and test automation, which will be highly
valuable in the software development industry.
COURSE OUTCOMES
CO1: Recall and explain the basic concepts of software
testing
CO2: Analyze the importance of testing as an engineering activity and testing as a process.
CO3: Evaluate the effectiveness of testing maturity model and testing axioms using
Bloom's Evaluating level
CO4: Design and implement test management and test processes, including reporting test
results, introducing the test specialist, and building a testing group.
CO5: Analyze the skills needed for automation and the scope of automation.
OUTLINE OF THE COURSE:

Unit No. Title of Unit Time Required for Unit
(Hours)
1 Introduction to Software Testing 6
2 Test Case Design Strategies 6
3 Levels of Testing 6
4 Test Management 7
5 Test Automation 7
COURSE CONTENT
Unit 1: Introduction to Software Testing (6L)

Testing as an Engineering Activity – Testing as a Process – Testing Maturity Model- Testing
44
45
axioms – Basic definitions – Software Testing Principles – The Tester ‘s Role in a Software
Development Organization – Origins of Defects – Cost of defects – Defect Classes – The Defect
Repository and Test Design –Defect Examples- Developer/Tester Support of Developing
Unit 2: Test Case Design Strategies (6L)
Test case Design Strategies – Using Black Box Approach to Test Case Design – Boundary Value
Analysis – Equivalence Class Partitioning – State based testing – Cause-effect graphing –
Compatibility testing – user documentation testing – domain testing – Random Testing –
Requirements based testing – Using White Box Approach to Test design – Test Adequacy Criteria
– static testing vs. structural testing – code functional testing – Coverage and Control Flow Graphs
– Covering Code Logic – Paths – code complexity testing – Additional White box testing
approaches- Evaluating Test Adequacy Criteria
Unit 3: Level of Testing (6L)
The need for Levels of Testing – Unit Test – Unit Test Planning – Designing the Unit Tests – The
Test Harness – Running the Unit tests and Recording results – Integration tests – Designing
Integration Tests – Integration Test Planning – Scenario testing – Defect bash elimination System
Testing – Acceptance testing – Performance testing – Regression Testing – Internationalization
testing – Ad-hoc testing – Alpha, Beta Tests – Testing OO systems – Usability and Accessibility
testing – Configuration testing –Compatibility testing – Testing the documentation – Website
testing.
Unit 4: Test Management (7L)
People and organizational issues in testing – Organization structures for testing teams – testing
services – Test Planning – Test Plan Components – Test Plan Attachments – Locating Test Items –
test management – test process – Reporting Test Results – Introducing the test specialist – Skills
needed by a test specialist – Building a Testing Group- The Structure of Testing Group- The
Technical Training Program
Unit 5: Test Automation (7L)
Software test automation – skills needed for automation – scope of automation – design and
architecture for automation – requirements for a test tool – challenges in automation – Test metrics
and measurements – project, progress and productivity metrics
1. Software Testing – Principles and Practices, Srinivasan Desikan and Gopalaswamy
Ramesh,Pearson Education, 2006
2. Software Testing, Ron Patton, 2nd Edition, Sams Publishing, Pearson Education, 2007
3. Practical Software Testing, Ilene Burnstein, Springer, Springer International Edition, 2003
Sr. NO. EXPERIMENTNAME

1 To study Grading System (grades: Distinction, First Class, Second Class, Third
Class, Fail, Absent) based on marks
2 Write a C/C++/Java Program. Write set of test cases to test the program (test Link)
46
Based on testing assign PASS/ FAIL results. Generate test report

3 Triangle program (categorize type of triangle) based on sides and angles give in the
input
4 Write a C/C++/Java Program. Write set of test cases to test the program (test Link)
Generate test report
5 To study any open source-testing tool (e.g. Test Link)
6 Create a testplan document for any application (e.g. Library Management System)
8 Prime Number generation. Write a C/C++/Java Program. Write set of test cases to
test the program (test Link). Generate test report
9 Write the test cases for any known application (e.g. Banking application)
10 Write the test cases for FACEBOOK, TWITTER etc.
CO-PO Mapping
COs
and
POs PO-1 PO-2 PO-3 PO-4 PO-5 PO-6 PO-7
CO1 1 2 - - 2 ─ ─
CO2 1 2 - 2 2 ─ ─
CO3 2 - - 2 2 ─ ─
CO4 - 2 - - - ─ ─
CO5 - 1 2 2 2 ─ ─
CO-PSO Mapping
COs and
PSO-1 PSO-2 PSO-3
PSOs
CO-1 3 - 1
CO-2 2 - 1
CO-3 2 - ─
CO-4 3 - ─
CO-5 3 - 1
47
Semester VI
BCA 305: Advanced Internet Technologies

3L+0T+2P+4C MM:100

3. Course Title Advanced Internet Technologies
6. Prerequisites(if any) Web Page Design and Development
COURSE OBJECTIVES
The course covers a wide range of topics related to advanced internet technologies, including internet
and networking basics, web development technologies and security, PHP, JSON, and XML.By the
end of the course, students will have a solid understanding of advanced internet technologies and will
be able to apply this knowledge to build functional and secure web applications, as well as to work
with JSON and XML data.
COURSE OUTCOMES
CO1: Understand the basics of web system architecture, including the roles of clients, servers, and
browsers
CO2: Be familiar with the concepts of web sockets, Progressive Web Apps (PWA), and serverless
web applications.
CO3: Understand how to use PHP session and cookie variables, as well as HTTP environment
variables
CO4: Understand JSON schema and how to validate JSON data against a schema
CO5: Be familiar with tools and techniques for parsing and processing XML data in various
programming languages.

(Hours)
1 Internet and Networking Basics 6
2 Web Development Technologies and 6
Security
3 Introduction to PHP 6
4 Test Automation JSON 7
5 XML (EXtensible Markup Language) 7
48
COURSE CONTENT
Unit 1: Internet and Networking Basics (6L)
Overview of Internet, History of Internet, Web System Architecture, URL (Uniform Resource
Locator), HTTP Protocol Basics, HTTP Request and Response, Cookies, TCP/IP Protocol Suite,
Domain Name System (DNS), Routing Protocols, Network Address Translation (NAT), Virtual
Private Networks (VPNs)
Unit 2: Web Development Technologies and Security (6L)
Development: HTML5 and CSS3, JavaScript Frameworks (Angular, React, Vue.js), Web Services
(REST, SOAP), Web Components, Single Page Applications (SPA), Web sockets, Progressive Web
Apps (PWA), Serverless Web Applications, Web Security concepts: Integrity, Confidentiality,
Availability, HTTP Authentication
Unit 3: Introduction to PHP (6L)
Introduction, Obtaining, Installing and Configuring PHP, PHP Language Core,PHP Session and
cookie variables, Sending E-mail, PHP and HTTP environment variables,Processing HTML Forms
using get and post database Operations with PHP
Unit 4: Test AutomationJSON (7L)
Introduction to JSON: What is JSON, its features, and benefits, Rules and conventions for writing
JSON data,Creating JSON objects and accessing their properties, Creating JSON arrays and
manipulating them, Parsing JSON data using JavaScript and other programming languages,
Converting JSON data to and from other data formats such as XML or CSV, Understanding JSON
schema and validating JSON data against a schema, Building RESTful web services that use JSON
for data exchange.
Unit 5: XML (EXtensible Markup Language) (7L)
Introduction, Objectives, An Overview of XML, An Overview of SGML, Difference between SGML

and XML, XML Development Goals, The Structure of the XML Document, Using DTD with XML
document, XML Parser, XML Entities
1. W. Richard Stevens and Gary R. Wright, “TCP/IP Illustrated, Volume 1: The Protocols"
2. Jennifer Robbins, "Learning Web Design: A Beginner's Guide to HTML, CSS, JavaScript, and
Web Graphics" by
3. Josh Lockhart, “Modern PHP: New Features and Good Practices"
4. SriparnaSaha, “JavaScript and JSON: Essentials"
5. Alex Grinberg, “XML and JSON Recipes for SQL Server: A Problem-Solution Approach"
49
1 Set up and configure a virtual private network (VPN) using a free VPN service
2 Use JavaScript to create a basic "to-do" list application
3 Implement HTTPS encryption on a website using a free SSL/TLS certificate
4 Create a basic PHP script that displays the current date and time
5 Create a login system using PHP and MySQL
6 Create a JSON file that stores information about a list of books
8 Use JavaScript to read and parse a JSON file and display the results on a web page
9 Create a simple XML file that stores information about a list of customers
10 Use PHP to read and parse an XML file and display the results on a web page
CO-PO Mapping
COs
and
CO1 2 2 - - 1 ─ ─
CO2 1 1 2 2 - ─ ─
CO3 2 - - 1 2 ─ ─
CO4 2 2 - - - ─ ─
CO5 2 1 1 1 2 ─ ─
CO-PSO Mapping
COs and
PSO-1 PSO-2 PSO-3
PSOs
CO-1 2 1 1
CO-2 2 1 1
CO-3 2 - ─
CO-4 1 1 ─
CO-5 1 2 1
50
BCA : Mobile Application Development

3L+0T+2P+4C MM:100

2. Course Code
3. Course Title Mobile Application Development
6. Prerequisites(if any) Web Page Design and Development
COURSE OBJECTIVES
This course is designed to introduce and familiarize students with programming in the Android
environment. It starts with an examination of the basic components and concepts that define the
Android platform, and then moves on to cover the specific structure that comprises an Android
application. An overview of the most common tools and techniques for writing Android applications
is included.
COURSE OUTCOMES
CO1: Understand the basics of Android app development, including the Android ecosystem and
architecture.
CO2: Design and develop simple Android applications using various components and UI elements.
CO3: Implement user interactions, data storage, and user interface layout for Android applications.
CO4: Utilize debugging and testing techniques to identify and resolve issues in Android applications.
CO5: Demonstrate knowledge of publishing Android applications and adhering to app development
best practices.

(Hours)
1 Introduction to Android App Development 6
2 Android Application Components 6
3 User Interface (UI) Design in Android 6

4 Data Storage and Retrieval in Android 7
5 Testing, Debugging, and Deployment 7
51
COURSE CONTENT
Unit 1: Introduction to Android App Development

Introduction to Android Platform, Android Stack, Android Versions and Installing, Android SDK and
updating SDK components, Android Studio, Using the Emulator, Android vs. Other mobile platforms.
Unit 2: Android Application Components

Application Life Cycle ,Application Components ,Activity life cycle, Manifest File, Layout XML Code,
Strings , the R File, Java Source Code, Java based layout vs. xml based layout ,Eclipse Visual Layout Editor,
Logging ,UI Design for Android ,Using different layouts – Linear Layout and Table Layout etc. ,Drawable
Resources ,Resolution and density independence ,Working with common widgets ,Working with List View
and Adapters, Creating and using option menu, Working with preferences ,Working with Dialogs and Toasts,
Working with Graphics and Animation
Unit 3: User Interface (UI) Design in Android

Introducing Intents: Intents, Intent filters, Invoking activities by class name and URI, Sharing data using
Extras Bundle and URI parameters, working with Tabs and Fragments. Files and Database: Using File
System ,Introducing SQLite on Android, Database Connectivity, Cursors and content values, Using Content
Provider to share data , Understanding Security model.
Unit 4: Data Storage and Retrieval in Android

Data storage and retrieval in Android applications, Shared Preferences, SQLite for managing databases
within an Android app, Reading and writing files to internal and external storage, an introduction to cloud-
based data storage options for scalable applications.
Unit 5: Testing, Debugging, and Deployment

Testing, debugging, and deploying Android applications, compatibility and functionality. debugging
techniques, performance optimization, preparing an Android application for release and uploading it to the
Google Play Store, adhering to best practices and guidelines for successful app deployment.
Text Books:
6. W. Richard Stevens and Gary R. Wright, “TCP/IP Illustrated, Volume 1: The Protocols"
7. Jennifer Robbins, "Learning Web Design: A Beginner's Guide to HTML, CSS, JavaScript, and
Web Graphics" by Josh Lockhart, “Modern PHP: New Features and Good Practices"
Reference Books:
1. SriparnaSaha, “JavaScript and JSON: Essentials"
2. Alex Grinberg, “XML and JSON Recipes for SQL Server: A Problem-Solution Approach"
52
1 Creating a basic Android application with multiple Activities and navigating between them.
2 Implementing user input validation and handling in an Android application.
3 Working with Fragments and understanding their lifecycle.
4 Building a simple Android app with SQLite database integration.
5 Designing a UI layout for different screen sizes using Constraint Layout.
6 Implementing a Broadcast Receiver to handle system events.
8 Storing and retrieving data using Shared Preferences in an Android app.
9 Debugging and fixing common issues in an Android application.
10 Testing an Android application on an emulator and a physical device.
CO-PO Mapping
COs
and
CO1 2 2 - - 1 ─ ─
CO2 1 1 2 2 - ─ ─
CO3 2 - - 1 2 ─ ─
CO4 2 2 - - - ─ ─
CO5 2 1 1 1 2 ─ ─
CO-PSO Mapping
COs and
PSO-1 PSO-2 PSO-3
PSOs
CO-1 2 1 1
CO-2 2 1 1
CO-3 2 - ─
CO-4 1 1 ─
CO-5 1 2 1
53
54

BCA NEP Core Syllabus

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

BCA NEP Core Syllabus

Uploaded by

Copyright:

Available Formats

Vivekananda Global University, Jaipur

UGCSA102: Introduction to Computers & Programming

1. Department offering the course Computer Science and Application

OUTLINE OF THE COURSE

Unit No. Title of Unit Time Required for

Unit 2: C Basics, Operators, Loops (6L)

Unit 3: Arrays & Functions (7L)

Unit 4: Structure and Union (6L)

Unit 5: Pointers & File handling (6L)

S. NO. MODULE EXPERIMENT NAME

UGCSA104: Web Page Design and Development

3L+0T+2P+4C MM: 100

1. Department offering the course Computer Science and Application

Unit No. Title of Unit Time Required for

Unit 1: Introduction to the Internet and WWW (5L)

Introduction, History of internet, Internet Design Principles, Internet Protocols - FTP,

Unit 2: Developing Web pages using HTML (8L)

Introduction to HTML, HTML Documents, Basic structure of an HTML document.

Unit 3: Introduction to Cascading Style Sheets (6L)

Unit 4: Working with Java Script (6L)

Introduction to JavaScript: Data types, variables, operators, expressions, statements,

S. NO. MODULE EXPERIMENT NAME

Module 4 Design a web page to perform mathematical calculations such as addition,

UGMAT103: MATHEMATICAL FOUNDATION

CO1: Capable of inquiring and understanding a wide range of concepts in mathematics.

OUTLINE OF THE COURSE

COs and PSOs PSO-1 PSO-2 PSO-3

UGCSA112: Data Structures Using C

1. Department offering Computer Science and Application

OUTLINE OF THE COURSE

Unit No Title of Unit Time Required for Unit

TEXT BOOK (S)

CO and PSO PSO1 PSO2 PSO3

S. NO. MODULE EXPERIMENT NAME

UGCSA113: Computer Systems Organization

3L+1T+0P+4C MM: 100

1. Department offering the course Computer Science and Application

On successful completion of the course students will be able to -

Unit No. Title of Unit Time Required for Unit (Hours)

1 Fundamental of Computer Design 6

Unit 1: Fundamental of Computer Design (6L)

UGCSA117: Object oriented Programming in JAVA

1. Department offering the course Computer Science and Application

Unit No. Title of Unit Time Required for Unit (Hours)

Unit 1: Introduction to object oriented programming Techniques

1. Y. Daniel Liang, “Intro to Java Programming (Comprehensive Version)”, Pearson

1. Herbert Schildt, “Java - The Complete Reference”, McGraw Hill Education;

CO and PSO PSO1 PSO2 PSO3

S. NO. MODULE EXPERIMENT NAME

BCA : Database Management System

1. Department offering the course Computer Science and Application

CO1: Apply and create Relational Database Design process.

OUTLINE OF THE COURSE

Unit No Title of Unit Time Required for

Unit 1: Introduction to Database System

S. NO. EXPERIMENT NAME

1 Implementation of Data Definition language in Query Language.

CO PO1 PO2 PO3 PO4 PO5 PO6 PO7

CO and PSO PSO1 PSO2 PSO3

MAT Probability and Statistics

COURSE OUTCOME: The student would be able to:

Unit 2: Distribution (6L)

Unit 2: Measures of Central Tendency and Dispersion (6L)