BABU BANARASI DAS UNIVERSITY, LUCKNOW

Department of Mathematics & Computer Science

School of Basic Sciences
B.Sc. (Hons./Hons. with research) Computer Science
(Effective from Academic Session 2023-24, as per NEP-2020)

Major Project/ Dissertation/

Apprenticeship/ Internship/
Major Elective Course (DSE)

Outreach/ MOOC (AIPCM)

General Proficiency (GP) /

Co-Curricular Course (CC)
Major Core Course (DSC)

Vocational Course (VC)

Project/ Community
Minor Course (GE)

Academic Project

Total Credit
Semester

4 Credits

4 Credits

3 Credits

2 Credits

2 Credits

6 Credits

Seminar
1 Credit
4 Cr

DSC1
I DSC2 GE1 CC1 VC1 1 22
DSC3
DSC4
II DSC5 GE2 CC2 VC2 1 22
DSC6
DSC7
III DSC8 GE3 CC3 VC3 Or AIPCM 1 22
DSC9
DSC10
IV DSC11 GE4 CC4 VC4 Or AIPCM 1 22
DSC12
DSC13
V DSC14 DSE1 GE5 VC5 Or AIPCM 22
DSC15
DSC16 Project/
VI DSC17 DSE2 GE6 Dissertation 22
DSC18 2 Credit
Three DSE or Dissertation/
Two DSE and Academic
VII DSC19 One GE or Project/ 22
One DSE and Internship
Two GE
Three DSE or Dissertation/
Two DSE and Academic
VIII DSC20 One GE or Project/ 22
One DSE and Internship
Two GE
 List of Discipline Specific Core (DSC) Courses

Course Contact Hours Marks Exam

DSC Course Name Cr
Code L T P CIA ESE Total Hrs.

Computer Fundamentals
DSC1 NBSC3101 & Programming 3 1 - 40 60 100 4 3
Technique
NBSC3102 Programming using C 3 - - 40 60 100 3 3
DSC2 Programming using C
NBSC3151 - - 2 40 60 100 1 3
LAB
Computer Organisation &
DSC3 NBSC3103 3 1 - 40 60 100 4 3
Architecture
NBSC3201 Data Structure using C 3 - - 40 60 100 3 3
DSC4 Data Structure using C
NBSC3251 - - 2 40 60 100 1 3
LAB
DSC5 NBSC3202 Operating System 3 1 - 40 60 100 4 3
DSC6 NBSC3203 Computer Networks 3 1 - 40 60 100 4 3
NBSC3301 Java Programming 3 - - 40 60 100 3 3
DSC7 NBSC3351 Java Programming LAB - - 2 40 60 100 1 3
DSC8 NBSC3302 Discrete Structures 3 1 - 40 60 100 4 3
Design & Analysis of
DSC9 NBSC3303 3 1 - 40 60 100 4 3
Algorithms
Database Management
NBSC3401 3 - - 40 60 100 3 3
System
DSC10
Database Management
NBSC3451 - - 2 40 60 100 1 3
System LAB
Programming Concept
NBSC3402 3 - - 40 60 100 3 3
with Python
DSC11 Python Programming
NBSC3452 - - 2 40 60 100 1 3
LAB
DSC12 NBSC3403 Artificial Intelligence 3 1 - 40 60 100 4 3
NBSC3501 Web Technologies 3 - - 40 60 100 3 3
DSC13 NBSC3551 Web Technologies LAB - - 2 40 60 100 1 3
Information Security and
DSC14 NBSC3502 3 1 - 40 60 100 4 3
Cyber Law
DSC15 NBSC3503 Software Engineering 3 1 - 40 60 100 4 3
DSC16 NBSC3601 Machine Learning 3 1 - 40 60 100 4 3
DSC17 NBSC3602 Cloud Computing 3 1 - 40 60 100 4 3
DSC18 NBSC3603 Soft Computing 3 1 - 40 60 100 4 3
DSC19 NBSC3701 Internet of Things 3 1 - 40 60 100 4 3
DSC20 NBSC3801 Digital Image Processing 3 1 - 40 60 100 4 3
 List of Discipline Specific Elective (DSE) Courses

Contact Hours Marks Exa

DSE Course Code Course Name Cr m
L T P CIA ESE Total Hrs.
Fundamental of Data
DSE1A NBSCE3501 3 1 - 40 60 100 4 3
Science
DSE1B NBSCE3502 Computer Vision 3 1 - 40 60 100 4 3

DSE1C NBSCE3503 Block chain Technology 3 1 - 40 60 100 4 3

DSE2A NBSCE3601 E-Commerce 3 1 - 40 60 100 4 3

Management Information
DSE2B NBSCE3602 3 1 - 40 60 100 4 3
System
DSE2C NBSCE3603 Research Methodologies 3 1 - 40 60 100 4 3

DSE3A NBSCE3701 Big Data Analysis 3 1 - 40 60 100 4 3

Data mining & Ware
DSE3B NBSCE3702 3 1 - 40 60 100 4 3
Housing
Distributed Data Base
DSE3C NBSCE3703 3 1 - 40 60 100 4 3
System
DSE3D NBSCE3704 Mobile Computing 3 1 - 40 60 100 4 3

DSE4A NBSCE3801 Sentiment Analysis 3 1 - 40 60 100 4 3

Augmented & Virtual
DSE4B NBSCE3802 3 1 - 40 60 100 4 3
Reality
DSE4C NBSCE3803 Neural Networks 3 1 - 40 60 100 4 3

DSE4D NBSCE3804 Expert System 3 1 - 40 60 100 4 3

 List of Minor Course (GE)

Contact Hours Marks Exam

GE Course Code Course Name Cr
Hrs.
L T P CIA ESE Total

GE1A NBSM3103 Calculus 3 1 - 40 60 100 4 3

GE1 B NBBA5102 Business Environment 3 1 - 40 60 100 4 3

GE1 C NBSE1101 Descriptive Statistic 3 1 - 40 60 100 4 3

Ordinary Differential
GE2 A NBSM3202 3 1 - 40 60 100 4 3
Equations
GE2 B NBBA5203 Business Organisation 3 1 - 40 60 100 4 3

GE2 C NBSE1201 Probability & Distribution 3 1 - 40 60 100 4 3

Partial Differential
GE3 A NBSM3303 3 1 - 40 60 100 4 3
equations
GE3 B NBBA5302 Rural Management 3 1 - 40 60 100 4 3

GE3 C NBSE1301 Statistical Inference 3 1 - 40 60 100 4 3

GE4 A NBSM3403 Graph Theory 3 1 - 40 60 100 4 3

Human Resource
GE4 B NBBA5402 Management and 3 1 - 40 60 100 4 3
Development
GE4 C NBSE1401 Survey Sampling 3 1 - 40 60 100 4 3

GE5 A NBSM3503 Numerical Analysis 3 1 - 40 60 100 4 3

Business Policy and
GE5 B NBBA5501 3 1 - 40 60 100 4 3
Strategies
Analysis of Variance &
GE5 C NBSE1501 3 1 - 40 60 100 4 3
Design of Experiment.
Boolean Algebra &
GE6 A BSME3602 3 1 - 40 60 100 4 3
Automata Theory
Entrepreneurship & Small
GE6 B NBBA5602 3 1 - 40 60 100 4 3
business Management
GE6 C NBSE1601 Operations Research 3 1 - 40 60 100 4 3

GE7 A NBSM3701 Discrete Mathematics 3 1 - 40 60 100 4 3

Income tax Law &
GE7 B NBBA5703 3 1 - 40 60 100 4 3
Practices
GE7 C NBSE1701 Optimization Techniques 3 1 - 40 60 100 4 3
Ordinary and Partial
GE8 A NBSM3801 3 1 - 40 60 100 4 3
Differential Equations
GE8 B NBBA5801 Banking Insurance 3 1 - 40 60 100 4 3

GE8 C NBSE1801 Applied Statistics 3 1 - 40 60 100 4 3

Program B.Sc. (Hons./ Hons. with Research) Computer Science
Year 1 Semester I
Course
Computer Fundamentals & Programming Techniques
Name
Code NBSC3101
Course
DSC L T P Credit
Type
Pre- Basic knowledge of computer and
3 1 - 4
Requisite its operations

The main objective of the course is to provide basic concept of computer

Course hardware and Software. Students also able to solve various kinds of real
Objectives life problems using various problem solving Techniques and understand
the concept of basics of programming.
Course Outcomes
CO1 To understand basic concepts of hardware technologies
To understand basic concepts of System Software and Applications
CO2
Software.
To understand and solve the problem using various types of problem
CO3
solving techniques.
CO4 To understand the basic concept of Programming Techniques.
Mo Conta
Mappe
dul Course Contents ct
d CO
e Hrs.
Introduction to computer: Introduction, Basic block
diagram and functions of various components of computer,
Concept of Hardware: Input/output Devices, Computer
1 15 CO1
Memories: Primary Memory and Secondary Memory, CPU
Registers. Concepts Of Machine Level, Assembly Level
And High Level Programming, ([1] Chapter 2).
Software: Software and its needs, Types of Software.
System Software: Operating System, Utility Programs
Programming Language: Machine Language, Assembly
2 Language, High Level Language their advantages & 15 CO2
disadvantages. Application of Software and its types:
Word Processing, Spread Sheets Presentation, Graphics,
DBMS software. ([3] Chapter 6).
Problem Solving Techniques: Problem Definition,
Problem Solving Using Divide And Conquer, Brain
3 15 CO3
Storming And Trial & Error, Steps In Problem Solving:
Define Problem Analyze Problem And Explore Solution.
Algorithms, Building Blocks Of Algorithms, Statements,
Control Flow, Characteristics of Algorithms, Examples.
4 Pseudo Code, Flow Chart, Notations, Examples. ([2] 15 CO4
Chapter 1).
Introduction To Programming: Basic Difference Between
 Procedure Oriented Language And Object Oriented

Suggested Readings

1. Computer Fundamentals by P.K.Sinha.

2. Jeri R. Hanly, Elliot B.Koffman, Problem Solving and Program Design in C Peardon
3. Object-Oriented Programming in C++ By Robert Lafore · 1997

Online Resources

1. https://nptel.ac.in/courses/106105171
2. https://onlinecourses.swayam2.ac.in/cec21_cs15/preview

PO-
PO PO PO PO PO PO PO PO PO PO1 PO1 PO1 PSO PSO
PS
1 2 3 4 5 6 7 8 9 0 1 2 1 2
O
CO
1 1 1 1 2 2 1
1
CO
1 1 1 2 1
2
CO
1 1 2
3
CO
1 1 1 1 2 1
4
Program B.Sc. (Hons./ Hons. with Research) Computer Science
Year 1 Semester I
Course
Programming using C
Name
Code NBSC3102
Course Type DSC L T P Credit
Pre- Basic knowledge of computer
3 - 3
Requisite and its operations
The course is designed to provide complete knowledge of C language.
Course Students will be able to develop logics which will help them to create
Objectives programs, applications in C. Also by learning the basic programming
constructs they can easily switch over to any other language in future
Course Outcomes
To learn and develop simple algorithms to solve various types of
CO1 problems and develop problem solving skills coupled with Top-Down
design principles.
To learn the strategies of writing efficient and well-structured
CO2 computer programs and develop the skills for formulating Iterative
solutions to various problems.
To learn various types of Operators and Functions in C programming
CO3 and learn the concept of single and multi-dimensional Arrays &
various Searching and Sorting techniques.
To enhance the learning of C programming by using Pointers &
CO4
various types of Dynamic Memory Allocation functions.

Conta
Modul Mappe
Course Contents ct
e d CO
Hrs.
Introduction to Programming Languages: Concept of
Assembler, Compiler, Interpreter ([1] Chapter 1).The
Role of Programming Languages, HLL, LLL,
Programming Paradigms, Programming Environments.
([1] Chapter 1).Programming Basics: Structure of C
1 15 CO1
Program, Writing and Executing the first C program,
Syntax and Logical Errors in Compilation, Object and
Executable Code. Components of C language: Standard
I/O in C, Fundamental Data Types, Variables and
Memory Locations, Storage Classes ([1] Chapter 1,2).
Arithmetic expressions & Conditional Branching:
Arithmetic Expressions and Precedence, Operators and
Expression using Numeric and Relational Operators,
Mixed-mode Operations, Type Conversion, Logical
Operators, Bit-wise Operators, Assignment Operators,
2 Operator Precedence and Associativity. Conditional 15 CO2
Branching: Applying if-else and Switch-case
Statements, Nesting If-Else([1] Chapter 6).Loops &
Functions: Iteration and Loops, While, Do-while and for
Loops, Multiple Loop Variables, Break and Continue
Statements ([1] Chapter 6). Functions: Introduction,
 Types of Functions, Functions with Array, Passing
Parameters to Functions, Call by value, Call by
Reference([1] Chapter 7).
Arrays and Structures: Array Notation and
Representation, Manipulating Array Elements, Arrays
Using Multi-Dimensional, Character Arrays and Strings,
3 Structure, Union, Enumerated Data Types, Array of 15 CO3
Structures, Passing Arrays to Functions ([1] Chapter
9).Basic Algorithms: Searching & Basic Sorting
Algorithms (Bubble and Selection).
Pointers & File Handling: Pointers: Pointers &Memory
Allocation in C, Pointer to Pointer, Pointers to
Structures, Problems with Pointers, Passing Pointers as
Function Arguments, Using Arrays with Pointers,
Passing Arrays to Functions. Static and Dynamic
4 Memory Allocation: use of malloc(), calloc() and free() 15 CO4
functions, Storage of Variables In Static and Dynamic
Memory Allocation ([1] Chapter 10). File handling:
Creating Files, various File handling modes, File I/O
functions, Standard C Pre-processors, defining and
calling Macros([1] Chapter 1-2).

Suggested Readings

1. Schaum’s Outline of Programming with C by Byron Gottfried, McGraw-Hill

2. The C programming by Kernighan Brain W. and Ritchie Dennis M, PearsonEducation.
3. Computer Basics and C Programming by V.Rajaraman, PHI Learning Pvt. Limited, 2015.
4. Computer Concepts and Programming in C, R.S. Salaria, Khanna Publishing House.

Online Resources

1. https://nptel.ac.in/courses/106104128
2. https://nptel.ac.in/courses/106105151

PO-
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
PSO
CO1 1 1 1 1 1 1 1

CO2 1 1 1 1 1 2

CO3 1 1 1 1 1 1

CO4 1 1 1 1 1 1
 B.Sc. (Hons./ Hons. with Research) Computer Science
Program
Year 1 Semester I
Course
Programming using C Lab
Name
Code NBSC3152
Course
DSC L T P Credit
Type
Pre- Basic knowledge of computer and
2 1
Requisite its operations
The course is designed to provide Practical knowledge of C language.
Course Students will be able to develop C language programs on various
Objectives mathematical and computational problems which will help them to create
applications in C.
Course Outcomes
To learn the basic terminology of C language, Structure of C program and
CO1
writing user friendly programs.
To learn the various kind of operators, data types, character sets which will
CO2
help to create basic program of c language.
To develop logical C language program using array loops, functions,
CO3
structure and union.
To create programs using concept of pointers, dynamic memory allocation
CO4
and file handling.

1.WAP to print the sum and product of digits of an Integer.

2.WAP to reverse a number.
3.WAP to compute the Sum of the first n terms of the following series S 1+1/2+1/3+1/4+…
4.WAP to compute the Sum of the first n terms of the following series S =1-2+3-4+5…….
5.Write a function that checks whether a given string is Palindrome or not.
6.Write a function to find whether a given no. is Prime or not. Use the same to generate the
Prime numbers less than 100.
7.WAP to compute the factors of a given number.
8.Write a macro that Swap two numbers.
9. WAP to perform following actions on an Array entered by the User:
i) Print the Even-valued elements.
ii) Print the Odd-valued elements.
iii) Calculate and print the Sum and Average of the elements of Array.
iv) Print the Maximum and Minimum elements of Array.
v) Remove the duplicates from the Array.
vi) Print the Array in Reverse Order.
The Program should present a Menu to the User and ask for one of the Options.
The Menu should also include options to re-enter Array and to quit the Program.
10. WAP that prints a table indicating the number of occurrences of each alphabet in the text
entered as Command line Arguments.
11. Write a program that Swap two numbers using Pointers.
12. Write a program in which a Function is passed address of two variables and then alter its
contents.
13.Write a program which takes the radius of a circle as input from the user, passes it to
another function that computes the area and the circumference of the circle and displays
the value of area and circumference from the main() function.
14. Write a program to find Sum of n elements entered by the user. To write this program,
Allocate memory dynamically using malloc() /calloc() functions or new Operator.

15. Write a Menu driven program to perform following Operations on strings:

a) Show address of each character in String.
b) Concatenate two strings without using strcat() function.
c) Concatenate two strings using strcat() function.
d) Compare two Strings.
e) Calculate length of the string (use Pointers).
f) Convert all Lowercase characters to Uppercase.
g) Convert all Upper case characters to Lowercase.
h) Calculate number of Vowels.
i) Reverse the String
16. Given two ordered Arrays of Integers, Write a program to merge the two-Arrays to get an
ordered Array.
17. WAP to display Fibonacci series:
(i) Using Recursion.
(ii) Using Iteration.
18. WAP to calculate Factorial of a number:
(i) Using Recursion.
(ii) Using Iteration.
19. Create a Structure Student containing fields for Roll No., Name, Class, Year and Total
Marks. Create 10 such Students and store them in a file.
20. Copy the contents of one text file to another file, after removing all Whitespaces.
21. Write a function that reverses the elements of an Array in place. The function must accept
only one Pointer value and return void.
22. Write a program that will read 10 integers from user and store them in an array.
Implement array using pointers. The program will print the array elements in ascending
and descending order.
23. Write a Program to create a file & store information.
24. Write a C Program to illustrate reading of data from a File.
25. Write a C Program delete a specific Line from a text File.

PO- PO PO PO PSO PSO

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9
PSO 10 11 12 1 2
CO1 1 1 2 1 2 1 3 1 1 1 1
CO2 1 1 3 1 2 2 3 1 1 1 2
CO3 1 1 2 1 3 1 3 2 1 1 1
CO4 1 1 3 1 3 2 3 2 1 2 1
Program B.Sc. (Hons./ Hons. with Research) Computer Science
Year 1 Semester I
Course
Computer Organisation & Architecture
Name
Code NBSC3103
Course Type DSC L T P Credit
Basic knowledge of
Pre-
computer and its 3 1 - 4
Requisite
operations
To study of the basic structure and operation of a digital computer system.
Course To understand how computer are constructed by a set of functional units.
Objectives To Analyzing fundamental issues in architecture design and their impact
on application performance
Course Outcomes
CO1 To Identify the basic structure and function unit of a digital Computer.
To understanding and analyze the effect of addressing modes and
CO2
instructions.
CO3 To understand Control Unit and ALU
CO4 To understand Interrupts and I/O
Contact Mapped
Module Course Contents
Hrs. CO
Computer Evolution and Arithmetic: A historical
evolution of computers: Von Neumann Architecture,
Hardware Architecture, Bus Interconnection, Register
Transfer Language, Bus and Memory Transfers, Bus
1 15 CO1
Architecture, Bus Arbitration Techniques, Arithmetic
Logic, Shift Micro Operation, Arithmetic Logic Shift
Unit, Arithmetic Algorithms(Addition, Subtraction,
Both Multiplication, Division ) ([1] Chapter 4).
Control Unit: Control Design: Hardwired and Soft
wired logic, Micro programmed logic, Performing of
Arithmetic and Logical Operations, Multiple Bus
Organization, Hardwired Control, Micro Programmed
Controlled, Micro-Instructions, Micro Programmed
2 15 CO2
Sequencing, Wide-Branch Addressing, Micro
Instruction with next- Address Field, Pre-fetching,
Micro Instruction, Block diagram of Microprocessor,
Pipelining, Pipeline Control Instructions Pipeline,
Pipeline Performance. ([1] Chapter 8).
Processor Organisation and Input/ Output
Organisation: Processor Design: General Register
Organisation, Stack Organisation, Addressing Modes,
3 15 CO3
Instruction Format, Data Transfer and manipulations,
Programmed controlled, Reduced Instruction Set, ([2]
Chapter13). Computer Memory Organisation: Basic
 Concept and Hierarchy, Semi-Conductor memories,
Concept and Design Issues and Performance, Address
Mapping and Replacement, Auxiliary Memories:
Magnetic Disk, Magnetic Tape, Optical Disk, Virtual
Memory, concept Implementation. ([2] Chapter 5-6).

Interrupts: Interrupt Hardware, Types of Interrupts and

Exceptions, Modes of Data Transfer: Programmed I/O,
Interrupt initiated I/O, Direct Memory Access: I/O
4 15 CO4
Channels and Processors, Serial Communication:
Synchronous & Asynchronous Communication,
Standard Communication Interfaces. ([2] Chapter 7).

Suggested Readings

1. Computer System Architecture, by Moris Mano

2. Computer Organization And Architecture Designing For Performance, By William
Stallings

Online Resources

1. https://nptel.ac.in/courses/106103068
2. https://nptel.ac.in/courses/106104073

PO- PO PO PO PO PO PO PO PO PO PO PO PO
PSO1 PSO2
PSO 1 2 3 4 5 6 7 8 9 10 11 12
CO1 1 1 1 1
CO2 1 1 1 1 1 1
CO3 1 1 1
CO4 1 1 1 1
Program B.Sc. (Hons./ Hons. with Research) Computer Science
Year 1 Semester II
Course
Data Structures using C
Name
Code BSC3201
Course
DSC L T P Credit
Type
Pre- Basic knowledge of computer
3 - 3
Requisite and its operations
Allow to assess how the choice of data structures and algorithm design
methods impacts the performance of programs.
Course
To solve problems using data structures such as linear lists, stacks,
Objectives
queues, binary trees, binary search trees, and graphs and writing
programs for these solutions.
Course Outcomes
To be familiar with fundamental Data Structures and with the manner
in which these Data Structures can best be implemented, become
CO1
accustomed to the description of Algorithms in both functional and
procedural styles.
To have knowledge of Complexity of basic Operations like Insert,
Delete, Search on these Data Structures.
CO2
Ability to choose a Data Structure to suitably model any data used in
Computer Applications.
To design programs using various Data Structures including Hash
CO3
tables, Binary and general Search Trees, Heaps, Graphs etc.
Ability to assess efficiency trade-offs among different Data Structure
implementations.
CO4
Implement and know the applications of Algorithms for Sorting,
Pattern-matching etc.

Conta
Modul Mappe
Course Contents ct
e d CO
Hrs.
Basic concepts: Algorithm Specification-Introduction,
Recursive Algorithms, Data Abstraction Performance
analysis ([1] Chapter 1).Linear and Non Linear Data
Structures. Linked Lists: Creating and Traversing
1 linked-lists, Circularly Linked Lists: Operations for 15 CO1
Circularly Linked Lists, Doubly Linked Lists-operations
([1] Chapter 4).Representation of Single, Two
Dimensional Arrays, Sparse Matrices-Array and Linked
Representations.([2] Chapter 4).
Stack: Operations, Array and Linked Implementations,
Applications- Infix to Postfix Conversion, Postfix
Expression Evaluation, Recursion implementation.
2 Queue: Definition and Operations, Array and Linked 15 CO2
implementations, Circular Queues-Insertion and Deletion
Operations, Deque(Double Ended Queue) Priority
Queue- Implementation ([2] Chapter 6).
 Trees: Representation of Trees, Binary Trees, Properties
of Binary Trees, Binary Tree Representations- Array and
Linked Representations, Binary Tree Traversals,
3 Threaded Binary Trees, Heap-Definition, Insertion, 15 CO3
Deletion. Search Trees: Binary Search Trees, AVL
Trees- Definition, creation and traversing. ([2] Chapter
7).
Graphs: Graph ADT, Graph Representations: Adjacency
Matrix, Incidence Matrix, Graph Traversals ([2] Chapter
4 8).Sorting Methods, Comparison of Sorting Methods. 15 CO4
Hashing: Introduction, Hash Tables, Hash Functions,
Overflow Handling ([2] Chapter 9).

Suggested Readings

1. Fundamentals of Data structures in C, 2nd Edition, E. Horowitz, S. Sahni and Susan

Anderson-Freed, Universities Press.
2. Lipschutz, Schaum’s outline series Data structures Tata McGraw-Hi
3. Data structures and Algorithm Analysis in C, 2nd edition, M. A. Weiss, Pearson.
4. .Data structures using C and S. Tanenbaum, Y. Langsam, and M. J. Augenstein.

Online Resources

1. https://nptel.ac.in/courses/106103069
2. https://nptel.ac.in/courses/106102064

PO-
PO PO PO PO PO PO PO PO PO PO1 PO1 PO1 PSO PSO
PS
1 2 3 4 5 6 7 8 9 0 1 2 1 2
O
CO
1 1 1 1 1
1
CO
1 1 1 1 1
2
CO
1 1 1 2 1 1 1
3
CO
1 1 1 1 1 1 1 1
4
Program B.Sc. (Hons./ Hons. with Research) Computer Science
Year 1 Semester Second
Course
Data Structures using C Lab
Name
Code NBSC3251
Course
DSC L T P Credit
Type
Pre- Basic knowledge of computer and
- - 2 1
Requisite its operations
To solve problems using data structures such as linear lists, stacks, queues,
Course
binary trees, binary search trees, and graphs and writing programs for these
Objectives
solutions.

Course Outcomes
Student will be able to develop programs using various kinds of data structure
CO1
like array and linked list
To develop and implement programs of stack and queue data structure using
CO2
array and linked list.
Student will be able to develop logic using heterogeneous data structure like
CO3
tree BST, AVL tree etc.
Student will be able to create and implement various algorithms using graph
CO4
theory.

1. Write a program to perform Insertion and Deletion operations in an Array.

2. Write a program to multiply two 2D Matrices.
3. Write a program to Display non-zero elements from Sparse Matrix.
4. WAP to convert the Sparse Matrix into non-zero form and vice-versa.
5. Write a program to Search an element from a list. Give user the option to perform
Linear or Binary search.
6. WAP using templates to Sort a list of elements. Give user the option to perform
sorting using Insertion Sort, Bubble sort or Selection sort.
7. Write a program to create Queue and perform Insertion and Deletion operations.
8. Write a program to create Deque and perform Insertion and Deletion operations.
9. Write a program to create Priority Queue and perform Insertion and Deletion
operations.
10. Implement Linked List using templates. Include functions for Insertion, Deletion and
search of a number, Reverse the list and concatenate two Linked Lists.
11. Implement Doubly Linked-List using templates. Include functions for Insertion,
Deletion and search of a number, reverse the list.
12. Implement Circular Linked List using templates. Include functions for Insertion,
Deletion and search of a number, reverse the list.
13. Perform Stack operations using Linked List implementation.
14. Perform Stack operations using Array implementation.
15. Perform Queues operations using Circular Array implementation.
16. Create and perform different operations on Double-ended Queues using Linked-list
implementation.
17. WAP to calculate factorial and to compute the factors of a given no. (i) using
Recursion (ii) Using Iteration.
18. WAP to display Fibonacci series (ii)Using Recursion, (iii) Using Iteration
 19. WAP to create a Binary Search Tree and include following operations in Tree:
20. Insertion (Recursive and Iterative Implementation).
21. Search a number in BST.
22. Display its pre-order, post-order and in-order traversals Recursively.
23. Display its pre-order, post-order and in-order traversals Iteratively.
24. Display its level-by-level traversals.
25. Count the non-leaf nodes and Leaf Nodes.
26. Display Height of Tree.
27. WAP to reverse the order of the elements in the Stack using additional Stack.
28. WAP to reverse the order of the elements in the Stack using additional Queue.
29. WAP to implement Lower Triangular Matrix using One-dimensional Array.
30. WAP to implement Upper Triangular Matrix using One-dimensional Array.
31. WAP to implement Symmetric Matrix using one-dimensional array.
32. WAP to Create a Threaded Binary Tree as per in-order Traversal, and Implement
operations.
PO-
PO PO PO PO PO PO PO PO PO PO1 PO1 PO1 PSO PSO
PS
1 2 3 4 5 6 7 8 9 0 1 2 1 2
O
CO
1 1 2 1 2 1 3 1 1 2 1
1
CO
2 1 3 1 2 2 3 1 1 1 2
2
CO
1 2 2 2 3 1 3 2 1 1 1
3
CO
1 1 3 2 3 2 3 2 1 2 1
4
Program B.Sc. (Hons./ Hons. with Research) Computer Science
Year 1 Semester II
Course
Operating System
Name
Code NBSC3202
Course
DSC L T P Credit
Type
Pre- Basic knowledge of computer and
3 1 - 4
Requisite its operations
To learn how Operating System is Important for Computer System, make
Course aware of different types of Operating System and their services, To learn
Objectives different process scheduling algorithms, synchronization and secondary
memory management
Course Outcomes
CO1 To understand the basic concept and types of Operating System.
To learn Operating System organization i.e. concept of process, process
CO2
synchronization etc.
CO3 To learn the various kinds of process scheduling algorithms.
To learn file management, I/O management and protection and security
CO4
policies.

Conta
Modul Mappe
Course Contents ct
e d CO
Hrs.
Module I: Introduction: Definition of operating system,
History of Operating Systems , Single user/Multi User
and Single and Multitasking OS; types of operating
systems–multiprogramming systems, batch systems, time
1 15 CO1
sharing systems, Distributed System, real time systems;
Functions of operating system: Memory management,
process management, device management, file
management etc.
Operating System Organization: System calls and
system programs. Process Management: System view
of the process and resources, process abstraction, process
hierarchy, threads; Process synchronization: concurrent
processes, critical sections, methods for inter-process
2 15 CO2
communication; classical two process and n-process
solutions, hardware primitives for synchronization,
semaphores, monitors, classical problems in
synchronization (producer-consumer, readers-writer,
dining philosophers etc.).
Process Scheduling: non-pre-emptive and pre-emptive
scheduling algorithms-FCFS, SJF, SRTF, Round Robin
etc., Semaphores. Memory Management: Memory
3 15 CO3
address, Physical and virtual address space; memory
allocation strategies –fixed and variable partitions,
Concept of paging, segmentation, demand paging, virtual
 memory, page replacement algorithms, virtual memory
Deadlocks: prevention and avoidance, detection and
recovery. File and I/O Management File concepts,
Access methods, Directory structure, File system
4 15 CO4
structure, files operations, files allocation methods,
device management, Protection and Security, Policy
mechanism, Authentication

Suggested Readings

1. A Silberschatz, P.B. Galvin, G. Gagne, Operating Systems Concepts, 8th Edition, John Wiley
2. Publications 2008.G. Nutt, Operating Systems: A Modern Perspective, 2nd Edition Pearson
Education 1997.
3. W. Stallings, Operating Systems, Internals & Design Principles , 5th Edition, Prentice Hall of India.
2008.
4. M. Milenkovic, Operating Systems- Concepts and design, Tata McGraw Hill 1992.

Online Resources

1. https://archive.nptel.ac.in/courses/106/105/106105214/
2. https://onlinecourses.nptel.ac.in/noc20_cs04/preview

PO-
PO PO PO PO PO PO PO PO PO PO1 PO1 PO1 PSO PSO
PS
1 2 3 4 5 6 7 8 9 0 1 2 1 2
O
CO
1 1 1 2 1
1
CO
1 1 1 1 1 1
2
CO
1 1 2 1
3
CO
1 1 1 1 2 1
4
Program B.Sc. (Hons./ Hons. with Research) Computer Science
Year 1 Semester II
Course
Computer Networks
Name
Code NBSC3203
Course
DSC L T P Credit
Type
Pre- Basic knowledge of
3 1 - 4
Requisite computer and its operations
Student will be able to learn the concept of computer networking, it’s
Course
various types, reference models, layers of TCP/IP and OSI Model and
Objectives
various services.

Course Outcomes
Describe how Computer Networks are organized with the concept of
CO1
layered Approach.
Implement a simple LAN with Hubs, Bridges and Switches. Learn
CO2 basic routing mechanisms, IP addressing scheme and internetworking
concepts.
Student will be able to learn the concept of multiple access control,
CO3
network layer functions and protocols.
To learn the various kind of protocols and services provided by
CO4
application layer and transport layer.
Contact Mapped
Module Course Contents
Hrs. CO
Fundamentals of Computer Networks:
Network Definition, Network Topologies,
Network Classifications, Network Protocol,
1 Layered Network Architecture, Reference 15 CO1
Models: OSI Reference Model, TCP/IP
Reference model ([1] Chapter 1-2), Comparison
of OSI and TCP/IP Models ([1] Chapter 2).
TCP/IP Protocol Suite: TCP/Ip layers and
Protocols, ([1] Chapter 2). Networks Switching
Techniques and Access Mechanisms: Circuit
Switching, Packet switching- Connectionless
Datagram Switching, Connection-Oriented
virtual Circuit Switching, Dial-up Modems,
Digital Subscriber Line, Cable TV for Data
2 15 CO2
transfer([1] Chapter 8).Data Link Layer
Functions and Protocol: Error Detection and
Error Correction Techniques, Data-link Control-
Framing and Flow Control, Error Recoveries
Protocols- Stop and Wait ARQ, Go-back-n ARQ,
Point to Point Protocol on Internet ([1] Chapter
10-11).
Multiple Access Protocol and Networks:
3 CSMA/CD Protocols; Ethernet LANS; 15 CO3
Connecting LAN and Back-Bone Networks-
 Repeaters, Hubs, Switches, Bridges, Router and
Gateways([1] Chapter 12).Networks Layer
Functions and Protocols: Routing, Routing
Algorithms: Distance Vector, Shortest Path
Routing Algorithm, Network Layer Protocols: IP
protocol, Internet Control Message Protocol,
IGMP, ARP, RARP([1] Chapter 19-22).
Transport Layer Functions and Protocols:
Transport services- Error control and Flow
Control, Reliability, TCP and UDP, Connection
Establishment and Release: Three way
4 Handshaking, Concept of Socket and Ports ([1] 15 CO4
Chapter 23-24). Application layer Protocol:
Overview of WWW, URL, HTTP, SMTP, FTP,
POP, TELNET. Domain Name System, Domain
Name Servers, DNS Space ([1] Chapter 25-28).

Suggested Readings

1. B. A. Forouzan: Data Communications and Networking, Fourth edition, THM, 2007.

2. Computer Network and Internet by Douglas E Comer.
3. A. S. Tanenbaum: Computer Networks, Fourth edition, PHI, 2002.
4. William Stallings, “Data and Computer Communication”, Prentice Hall.

Online Resources

1. https://nptel.ac.in/courses/106105183
2. https://nptel.ac.in/courses/106106091

PO-
PO PO PO PO PO PO PO PO PO PO1 PO1 PO1 PSO PSO
PS
1 2 3 4 5 6 7 8 9 0 1 2 1 2
O
CO
1 1 1 1 1 1 1 1
1
CO
1 1 1 1 1 1 1 1 1
2
CO
1 1 1 1 1 2 2 1 1
3
CO
1 1 1 2 1 2 2 1 1
4
Program B.Sc. (Hons./ Hons. with Research)
Year 1 Semester 1
Course Name Calculus
Code NBSM3103
Course Type L T P Credit
Pre-
10+2 Mathematics 3 1 - 4
Requisite

Course The objective of the course is to provide the concept of limit, continuity and
Objectives differentiability and to apply the knowledge to solve problems.

Course Outcomes
To understand continuity and differentiability in terms of limits and graphs of
CO1
certain functions.
To understand the consequences of various mean value theorems for
CO2
differentipable functions.
To understand the concepts of asymptotes and inflexion points in curve
CO3
tracing.
To be able to compute the reduction formulae of standard transcendental
CO4
functions with applications.

Modul Contac Mappe

Course Contents
e t Hrs. d CO
𝜀 − 𝛿 definition of a limit, Infinite limits, Continuity and
types of discontinuities ([1] Chapter 2); Differentiability of a
function ([1] Chapter 3), Successive differentiation: Calculation
1 15 CO1
of the nth derivatives, Leibnitz theorem ([1] Chapter 5). Partial
differentiation, Euler’s theorem on homogeneous functions ([1]
Chapter 12).
Rolle’s theorem, Mean value theorems, Taylor’s and
2 Maclaurin’s series expansions of one variable ([1] Chapter 7). 15 CO2
Indeterminate forms ([1] Chapter 16).
Asymptotes ([1] Chapter 9), Curvature, Concavity and inflexion
3 points ([1] Chapter 10), Singular points, Tangents at the origin 15 CO3
and nature of singular points, Curve tracing ([1] Chapter 11).
Integration of irrational algebraic functions and transcendental
functions, Reduction formulae for ∫ sin 𝑥 𝑑𝑥 , ∫ cos 𝑥 𝑑𝑥,
4 ∫ sin 𝑥 cos 𝑥 𝑑𝑥, ∫ 𝑥 sin 𝑚𝑥 𝑑𝑥, ∫ 𝑥 cos 𝑚𝑥 𝑑𝑥 and 15 CO4
∫ 𝑥 (log 𝑥 ) 𝑑𝑥 ([2] Chapter 3&4). Definite integral as a limit
of sum ([2] Chapter 5),

Suggested Readings

1. Prasad, Gorakh (2016). Differential Calculus (19th ed.). Pothishala Pvt. Ltd. Allahabad.
2. Prasad, Gorakh (2015). Integral Calculus. Pothishala Pvt. Ltd. Allahabad.
Online Resources

1. https://archive.nptel.ac.in/courses/111/106/111106146/
2.https://vidyamitra.inflibnet.ac.in/index.php/search?subject%5B%5D=&course%5B%5D=C
alculus&domain%5B%5D=Physical+%26+Basic+Sciences

Course Articulation Matrix

PO-
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
PSO

CO1 2 2 1 1 2 1 2 1

CO2 2 2 2 1 2 2 2 2

CO3 1 2 1 1 1 1 1 1

CO4 1 1 2 1 2 1 1
Program B.Sc. (Hons./ Hons. with Research)
Year 1 Semester 2
Course
Ordinary Differential Equations
Name
Code NBSM3202
Course Type L T P Credit
Pre-
10+2 Mathematics 3 1 - 4
Requisite
The objective of this course is to introduce the students to understand and
Course
solve of Differential Equations, create various Mathematical models and
Objectives
their applications in everyday life.

Course Outcomes
To understand the genesis of ordinary differential equations of first order and
CO1
first degree.
To learn various techniques of getting exact solutions of linear differential
CO2
equations of Second and higher order.
To develop the concept of a general solution of a linear differential equation
CO3 of an arbitrary order and also learn a few methods to obtain the general
solution of such equations.
To formulate mathematical models in the form of ordinary differential
CO4 equations to suggest possible solutions of the day to day problems arising in
physical, chemical and biological disciplines.

Modul Contac Mappe

Course Contents
e t Hrs. d CO
Basic concepts and genesis of ordinary differential equations,
Order and degree of a differential equation ([2] Chapter 1, Part
I), Differential equations of first order and first degree,
Equations in which variables are separable, Homogeneous
1 equations, Linear differential equations and equations reducible 15 CO1
to linear form, Exact differential equations, Integrating factor
([2] Chapter 2, Part I), First order higher degree equations
solvable for x, y and p. Clairaut’s form and singular solutions
([2] Chapter 4, Part I).
Second Order Linear Differential Equations: Solutions of
homogeneous linear ordinary differential equations of second
order with constant coefficients ([1] Chapter 2), Euler-
Cauchy’s linear differential equations, Legendre’s linear
differential equations. Transformations of the equation by
2 15 CO2
changing the dependent/independent variable, Method of
variation of parameters ([2] Chapter 10, Part I), Reduction of
order ([1] Chapter 2). Higher Order Linear Differential
Equations: Linearly dependent and linearly independent
solutions on an interval, Wronskian and its properties.
Power series method ([2] Chapter 7, Part II), Frobenius method
([2] Chapter 8, Part II), Legendre's equation, Legendre
3 15 CO3
polynomials, Rodrigue’s formula, Orthogonality of Legendre
polynomials ([2] Chapter 9, Part II), Bessel's equation, Bessel
 functions and their properties, Recurrence relations ([2] Chapter
11, Part II).
Application of first order differential equations to acceleration-
velocity model ([5] Chapter 2), Growth and Decay model ([4]
Chapter 2). Introduction to compartmental models ([4] Chapter
4 2), Lake pollution model (with case study of Lake Burley 15 CO4
Griffin) ([4] Chapter 2), Drug Assimilation models ([4] Chapter
2), population models (with limited growth, exponential
growth) Epidemic models ([5] Chapter 2 or [4] Chapter 3).

Suggested Readings

1. Erwin Kreyszig (2011). Advanced Engineering Mathematics (10th edition). Wiley.

2. M. D. Raisinghania, Advanced Differential Equations, Eighteenth Edition 2013, S. Chand.
3. H. I. Freedman (1980). Deterministic Mathematical Models in Population Ecology. Marcel
Dekker Inc.
4. Barnes, Belinda &Fulford, Glenn R. (2015). Mathematical Modelling with Case Studies, Using
Maple and MATLAB (3rd ed.). CRC Press, Taylor & Francis Group.
5. Edwards, C. Henry, Penney, David E., & Calvis, David T. (2015). Differential Equation and
Boundary Value Problems: Computing and Modeling(5th ed.). Pearson Education

Online Resources

1. https://archive.nptel.ac.in/courses/111/106/111106100/

Course Articulation Matrix

PO-
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
PSO

CO1 1 2 1 2 1 1 2

CO2 1 2 2 3 3 2 3

CO3 2 2 1 2 1 2 2

CO4 2 3 2 1 3 2 3 3
Program

Year First Semester First

Course Name Business Environment

Code NBBA5102

Course Type L T P Credit

Pre-Requisite 10+2 in any discipline 4 0 0 4

To Familiarize students with:

Course Various external and internal factors that impact business and understand the
Objectives economic, cultural, legal and political issues associated with national and
international business.
Course Outcomes
Explain the types of business environment viz Political, Economic, Socio-
CO1
cultural, Legal, Technological and Global environment.
Analyse the existence of business under various Policies Framework laid by
CO2
legal environment.
Examine the role of public sector along with various government regulatory
CO3 acts and policies regarding business environment including industrial,
monetary and fiscal policies.
Analyse and evaluate global business environment in terms of Global Trade
CO4 Policies by respective Institutions along with determining the impact and
prospects of Technology in shaping Business.

Contact Mapped
Module Course Contents
Hrs. CO

Module I: Introduction
Business Environment: Nature, dimensions and meaning.
Components of business environment: economic, political,
1 15 1
technological and social environment. Consumerism and
consumer protection in India. A brief study of capitalism,
socialism and mixed economy.

Module II: Industrial and Legal Environment

Industrial Growth and policy, industrial licensing policy.
2 MRTP. Economic planning: aims, objectives and 15 2
framework of development planning in India. Legal
Environment. India’s Fiscal and Monetary Policies.
Module III: Public Sector and Economic
Organizations
3 15 3
Public Sector: Concept, Rationale, Government
Programme, Role of Public Sector in India. Foreign Trade
 Policies. Development Banks: IFCI, IDBI, SIDBI, IIBI.
Module IV: Recent Economic Trends Recent Economic
Trends
Economic Liberalization, Privatization and Globalization.
Foreign investment policy. Export Promotion councils and
4 15 4
boards. Import Control. EXIM policy, FEMA, IPR
(International and Indian Patent Rights Acts). Anti-
Pollution Act. Environmental Groups and Bodies. Euro I,
II and III Norms, Introduction to Goods and Services Tax.

Suggested Readings

1. Mishra S. K. And Puri V. K., Economic Environment of Business, Himalaya

Publication.
2. Paul, Justin., Business Environment Text and Cases, Tata McGraw Hill.
3. Shaikh and Saleem, Business Environment, Pearson, 1st Edition.

Online Resources

1. eGyanKosh: Business Environment online available at

https://egyankosh.ac.in/handle/123456789/2898
2. NPTEL: Introduction to Business environment available at
https://onlinecourses.swayam2.ac.in/imb22_mg02/preview

Course Articulation Matrix

PO-PSO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 3 1 1 2 2 2

CO2 3 2 2 1 2 2 2 2

CO3 3 3 3 3 3 1 2 1 3 3 2

CO4 1 1 1 2 2 2 2 1 3 3 2
Program

Year First Semester Second

Course Name Business Organisation

Code NBBA5203

Course Type L T P Credit

Pre-Requisite 10+2 from any discipline 3 1 0 4

To familiarize students with:

Course
Objectives Management and business concepts and practices. Emerging challenges of
managing resources, managing business processes and managing managers.
Course Outcomes
Understand the concept of business organization and principles of
CO1
organization.
Examine the role of sole proprietorship, Partnership firm, joint stock
CO2
concerns and companies.
Analyse the sources and methods of Business Finance and analyse working of
CO3
financial institutions like IFCI, SFC, ICICI, IDBI and security market.
Assessing market structure and applying it to different industries to
CO4 understand the four P’s of marketing structure of these industries. Applying
the concepts of advertisement and sales promotion to real life situations.

Contact Mapped
Module Course Contents
Hrs. CO
Module I: Introduction to Organization
Concepts and objectives of business organization,
establishment of a new business, pre-establishment
1 15 1
considerations and social responsibility of business.
Meaning, objective and principles of organization, line and
staff, functional organization, concept of scalar chain.
Module II: Forms of Business Organization
Sole Proprietorship: Meaning, characteristics and legal
requirements. Partnership firms: Meaning, partnership deed
2 15 2
and legal requirements as per Partnership Act 1932. Joint
stock concerns: Meaning, features, kinds of companies, legal
requirements as per Companies Act 2013.
Module III: Business Finance
Business Finance: Concept, need and significance.
Methods of financing: long term, medium term and short
3 term. National finance and international finance. Financial 15 3
institutions: Brief introduction to IFCI, SFC, ICICI, IDBI.
Security market: An introduction to primary and secondary
market.
4 Module IV: Marketing 15 4
 Marketing: Concept of marketing, four P’s of Marketing.
Distribution channel: Meaning, importance, and significance
of middlemen. Advertisement and sales promotion: Meaning
and objectives. Introduction to Consumer Behaviour.

Suggested Readings

1. Tulsian P. C. and Pandey V., Business Organization and Management, Pearson

Education.
2. Bhushan Y. K., Fundamentals of Business Organization and Management, Sultan
Chand and Sons.
3. Chhabra T.N., Business Organisation, Dhanpat Rai and Sons.
4. Robert., Modern Business Administration, McMillan India.

Online Resources

1. SWAYAM: Business Organization and Management online available at

https://onlinecourses.swayam2.ac.in/nou21_mg03/preview

2. eGyanKosh: Business Organisation online available at

https://egyankosh.ac.in/handle/123456789/3592

Course Articulation Matrix

PO-PSO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 3 1 1 1 1 1 2 2 1

CO2 3 1 2 1 2 2 2 1

CO3 3 3 3 3 3 1 2 3 3 1

CO4 1 1 1 2 2 2 2 1 3 3 1
Program For all UG Programs
Year 1 Semester 1
Course Name Descriptive Statistics
Code NBSE1101
Course Type GE L T P Credit
Pre-Requisite 10+2 in any discipline 3 1 0 4
The general objectives of the course are to:
Understand Statistics, its scope and importance in various fields.
Course
Learn difference between sample population data and its types.
Objectives
Understand graphical representation of different types of data.
Differentiate between measures of central tendency & dispersion.
Course Outcomes:
To understand concept of sample vs. population and difference between
CO1
different types of data.
To be able to apply different methods for summarising data sets, Interpret
CO2
histograms and ogives etc.
To describe data with measures of central tendency and measures of
CO3
dispersion.
CO4 To understand measures of skewness, kurtosis and their utility.

Contact Mapped
Module Course Contents
Hrs. CO
Concept of statistical population, Attributes and variables
(discrete and Continuous) ([2] Chapter 1); Primary data –
1 designing a questionnaire and schedule, collection of primary 15 CO1
data, Secondary data ([2] Chapter 3); Presentation of data:
classification, tabulation ([2] Chapter 5).
Diagrammatic & graphical representation of grouped data.
Frequency distributions, cumulative frequency distributions
2 15 CO2
and their graphical representations, histogram, frequency
polygon and ogives ([3] Chapter 3).
Measure of central tendency: Average or arithmetic mean,
median, mode, geometric mean & harmonic mean for
3 15 CO 3
grouped and ungrouped data with their merits and demerits
([3] Chapter 4).
Dispersion, merits and demerits of these measures ([1]
Chapter 7); Moments, Shephard’s correction for moments
4 ([2] Chapter 9); Skewness and Kurtosis and their Measures 15 CO4
([1] Chapter 8); Measures based on quartiles (Quartiles,
Deciles and percentiles) ([1] Chapter 7).

Suggested Readings

1. Beri, G.C. (2011). Business Statistics (3rd ed.), TMH Education Pvt. Ltd. New Delhi.
2. Gupta, S.P. (2011). Statistical Methods (41st ed.), Sultan Chand and Sons New Delhi.
3. Tulsian, P.C. and Tulsian, Bharat. (2019). Business Statistics (2nd ed.), Sultan Chand and
Company Ltd. New Delhi.

Online Resources

1. https://heecontent.upsdc.gov.in/Home.aspx
2. https://www.edx.org/search?q=statistics

Course Articulation Matrix

PO-
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
PSO

CO1 1 1 1 1 1 1 1 1
CO2 1 1 1 2 1 1 1
CO3 1 1 1 2 1 1 1
CO4 1 1 1 2 1 1 1
Program For all UG Programs
Year 1 Semester 2
Course Name Probability & Distributions
Code NBSE1201
Course Type GE L T P Credit
Pre-Requisite 10+2 in any discipline 3 1 0 4
The general objectives of the course are to:
understand concept of probability along with basic laws and axioms of
probability.
Course
understand Addition & Multiplication theorems of probability.
Objectives
understand the concept of random variable (discrete and continuous),
concept of probability distribution.
knowledge of discrete & continuous distributions.
Course Outcomes:
CO1 To apply the concept of different terms used in probability.
CO2 To apply basic probability principles to solve real life problems.
CO3 To differentiate & apply different types of distributions.
To understand applications of discrete & continuous distributions to
CO4
solve the problems.

Contact Mapped
Module Course Contents
Hrs. CO
Basic Concepts of probability, Random Experiment, Trial,
Sample Point, Sample space, events, Definitions of Mutually
1 Exclusive, Exhaustive and Equally Likely events, Definitions 15 CO1
of Probability: Classical, relative frequency and axiomatic
approaches and their limitations ([2] Vol. 2, Chapter 1).
Theorems on Probability: Addition theorem of Probability
for n Events, Theorem of Total Probability for n Events,
2 Conditional Probability, Multiplication Theorem of 15 CO2
Probability for n events, Independent Events. Bayes’
Theorem and its Applications ([2] Vol. 2, Chapter 1).
Random variables – discrete and continuous, ([1], Chapter
10); probability mass function (pmf) and probability density
function (pdf), Cumulative distribution function (cdf), Joint
distribution of two random variables, marginal and
3 15 CO 3
conditional distributions, Independence of random variables
([3], Chapter 5); Expectation of a random variable and its
properties, expectation of sum of random variables and
product of independent random variables ([3], Chapter 6).
Probability Distributions: Binomial, Poisson, Normal
4 15 CO4
distribution and their properties ([1], Chapter 10).

Suggested Readings
 1. Beri, G.C. (2011). Business Statistics (3rd ed.), TMH Education Pvt. Ltd. New Delhi.
2. Gupta, S.P. (2011). Statistical Methods (41st ed.), Sultan Chand and Sons New Delhi.
3. Gupta, S.C. and Kapoor, V.K. (2000). Fundamentals of Mathematical Statistics (10th ed.),
Sultan Chand and Sons, New Delhi.

Online Resources
1. https://www.coursera.org/search?query=statistics&
2. https://www.edx.org/search?q=statistics

Course Articulation Matrix

PO-
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
PSO
CO1 1 1 1 1 1 1 1
CO2 1 2 1 1 1 1 1
CO3 1 2 2 2 1 1 1
CO4 1 2 2 2 1 1 1