BHAVANS AUTONOMOUS COLLEGE, SYLLABUS FOR FYBSc(Computer science) 2021-2022

Resolution No:

Bharatiya Vidya Bhavan’s

M. M. College of Arts, N.M. Institute of Science,
H.R.J. College of Commerce. (Bhavan’s College)
Autonomous

(Affiliated to University of Mumbai)

Syllabus for: F.Y.B.Sc.Computer Science

Program: B.Sc.
Program Code: BH. BSc

Course Code: (BH. USCS)

Choice Based Credit System (CBCS)

with effect from academic year 2021-22

 BHAVANS AUTONOMOUS COLLEGE, SYLLABUS FOR FYBSc(Computer science) 2021-2022

PREAMBLE
The goal of B.Sc. program in computer science is to provide students the foundations of various
career opportunities in the field of Information and Communication Technology (ICT). This
programme emphasizes acquisition of knowledge and understanding of system, various
programming languages and tools requires for effective computation based problem solving.

The main objective of this program is to inculcate among the students, the technical as well as
the theoretical knowledge about the computers and its various applications in different fields.
This program is designed in such a way that students can have a detailed knowledge of subjects
as well as the knowledge of information technology related applications. Throughout this
program the students will go through the Information and Communication Technology (ICT)
scenario, its scope, career and the essentials of the ICT world.

The Bachelor of Computer Science programme will equip the students with the necessary
knowledge and skills for the existing and emerging challenges that a career in computing and
software technology will entail. In addition it prepares graduates to show high quality of
independent thought, flexibility and maturity based on a sound technical knowledge of the
field.

SYLLABUS OUTLINE

Semester –I (Theory)

Course Code Course Type Course Title Credits Lectures/

Week
BH.USCS101 Core Subject Fundamentals of C++ 2 3
Programming
BH.USCS102 Core Subject Programming with Python- I 2 3
BH.USCS103 Core Subject Computer Organization and 2 3
Design
BH.USCS104 Core Subject Database Systems 2 3
BH.USCS105 Core Subject Discrete Mathematics 2 3
 BHAVANS AUTONOMOUS COLLEGE, SYLLABUS FOR FYBSc(Computer science) 2021-2022

Descriptive Statistics and

BH.USCS106 Core Subject 2 3
Introduction to Probability
Ability
BH.USCS107 enhancement Green Technologies 2 3
Course 1

Semester –I (Practicals)
Course Code Course Type Course Title Credits Lectures/
Week
BH.USCSP101 Core Subject Practical Practical of BH.USCS.101 1 3
BH.USCSP102 Core Subject Practical Practical of BH.USCS.102 1 3
BH.USCSP103 Core Subject Practical Practical of BH.USCS.103 1 3
BH.USCSP104 Core Subject Practical Practical of BH.USCS.104 1 3
BH.USCSP105 Core Subject Practical Practical of BH.USCS.105 1 3
BH.USCSP106 Core Subject Practical Practical of BH.USCS.106 1 3

Semester – II (Theory)

Course Code Course Type Course Title Credits Lectures/

Week
BH.USCS201 Core Subject Object Oriented Programming with 2 3
C++
BH.USCS202 Core Subject Programming with Python– II 2 3
BH.USCS203 Core Subject Linux 2 3
BH.USCS204 Core Subject Database Management Systems 2 3
BH.USCS205 Core Subject Calculus 2 3
BH.USCS206 Core Subject Statistical Methods and Testing of 2 3
Hypothesis
BH.USCS207 Skill Enhancement Soft Skills Development 2 3
Course 2

Semester – II (Practicals)

Course Code Course Type Course Title Credits Lectures/

Week
BH.USCSP201 Core Subject Practical Practical of BH.USCS.201 1 3

BH.USCSP202 Core Subject Practical Practical of BH.USCS.202 1 3

BH.USCSP203 Core Subject Practical Practical of BH.USCS.203 1 3
 BHAVANS AUTONOMOUS COLLEGE, SYLLABUS FOR FYBSc(Computer science) 2021-2022

BH.USCSP204 Core Subject Practical Practical of BH.USCS.204 1 3

BH.USCSP205 Core Subject Practical Practical of BH.USCS.205 1 3
BH.USCSP206 Core Subject Practical Practical of BH.USCS.206 1 3
 BHAVANS AUTONOMOUS COLLEGE, SYLLABUS FOR FYBSc(Computer science) 2021-2022

PROGRAM OUTCOMES

PO Description

A student completing Bachelor’s Degree in Computer Science program

will be able to
PO-1 Form strong foundation in Computer science, through Introduction of
emerging trends and Groom the students for the challenges of ICT industry
PO-2 Formulate fundamental skills for solving computational problems while the
subjects of Mathematics & Statistics course will inculcate research oriented
acumen.

PO-3 to align the programme structure and course curriculum with student
aspirations and corporate expectations as the proposed curriculum is more
contextual, industry affable and suitable to cater the needs of society and
Nation in present day context.
PO-4 helps the student evaluate domain specific skills and to meet industry
expectations
PO-5 Have introduction of Ethical Hacking, Cyber Forensic and Information and
Network Security. Besides getting hands on experience Linux Server
Administration and Web Services
PO-6 Be introduced to the physical world through Architecting of IoT and
Wireless Sensor Networks and Mobile Communication
PO-7 To create a pool of technologically savvy, theoretically strong, innovatively
skilled and ethically responsible generation of computer science professional

PROGRAM SPECIFIC OUTCOME

PSO Description

A student completing Bachelor’s Degree in B.Sc program in the subject of Computer

Science will be able to:

Foundation of mathematical concepts :

obtain the Ability to apply mathematical methodologies to solve computation task, model
real world problem using appropriate data structure and suitable algorithm.
PSO 1
Foundations of Software development :
obtain the Ability to understand the structure and development methodologies of
software systems. Possess professional skills of software design process.
 BHAVANS AUTONOMOUS COLLEGE, SYLLABUS FOR FYBSc(Computer science) 2021-2022

Applications of Computing and Research Ability:

obtain the Ability to use knowledge in various domains to identify research gaps and
hence to provide solution to new ideas and innovation

PSO 2 Problem analysis:

Identify, formulate, review research literature, and analyze complex technical problems
reaching substantiated conclusions using first principles of mathematics, natural
sciences, and computer sciences.

Individual and team work:

Function effectively as an individual, and as a member or leader in diverse teams, and in
multidisciplinary settings.

PSO 3 Project management and finance: Demonstrate knowledge and understanding of the
development and management principles and apply these to one’s own work, as a
member and leader in a team, to manage projects and in multidisciplinary environments.

Design/development of solutions:
Design solutions for complex technical problems and design system components or
processes that meet the specified needs with appropriate consideration for the public
PSO 4 health and safety, and the cultural, societal, and environmental considerations.

Conduct investigations of complex problems:

Use research-based knowledge and research methods including design of experiments,
PSO 5 analysis and interpretation of data, and synthesis of the information to provide valid
conclusions.

Ethics:
Apply ethical principles and commit to professional ethics and responsibilities and
norms of the software development practice

Modern tool usage:

Create, select, and apply appropriate techniques, resources, and modern technical
methods and IT tools including prediction and modeling with an understanding of the
PSO 6 limitations.

Communication:
Communicate effectively on complex technical activities with the development
community and with society at large, such as, being able to comprehend and write
effective reports and design documentation, make effective presentations, and give and
receive clear instructions.
BHAVANS AUTONOMOUS COLLEGE, SYLLABUS FOR FYBSc(Computer science) 2021-2022
 BHAVANS AUTONOMOUS COLLEGE, SYLLABUS FOR FYBSc(Computer science) 2021-2022

DETAILED SYLLABUS
SEMESTER I

Fundamentals of C++ Programming

Programme: B.Sc.(CS) Semester: I

Course: Fundamentals of C++ Programming Course Code: BH.USCS101
Teaching Scheme Evaluation Scheme (Theory)
Lecture Practical Tutorial Credits Continuous End Semester
(Periods (Periods (Periods (Theory Internal Examination (ESE)
per week) per week per week +Practical Assessment
per per ) (CIA)
batch) batch)
3 3 1 2+1 (Marks - 40) (Marks: 60)
Pre-requisites: Knowledge of basic working of a computer.
Course Objectives:
The objective of this course is to provide a comprehensive study of the C++ programming language,
stressing upon the strengths of C++, which provide the students with the means of writing modular,
efficient, maintainable, and portable code.
Course Outcomes: After successfully completing the course
1) Students should be able to write, compile and debug programs in C++ language.
2) Students should be able to use different data types in a computer program.
3) Students should be able to design programs involving decision structures, loops and functions.
4) Students should be able to explain the difference between call by value and call by reference
5) Students should be able to understand the dynamics of memory by the use of pointers.
6) Students should be able to use different data structures.
INDEX

Unit Description Periods

1 An Overview of C++ programming language, C++ Expressions, C++ 15L

Statements.
2 Arrays and Null-Terminated Strings, Pointers, Functions. 15L

3 Structures, Unions, Enumerations and User-Defined Types, The 15L

Preprocessor and Comments.

Total 45L
BHAVANS AUTONOMOUS COLLEGE, SYLLABUS FOR FYBSc(Computer science) 2021-2022

Detailed syllabus
Units Detailed descriptions Lecture period
/Unit
I An Overview: 15Lectures
The Origins and History, Middle-Level Language, Structured
Language, Programmer’s Language, The Form of a C++ Program, The
Library and Linking, Separate Compilation, Understanding the .C and
.CPP File Extensions
Expressions:
The Five Basic Data Types, Modifying the Basic Types, Identifier
Names, Variables, The const and volatile Qualifiers, Storage Class
Specifiers, Variable Initializations, Constants, Operators, Expressions
Statements:
True and False in C and C++, Selection Statements (if, nested if,
conditional operator, switch, nested switch), Iteration Statements
(while, do..while, for), Declaring Variables Within Selection and
Iteration Statements, Jump Statements (return, goto, break, exit,
continue), expression statements, block statements.
(Ch-1, 2, 3)
II Arrays and Null-Terminated Strings: 15Lectures
Single-Dimension Arrays, Generating a Pointer to an Array, Passing
Single-Dimension Arrays to Functions, Null-Terminated Strings, Two-
Dimensional Arrays, Arrays of Strings, Multidimensional Arrays,
Indexing Pointers, Array Initialization.
Pointers:
What Are Pointers, Pointer Variables, The Pointer Operators, Pointer
Expressions, Pointers and Arrays, Multiple Indirection, Initializing
Pointers, Pointers to Functions, Dynamic Allocation Functions
Functions:
The General Form of a Function, Scope Rules of Functions,
Function Arguments, Call by Value, Call by Reference, Creating a Call
by Reference, Calling Functions with Arrays, argc and argv—
Arguments to main(), The return Statement, Recursion
(Ch-4, 5, 6)
III Structures, Unions, Enumerations and User-Defined Types: 15Lectures
Structures, Arrays of Structures, Passing Structures to Functions,
Structure Pointers, Arrays and Structures Within Structures, Unions,
Bit-Fields, Enumerations, Using sizeof to Ensure Portability, typedef
The Preprocessor and Comments:
The Preprocessor, #define, #error, #include, Conditional Compilation
Directives(#if, #else, #elif, and #endif #ifdef and #ifndef, #undef)
Using defined, #line, #pragma, The # and ## Preprocessor Operators,
 BHAVANS AUTONOMOUS COLLEGE, SYLLABUS FOR FYBSc(Computer science) 2021-2022

Predefined Macro Names, Comments, Single-Line Comments (Ch-7,

10)
Total 45Lectures

Text Book:
1. The Complete Reference C++ (fourth edition): Herbert Schildt
(https://docs.google.com/file/d/0ByYLraYXu0PHYVJHcEFtcFFCNVE/edit)

Reference Books:
1. Mastering C++: K.R.Venugopal, Rajkumar Buyya, T. Ravishankar
(https://tfetimes.com/wp-content/uploads/2015/09/Mastering-C-By-KR-Venugopal-1.pdf)
2. Object Oriented Programming with C++(fourth edition): E. Balagurusamy
(http://www.mktechnocratcampuspatan.com/uploads/development/facility_560099.pdf)

Self-Study topics:
1. Evolution of programming languages.
2. Types of programming languages.
3. Top programming languages in market.
4. Benefits of C++ programming.
5. Comparative study of C++ with other languages.

List of Topics for the practicals:

1. Programs to understand the basic data types and I/O.
2. Programs on Operators and Expressions
3. Programs on decision statements.
4. Programs on switch-case statements
5. Programs on looping.
6. Programs on arrays.
7. Programs on string manipulations
8. Programs on pointers.
9. Programs on functions.
10. Programs on structures and unions.
11. Program on pre-processors.

Details of Conduct of Practical Examination (Evaluation Scheme):

40 -Marks practical work
05 -Marks Viva
05 -Marks Journal
 BHAVANS AUTONOMOUS COLLEGE, SYLLABUS FOR FYBSc(Computer science) 2021-2022

Programming with Python- I

Programme: B.Sc.(CS) Semester: I

Course : Programming with Python- I Course Code: BH.USCS102
Teaching Scheme Evaluation Scheme (Theory)
Lecture Practical Tutorial Credits Continuous End Semester
(Periods (Periods (Periods (Theory Internal Examination (ESE)
per week) per week per week +Practical Assessment
per per ) (CIA)
batch) batch)
3 3 1 2+1 (Marks - 40) (Marks: 60)
Pre-requisites:
Basic concept of programming, types of programming languages, Qualities of good programming
language etc. knowledge of basic concept like software, hardware etc.

Course Objectives:
The objective of this paper is to introduce various concepts of programming to the students using
Python.
 BHAVANS AUTONOMOUS COLLEGE, SYLLABUS FOR FYBSc(Computer science) 2021-2022

Course Outcomes: After successfully completing the course

1) Students should be able to understand the concepts of programming before actually starting to
write programs.
2) Students should be able to develop logic for Problem Solving.
3) Students should be made familiar about the basic constructs of programming such as data,
operations, conditions, loops, functions etc.
4) Students should be able to apply the problem solving skills using syntactically simple
language i.e. Python (version: 3.X or higher)

INDEX
Unit Periods
Description
1 Introduction, Expression evaluation, Enumeration of simple and 15 L
compound statements, Interactive and script modes of IDLE,
Compound data types.
2 Control flow statements, Dictionaries, Working with Functions. 15 L

3 Anonymous functions, List comprehensions, Gentle introduction to 15 L

object-oriented programming.

Total 45 L

Detailed syllabus
Units Detailed descriptions Lecture period
/Unit
Introduction: Reasons for Python as the learner’s first programming
language. Introduction to the IDLE interpreter (shell) and its
1 documentation.

Expression evaluation: similarities and differences compared to a

calculator expressions and operators of types int, float, Boolean. Built-
in function type. Operator precedence.
15Lectures
Enumeration of simple and compound statements: The expression
statement. The assert statement, whose operand is a Boolean
expression (values true or false). The assignment statement, dynamic
binding of names to values, (type is associated with data and not with
names) automatic and implicit declaration of variable names with the
assignment statement assigning the value None to a name. The del
(delete) statement. Input/output with print and input functions. A
BHAVANS AUTONOMOUS COLLEGE, SYLLABUS FOR FYBSc(Computer science) 2021-2022

statement list (semi-colon separated list of simple statements on a

single line) as a single interpreter command. The import statement for
already-defined functions and constants. The augmented assignment
statement. The built-inhelp() function.

Interactive and script modes of IDLE, running a script, restarting

the shell. The compound statement def to define functions the role of
indentation for delimiting the body of a compound statement calling a
previously defined function.

Compound data types string, tuple and list (enclosed in quotes,

parentheses and brackets, respectively). Indexing individual elements
within these types. Strings and tuples are immutable, lists are mutable.
Built- in functions min, max, sum. Interactive solution of model
problems, (e.g., finding the square root of a number or zero of a
function), by repeatedly executing the body of a loop (where the body
is a statement list).

Control flow statements: The iterative for statement. The conditional

statements if, if-else, if-elif-else. The iterative statements while, while-
2 else, for-else. The continue statement to skip over one iteration of a 15Lectures
loop, the break statement to exit the loop. Nested compound
statements.

Dictionaries: concept of key-value pairs, techniques to create, update

and delete dictionary items. Problem-solving using compound types
and statements.

Working with Functions: Advantages of functions, function

parameters, formal parameters, actual parameters, global and local
variables. The range function.

Anonymous functions.
3 List comprehensions. 15Lectures
Gentle introduction to object-oriented programming using the built-in
dir() function,
Enumerate the methods of strings, tuples, lists, dictionaries. Using
these methods for problem-solving with compound types.
Total 45Lectures
 BHAVANS AUTONOMOUS COLLEGE, SYLLABUS FOR FYBSc(Computer science) 2021-2022

Text books:
1. Magnus Lie Hetland, Beginning Python: From Novice to Professional, Apress
2. Paul Gries, et al., Practical Programming: An Introduction to Computer Science Using
Python 3, Pragmatic Bookshelf, 2/E 2014

Reference Books:
1. Charles Dierbach, Introduction to computer Science using Python, Wiley, 2013
2. Paul Gries , Jennifer Campbell, Jason Montojo, Practical Programming: An Introduction to
computer Science Using Python 3, Pragmatic Bookshelf, 2/E 2014
3. Adesh Pandey, Programming Languages – Principles and Paradigms, Narosa, 2008

Self-Study topics:
1. Evolution of programming languages.
2. Types of programming languages.
3. IDLE of python.
4. Top programming languages in market.
5. Benefits of python programming.
6. Comparative study of python with other languages.

List of Topics for the practicals:

1. Installing and setting up the Python IDLE interpreter. Executing simple statements like
expression statement (numeric and Boolean types), assert, assignment, delete statements; the
print function for output.
2. Script and interactive modes; defining a function in the two modes; executing a script;
interactively executing a statement list (semicolon-separated sequence of simple statements);
the input function.
3. Programs based on lists, conditional constructs, the for statement and the range function;
interactively using the built-in functions len, sum, max, min
4. Programs related to string manipulation
5. Programs based on the while statement; importing and executing built-in functions from the
time, math and random modules
6. Programs using break and continue statements.
7. Programs related to dictionaries.
8. Programs using list comprehensions and anonymous functions
9. Programs using the built-in methods of the string, list and dictionary classes

Details of Conduct of Practical Examination (Evaluation Scheme):

40 -Marks practical work, 05 -Marks Viva, 05 -Marks Journal

Computer Organization and Design

Programme: B.Sc.(CS) Semester: I

Course: Computer Organization and Design Course Code: BH.USCS103
 BHAVANS AUTONOMOUS COLLEGE, SYLLABUS FOR FYBSc(Computer science) 2021-2022

Teaching Scheme Evaluation Scheme (Theory)

Lecture Practical Tutorial Credits Continuous End Semester
(Periods (Periods (Periods (Theory Internal Examination (ESE)
per week) per week per week +Practical Assessment
per per ) (CIA)
batch) batch)
3 3 1 2+1 (Marks - 40) (Marks: 60)
Pre-requisites:
Knowledge of basic working of a computer.
Course Objectives:
To understand the structure and operation of modern processors and their instruction sets.
Course Outcomes: After successfully completing the course
1. To learn about how computer systems work and underlying principles.
2. To understand the basics of digital electronics needed for computers.
3. To understand the basics of instruction set architecture for reduced and complex instruction sets.
4. To understand the basics of processor structure and operation.
5. To understand how data is transferred between the processor and I/O devices.

INDEX

Unit Description Periods

1 Digital Logic Circuits, Digital Components, Data Representation. 15L

2 Register Transfer, Basic Computer Organization and Design, 15L

Programming the Basic Computer.

3 Central Processing Unit, Input Output Organization, Memory 15L

Organization.
Total 45L

Detailed syllabus
Units Detailed descriptions Lecture period
/Unit
BHAVANS AUTONOMOUS COLLEGE, SYLLABUS FOR FYBSc(Computer science) 2021-2022

Unit I Digital Logic Circuits: 15Lectures

Digital Computers, Logic Gates - Basic, Universal gates and
implementation, Boolean Algebra - Complement of a function,
Map Simplification - Product-of-sum simplification, don't care
conditions, Combinational Circuits - Half-adder, full-adder, Flip-
Flops - SR, D, JK, T, Edge Triggered, Sequential Circuits - Flip
flop input equations, state table, state diagram.
Digital Components:
Integrated Circuits, Decoders-NAND gate decoder, Decoder
Expansion, Encoders Multiplexers, Registers - Register with
Parallel Load, Shift Registers - Bidirectional Shift Register, Binary
Counters - with parallel load, Memory Unit - Random Access
Memory, Read-Only Memory, Types of ROMs
Data Representation:
Data Types - Number Systems, Octal and Hexadecimal Numbers,
Decimal representation, Alphanumeric Representation,
Complements - (r-1)'s Complement, r's Complement, Subtraction of
unsigned numbers , Other Binary Codes - Gray Code, Other
decimal and alphanumeric codes, Error Detection Codes (Ch-
1,2,3)

Unit II Register Transfer: 15Lectures

Register Transfer Language, Register Transfer, Bus and Memory
Transfers - Three state bus buffers, Memory transfer, Arithmetic
Micro operations - Binary Adder, Binary Adder-Subtractor, Binary
Incrementer, Arithmetic Circuit.
Basic Computer Organization and Design:
Instruction Codes - Stores Program, Indirect Address, Registers,
Instructions, Timing and Control, Instruction Cycle - Fetch and
decode, type of instruction, register-reference instructions.
Programming the Basic Computer:
Introduction, Machine Language, Assembly Language - Rules of
the Language with example, Translation to Binary, Assembler -
Representation of symbolic program in memory, First Pass, Second
Pass (Ch- 4,5,6)
Unit III Central Processing Unit: 15Lectures
 BHAVANS AUTONOMOUS COLLEGE, SYLLABUS FOR FYBSc(Computer science) 2021-2022

Introduction, Register Organization, Stack Organization,

Instruction Formats, Addressing Modes, Data Transfer and
manipulation, Program Control, Decimal Arithmetic Unit
Input Output Organization:
Peripheral devices, Input-Output Interface, Priority Interrupt, Direct
Memory Access
Memory Organization:
Memory Hierarchy, Main Memory, Auxiliary Memory, Associative
Memory, Cache Memory, Virtual Memory, Memory Management
Hardware(Ch- 8,10,11,12)
TOTAL 45Lectures
Text books:
1. Computer System Architecture (third edition): M. Morris Mano
(https://poojavaishnav.files.wordpress.com/2015/05/mano- m- m-computer-system-
architecture.pdf )

Reference Books:
1. Computer Organization and Architecture (tenth edition): William Stallings
(https://tfetimes.com/wp-content/uploads/2015/09/Mastering-C-By-KR-Venugopal-1.pdf)
2. Computer Organization and Design (Fifth Edition): Carl Hamacher

Self-Study topics:
1. Explore more on digital computing.
2. Comparative study of Combinational Circuits.
3. More problem solving on Number system.
4. Learn and differentiate between digital components.
5. Analysis of programming in basic computers.
6. Comparative study of different memory organization methods.

List of Topics for the practicals:

1. Study conversion form decimal numbers to binary, octal and hexadecimal and vice versa
2. Study conversion from Octal to binary and hexadecimal and vice versa
3. Study conversion from binary to hexadecimal and vice versa
4. Study and verify the truth table of various logic gates (NOT, AND, OR, NAND, NOR, EX-
OR, and EX-NOR).
5. Simplify given Boolean expression and realize it.
6. Design and verify a half/full adder
7. Design and verify half/full subtractor
8. Design a 4 bit magnitude comparator using combinational circuits.
9. Design and verify the operation of flip-flops using logic gates.
10. Verify the operation of a counter.
 BHAVANS AUTONOMOUS COLLEGE, SYLLABUS FOR FYBSc(Computer science) 2021-2022

11. Verify the operation of a 4 bit shift register

Details of Conduct of Practical Examination (Evaluation Scheme):

40 -Marks practical work
05 -Marks Viva
05 -Marks Journal
 BHAVANS AUTONOMOUS COLLEGE, SYLLABUS FOR FYBSc(Computer science) 2021-2022

Database Systems

Programme : B.Sc.(CS) Semester: I

Course : Database Systems Course Code: BH.USCS104
Teaching Scheme Evaluation Scheme (Theory)
Lecture Practical Tutorial Credits Continuous End Semester
(Periods (Periods (Periods (Theory Internal Examination (ESE)
per week) per week per week +Practical Assessment
per per ) (CIA)
batch) batch)
3 3 1 2+1 (Marks - 40) (Marks: 60)

Pre-requisites:
Knowledge of computer basics including software and about hardware.
Course Objectives:
1. To introduce the concept of the DBMS with respect to the relational model
2. To specify the functional and data requirements for a typical database application
3. To understand creation, manipulation and querying of data in databases
Course Outcomes: After successfully completing the course
1. Students should be able to evaluate business information problem and find the requirements of
a problem in terms of data.
2. Students should be able to design the database schema with the use of appropriate data types for
storage of data in database.
3. Students should be able to create, manipulate, query and back up the databases
INDEX

Unit Description Periods

1 Introduction to DBMS, Data models, Entity Relationship Model, 15 L

Relational data model and ER to Table
2 Schema refinement and Normal forms , Relational Algebra , DDL 15 L
Statements and DML Statements
3 Functions , Joining Tables, Subqueries , Database Protection , Views and 15 L
DCL Statements
Total 45 L
Detailed syllabus
Units Detailed descriptions Lecture period
/unit
BHAVANS AUTONOMOUS COLLEGE, SYLLABUS FOR FYBSc(Computer science) 2021-2022

1 Introduction to DBMS – Database, DBMS – Definition, Overview of 15 Lectures

DBMS, Advantages of DBMS, Levels of abstraction, Data
independence, DBMS Architecture

Data models - Client/Server Architecture, Object Based Logical

Model, Record Based Logical Model ( relational, hierarchical, network)

Entity Relationship Model - Entities, attributes, entity sets, relations,

relationship sets, Additional constraints (key constraints, participation
constraints, weak entities, aggregation / generalization, Conceptual
Design using ER ( entities VS attributes, Entity Vs relationship, binary
Vs ternary, constraints beyond ER)

Relational data model– Domains, attributes, Tuples and Relations,

Relational Model Notation, Characteristics of Relations, Relational
Constraints - primary key, referential integrity, unique constraint, Null
constraint, Check constraint

ER to Table- Entity to Table, Relationship to tables with and witho ut

key constraints.
15 Lectures
2 Schema refinement and Normal forms: Functional dependencies,
first, second, third, and BCNF normal forms based on primary keys,
lossless join decomposition.

Relational Algebra operations (selection, projection, set operations

union, intersection, difference, cross product, Joins –conditional, equi
join and natural joins, division)

DDL Statements - Creating Databases, Using Databases, datatypes,

Creating Tables (with integrity constraints – primary key, default,
check, not null), Altering Tables, Renaming Tables, Dropping Tables,
Truncating Tables, Backing Up and Restoring databases

DML Statements – Viewing the structure of a table insert, update,

delete, Select all columns, specific columns, unique records,
conditional select, in clause, between clause, limit, aggregate functions
(count, min, max, avg, sum), group by clause, having clause
3 Functions – String Functions (concat, instr, left, right, mid, length,
lcase/lower, ucase/upper, replace, strcmp, trim, ltrim, rtrim), Math
Functions (abs, ceil, floor, mod, pow, sqrt, round, truncate) Date
Functions (adddate, datediff, day, month, year, hour, min, sec, now,
reverse)
 BHAVANS AUTONOMOUS COLLEGE, SYLLABUS FOR FYBSc(Computer science) 2021-2022

Joining Tables – inner join, outer join (left outer, right outer, full outer)
Subqueries – subqueries with IN, EXISTS, subqueries restrictions,
Nested subqueries, ANY/ALL clause, correlated subqueries
15 Lectures
Database Protection: Security Issues, Threats to Databases, Security
Mechanisms, Role of DBA, Discretionary Access Control

Views (creating, altering dropping, renaming and manipulating views)

DCL State ments (creating/dropping users, privileges introduction,

granting/revoking privileges, viewing privileges)
Total 45Lectures

Text books :
1. Ramez Elmasri & Shamkant B.Navathe, Fundamentals of Database Systems, Pearson
Education, Sixth Edition, 2010
2. Ramakrishnam, Gehrke, Database Management Systems, McGraw‐Hill, 2007
3. Joel Murach, Murach’s MySQL, Murach, 2012
4. Silberschatz, H.F. Korth, S. Sudarshan, Database System Concepts 6th Edition, McGraw Hill,
2010.

Reference Books:
1. Robert Sheldon, Geoff Moes, Begning MySQL, Wrox Press, 2005.

Self-study topics
1. Creating database with tables using data types.
2. Perform operations on the table
3. Retrieve data using simple queries
4. Drawing ER diagrams of different scenarios
5. Mapping tables of different datatypes
6. Providing relation between tables

List of Topics for the practicals:

1. For given scenario
 Draw E-R diagram and convert entities and relationships to table.
2. Write relational algebra queries on the tables created in Practical-1.
3. Perform the following:
 Viewing all databases
 Creating a Database
 Viewing all Tables in a Database
 Creating Tables (With and Without Constraints)
 BHAVANS AUTONOMOUS COLLEGE, SYLLABUS FOR FYBSc(Computer science) 2021-2022

 Inserting/Updating/Deleting Records in a Table

 Saving (Commit) and Undoing (rollback)
4. Perform the following:
 Altering a Table
 Dropping/Truncating/Renaming Tables
 Backing up / Restoring a Database
5. Perform the following:
 Simple Queries
 Simple Queries with Aggregate functions
 Queries with Aggregate functions (group by and having clause)
6. Queries involving
 Date Functions
 String Functions
 Math Functions
7. Join Queries
 Inner Join

 Outer Join

8. Subqueries
 With IN clause
 With EXISTS clause
9. Views
 Creating Views (with and without check option)
 Dropping views
 Selecting from a view

10. DCL statements

 Granting and revoking permission.

Details of Conduct of Practical Examination (Evaluation Scheme):

40 -Marks practical work

05 -Marks Viva
05 -Marks Journal
 BHAVANS AUTONOMOUS COLLEGE, SYLLABUS FOR FYBSc(Computer science) 2021-2022

Discrete Mathematics

Programme: B.Sc.(CS) Semester: I

Course: Discrete Mathematics Course Code : BH.USCS105
Teaching Scheme Evaluation Scheme (Theory)
Lecture Practical Tutorial Credits Continuous End Semester
(Periods (Periods (Periods (Theory Internal Examination (ESE)
per week) per week per week +Practical Assessment
per per ) (CIA)
batch) batch)
3 3 1 2+1 (Marks - 40) (Marks: 60)

Pre-requisites:
Requires basic knowledge of abstract algebra.

Course Objectives:
1. The purpose of the course is to familiarize the prospective learners with mathematical
structures that are fundamentally discrete.
2. This course introduces sets and functions, forming and solving recurrence relations and
different counting principles.
3. These concepts are useful to study or describe objects or problems in computer algorithms and
programming languages.

Course Outcomes: After successfully completing the course the student will be able
1. To provide overview of theory of discrete objects, starting with relations and partially ordered
sets.
2. Study about recurrence relations, generating function and operations on them.
3. Give an understanding of graphs and trees, which are widely used in software.
4. Provide basic knowledge about models of automata theory and the corresponding formal
languages.

INDEX
Unit Description Periods

1 Recurrence Relations 15L

(a) Functions
(b) Relations
(c) Recurrence Relations
BHAVANS AUTONOMOUS COLLEGE, SYLLABUS FOR FYBSc(Computer science) 2021-2022

2 Counting Principles, Languages and Finite State Machine 15L

(a) Permutations and Combinations
(b) Counting Principles
(c) Languages, Grammars and Machines
3 Graphs and Trees 15L
(a) Graphs
(b) Trees
Total 45L

Detailed syllabus
Units Detailed descriptions Lecture period
/Unit
1 Recurrence Relations

(a) Functions: Definition of function. Domain, co domain and the

range of a function. Direct and inverse images. Injective, surjective
and bijective functions. Composite and inverse functions.
15Lectures
(b) Relations: Definition and examples. Properties of relations, Partial
Ordering sets, Linear Ordering Hasse Diagrams, Maximum and
Minimum elements, Lattices

(c) Recurrence Relations: Definition of recurrence relations,

formulating recurrence relations, solving recurrence relations- Back
tracking method, Linear homogeneous recurrence relations with
constant coefficients. Solving linear homogeneous recurrence
relations with constant coefficients of degree two when characteristic
equation has distinct roots and only one root, Particular solutions of
nonlinear homogeneous recurrence relation, Solution of recurrence
relation by the method of generation functions, Applications-
Formulate and solve recurrence relation for Fibonacci numbers,
Tower of Hanoi, Intersection of lines in a plane, Sorting Algorithms.

2 Counting Principles, Languages and Finite State Machine

(a) Permutations and Combinations: Partition and Distribution of

objects, Permutation with distinct and indistinct objects, Binomial
numbers, Combination with identities: Pascal Identity, 15Lectures
Vandermonde’s Identity, Pascal triangle, Binomial theorem,
Combination with indistinct objects.
 BHAVANS AUTONOMOUS COLLEGE, SYLLABUS FOR FYBSc(Computer science) 2021-2022

(b) Counting Principles: Sum and Product Rules, Two-way counting,

Tree diagram for solving counting problems, Pigeonhole Principle
(without proof); Simple examples, Inclusion Exclusion Principle
(Sieve formula) (Without proof).

(c) Languages, Grammars and Machines: Languages, regular

Expression and Regular languages, Finite state Automata, grammars,
Finite state machines, Gödel numbers, Turing machines.

3 Graphs and Trees 15Lectures

(a) Graphs : Definition and elementary results, Adjacency matrix,

path matrix, Representing relations using diagraphs, Warshall’s
algorithm- shortest path , Linked representation of a graph, Operations
on graph with algorithms - searching in a graph; Insertion in a graph,
Deleting from a graph, Traversing a graph Breadth-First search and
Depth-First search.
(b) Trees: Definition and elementary results. Ordered rooted tree,
Binary trees, Complete and extended binary trees, representing binary
trees in memory, traversing binary trees, binary search tree,
Algorithms for searching and inserting in binary search trees,
Algorithms for deleting in a binary search tree
Total 45Lectures

Text books:
1. Discrete Mathematics and Its Applications, Seventh Edition by Kenneth H. Rosen, McGraw
Hill Education (India) Private Limited. (2011)

Reference Books:
1) Norman L. Biggs, Discrete Mathematics, Revised Edition, Clarendon Press, Oxford 1989.
2) Data Structures Seymour Lipschutz, Schaum’s out lines, McGraw- Hill Inc.

Self-Study topics:
Basics and revision of
1. Functions
2. Relations
3. Graphs
 BHAVANS AUTONOMOUS COLLEGE, SYLLABUS FOR FYBSc(Computer science) 2021-2022

List of Topics for the practicals:

1. Graphs of standard functions such as absolute value function, inverse function, logarithmic
and exponential functions, flooring and ceiling functions, trigonometric functions over
suitable intervals.
2. Partial ordering sets, Hasse diagram and Lattices.
3. Recurrence relation.
4. Different counting principles.
5. Finite state Automata and Finite state machines.
6. Warshall’s Algorithm.
7. Shortest Path algorithms.
8. Operations on graph.
9. Breadth and Depth First search algorithms.
10. Concept of searching, inserting and deleting from binary search trees.

Details of Conduct of Practical Examination (Evaluation Scheme):

40 -Marks practical work
05 -Marks Viva
05 -Marks Journal
 BHAVANS AUTONOMOUS COLLEGE, SYLLABUS FOR FYBSc(Computer science) 2021-2022

Descriptive Statistics and Introduction to Probability

Programme: B.Sc.(CS) Semester: I

Course: Descriptive Statistics and Introduction to Course Code:BH.USCS106
Probability
Teaching Scheme Evaluation Scheme (Theory)
Lecture Practical Tutorial Credits Continuous End Semester
(Periods (Periods (Periods (Theory Internal Examination (ESE)
per week) per week per week +Practical Assessment
per per ) (CIA)
batch) batch)
3 3 1 2+1 (Marks - 40) (Marks: 60)

Pre-requisites:
Knowledge of basic mathematics and its rules.

Course Objectives:
1) The purpose of this course is to familiarize students with basics of Statistics.
2) This will be essential for prospective researchers and professionals to know these basics.

Course Outcomes: After successfully completing the course the student will be able to
1) know descriptive statistical concepts.
2) Enable study of probability concept required for Computer learners.

INDEX

Unit Description Periods

1 Introduction to Statistics 15L

Data type, Data Presentation, Frequency Distribution, Histogram,

Measures of Central Tendency, Arithmetic Mean, Median, Mode,
Relationship between mean median and mode, Measures of Dispersion,
Quartiles, Inter Quartile Range, Quartile deviation, Standard Deviation
2 Moments 15L

Moments, Measures of Skewness and Kurtosis, Correlation and

Regression, Linear Regression
BHAVANS AUTONOMOUS COLLEGE, SYLLABUS FOR FYBSc(Computer science) 2021-2022

3 Probability 15L

Permutations and Combinations, Basic definitions, Axioms of Probability,

Conditional Probability, Multiplication Theorem of probability,
Independent Events, Bayes’ Theorem, Implementation of Independent
events
Total 45L

Detailed syllabus
Units Detailed descriptions Lecture period
/Unit
1 Data Presentation
Data types: attribute, variable, discrete and continuous variable
Data presentation: frequency distribution, histogram o give, curves,
stem and leaf display 15Lectures

Data Aggregation
Measures of Central tendency: Mean, Median, mode for raw data,
discrete, grouped frequency distribution.
Measures of dispersion: Variance, standard deviation, coefficient of
variation for raw data, discrete and grouped
frequency distribution, quartiles, quantiles Real life examples

2 Moments: raw moments, central moments, relation between raw and

central moments

Measures of Skewness and Kurtosis: based on moments, quartiles,

relation between mean, median, mode for symmetric, asymmetric 15Lectures
frequency curve.

Correlation and Regression: bivariate data, scatter plot, correlation,

nonsense correlation, Karl Pearson’s coefficients of correlation,
independence.

Linear regression: fitting of linear regression using least square

regression, coefficient of determination, properties of regression
coefficients (only statement)

3 Probability: Random experiment, sample space, events types and 15Lectures

operations of events.
 BHAVANS AUTONOMOUS COLLEGE, SYLLABUS FOR FYBSc(Computer science) 2021-2022

Probability definition: classical, axiomatic, Elementary Theorems of

probability (without proof) 
0 ≤ P(A) ≤ 1,
P(A  B) = P(A) + P(B) - P(A  B),
P (A’) = 1 - P(A),
P(A) ≤ P(B) if A  B
Conditional probability, ‘Bayes’ theorem, independence, Examples on
Probability
Total 45Lectures

Text books:
1) Trivedi, K.S.(2001) : Probability, Statistics, Design of Experiments and Queuing theory, with
applications of Computer Science, Prentice Hall of India, New Delhi

Reference Books:
1) Ross, S.M. (2006): A First course in probability. 6th Edⁿ Pearson
2. Kulkarni, M.B., Ghatpande, S.B. and Gore, S.D. (1999): common statistical tests. Satyajeet
Prakashan, Pune
3. Gupta, S.C. and Kapoor, V.K. (1987): Fundamentals of Mathematical Statistics, S. Chand and
Sons, New Delhi
4. Gupta, S.C. and Kapoor, V.K. (1999): Applied Statistics, S. Chand and Son’s, New Delhi
5. Montgomery, D.C. (2001): Planning and Analysis of Experiments, wiley.

Self-Study topics:
1) Basic Concepts of Permutation and Combination.

List of Topics for the practicals:

Practical to be implemented using R software
1. Frequency distribution and data presentation
2. Measures of central tendency
3. Data entry using, functions, c(), scan (), Creating vectors, Mathematical Operations: ** +/-/*/
/ ^ , exp, log, log10, etc, creating vector of text type, useful functions: data, frame, matrix
operations, seq(), split() etc.
4. Frequency distribution using cut(), table()
5. Data presentation
6. Summary Statistics (measures of central tendency, dispersion)
7. Measures of skewness and kurtosis
8. Correlation and regression
9. Probability
10. Conditional probability

Details of Conduct of Practical Examination (Evaluation Scheme):

 BHAVANS AUTONOMOUS COLLEGE, SYLLABUS FOR FYBSc(Computer science) 2021-2022

40 -Marks practical work

05 -Marks Viva
05 -Marks Journal
 BHAVANS AUTONOMOUS COLLEGE, SYLLABUS FOR FYBSc(Computer science) 2021-2022

Green Technology

Programme: B.Sc (Computer Science) Semester: I

Course : Green Technology Course Code: BH.USCS107
Teaching Scheme Evaluation Scheme (Theory)
Lecture Practical Tutorial Credits Internal End Semester
(Periods (Periods (Periods (Theory Evaluation Examination (Activity
per week) per week per week +Practical Based)
per per )
batch) batch)
3 --- 1 2 (Marks:50) (Marks:50)
Pre-requisites:
Basic knowledge of the environment and factors causing environmental degradation.
Course Objectives:
1. To introduce the concept of Green IT to the students.
2. To help students understand need and methods of implementation of Green IT
3. To enable students to use knowledge in a practical manner to evaluate real life situations
Course Outcomes:
After successful completion of syllabus students can evaluate the “greenness” of an organization in
real-life situations.

INDEX

Unit Description Periods

Overview and Issues:

Problems: Toxins, Power Consumption, Equipment Disposal,
Company’s Carbon Footprint: Measuring, Details, reasons to bother,
Plan for the Future, Cost Savings: Hardware, Power.

Initiatives and Standards:

Global Initiatives: United Nations, Basel Action Network, Basel
1 15 Lectures
Convention, North America: The United States, Canada, Australia,
Europe, WEEE Directive, RoHS, National Adoption

Minimizing Power Usage:

Power Problems, Monitoring Power Usage, Servers, Low-Cost
Options, Reducing Power Use, Data De-Duplication,
Virtualization, Management, Bigger Drives, Involving the Utility
Company, Low- Power Computers, PCs, Linux, Components,
Servers, Computer Settings, Storage, Monitors, Power Supplies,
Wireless Devices, Software.
BHAVANS AUTONOMOUS COLLEGE, SYLLABUS FOR FYBSc(Computer science) 2021-2022

Cooling:
Cooling Costs, Power Cost, Causes of Cost, Calculating Cooling
Needs, Reducing Cooling Costs, Economizers, On-Demand Cooling,
HP’s Solution, Optimizing Airflow, Hot Aisle/Cold Aisle, Raised
Floors, Cable Management, Vapour Seal, Prevent Recirculation of
Equipment Exhaust, Supply Air Directly to Heat Sources, Fans,
Humidity, Adding Cooling, Fluid Considerations, System Design,
Datacentre Design, Centralized Control, Design for Your Needs, Put
Everything Together.

2 15Lectures
Changing the Way of Work:
Old Behaviours, starting at the Top, Process Reengineering with Green
in Mind, Analysing the Global Impact of Local Actions, Steps: Water,
Recycling, Energy, Pollutants, Teleworkers and Outsourcing,
Telecommuting, Outsourcing, how to Outsource.

Going Paperless:
Paper Problems, The Environment, Costs: Paper and Office,
Practicality, Storage, Destruction, Going Paperless, Organizational
Realities, Changing Over, Paperless Billing, Handheld Computers
vs. the Clipboard, Unified Communications, Intranets, What to
Include, Building an Intranet, Microsoft Office SharePoint Server
2007, Electronic Data Interchange (EDI), Nuts and Bolts, Value
Added Networks, Advantages, Obstacles.
BHAVANS AUTONOMOUS COLLEGE, SYLLABUS FOR FYBSc(Computer science) 2021-2022

Recycling:
Problems, China, Africa, Materials, Means of Disposal, Recycling,
Refurbishing, Make the Decision, Life Cycle, from beginning to end,
Life, Cost, Green Design, Recycling Companies, Finding the Best
One,
Checklist, Certifications, Hard Drive Recycling, Consequences,
cleaning a Hard Drive, Pros and cons of each method, CDs and DVDs,
good and bad about CD and DVDs disposal, Change the mind-set,
David vs. America Online

3 Hardware Considerations: 15 Lectures

Certification Programs, EPEAT, RoHS, Energy Star, Computers,
Monitors, Printers, Scanners, All-in-Ones, Thin Clients, Servers, Blade
Servers, Consolidation, Products, Hardware Considerations, Planned
Obsolescence, Packaging, Toxins, Other Factors, Remote Desktop,
Using Remote Desktop, Establishing a Connection, In Practice.
 BHAVANS AUTONOMOUS COLLEGE, SYLLABUS FOR FYBSc(Computer science) 2021-2022

Total 45 Lectures

Text books
1. Green IT Toby Velte,Anthony Velte,Robert Elsen Peter, McGraw Hill 2008

Reference Books:
1. Green Data Center: Steps for the Journey Alvin Galea, Michael Schaefer, Mike Ebbers Shroff
Publishers and Distributers 2011
2. Green Computing and Green IT Best Practice Jason Harris Emereo

Modality of Assessment

Theory Examination Pattern:

A) Internal Assessment- 50%- 50 Marks

Sr No Evaluation type Total Marks

1 Conduct 5 Assignments (for 10 marks each) throughout the course

of the syllabus.
50
These assignments may be any of the following: Case study based,
Recall based, Analysis Based.
 BHAVANS AUTONOMOUS COLLEGE, SYLLABUS FOR FYBSc(Computer science) 2021-2022

B ) External Examination- 50%- 50 Marks

1. A project should be done based on the objectives of Green Technology. A report of

minimum 30 pages should be prepared. The report should have a font size of 12,
Times new roman and 1.5 line spacing. The headings should have font size 14. The
report should be hard bound/ spiral bound.

2. The project can be done individually or a group of two students.

3. The students will have to present the project during the examination.

4. A certified copy of the project report is essential to appear for the examination.

5. Project will be evaluated based on the below-given criteria

a. Documentation-10 Marks
b. Data Collection Methodology- 10 Marks
c. Results and Inferences: 10 Marks
d. Presentation of the project- 10Marks
e. Viva voice-10 Marks

DETAILED SYLLABUS

SEMESTER II

Object Oriented Programming with C++

Programme: B.Sc.(CS) Semester: II

Course: Object Oriented Programming with C++ Course Code:BH.USCS201
Teaching Scheme Evaluation Scheme (Theory)
Lecture Practical Tutorial Credits Continuous End Semester
(Periods (Periods (Periods (Theory Internal Examination (ESE)
per week) per week per week +Practical Assessment
per per ) (CIA)
batch) batch)
3 3 1 2+1 (Marks - 40) (Marks: 60)

Pre-requisites:
 BHAVANS AUTONOMOUS COLLEGE, SYLLABUS FOR FYBSc(Computer science) 2021-2022

Knowledge of basic fundamentals of C++ programming, Conditional control, User defined data type
etc.

Course Objectives: After successfully completing the course

the students will be able to successfully write modular, efficient, maintainable, and portable code.

Course Outcomes: after successfully completing the course the

1. Students should be able to write program based on Classes and objects.
2. Students should be able to understand and use constructor and destructors as per the requirement
of problem definition.
3. Students should be able to design programs involving Arrays, Pointers, References, and the
Dynamic Allocation Operators.
4. Students should be able to explain the concept of polymorphism and its implementation in
programming.
5. Students should be able to understand the role of inheritance and virtual function for reusability.
6. Students should be able to understand concept of Exception and ways to handle them.

INDEX

Unit Description Periods

1 An Overview of C++ programming language, Introduction to Classes and 15L

Objects.
2 Arrays, Pointers, References, and the Dynamic Allocation Operators, 15L
Function Overloading, Copy Constructors, and Default Arguments,
Operator Overloading.
3 Inheritance, Virtual Functions and Polymorphism, Exception Handling. 15L

Total 45L

Detailed syllabus
Units Detailed descriptions Lecture period
/Unit
I An Overview of C++: 15L
The Origins of C++, What Is Object-Oriented Programming?
(Encapsulation, Polymorphism, Inheritance), C++ Fundamentals, Old-
Style vs. Modern C++, Introducing C++ Classes, Function
Overloading, Operator Overloading, Inheritance, Constructors and
Destructors, The C++ Keywords, The General Form of a C++ Program
Classes and Objects:
BHAVANS AUTONOMOUS COLLEGE, SYLLABUS FOR FYBSc(Computer science) 2021-2022

Classes, Structures and Classes, Unions and Classes, Anonymous

Unions, Friend Functions, Friend Classes, Inline Functions, Defining
Inline Functions Within a Class, Parameterized Constructors,
Constructors with One Parameter: A Special Case, Static Class
Members, Static Data Members, Static Member Functions, When
Constructors and Destructors Are Executed, The Scope Resolution
Operator, Nested Classes, Local Classes, Passing Objects to Functions,
Returning Objects. (Ch 11, 12, 13)

II Arrays, Pointers, References, and the Dynamic Allocation 15L

Operators:
Arrays of Objects, Pointers to Objects, Type Checking C++ Pointers,
The this Pointer, The this Pointer, Pointers to Class Members,
References, C++'s Dynamic Allocation Operators.

Function Overloading, Copy Constructors, and Default

Arguments:
Function Overloading, Overloading Constructors, Overloading a
Constructor to Gain Flexibility, Allowing Both Initialized and
Uninitialized Objects, Copy Constructors, Finding the Address of an
Overloaded Function, The overload Anachronism, Default Function
Arguments, Default Arguments vs. Overloading, Using Default
Arguments Correctly, Function Overloading and Ambiguity.

Operator Overloading:
Creating a Member Operator Function, Operator Overloading Using a
Friend Function, Overloading new and delete, Overloading Some
Special Operators([], (), ->), Overloading the Comma Operator,
Overloading << and >>
(Ch 14, 15, 16, Ch 20 – specific topic)
III Inheritance: 15L
Base-Class Access Control, Inheritance and protected Members,
Inheriting Multiple Base Classes, Constructors, Destructors, and
Inheritance, Granting Access, Virtual Base Classes

Virtual Functions and Polymorphis m:

Virtual Functions, The Virtual Attribute Is Inherited, Virtual Functions
Are Hierarchical, Pure Virtual Functions (Abstract Classes), Using
Virtual Functions, Early vs. Late Binding

Exception Handling:
 BHAVANS AUTONOMOUS COLLEGE, SYLLABUS FOR FYBSc(Computer science) 2021-2022

Exception Handling Fundamentals, Handling Derived-Class

Exceptions, Exception Handling Options, Understanding terminate()
and unexpected(), The uncaught_exception() Function, The exception
and bad_exception Classes, Applying Exception Handling.
(Ch 17, 19, 21)
Total 45L
Text books:
1) The Complete Reference C++ (fourth edition): Herbert Schildt
(https://docs.google.com/file/d/0ByYLraYXu0PHYVJHcEFtcFFCNVE/edit)

Reference Books:
1. Mastering C++: K.R.Venugopal, Rajkumar Buyya, T. Ravishankar
(https://tfetimes.com/wp-content/uploads/2015/09/Mastering-C-By-KR-Venugopal-1.pdf)
2. Object Oriented Programming with C++(fourth edition): E. Balagurusamy
(http://www.mktechnocratcampuspatan.com/uploads/development/facility_560099.pdf)
Self-Study topics:
1. Explore more on defining classes and object based on practical life scenario.
2. Comparative study of different ways of creating constructor.
3. Explore more on functions.
4. Analyse the term polymorphism and understand its implementation in programming.
5. Study different ways of inheriting parent class data to child class.
6. Face and handle Exceptions using exception handling tools.

List of Topics for the practicals:

1. Programs on Classes and Objects
2. Programs on Arrays of objects and Pointers to objects
3. Programs on References of object and Dynamic Allocation Operators for Objects
4. Programs on Function Overloading
5. Programs on Operator Overloading
6. Programs on Inheritance
7. Programs on Virtual Functions
8. Programs on Polymorphism
9. Programs on Exception Handling

Details of Conduct of Practical Examination (Evaluation Scheme):

40 -Marks practical work
05 -Marks Viva
05 -Marks Journal
 BHAVANS AUTONOMOUS COLLEGE, SYLLABUS FOR FYBSc(Computer science) 2021-2022

Programming with Python- II

Programme: B.Sc.(CS) Semester: II

Course: Programming with Python- II Course Code:BH.USCS202
Teaching Scheme Evaluation Scheme (Theory)
Lecture Practical Tutorial Credits Continuous End Semester
(Periods (Periods (Periods (Theory Internal Examination (ESE)
per week) per week per week +Practical Assessment
per per ) (CIA)
batch) batch)
3 3 1 2+1 (Marks - 40) (Marks: 60)
Pre-requisites:
Concepts of Console based python programming.
Course Objectives:
The objective of this paper is to explore the style of structured programming to give the idea to the
students how programming can be used for designing real-life applications by reading/writing to
files, GUI programming, interfacing database/networks and various other features.
Course Outcomes: after successfully completing the course
1. Students should be able to understand how to read/write to files using python.
2. Students should be able to catch their own errors that happen during execution of programs.
3. Students should get an introduction to the concept of pattern matching.
4. Students should be made familiar with the concepts of GUI controls and designing GUI
applications.
5. Students should be able to connect to the database to move the data to/from the application.
6. Students should know how to connect to computers, read from URL and send email.

INDEX

Unit Description Periods

1 Python File Input-Output, Exception handling, Iterables, iterators and 15L

their problem solving applications, Regular Expressions.

2 GUI Programming in Python (using Tkinter/wxPython/Qt) 15L

3 Database connectivity in Python, Network connectivity 15L

 BHAVANS AUTONOMOUS COLLEGE, SYLLABUS FOR FYBSc(Computer science) 2021-2022

Total 45L

Detailed syllabus
Units Detailed descriptions Lecture period
/Unit
1 Python File Input-Output: Opening and closing files, various types 15Lectures
of file modes, reading and writing to files, manipulating directories.
Exception handling: What is an exception, various keywords to
handle exceptions such try, catch, except, else, finally, raise.
Iterables, iterators and their problem solving applications.
Regular Expressions: Concept of regular expression, various types of
regular expressions, using match function.
2 GUI Programming in Python (using Tkinter/wxPython/Qt) : 15Lectures
What is GUI, Advantages of GUI, and Introduction to GUI library.
Layout management, events and bindings, fonts, colors.
Drawing on canvas (line, oval, rectangle, etc.)
Widgets such as : frame, label, button, checkbutton, entry, listbox,
message, radiobutton, text, spinbox etc
3 Database connectivity in Python: Installing mysql connector, 15Lectures
accessing connector module module, using connect, cursor,execute &
close functions, reading single & multiple results of query execution,
executing different types of statements, executing transactions,
understanding exceptions in database connectivity.
Network connectivity: Socket module, creating server-client
programs, sending email, reading from URL.
Total 45Lectures
Text books:
1 ) Paul Gries , Jennifer Campbell, Jason Montojo, Practical Programming: An Introduction to
computer Science Using Python 3, Pragmatic Bookshelf, 2/E 2014
2) James Payne , Beginning Python: Using Python 2.6 and Python 3, Wiley India, 2010

Reference Books:
1. Lukaszewski, MySQL for Python: Database Access Made Easy, Pact Publisher, 2010
2. Programming Languages - Principles and Paradigms, Adesh Pandey, Narosa
3. Introduction to Computer Science using Python, Charles Dierbach, Wiley, 2013.

Self-Study topics:
1) Reading writing with other file format.
2) Comparative study of iterables and iterators.
3) Face and handle Exceptions using exception handling tools.
4) Explore more GUI application programming.
5) GUI along with DB programming. (Front end- python, Back end- MYSQL/SQLITE)
 BHAVANS AUTONOMOUS COLLEGE, SYLLABUS FOR FYBSc(Computer science) 2021-2022

6) Study different ways of sending an email and finding URL information.

List of Topics for the practicals:

1) Programs to read and write files.
2) Programs with iterables and iterators.
3) Program to demonstrate exception handling.
4) Program to demonstrate the use of regular expressions.
5) Program to show draw shapes & GUI controls.
6) Program to create server-client and exchange basic information.
7) Program to send email & read contents of URL.

Details of Conduct of Practical Examination (Evaluation Scheme):

40 -Marks practical work
05 -Marks Viva,05 -Marks Journal

Linux

Programme: B.Sc.(CS) Semester: II

Course: Linux Course Code:BH.USCS203
Teaching Scheme Evaluation Scheme (Theory)
Lecture Practical Tutorial Credits Continuous End Semester
(Periods (Periods (Periods (Theory Internal Examination (ESE)
per week) per week per week +Practical Assessment
per per ) (CIA)
batch) batch)
3 3 1 2+1 (Marks - 40) (Marks: 60)
Pre-requisites:
Basic Knowledge of software’s, different platforms and computer system.
Course Objectives:
1. To introduce the concept behind Free and Open Source Software's, its use, importance and impact
in the society.
2. To explain the open source methodologies and ecosystem to students.
3. To demonstrate various open source software's, platforms and technologies in use.

INDEX

Unit Periods
Description
1 Linux System, Linux Basics, Basic bash shell commands, More bash 15L
shell commands, The Linux environment variable, Understanding Linux
file permission.
BHAVANS AUTONOMOUS COLLEGE, SYLLABUS FOR FYBSc(Computer science) 2021-2022

2 Basic script building, Using structured commands, More structured 15L

commands, Handling user input, Presenting data, Script control.
3 Essential System Administration, TCP/IP networking, Advanced System 15L
Administration, Text Editors.
Total 45L

Detailed syllabus
Units Detailed descriptions Lecture period
/Unit
1 Linux System: History, Design Principles, Kernel Modules, Process 15Lectures
Management, Scheduling, Memory Management, File system, I/O.
(SGG: 20.1 to 20.8)

Linux Basics: Looking into the Linux Kernel, GNU Utilities, Desktop
environments. (RB: Chapter-1) , The Linux console (RB: Chapter-2)
The Unix/Linux architecture, Features of Unix/Linux. . (SD: 2.1, 2.2)

Basic bash shell commands: Starting the shell, Shell prompt, File
system Navigation, File and directory listing, File handling, Directory
handling, Viewing file contents. (RB: Chapter-3)

More bash shell commands: Monitoring programs, Monitoring disk

space, Working with data files: Sorting, Searching, Compressing,
Archiving. (RB: Chapter-4)

The Linux e nvironment variable: Environment variables, setting

environment variables, Removing environment variables, Default shell
environment variables, setting the PATH environment variables,
Locating system environment variables, Variable arrays, Using
command aliases. (RB: Chapter-5)

Unde rstanding Linux file permission: Linux security, Using Linux

groups, Decoding file permissions, Changing security settings, Sharing
files. (RB: Chapter-6)

2 Basic script building: Using multiple commands, Creating a script 15Lectures

file, Displaying messages, Using variables, Redirecting Input and
Output, Pipes, Performing math, Exiting the script. . (RB: Chapter-8)
Using structured commands: Working with the if-then, if-then-else
and nesting if statements, test command, Compound condition testing
advanced, if then features, the case command. (RB: Chapter-9)
More structured commands: for command, C-style for command,
while command, until command, nesting loops, Looping on file data,
Controlling the loop, processing the o/p of a loop. (RB: Chapter-10)
 BHAVANS AUTONOMOUS COLLEGE, SYLLABUS FOR FYBSc(Computer science) 2021-2022

Handling user input: Command line parameters, Special parameter

variables, shift command, working with options, Standardizing
options, Getting user I/P.(RB: Chapter-11)

Presenting data: Understanding I/O, Redirecting O/p in scripts,

Redirecting I/p in scripts, Creating your own redirection, Listing open
file descriptors, Suppressing command o/p, Using temporary files,
Logging Messages. (RB: Chapter-12)

Script control: Handling signals, Running scripts in background

mode, Running scripts without a console, Job control, Job Scheduling
Commands: nice, renice, at, batch, cron table, Running the script at
boot.
(RB: Chapter-13)

3 Essential System Administration: root: The system administrator’s 15Lectures

login, The administrator’s privileges, Startup & Shutdown. (SD: 15.1,
15.2, 15.5)
TCP/IP networking: TCP/IP Basics, TCP/IP Model, Resolving IP
addresses, Applications, telnet, ftp, Berkeley commands. (SD:
Chapter-17)
Advanced System Administration: Partitions & file systems,
/etc/fstab, fsck, System startup and init, Shutdown & sync operation.
(SD: 25.2, 25.6.3, 25.7, 25.8, 25.9)
Text Editors: vim, emacs, Sed and awk (RB: Chapter-16)

Total 45Lectures
Text books:
1) SGG: Operating System Concepts, 6e, Silberschatz, Galvin and Gagne, Wiley.
2) SD: UNIX Concepts and Applications, 4e, Sumitabha Das., TMH.
3) RB: Linux Command line and Shell Scripting: Bible, Richard Blum, Wiley-India.
4) CS: Linux Networking Cookbook, Carla, Schroder, O’reilly

Reference Books:
1. UNIX Complete Reference, TMH.
2. Linux Complete Reference, TMH.
3. inux Command Reference. Shroff.
Self-Study topics:
1. Comparative study of documentation commands
2. Use and compare various Linux distributions.
3. Execute and analyze system administration command.
4. Explore more with Linux File permission security.
 BHAVANS AUTONOMOUS COLLEGE, SYLLABUS FOR FYBSc(Computer science) 2021-2022

5. Explore more in Shell programming.

List of Topics for the practicals:
1. Linux Installation:
a. Install your choice of Linux distribution e.g. Ubuntu, Fedora, Debian.
b. Try different installation media like CD/DVD, USB Drive to install.
c. Customize desktop environment by changing different default options like
changing default background, themes and screensavers.
2. Study of Basic and advanced Linux Commands -
Try the following commands with atleast three options: date, cal, cat, cp, rm who, ps, history,
tty, stty, man, help, echo, pwd, dir, cd, mkdir, rmdir, mv, file, lp, head, tail, more(less), wc, tr,
sort, split, chmod, find, redirection commands.
3. Installing and Removing Software:
a. Install any package. Verify that it runs, and then remove it.
4. Study of Filter Commands-
Try the following commands with atleast three options: od, cmp, comm, diff, cut, paste, uniq,
grep, egrep, fgrep, nl, ln.
5. Command line operations:
a. Install any newpackage on your system
b. Remove the package installed
c. Find the passwd file in / using find command
d. Create a symbolic link to the file you found in last step
e. Create an empty file example.txt and move it in /tmp directory using relative pathname.
f. Delete the file moved to /tmp in previous step using absolute path.
 BHAVANS AUTONOMOUS COLLEGE, SYLLABUS FOR FYBSc(Computer science) 2021-2022

g. Find the location of ls, ps, bash commands.

6. File Operations:
a. Explore mounted filesystems on your system.
b. What are different ways of exploring mounted filesystems on Linux?
c. Archive and backup your home directory or work directory using tar, gzip commands.
d. Use dd command to create files and explore different options to dd.
e. Use diff command to create diff of two files.
f. Use patch command to patch a file. And analyze the patch using diff command again.
7. Use environment
a. Which account are you logged in? How do you find out?
b. Display /etc/shadow file using cat and understand the importance of shadow file. How it’s
different than passwd file.
c. Get you current working directory.
d. Explore different ways of getting command history, how to run previously executed
command without typing it?
e. Create alias to most commonly used commands like.
8. Linux Editors: vim/emacs
a. Create, modify, search and navigate a file in editor.
b. Learn all essential commands like search, search/replace, highlight and show line numbers.
9. Linux Security:
a. Use of sudo to change user privileges to root
b. Identify all operations that require sudo privileges
c. Create a new user and add it to sudo configuration file.
d. Set password for new user.
e. Modify the expiration date for new user using password ageing.
f. Delete newly added user.
10. Network:
a. Get IP address of your machine using ifconfig.
b. If IP is not set, then assign an IP address according to your network settings.
c. Get hostname of your machine.
d. Use ping to check the network connectivity to remote machines.
e. Use telnet/ssh to connect to remote machines and learn the difference between the two.
f. Troubleshooting network using traceroute, ping, route commands.
11. Shell Scripting
a. Searching with grep: Search for your username in the /etc/passwd file.
b. Parsing files with awk: Display in a column a unique list of all the shells used for users in
/etc/passwd. Which field in /etc/passwd holds the shell (user command interpreter in the
manual page)? How do you make a list of unique entries, that is, no repeated entries?
c. Searching and substituting with sed: Search all instances of the user command interpreter
(shell) equal to /bin/false in /etc/passwd and substitute with /bin/bash using sed.
 BHAVANS AUTONOMOUS COLLEGE, SYLLABUS FOR FYBSc(Computer science) 2021-2022

d. Exit status: write a script which does ls to a nonexistent file. Display an exit status of the
previous command. Now create the file and again display the exit status. In each task send the
ls output to /dev/null
e. Working with files: Write a shell script which will ask user for a directory, create that
directory and switch to it and tell the user where you are using pwd command. Now use touch
to create some new files followed by displaying the filenames.
f. Environment variables: Write a script which displays all environment variables on the
system.
g. Functions: Write a script that asks user for a number (1,2 or 3) which is used to call a
function with the number in its name. The function then displays a message with the function
number within it, example: “This message is from function number 4.”
h. Arithmetic: Write a script which will work as arithmetic calculator to add, subtract,
multiply, divide. The user should pass an argument on the command line a letter (a,s,m or d)
and two numbers. If wrong number of arguments are passed then display an error message.
Make use of functions to perform operations.
i. Case Statements: Write a script that will be given a month number as the argument and will
translate this number into a month name. The result will be printed to stdout.
j. Script Arguments and Usage Information: Write a script that takes exactly one argument, a
directory name. The script should print that argument back to standard output. Make sure the
script generates a usage message if needed and that it handles errors with a message.
k. Randomness: Create a script that takes a word as an argument from the user, then appends
a random number to the word and display it to the user. Put in a check to make sure the user
passed in a word, displaying a usage statement if a word was not passed as an argument.
l. Strings: Write a script that will read two strings from the user. The script will perform three
operations on the two strings: (1) Use the test command to see if one of the strings is of zero
length and if the other is of non-zero length, telling the user of both results. (2) Determine the
length of each string and tell the user which is longer or if they are of equal length. (3)
Compare the strings to see if they are the same. Let the user know the result.

12. Processes
a. Background and Foreground Jobs: Create a job that writes the date to an output file thrice,
with a gap of 60 seconds and 180 seconds. Check whether the job is running and bring it to
foreground job. Stop the foreground job and make it run in the background. Finally, kill the
background job and verify its status.

Details of Conduct of Practical Examination (Evaluation Scheme):

40 -Marks practical work
05 -Marks Viva
05 -Marks Journal
 BHAVANS AUTONOMOUS COLLEGE, SYLLABUS FOR FYBSc(Computer science) 2021-2022

Database Management Systems

Programme:. B.Sc.(CS) Semester: II

Course: Database Management Systems Course Code: BH.USCS204
Teaching Scheme Evaluation Scheme (Theory)
Lecture Practical Tutorial Credits Continuous End Semester
(Periods (Periods (Periods (Theory Internal Examination (ESE)
per week) per week per week +Practical Assessment
per per ) (CIA)
batch) batch)
3 3 1 2+1 (Marks - 40) (Marks: 60)
Pre-requisites:
Basic Knowledge of database and SQL is required.
Course Objectives:
1. To develop understanding of concepts and techniques for data management
2. To learn about widely used systems for implementation and usage.
3 To learn PL/SQL
Course Outcomes:
1. Understand concepts and implementations of transaction management and crash recovery.
2. Learn about using PL/SQL for data management. Master concepts of stored procedure and triggers
and its use.
INDEX

Unit Description Periods

1 Advanced Database Management Concepts like Transaction 15L

management, Transaction control language statements and Crash
recovery
2 Basics of PL/SQL-Operators, variables, Datatypes and Control 15L
Structures.
3 Important Data management concepts like cursors, stored procedures, 15L
sequences, triggers, indexing and file organization.
Total 45L

Detailed syllabus
Units Detailed descriptions Lecture period
/unit
1 Transaction Management: ACID Properties, Serializability, Two- 15Lectures
phase Commit Protocol, Concurrency Control, Lock Management,
 BHAVANS AUTONOMOUS COLLEGE, SYLLABUS FOR FYBSc(Computer science) 2021-2022

Lost Update Problem, Inconsistent Read Problem, Read-Write Locks,

Deadlocks Handling, Two Phase Locking protocol.

TCL Statements: Defining a transaction, Making Changes Permanent

with COMMIT, Undoing Changes with ROLLBACK, Undoing
Partial Changes with SAVEPOINT and ROLLBACK.

Crash Recovery: ARIES algorithm. The log based recovery, recovery

related structures like transaction and dirty page table, Write-ahead
log protocol, check points, recovery from a system crash, Redo and
Undo phases.
2 Fundamentals of PL/SQL: Defining variables and constants, 15Lectures
PL/SQL expressions and comparisons: Logical Operators, Boolean
Expressions, CASE Expressions Handling, Null Values in
Comparisons and Conditional Statements, PL/SQL Datatypes:
Number Types, Character Types, Boolean Type, Datetime and
Interval Types.
Overview of PL/SQL Control Structures: Conditional Control: IF
and CASE Statements, IF-THEN Statement, IF-THEN-ELSE
Statement, IFTHEN-ELSIF Statement, CASE Statement, Iterative
Control: LOOP and
EXIT Statements, WHILE-LOOP, FOR-LOOP, Sequential Control:
GOTO and NULL Statements
3 Cursors and Stored Procedures: Concept of Cursors , Types of 15Lectures
Cursors and their Implementation, Types and benefits of stored
procedures, creating stored procedures, executing stored procedures,
altering stored procedures, viewing stored procedures.
Triggers: Concept of triggers, Implementing triggers – creating
triggers, Insert, delete, and update triggers, nested triggers, viewing,
deleting and modifying triggers, and enforcing data integrity through
triggers.
Sequences: creating sequences, referencing, altering and dropping a
sequence.
File Organization and Indexing: Cluster, Primary and secondary
indexing, Index data structure: hash and Tree based indexing,
Comparison of file organization: cost model, Heap files, sorted files,
clustered files. Creating, dropping and maintaining indexes.

Text books
1. Abraham Silberschatz, Henry F. Korth,S. Sudarshan , Database System Concepts, 6 th Edition
2. Ivan Bayross, “SQL,PL/SQL -The Programming language of Oracle”, B.P.B. Publications
 BHAVANS AUTONOMOUS COLLEGE, SYLLABUS FOR FYBSc(Computer science) 2021-2022

Reference Books:
1. Ramez Elmasri & Shamkant B.Navathe, Fundamentals of Database Systems, Pearson Education.
2. Ramakrishnam, Gehrke, Database Management Systems, Bayross, McGraw‐Hill,3rd Edition.
3. https://docs.oracle.com /en/database/oracle/oracle -database/21/cncpt/server-side
programming.html#GUID-D4A154D2-DF56-45DA-863C-BED5DA6BDA34

Self study topics :

1. Can compare SQL with PL/SQL
2. Work with different PL/SQL Operators and Datatypes other than that in the syllabus
3. Learn using triggers and sequences on databases like northwind .
4. Research about companies who use PL/SQL and their purpose of choosing PL/SQL instead
of SQL.

List of Topics for the practicals:

1. Creating and working with Insert/Update/Delete Trigger using Before/After clause.
2. Writing PL/SQL Blocks with basic programming constructs by including following:
a. Sequential Statements
b. unconstrained loop
3. Sequences:
a. Creating simple Sequences with clauses like START WITH, INCREMENT
BY,MAXVALUE, MINVALUE, CYCLE | NOCYCLE, CACHE | NOCACHE,
ORDER | NOORECER.
b. Creating and using Sequences for tables.
4. Writing PL/SQL Blocks with basic programming constructs by including following:
a. If...then...Else, IF...ELSIF...ELSE... END IF
b. Case statement
5. Writing PL/SQL Blocks with basic programming constructs for following Iterative Structure:
a. While-loop Statements
b. For-loop Statements.
6. Writing PL/SQL Blocks with basic programming constructs by including a GoTO to jump
out of a loop and NULL as a statement inside IF
7. Writing Procedures in PL/SQL Block
a. Create an empty procedure, replace a procedure and call procedure
b. Create a stored procedure and call it
c. Define procedure to insert data
d. A forward declaration of procedure
8. Writing Functions in PL/SQL Block.
a. Define and call a function
b. Define and use function in select clause,
c. Call function in dbms_output.put_line
d. Recursive function
e. Count Employee from a function and return value back
 BHAVANS AUTONOMOUS COLLEGE, SYLLABUS FOR FYBSc(Computer science) 2021-2022

f. Call function and store the return value to a variable

g. Writing a recursive Functions in PL/SQL Block
9. Study of transactions and locks
10. Writing PL/SQL Block for Cursors
a. Cursor attributes: %ROWCOUNT, %FOUND, %NOTFOUND, %ISOPEN
b. Cursor with sub queries
c. Combination of PL/SQL, cursor and for loop
d. Parameterized cursors, Cursor Variables

Details of Conduct of Practical Examination (Evaluation Scheme) :

40 -Marks practical work
05 -Marks Viva
05 -Marks Journal
 BHAVANS AUTONOMOUS COLLEGE, SYLLABUS FOR FYBSc(Computer science) 2021-2022

Calculus

Programme: B.Sc.(CS) Semester: II

Course: Calculus Course Code:BH.USCS205
Teaching Scheme Evaluation Scheme (Theory)
Lecture Practical Tutorial Credits Continuous End Semester
(Periods (Periods (Periods (Theory Internal Examination (ESE)
per week) per week per week +Practical Assessment
per per ) (CIA)
batch) batch)
3 3 1 2+1 (Marks - 40) (Marks: 60)
Pre-requisites:
Basic knowledge of Derivatives and Integration will be an added advantage.
Course Objectives:
1. The course is designed to have a grasp of important concepts of Calculus in a scientific way.
2. It covers topics from as basic as definition of functions to partial derivatives of functions in a
gradual and logical way.
3. The learner is expected to solve as many examples as possible to a get compete clarity and
understanding of the topics covered.

Course Outcomes:
1) Understanding of Mathematical concepts like limit, continuity, derivative, integration of
functions.
2) Ability to appreciate real world applications which uses these concepts.
3) Skill to formulate a problem through Mathematical modelling and simulation.

INDEX

Unit Description Periods

1 Derivatives and its applications 15L

2 Integration and its applications 15L

3 Partial derivatives and its applications 15L

Total 45L

Detailed syllabus
Units Detailed descriptions Lecture period
/Unit
1 Derivatives and its applications: 15L
 BHAVANS AUTONOMOUS COLLEGE, SYLLABUS FOR FYBSc(Computer science) 2021-2022

Review of Functions, limit of a function, continuity of a function,

derivative function. Derivative In Graphing And Applications:
Analysis of Functions: Increase, Decrease, Concavity, Relative
Extrema; Graphing Polynomials, Rational Functions, Cusps and
Vertical Tangents. Absolute Maxima and Minima, Applied Maximum
and Minimum Problems, Newton’s Method.

2 Integration and its applications: 15L

An Overview of the Area Problem, Indefinite Integral, Definition of
Area as a Limit; Sigma Notation, Definite Integral, Evaluating
Definite Integrals by Substitution, Area Between Two Curves, Length
of a Plane Curve. Numerical Integration: Simpson’s Rule. Modeling
with Differential Equations, Separation of Variables, Slope Fields,
Euler’s Method, First
Order Differential Equations and Applications.

3 Partial derivatives and its applications: 15L

Functions of Two or More Variables Limits and Continuity Partial
Derivatives, Differentiability, Differentials, and Local Linearity,
Chain Rule, Directional Derivatives and Gradients, Tangent Planes
and Normal, Vectors, Maxima and Minima of Functions of Two
Variables.
45L
Text books:
1. Calculus: Early transcendental (10th Edition): Howard Anton, Irl Bivens, Stephen Davis, John
Wiley & sons, 2012.
Reference Books:
1. Calculus and analytic geometry (9th edition): George B Thomas, Ross L Finney, Addison
Wesley, 1995
2. Calculus: Early Transcendentals (8th Edition): James Stewart, Brooks Cole, 2015.
3. Calculus (10th Edition): Ron Larson, Bruce H. Edwards, Cengage Learning, 2013.
4. Thomas' Calculus (13th Edition): George B. Thomas, Maurice D. Weir, Joel R. Hass,
Pearson, 2014.

Self-Study topics:
1. Basic problem-solving involving Derivatives
2. Basic problem-solving involving Integration

List of Topics for the practicals:

1. Continuity of functions; Derivative of functions
2. Increasing, decreasing, concave up and concave down functions
3. Relative maxima, relative minima, absolute maxima, absolute minima
4. Newton’s method to find approximate solution of an equation
 BHAVANS AUTONOMOUS COLLEGE, SYLLABUS FOR FYBSc(Computer science) 2021-2022

5. Area as a limit and length of a plane curve

6. Numerical integration using Simpson’s rule
7. Solution of a first order first degree differential equation, Euler’s method
8. Calculation of Partial derivatives of functions
9. Local linear approximation and directional derivatives
10. Maxima and minima of functions of two variables.

Details of Conduct of Practical Examination (Evaluation Scheme):

40 -Marks practical work
05 -Marks Viva
05 -Marks Journal

Statistical Methods and Testing of Hypothesis

Programme: B.Sc.(CS) Semester: II

Course : Statistical Methods and Testing of Hypothesis Course Code:BH.USCS206
Teaching Scheme Evaluation Scheme (Theory)
Lecture Practical Tutorial Credits Continuous End Semester
(Periods (Periods (Periods (Theory Internal Examination (ESE)
per week) per week per week +Practical Assessment
per per ) (CIA)
batch) batch)
3 3 1 2+1 (Marks - 40) (Marks: 60)
Pre-requisites:
Basic knowledge of Statistics
Course Objectives:
1. The purpose of this course is to familiarize students with basics of Statistics.
2. Helpful for prospective researchers and professionals to know these basics.

Course Outcomes:
1) Enable learners to know descriptive statistical concepts
2) Enable study of probability concept required for Computer learners

INDEX

Unit Description Periods

1 Standard distributions: 15L

random variable; discrete, continuous, expectation and variance of a
random variable, pmf, pdf, cdf, reliability, Introduction and properties
BHAVANS AUTONOMOUS COLLEGE, SYLLABUS FOR FYBSc(Computer science) 2021-2022

without proof for following distributions; binomial, normal, chi-square,

t, F. Examples
2 Hypothesis testing: 15L
One sided, two sided hypothesis, critical region, p-value, tests based on
t, Normal and F, confidence intervals. Analysis of variance : one-way,
two-way analysis of variance
3 Non-parametric tests: 15L
Need of non-parametric tests, sign test, Wilicoxon’s signed rank test,
run test, Kruskal-Walis tests. Post-hoc analysis of one-way analysis of
variance : Duncan’s test Chi-square test of association
Total 45L

Detailed syllabus
Units Detailed descriptions Lecture period
/Unit
1 Standard distributions
Random Variable Discrete Random Variable, Probability Mass
Function, C.D.F. for discrete random variable, Expectation of Random
Variable, Variance of Discrete random variable
Continuous Random Variable, Probability Density function, C.D.F. of 15Lectures
continuous random variable, properties of C.D.F, Mean and Variance
of continuous random variable
Reliability,
Binomial Distribution, Properties of Binomial distribution,
Normal or Gaussian distribution, Properties of Normal distribution,
Standard Normal distribution,
Introduction to Chi Square Distribution and its properties,
Introduction to t-distribution and its properties,
Introduction to F-distribution and its properties
2 Hypothesis Testing
Introduction to Statistical Hypothesis
One-Sided and Two-sided hypothesis, Type I and Type II error, Level
of Significance, Power of the Test, Sampling Distribution, Standard
Error, Critical Region approach and p-value approach, Test Statistics, 15Lectures
Procedure for Hypothesis testing
Problems based on Normal distribution, t-distribution, f-distribution
Confidence Interval
One Way Analysis of Variance
Two Way Analysis of Variance, Two Way Analysis of Variance
With interactions.
 BHAVANS AUTONOMOUS COLLEGE, SYLLABUS FOR FYBSc(Computer science) 2021-2022

3 Need of Non parametric test

Sign test – Methodology, Problem solving, Table of Critical values
Wilcoxon Signed Rank Test – Methodology, Problem solving, Table
of Critical values
Mann Whitney U test – Methodology, Problem solving, Table of
Critical values 15Lectures
Kruskal Wallis Test – Methodology, Problem solving, Table of
Critical values
Run Test - Methodology, Problem solving, Table of Critical values
Post hoc Analysis – Analysis of Variance (ANOVA) Post-hoc
comparisons, One way Analysis of variance, Partition of variations,
ANOVA table, Linear contrasts, Tukey’s method, SNK method,
Duncan’s test
Chi Square test of Association - Methodology, Problem solving, Table
of Critical values
Total 45Lectures
Text books:
1. Trivedi, K.S.(2009) : Probability, Statistics, Design of Experiments and Queuing theory, with
applications of Computer Science, Prentice Hall of India, New Delhi

Reference Books:
1. Ross, S.M. (2006): A First course in probability. 6th Edⁿ Pearson
2. Kulkarni, M.B., Ghatpande, S.B. and Gore, S.D. (1999): Common statistical tests. Satyajeet
Prakashan, Pune 3. Gupta, S.C. and Kapoor, V.K. (2002) : Fundamentals of Mathematical
Statistics, S. Chand and Sons, New Delhi
3. Gupta, S.C. and Kapoor, V.K. (4 th Edition) : Applied Statistics, S. Chand and Son’s, New
Delhi
4. Montgomery, D.C. (2001): Planning and Analysis of Experiments, Wiley.

Self-Study topics:
1. Properties of Random Variable
2. Properties of Binomial Distribution
3. Properties of Normal Curve
4. Confidence Interval.

List of Topics for the practicals:

1) Problems based on binomial distribution
2) Problems based on normal distribution
3) Property plotting of binomial distribution
4) Property plotting of normal distribution
5) Plotting pdf, cdf, pmf, for discrete and continuous distribution
6) t test, normal test, F test
7) Analysis of Variance
 BHAVANS AUTONOMOUS COLLEGE, SYLLABUS FOR FYBSc(Computer science) 2021-2022

8) Non parametric tests- I

9) Non- Parametric tests – II
10) Post-hoc analysis of one-way analysis

Details of Conduct of Practical Examination (Evaluation Scheme):

40 -Marks practical work
05 -Marks Viva
05 -Marks Journal
 BHAVANS AUTONOMOUS COLLEGE, SYLLABUS FOR FYBSc(Computer science) 2021-2022

Soft Skills Development

Programme:B.Sc (Computer Science) Semester: II

Course: Soft Skills Development Course Code: BH.USCS207
Teaching Scheme Evaluation Scheme (Theory)
Lecture Practical Tutorial Credits Internal End Semester
(Periods (Periods (Periods (Theory Evaluation Examination (Activity
per week) per week per week +Practical Based)
per per )
batch) batch)
3 --- 1 2 (Marks:50) (Marks:50)
Pre-requisites:
Basic knowledge of spoken and written English language.
Course Objectives:
1) To help learners develop their soft skills and develop their personality together with their
technical skills.
2) To develop professional, social and academic skills to harness hidden strengths, capabilities and
knowledge and equip students to excel in real work environment and corporate life.
3) To enable learners to understand various issues in personal and profession communication and
learn to overcome them.

Course Outcomes:
1) To know about various aspects of soft skills and learn ways to develop personality
2) Understand the importance and type of communication in personal and professional
environment.
3) To provide insight into much needed technical and non-technical qualities in career planning

INDEX

Unit Description Periods

Personality Development: Knowing Yourself, Positive Thinking,

Johari’s Window, Communication Skills, Non-verbal Communication,
Physical Fitness
Communication Today: Significance of Communication, GSC’s 3M
Model of Communication, Vitality of the Communication Process,
I
Virtues of Listening, Fundamentals of Good Listening, Nature of Non- 7+8
Verbal Communication, Need for Intercultural Communication,
Communicating Digital World (Classroom demonstration of all the
concept taught in this chapter)
Employment Communication: Introduction, Resume, Curriculum
Vitae, Scannable Resume, Developing an Impressive Resume, Formats
BHAVANS AUTONOMOUS COLLEGE, SYLLABUS FOR FYBSc(Computer science) 2021-2022

of Resume, Job Application or Cover Letter (Classroom demonstration

of all the concept taught in this chapter)

Professional Presentation: Nature of Oral Presentation, Planning a

Presentation, Preparing the Presentation, Delivering the Presentation
(Classroom demonstration of all the concept taught in this chapter)
Job Interviews: Introduction, Importance of Resume, Definition of
Interview, Background Information, Types of Interviews, Preparatory
Steps for Job Interviews, Interview Skill Tips, Changes in the
Interview Process, FAQ During Interviews (Classroom demonstration
II 8+7
of all the concept taught in this chapter)
Group Discussion: Introduction, Ambience/Seating Arrangement for
Group Discussion, Importance of Group Discussions, Difference
between Group Discussion, Panel Discussion and Debate, Traits,
Types of Group Discussions, topic based and Case based Group
Discussion, Individual Traits (Classroom demonstration of all the
concept taught in this chapter)
Decision Making and Negotiation: Introduction to Decision Making,
Steps for Decision Making, Decision Making Techniques, Negotiation
Fundamentals, Negotiation Styles, Major Negotiation Concepts
Creativity at Workplace: Introduction, Current Workplaces,
Creativity, Motivation, Nurturing Hobbies at Work, The Six Thinking
Hat Method
Leadership and Team Building: Leader and Leadership, Leadership
Traits, Culture and Leadership, Leadership Styles and Trends, Team
III Building, Types of Teams 15+0
Stress and Time Management: Stress, Sources of Stress, Ways to
Cope with Stress.

Total 45
 BHAVANS AUTONOMOUS COLLEGE, SYLLABUS FOR FYBSc(Computer science) 2021-2022

Text books
1) Soft Skills: An Integrated Approach to Maximize Personality, Gajendra S. Chauhan, Sangeeta
Sharma, Wiley India.

Reference Books:
1. Personality Development and Soft Skills, Barun K. Mitra, Oxford Press
2. Business Communication, Shalini Kalia, Shailja Agrawal, Wiley India
3. Soft Skills - Enhancing Employability, M. S. Rao, I. K. International Cornerstone:
Developing Soft Skills, Sherfield, Pearson India

Modality of Assessment (Soft skill Development)

Theory Examination Pattern:
A) Internal Assessment- 50%- 50 Marks

Sr.No Marks
Evaluation type
Two assignments which will be recall/analysis/case-study based
20
1
30
2 Three activities/ demonstration based assignments
TOTAL 50

B) External Examination- 50%- 50 Marks

1. A group-based Activity, for 50 Marks will be conducted on the basis of any topic of choice. The group
must consist of 3-4 Students.
2. Activities can be as follows (based on the skills acquired during the course of the programme): Skit/
Street plays/ Real-life Scenario Role-play/ Debate etc.
3. Activity will be evaluated based on the below-given criteria
a. Relevance to topic-10 Marks
b. Coordination Between team Members -10 Marks
c. Communication Skill- 10 Marks
d. Time Management-10 Marks
e. Presentation of the Activity -10 Marks

Note :- Duration of activities have to be between 10-15 Minutes.

 BHAVANS AUTONOMOUS COLLEGE, SYLLABUS FOR FYBSc(Computer science) 2021-2022

Modality of Assessment
Theory Examination Pattern:

A) Internal Assessment - 40% - 40 Marks

SR. NO EVALUATION TYPE MARKS

1 CONTINOUS INTERNAL ASSESSMENT-I (CIA-I): 20

Internal Class Test with Objective types questions MCQ’s.

2 CONTINOUS INTERNAL ASSESSMENT-II (CIA-II): 20

Assignments, Case study, Mini project, Group activity,
Presentations, Tutorial, Quizzes etc.
TOTAL 40

B) External Examination- 60%- 60 Marks

Semester End Theory Examination: 60 marks

1. Duration: These examinations shall be of 2 hours duration.

2. Passing criteria: Student has to acquire minimum of 40% marks in each course.

3. Paper Pattern:

 There shall be four questions each of 15 marks. On each unit there will be
seven/eight questions.

 All questions shall be compulsory with internal choice within some

questions. Each Question may be sub-divided into sub questions as a, b, c, d
& e, etc & the allocation of Marks depends on the weightage of the topic
 BHAVANS AUTONOMOUS COLLEGE, SYLLABUS FOR FYBSc(Computer science) 2021-2022

In case if exams are conducted online then following examination pattern will be
followed.

Theory Examination Pattern:

A) Internal Assessment- 40%- 40 Marks

SR. NO EVALUATION TYPE MARKS

1 CONTINOUS INTERNAL ASSESSMENT-I (CIA-I): 20
Internal Class Test with Objective types questions MCQ’s.
Online platform such as Google Classroom, Google Form, zoom,
Google meet etc. can be used.

CONTINOUS INTERNAL ASSESSMENT-II (CIA-II): 20

2 Assignments, Case study, Mini project, Group activity,
Presentations, Tutorial and Quizzes etc.
Online platform such as Google Classroom, zoom, Google meet
etc. can be used.
TOTAL 40

B) External Examination- 60%- 60 Marks Semester End

Theory Examination: 60 marks

1. Duration: These examinations shall be of 90mins duration.

2. Passing criteria: Student has to acquire minimum of 40% marks in each course.

3. Paper Pattern: All MCQ questions.

Pattern of MCQ question paper should be as follows:

Unit l -14 one mark and 3 two mark questions 20 Marks

Unit ll -13 one mark and 3 two mark questions 19 Marks
Unit lll - 13 one mark and 4 two mark questions 21 Marks
TOTAL 60 Marks
 BHAVANS AUTONOMOUS COLLEGE, SYLLABUS FOR FYBSc(Computer science) 2021-2022

Practical Examination Pattern:

External Examination- 50 marks

1. Duration: These examinations shall be of 2 hours duration.

2. Passing criteria: Student has to acquire minimum of 40% marks in each course.
Minimum 75% practical from each core/allied course are required to be completed
and written in the journal.

3. Certified E-Journal is compulsory for appearing at the time of Practical

Exam.

4. Examination pattern:
a. Practical work and Viva: 40 marks
b. Journal: 10 marks

Overall Examination & Marks Distribution Pattern

Semester I&II

BH.USCS 101,102,103,104,105,106,107
COURSE THEORY: BH.USCS 201,202,203,204,205,206,207

PRACTICALS: BH.USCSP 101,102,103,104,105,106

BH.USCSP 201,202,203,204,205,206

Internal External Total

Theory 40 60 700
Practical’s - 50 300

Total 1000
 BHAVANS AUTONOMOUS COLLEGE, SYLLABUS FOR FYBSc(Computer science) 2021-2022

Rubrics of evaluation for ESE:

Unit Knowledge Understanding Analysis & Total

critical thinking marks/unit
from all units 05 05 5 15
1 05 05 5 15
2 05 05 5 15
3 05 05 5 15
Total 20 20 24 60
% Weightage 33.33 33.33 33.34 100

Rubrics of evaluation for CIA-2 Assignment: Presentation/debate/quiz

Parameters Max 80 – 60 -80% 40 – 60% 20 – 0-20% very

Marks 100% Good Satisfactory 40% poor
Excellent Poor
CONTENT 10
Content: 02
Knowledge
Content: 03
Development
Content: 03
Conclusion
Content: 02
Bibliography
Effective 10
communication
skill
Language, Style 05
and Structure;
Teaching aids; 05
Total 20