FYCS Merged
FYCS Merged
4 Semesters I
5 Level UG
BOARD OF STUDIES
SYLLABUS FOR
B.SC (COMPUTER SCIENCE)
1. To develop an understanding and knowledge of the basic theory of Computer Science with good
foundation on theory, systems, and applications.
2. To foster necessary skills and analytical abilities for developing computer-based solutions of real-
life problems.
3. To provide training in emergent computing technologies which lead to innovative solutions for
industry and academia.
4. To develop the necessary study skills and knowledge to pursue further post-graduate study in
computer science or other related fields.
5. To develop the professional skillset required for a career in an information technology-oriented
business or industry.
6. To enable students to work independently and collaboratively, communicate effectively, and become
responsible, competent, confident, insightful, and creative users of computing technology.
PROGRAMME OUTCOMES:
1. At the end of the program, students will develop technical, computational, and soft skills required
for secure and reliable software and communications networks.
2. Students will develop the ability to design, test and implement sustainable computer-based systems
to meet industry requirements.
3. Ability to develop an understanding of professional, ethical, legal, security and social issues as well
as responsibilities while developing and using computer software.
4. Ability to pursue higher education or become self-employed by applying the knowledge of computer
science to solve real world problems.
5. Ability to develop technical projects addressing the needs of diverse domains.
SIES(Nerul) College of Arts, Science and Commerce (Autonomous)
Department of Computer Science
NEP Credit Structure for 2023 - 24
OJT, FP,
Sem VSC, SEC Cum.
Major Minor OE (Basket) AEC, VEC, IKS CEP, CC,
ester (VSEC) Cr./ Sem.
RP
VSC-
Introduc AEC-Effective
Computer
tion to Communication – I
Descriptive Organization
Python Business (02 Credits)
Statistics (02 Credits))
I Program Economics VEC-Environmental studies __ 22
(04 SEC-
ming (04 Credits) (02 Credits)
Credits) Basics of Web
(04 IKS- Indian Astronomy
Programming
Credits) (02 Credits)
(02 Credits)
Tota
4 4 4 4 6 22
l
SCHEME OF MODULES
Semester I
Serial
Course Code Credits Course Name
No.
I Major Department Specific Course (DSC)
TOTAL CREDITS 22
Introduction to Python Programming
COURSE CODE: U23CS1MJ01 COURSE CREDIT: 03
1 credit - 15 lectures
1 lecture is 60 minutes.
Course Objectives:
• To learn how to design and program Python applications and to explore the innards of Python Programming and
understand components of Python Program.
• To define the structure and components of a Python program and to learn how to write loops and decision
statements in Python.
• To learn about inbuilt input/output operations and compound data types in Python and to learn about functions
and strings in Python. And to learn about list, dictionaries, and file handling in Python
Course Outcomes:
• Ability to learn how to store, manipulate and access data in Python and write loops and decision statements in
Python.
• Ability to learn how to write functions and pass arguments in Python
• Ability to write OOP based programs using python
No.
Unit Syllabus of
Lectures
Introduction: The Python Programming Language, History, features, Installing Python,
Running Python program, Debugging: Syntax Errors, Runtime Errors, Semantic Errors,
Experimental Debugging, Formal and Natural Languages, The Difference Between Brackets,
Braces, and Parentheses,
Variables and Expressions: Values and Types, Variables, Variable Names and Keywords,
1 15
Type conversion, Operators and Operands, Expressions, Interactive Mode and Script Mode,
Order of Operations.
Conditional Statements: if, if-else, nested if –else
Looping: for, while, and nested loops
Control statements: Terminating loops, skipping specific conditions
Functions: Function Calls, Type Conversion Functions, Math Functions, Composition, Adding
New Functions, Definitions and Uses, Flow of Execution, Parameters and Arguments,
Variables and Parameters Are Local, Stack Diagrams, Fruitful Functions and Void Functions,
Why Functions? Importing with from, Return Values, Incremental Development, Composition,
2 15
Boolean Functions, More Recursion, Leap of Faith, Checking Types
Strings: A String Is a Sequence, Traversal with a for Loop, String Slices, Strings Are
Immutable, Searching, Looping and Counting, String Methods, The in Operator, String
Comparison, String Operations.
Lists: Values and Accessing Elements, Lists are mutable, traversing a List, Deleting elements
from List, Built-in List Operators, Concatenation, Repetition, In Operator, Built-in List
functions and methods
Tuples and Dictionaries: Tuples, accessing values in Tuples, Tuple Assignment, Tuples as
return values, Variable-length argument tuples, Basic tuples operations, Concatenation,
Repetition, in Operator, Iteration, Built-in Tuple Functions Creating a Dictionary, Accessing
3 15
Values in a dictionary, Updating Dictionary, Deleting Elements from Dictionary, Properties of
Dictionary keys, Operations in Dictionary, Built-In Dictionary Functions, Built-in Dictionary
Methods
List Comprehensions & OOPS in Python: Anonymous Functions, List Comprehensions,
Introduction to Object Oriented Programming – Defining Class in Python, Creating Object in
Python, Directory Methods in Python, Methods (String, Tuples, Lists, Dictionaries).
References:
1. Introduction to Computing and Problem-Solving Using Python by E Balagurusamy, Mc Graw
Hill. 2017
2. Programming and Problem solving with Python by Ashok Namdev Kamthane and Amit Ashok
Kamthane, Mc Graw Hill. 2020
3. Python Programming by Kiran Gurbani and Ashwin Mehta, Himalaya Publications. 2018
Introduction to Python Programming Practical
Sr.
List of Practical
No
Write the program for the following:
a. Create a program that asks the user to enter their name and their age. Print out a message addressed to
them that tells them the year that they will turn 100 years old.
1
b. Enter the number from the user and depending on whether the number is even or odd, print out an
appropriate message to the user.
Additional References:
1. Sarma, K. V. S. (2001). Statistics Made it Simple: Do it yourself on PC. Prentice Hall of India,
New Delhi.
2. Agarwal, B. L. (2003). Programmed Statistics, Second Edition, New Age International
Publishers, New Delhi.
3. Purohit, S. G., Gore S. D., Deshmukh S. R. (2008). Statistics Using R, Narosa Publishing
House, New Delhi.
4. Schaum’s Outline Of Theory And Problems Of Beginning Statistics, Larry J. Stephens,
Schaum’s Outline Series McGraw-Hill. 2009
Descriptive Statistics Practical
COURSE CODE: U23CS1MIP01 COURSE CREDIT: 01
1 credit - 2 lectures
1 lecture is 60 minutes.
Sr.
List of Practical
No.
Problem solving and implementation using R Studio
Basics of R-
a. Data input, Arithmetic Operators
1 b. Vector Operations, Matrix Operations
c. Data Frames, Built-in Functions
d. Frequency Distribution, Grouped Frequency Distribution
e. Diagrams and Graphs
Frequency distribution and data presentation-
2 a. Frequency Distribution (Univariate data/ Bivariate data)
b. Diagrams
c. Graphs
Measures of Central Tendency-
a. Arithmetic Mean
3 b. Median
c. Mode
d. Partition Values
Measures dispersion-
4 a. Range and Coefficient of range
b. Quartile deviation and Coefficient of quartile deviation
c. Standard deviation, Variance and Coefficient of variation (C.V.)
Moments-
5
a. Raw moments
b. Central moments
Measures of Skewness -
6 a. Karl Pearson’s measure of Skewness
b. Bowley’s measure of Skewness
c. Moment coefficient of Skewness
Measures of Kurtosis-
7
a. Moment coefficient of Kurtosis (Absolute measure)
b. Moment coefficient of Kurtosis (Relative measure)
Correlation-
8
a. Karl Pearson’s correlation coefficient
b. Spearman’s Rank correlation
Regression-
9 a. Method of least squares
b. Using regression coefficients
c. Properties of regression lines & regression coefficients
Summary Statistics using R-
10 a. Summary statistics for raw data
b. Summary statistics for grouped frequency distribution
c. Simple Correlation & Regression using R
Basics of Web Programming
COURSE CODE: U23CS1VSCP01 COURSE CREDIT: 01
2 credits - 60 lectures
1 lecture is 60 minutes.
Course Objectives:
• To know the use of HTML, CSS, JavaScript in designing Web pages.
Course Outcomes:
• Ability to design and develop Web Pages using HTM, CSS and JavaScript.
Course Objectives:
• To understand the structure and operation of modern processors and their instruction sets.
Course Outcomes:
• To understand basics of digital electronics needed for computers and how data is transferred between the
processor and I/O devices.
No.
Unit Syllabus of
Lectures
1 Computer Abstractions and Technology: Basic structure and operation of a computer, 15
functional units and their interaction. Representation of numbers and characters.
Logic circuits and functions: Combinational circuits and functions: Basic logic gates and
functions, truth tables; logic circuits and functions. Minimization with Karnaugh maps.
Synthesis of logic functions with and-or-not gates, Nand gates, nor gates. Fan-in and fan-out
requirements; tristate buffers. Half adder, full adder, ripple carry adder. (Flip flops) Gated S-
R and D latches, edge-triggered D latch. Shift registers and registers. Decoders, multiplexers.
Sequential circuits and functions: State diagram and state table; finite state machines and
their synthesis.
Instruction set architectures: Memory organization, addressing and operations; word size,
big-endian and little-endian arrangements. Instruction sets.
Basic Processor Unit: Main components of a processor: registers and register files, ALU,
control unit, instruction fetch unit, interfaces to instruction and data memories
References:
1. Carl Hamacher et al., Computer Organization and Embedded Systems, 6 ed., McGraw-Hill 2012
Additional References:
1. Patterson and Hennessy, Computer Organization and Design, Morgan Kaufmann, ARM Edition, 2011
2. R P Jain, Modern Digital Electronics, Tata McGraw Hill Education Pvt. Ltd. , 4th Edition, 2010
Computer Organization Practical
COURSE CODE: U23CS1SECP01 COURSE CREDIT: 01
1 credit - 2 lectures
1 lecture is 60 minutes.
Sr.
List of Practical
No,
1 Study and verify the truth table of various logic gates (NOT, AND, OR, NAND, NOR, EX-OR, and
EX-NOR).
Using SPIM, write and test an adding machine program that repeatedly reads in integers and adds them
9 into a running sum. The program should stop when it gets an input that is 0, printing out the sum at that
point.
Using SPIM, write and test a program that reads in a positive integer using the SPIM system calls. If the
integer is not positive, the program should terminate with the message “Invalid Entry”; otherwise the
10
program should print out the names of the digits of the integers, delimited by exactly one space. For
example, if the user entered “528,” the output would be “Five Two Eight.”
# Practical No. 1 to 8 can be performed using any open-source simulator (like Logisim)
(Download it from https://sourceforge.net/projects/circuit/)
# Practical No. 9 and 10 are required to be done using SPIM. SPIM is a self-contained simulator that will run MIPS
R2000/R3000 assembly language programs.
# Latest version is available at https://sourceforge.net/projects/spimsimulator/
Indian Astronomy
Course Objectives:
• To develop an awareness among learners about the Indian Astronomy.
• To make learners proficient in the concept, technicalities and computational procedures developed by
Indian mathematician and astronomers.
Course Outcomes:
• To understands basics of Indian Astronomy.
• To Understand Coordinate Systems, Rasi & Nakshatra systems.
Reference:
1. Indian Astronomy: An Introduction by S Balachandra Rao, University Press 2000
2. Mathematics in Ancient and Medieval India by A K Bag, Orientilia Delhi. 1979
Environmental Studies
COURSE CODE: U23CS1VEC01 COURSE CREDIT: 02
1 credit - 15 lectures
1 lecture is 60 minutes.
Course Objectives:
• Understand key concepts of environmental studies. ecosystems and natural resources.
• Understand the role of communities in environmental management, use computing effectively by
applying concepts of green computing.
Course Outcomes:
• To understand environmental policies and practices.
• To develop ethical values towards the environment conservation
Unit No. of
Syllabus lectures
Human Communities and the Environment Human Population and Growth, Carbon
Footprint, Resettlement and Rehabilitation of Project-Affected Persons, Disaster
Management, Environmental Movements, Environmental Ethics, Environmental
Communication and Public Awareness, Visit to Local Area to Document Environmental
02 Assets. 15
Green Computing Overview of Green Computing, Green Computing Efforts, Going
Paperless, Power Measurement and Power Reduction, Electronic Waste, Recycling of
Electronic Waste, Green Supply Chain, Certifications for Green Computing
References:
1. Bharucha Erach, “Textbook of Environmental Studies for Undergraduate Courses”, Universities
Press 2005
Additional References
1. Hawkins R.E., “Encyclopedia of Indian Natural History”, Bombay Natural History Society,
Bombay 1986
2. Kaushik A., " Perspectives in Environmental Studies", New Age International Publication, New
Delhi 2006
2. Jadhav, H &Bhosale, “Environmental Protection and Laws”, Himalaya Pub. House, Delhi 2015
SCHEME OF THEORY EXAMINATION
I. MAJOR AND MINOR
Description Marks
Internal test of 20 marks
Q.1 Multiple choice Questions / True or False - 10 Marks 20
Q.2 Attempt 2 questions out of 3 questions (5 marks each)- 10 Marks
One Project and Viva voce / Presentation / Case studies / Assignments Poster
15
Making / Quiz / Role Play / Subject Specific Activities
Attendance and Class behavior 05
Total 40
PAPER PATTERN
Duration: 2 hours
Total Marks: 60
Q. 1 Unit 1 A OR B / A OR B 15
Q. 2 Unit 2 A OR B / A OR B 15
Q. 3 Unit 3 A OR B / A OR B 15
Q. 4 Unit 1,2,3 A OR B / A OR B 15
Total 60
Note:
1. Q.1, 2, 3 and 4 may be divided into sub questions with internal choice if required.
• Passing criteria: Minimum 40% in Internal (16 out of 40) and 40% (24
out of 60) in semester end examination.
II. VOCATIONAL COURSE (VSC) & SKILL ENHANCEMENT COURSE
(SEC)
Description Marks
Internal test
Q.1 Multiple choice Questions/True or False - 5 Marks 10
Q.2. Attempt 1 question out of 3 questions- 5 Marks
Assignments / Presentation / Poster / Subject Specific Activities 5
Attendance and Class behavior 5
Total 20
PAPER PATTERN
Duration: 1 hours
Total Marks: 30
Description Marks
Q.1 10 marks OR 10 marks 10
Q.2 10 marks OR 10 marks 10
Total 30
Note:
1. Q.1, 2, 3 may be divided into sub questions if required.
2. Q.3 May include theory (short notes) /Case Study in one of the options.
Passing criteria: Minimum 40% in Internal (8 out of 20) and 40% (12 out
of 30) in semester end examination.
III. ABILITY ENHANCEMENT COURSE(AEC) / VALUE EDUCATION
COURSE (VEC) / INDIAN KNOWLEDGE SYSTEM (IKS)
Description Marks
Internal Test
Q.1 Multiple choice Questions/True or False - 5 Marks 10 Marks
Q.2. Attempt 1 question out of 3 questions- 5 Marks
Assignment/Presentation/Group Discussion/Role Play/Mock Interviews / Subject
05 Marks
Specific Activities
Attendance 05 Marks
Description Marks
A) Descriptive Question
OR
10 Marks
B) Short Notes 2 out of 3 (5 Marks each)
From Unit 1
A) Descriptive Question
OR
10 Marks
B) Short Notes 2 out of 3 (5 Marks each)
From Unit 2
A) Descriptive Question
OR
10 Marks
B) Short Notes 2 out of 3 (5 Marks each)
From Unit 1,2
SCHEME OF PRACTICAL EXAMINATION
The scheme of Practical examination shall be
● Practical assessment carries 50 Marks : 40 marks + 05 marks (journal)+ 05 marks(viva)
● Minimum 75 % practical are required to be completed and written in the journal.
(Certified Journal is compulsory for appearing at the time of Practical Exam)
Description Marks
Journal 5
Viva 5
Total 50
________________________________________________________
4 Semesters II
5 Level UG
Signature:
BOARD OF STUDIES
SYLLABUS FOR
B.SC (COMPUTER SCIENCE)
1. To develop an understanding and knowledge of the basic theory of Computer Science with good
foundation on theory, systems, and applications.
2. To foster necessary skills and analytical abilities for developing computer-based solutions of
real-life problems.
3. To provide training in emergent computing technologies which lead to innovative solutions for
industry and academia.
4. To develop the necessary study skills and knowledge to pursue further post-graduate study in
computer science or other related fields.
5. To develop the professional skill set required for a career in an information technology-oriented
business or industry.
6. To enable students to work independently and collaboratively, communicate effectively, and
become responsible, competent, confident, insightful, and creative users of computing technology.
PROGRAMME OUTCOMES:
1. At the end of the program, students will develop technical, computational, and soft skills
required for secure and reliable software and communications networks.
2. Students will develop the ability to design, test and implement sustainable computer-based
systems to meet industry requirements.
3. Ability to develop an understanding of professional, ethical, legal, security and social issues as
well as responsibilities while developing and using computer software.
4. Ability to pursue higher education or become self-employed by applying the knowledge of
computer science to solve real world problems.
5. Ability to develop technical projects addressing the needs of diverse domains.
SIES(Nerul) College of Arts, Science and Commerce (Autonomous)
Department of Computer Science
NEP Credit Structure for 2023 - 24
OJT, Cum
OE
VSC, SEC AEC, VEC, FP, .
Semester Major Minor (Basket) Any
(VSEC) IKS CEP, CC, Cr./
Two
RP Sem.
Design Probability Money VSC- AEC- CC 22
and Theory and Inflation& Advanced Effective (02-
Analysis Distribution Monetary Policy Python Communication Credits)
of (02 Credits) Introduction to Programing –II
Algorithm Entrepreneurship (2 credits) (02 Credits)
(4 credits) Supply Chain VEC-
II Management SEC- Sustainability
Basics of Film Object- Development
Data Appreciation Oriented with Green IT
Structure (02+02=04 Analysis (02 Credits)
(2 Credits) Credits) and Design
(02 Credits)
Total 6 2 4 4 4 2 22
SCHEME OF MODULES
Semester II
TOTAL CREDITS 22
Design & Analysis of Algorithms
COURSE CODE: U23CS2MJ102 COURSE CREDIT: 03
1 credit - 15 lectures
1 lecture is 60 minutes.
Course Objectives:
• To make students understand the basic principles of algorithm design and the theoretical
background of the basic data structures
• To familiarize the students with fundamental problem-solving strategies like searching,
sorting, selection, recursion and help them to evaluate efficiencies of various algorithms.
• To teach students the important algorithm design paradigms and how they can be used to
solve various real world problems.
Course Outcomes:
• Students should be able to understand and evaluate efficiency of the programs that they
write based on performance of the algorithms used.
• Students should be able to appreciate the use of various data structures as per need
• To select, decide and apply appropriate design principle by understanding the requirements
of any real life problems
No
Unit Syllabus of
Lectures
Introduction to algorithms - What is algorithm, analysis of algorithm,
Types of complexity, Running time analysis, How to Compare Algorithms,
Rate of Growth, Types of Analysis, Asymptotic Notation, Big-O Notation,
Omega-Ω Notation, Theta-Θ Notation, Asymptotic Analysis, Performance
1 characteristics of algorithms, Estimating running time / number of steps of 15
executions on paper, Idea of Computability
Algorithm Design Techniques - Introduction to various types of
classifications/design criteria and design techniques.
Greedy Technique - Concept, Advantages & Disadvantages, Applications,
Implementation using problems like - file merging problem Divide-n-
Conquer - Concept, Advantages & Disadvantages, Applications,
2 Implementation using problems like - merge sort, Strassen's Matrix 15
Multiplication Dynamic Programming - Concept, Advantages &
Disadvantages, Applications, Implementation using problems like -
Fibonacci series, Factorial of a number, Longest Common subsequence
Backtracking Programming - Concept, Advantages & Disadvantages,
Applications, Implementation using problems like N-Queen Problem
Recursion - What is recursion, Recursion vs Iteration, recursion
applications like Factorial of a number, Fibonacci series & their
comparative analysis with respect to iterative version, Tower of Hanoi
3 problem Basic Sorting Techniques - Bubble, Selection and Insertion Sort 15
& their comparative analysis Searching Techniques - Linear Search and
its types, Binary Search and their comparative analysis Selection
Techniques - Selection by Sorting, Partition-based Selection Algorithm,
Finding the Kth Smallest Elements in Sorted Order & their comparative
analysis String Algorithms - Pattern matching in strings, Brute Force
Method & their comparative analysis
References:
1. “Data Structure and Algorithm Using Python”, Rance D. Necaise, Wiley India Edition,
2016.
2. “Data Structures and Algorithms Made Easy”, NarasimhaKarumanchi, CareerMonk
Publications, 2016.
3. “Introduction to Algorithms”, Thomas H. Cormen, 3rd Edition, PHI.
Design & Analysis of Algorithms Practical
Sr.
List of Practical
No
Programs on 1-d arrays like - sum of elements of array, searching an element in
1 array, finding minimum and maximum element in array, count the number of even
and odd numbers in array. For all such programs, also find the time complexity,
compare if there are multiple methods
Programs on 2-d arrays like row-sum, column-sum, sum of diagonal elements,
2 addition of two matrices , multiplication of two matrices. For all such programs, also
find the time complexity, compare if there are multiple methods
3 Program to implement various types of classifications.
Program to implement file merging, coin change problems using Greedy Algorithm
4 and to understand time complexity
Programs to select the Nth Max/Min element in a list by using various algorithms.
5 Compare the efficiency of algorithms.
Programs to find a pattern in a given string - general way and brute force technique.
6 Compare the efficiency of algorithms.
Program to implement merge sort, Straseen‟s Matrix Multiplication using D-n-C
7 Algorithm and to understand time complexity.
Program to implement fibonacci series, Longest Common Subsequence using
8 dynamic programming and
to understand time complexity. Compare it with the general recursive algorithm
Program to implement N-Queen Problem, Binary String generation using
9 Backtracking Strategy and to
understand time complexity.
10 Programs on recursion like factorial, fibonacci, tower of hanoi. Compare algorithms
to find factorial/fibonacci using iterative and recursive approaches
11 Program to perform linear search and binary search on list of elements. Compare the
algorithms by calculating time required in milliseconds using readymade libraries
12 Programs to sort elements of list by using various algorithms like bubble, selection
sort, and insertion sort. Compare the efficiency of algorithms.
Basics of Data Structure
Unit Syllabus No of
lectures
01 Introduction to Data Structures - What is data structure, types, Introduction
to Array(1-d & 2-d), Stack and List data structures, operations on these data
structures, advantages disadvantages and applications of these data structures 15
like solving linear equations, Polynomial Representation, Infix-to-Postfix
conversion
Graphs: Graphs and Graph Models; Graph terminologies and Special types
of graphs; Definition and elementary results; Representing graphs, Linked
representation of a graph; Graph Isomorphism; Connectivity in graphs – path,
trail, walk; Euler and Hamilton paths; Planar graphs, Graph colouring and
chromatic number.
Trees: Definition, Tree terminologies and elementary results; Linked
representation of binary trees; Ordered rooted tree, Binary trees, Complete and
extended binary trees, Expression trees, Binary Search tree, Algorithms for
searching and inserting in binary search trees, Algorithms for deleting in a
binary search tree; Traversing binary trees.
Text Books:
1. Introduction to Algorithm, Thomas H Cormen, PHI
2. Data Structures & Algorithms Made Easy, Narasimha Karumanchi, 2021
3. Data Structures Seymour Lipschutz, Schaum’s out lines, McGraw- Hill Inc. 2017
References:
1. Fundamentals of Computer Algorithms, Sartaj Sahni and Sanguthevar Rajasekaran Ellis
Horowitz, Universities Press, 2018
2. Data Structures and Algorithms in Python, Michael T. Goodrich, Roberto Tamassia, Michael
H. Goldwasser, Wiley, 2016
Basics of Data Structures Practical
Sr.
List of Practical
No
1 Write a program to implement basic array operations like insertion, deletion, and
searching.
2 Write a program to Create a singly linked list with operations like insertion, deletion,
and traversal.
3 Write a program to Create a doubly linked list with operations like insertion, deletion,
and traversal.
4 Write a program to Implement stack using arrays and linked lists, with operations like
push, pop.
5 Write a program to Implement queue using arrays and linked lists, with operations
like enqueue, and dequeue.
6 Write a program to implement Binary Tree with insertion, deletion, traversal
operations
7 Write a program to implement Graph with traversal operations
8 Write a program for creating, traversing (inorder, preorder, postorder), and searching
in a binary tree
9 Write a program to for creating, traversing (inorder, preorder, postorder), and
searching in a binary tree
10 Write a program to convert infix expression to postfix expression
Probability Theory and Distribution
COURSE CODE: U23CS2MI102 COURSE CREDIT: 01
1 credit - 15 lectures
1 lecture is 60 minutes
Course Objective:
• To make learner aware about basic probability axioms and rules and its application.
• To understand the concept of conditional probability and Independence of events.
• To make learner familiar with discrete and continuous random variables as well as standard
discrete and continuous distributions.
Course Outcome:
• Calculate probability, conditional probability and independence.
• Apply the given discrete and continuous distributions whenever necessary.
Sr. Syllabus No of
No. Lectures
REFERENCES:
Textbooks:
1. Gupta, S.C. and Kapoor, V.K. (1987): Fundamentals of Mathematical Statistics, S. Chand
and Sons, New Delhi
2. Goon, A. M., Gupta, M. K. and Dasgupta, B. (1983). Fundamentals of Statistics, Vol. 1,
Sixth Revised Edition, The World Press Pvt. Ltd., Calcutta.
Additional References:
1. Mood, A. M. and Graybill, F. A. and Boes D.C. (1974). Introduction to the Theory of
Statistics, Ed. 3, McGraw Hill Book Company.
2. Hoel P. G. (1971). Introduction to Mathematical Statistics, John Wiley and Sons, New
York.
3. Hogg, R.V. and Craig R.G. (1989). Introduction to Mathematical Statistics, Ed. MacMillan
Publishing Co., New York.
4. Walpole R. E., Myers R. H. and Myers S. L. (1985), Probability and Statistics for Engineers
andScientists
5. Agarwal, B. L. (2003). Programmed Statistics, Second Edition, New Age International
Publishers, New Delhi.
Probability Theory and Distribution Practical
COURSE CODE: U23CS2MIP102 COURSE CREDIT: 01
1 credit - 15 lectures
1 lecture is 60 minutes
SN List of Practical’s
O
1 Implement examples based on Probability definition: classical, axiomatic
2 Implement examples based on elementary Theorems of probability
3 Implement examples based on Conditional probability
4 Implement examples based on „Bayes‟ theorem
5 Implement examples based on independence
6 Implement examples based on Probability distribution of discrete random
variable.
7 Implement examples based on Probability mass function
8 Implement examples based on Probability distribution of continuous random
variable.
9 Implement examples based on Probability density function
10 Implement examples on Mean of discrete and continuous Probability distribution
Course Objectives:
• To familiarize students with the basic concepts of money, money supply and inflation.
• To orient students with the role of Central Bank and Monetary Policy in the economy.
Course Outcomes:
• Learners will be able to discuss the basic concepts of money, money supply and inflation.
• Learners will be able to recognize the role of Central Bank and interpret the working of the
Monetary Policy in the economy.
References:
1. Ackley.G (1976), Macro Economic Theory and Policy, Macmillan Publishing Co. New
York
2. Ahuja. H.L., Modern Economics –– S.Chand Company Ltd. New Delhi.
3. Blanchard Olivier (2000), Macro Economics, Englewood Elitt, Prentice Hall
4. Dornbush , Rudiger, Fisher Stanley and Startz, Richards Macroeconomics, Nineth edition
2004 Tata-Mac Graw Hill, New Delhi.
5. Dwivedi, D.N. (2001), Macro Economics: Theory and Policy, Tata-Mac Graw Hill, New
Delhi.
6. Gregory .N. Mankiw, Macroeconomics, Fifth Edition (2002) New York:Worth Publishers
7. Jhingan, M.L., Principles of Economics –– Vrinda Publications (P) Ltd.
8. Shapiro, E (1996), Macro-Economic Analysis , Galgotia Publication, New Delhi.
9. Vaish .M.C. (2010) Macro Economic Theory 14th edition, Vikas Publishing House(P)Ltd
Advanced Python Programming
COURSE CODE: U23CS2VSC01 COURSE CREDIT: 01
1 credit - 15 lectures
1 lecture - 60 minutes
Course Objectives:
• To know about use of regular expression and to design GUI Programs also to learn about
reading, writing and implementing other operation on files in Python and to implement
database interaction using Python.
Course Outcomes:
• Ability to implement regular expression and designing GUI in Python as well as ability to
work with files and perform operations on it using Python and knowledge of working with
databases.
Sr. Syllabus No. of
No lectures
01 Regular expressions: What is a regular expression? sequence characters in 15
regular expressions, quantifiers in regular expressions, special characters in
regular expressions, using regular expression on files, retrieving information
from an html file.
Graphical user interface: Creating a GUI in python, Widget classes, Working
with Fonts and Colours, working with Frames, Layout manager, Event
handling Working with files: Files, opening and closing a file, working with
text files containing strings, knowing whether a file exists or not, working with
binary files, the “with‟ statement, the seek() and tell() methods, random
accessing of binary files, zipping and unzipping files, working with
directories, running other programs from python program Database in python:
Using SQL with python, retrieving rows from a table, inserting rows into a
table, deleting rows from a table, updating rows in a
table, creating database tables through python, Exception handling in
databases.
Textbooks:
1. Paul Gries , Jennifer Campbell, Jason Montojo, Practical Programming: An Introduction
to Computer Science Using Python 3, Pragmatic Bookshelf, 3rd Edition, 2018
2. Programming through Python, M. T Savaliya, R. K. Maurya, G M Magar, Revised Edition,
Sybgen Learning India, 2020
Additional References:
1. Advanced Python Programming, Dr. Gabriele Lanaro, Quan Nguyen, SakisKasampalis,
Packt Publishing, 2019
2. Programming in Python 3, Mark Summerfield, Pearson Education, 2nd Ed, 2018
3. Python: The Complete Reference, Martin C. Brown, McGraw Hill, 2018
Advanced Python Programming Practical
COURSE CODE: U23CS2VSCP01 COURSE CREDIT: 01
1 credit - 2 lectures
1 lecture - 60 minutes
8 Write a program to Python program to append text to a file and display the text.
12 Write a Python Program to create a table to store the student roll no., student
name, class, phone number and insert records into the table.
Object-Oriented Analysis and Design
COURSE CODE: U23CS2SEC01 COURSE CREDIT: 02
1 credit - 15 lectures
1 lecture is 60 minutes
Course Objectives:
• Understand the importance of OOP approach over procedural language.
Course Outcomes:
• Ability to implement the concepts of OOPS like encapsulation, inheritance, and
polymorphism.
Textbooks:
1. Object Oriented Programming with C++, Balagurusamy E., 8th Edition, McGraw Hill
Education India.
2. UML & C++: A Practical Guide to Object Oriented Development, Lee/Tepfenhart, Pearson
Education, 2nd Edition2015
Additional References:
1. Mastering C++ by Venugopal, Publisher: McGraw-Hill Education, 2017
2. Let Us C++ by KanetkarYashwant, Publisher: BPB Publications, 2020
3. Object Oriented Analysis and Design by Timothy Budd TMH, 2001
Practical of Object-Oriented Analysis and Design
COURSE CODE: U23CS2SECP01 COURSE CREDIT: 01
1 credit - 30 lectures
1 lecture is 60 minutes
2 lecture per week
Sr. Syllabus
No
3 Program to use scope resolution operator. Display the various values of the same
variables declared at different scope levels.
4 Programs to demonstrate various types of constructors and destructors.
Semester – I
Course Name: CC in Cultural Activities Course Code: U23CA2CC01
Course Type Co-curricular
Focuses on Skill Development
Caters to Local
Total Lectures per week (1 Period is 60 minutes) 1
Credits 2
References:
1. S.N. Maheshwari, Cost Accounting
2. B.M. Lal, Cost Accounting
3. Senge, Peter : The Learning Organization
4. Successful Event Management By Anton Shone & Bryn Parry
5. Event management, a professional approach By Ashutosh Chaturvedi
Co –Curricular Course in DLLE
Course Code: U23NSS2CC01 Course Type: Co-curricular Credits: 2
Course Objectives:
The syllabus is aimed to achieve the following objectives:
CO 1: To promote unexplored career opportunities and a knowledge-based society to the
unreached.
CO 2: To enhance students' skills in terms of employment.
CO 3: To enhance skills for students to face life challenges, develop business at a small scale, and
earn a source of income.
CO 4: To promote a humanitarian approach amongst the learners and provide their service in the
society
CO 5: A learner would become aware of the importance of responsibilities towards community
engagement and get actively involved in the upliftment of society with selfless contribution
CO 6: The purpose of this course is to have students create a community project as a means of
synthesizing, integrating, and applying the foundational and concentrated curriculum working in
small groups and coordinating one with other agencies.
CO 7: To introduce the multidisciplinary approach to environmental education and its importance
to the young generation and enable students to create resource materials to promote an
environmentally conservative approach in society.
CO 8: To educate students about environmental awareness and sensitivity and encourage
collaboration with the community to repair human-made damage and preserve the environment
for future generations.
CO 9: The participants will be actively involved in creating awareness about the Fundamental
Rights and Duties of every citizen.
CO10: The participants will create visual aids to propagate and promote civic sense in all parts of
society and express what they have learned through street plays and rallies.
CO11: To spread awareness and educate consumers about their rights before and after purchase.
CO12: To understand the level of knowledge regarding the Consumer Protection Act in society..
Learning Outcome:
The learners will be able to:
CO 1: It will enable students to connect and understand the social realities and work for social
welfare
CO 2: It would help students to enhance leadership skills and apply them in their careers. CO 3:
Students will be more aware of the practicality of real life and can face challenges in a better way
CO 4: Students will be equipped with basic knowledge about environmental education and
sustainability.
CO 5: The students will be able to apply the knowledge for employment in the future.
CO 6: Students will be able to connect to the unreached section of society and help them.
Name of the Syllabus and Project-based activity No. of
Project Lectures
Required
Vocational Career-Oriented Projects
1. Career • Different career paths 30
Project CP. • Developing communication skills
• Building a CV
• Enhancing skills for interview
• Developing profiles on online job portals Students are
expected to select a career path and interview in their
respective fields and organize charts showing different
aspects related to careers.
• Students are expected to prepare a booklet/pamphlet on
careers and prepare a report
2. Anna • Anna Poorna Yojana (APY) – meaning and importance, 30
Poorna problems and prospects in setting up of business.
Yojana • Computation of Cost and preparation of Cost sheet.
[APY] • Preparation of Basic Income/ profit and loss statement.
• Business model - B to B and B to C
• Project activities - Food preparation and selling through
stalls, street play, Selling items at the community level,
celebrating festivals with NGO, Awareness of food
waste management.
Community Oriented Projects
1. Population • Understanding community-related issues around the 30
Education region and developing a sensitive approach towards
society
• Engage in community partnership practices and provide
leadership in promoting changes to improve community
well-being, Community engagement, and leadership
• Students are expected to engage in different activities
based on the project in the form of Street play, Seminar,
Poster competition, Essay writing, Creative Writing
competition, Elocution Discussion, act plays
Composing songs, Powada, Rally, Exhibition, Video,
Short film presentation, Waste collection drive,
Environment awareness campaign
2. • Understanding the basic environmental issues in society 30
Environment and the importance of Environmental Education.
Education • Environmental Awareness program with solutions by
EC with concept of Sustainable Development Goals Project
activities: Students are expected to conduct community-
level awareness programs by distributing pamphlets,
conducting street plays, and participating in various
drives like Tree plantation, cleanliness drive, waste
recycling drive energy, water conservation
3. Citizenship • Constitution of India: Preamble, Article 51A 30
Education Fundamental Rights and Duties of every citizen.
Project(CEP). Educational Institutions as agents for community
development.
• Preparation of Guidelines for Civic sense in public
places and displaying them through posters, placards,
and charts.
• Project Activities: Street play, Civic Sense Rally, Essay
writing, Case Study, Oath taking, Poster Making,
Slogan writing.
4. Consumer • Significance of consumer guidance. 30
Guidance • Different consumer rights.
(CG) • Details on Consumer Protection Act.
• Role of Government in Consumer Protection.
Consumer protection councils and redressal
mechanisms.
• Students need to work in groups of five to eight to
organize the program by inviting resource persons and
arranging field visits
1 Training 10
TOTAL 30
National Service Scheme (NSS) Studies Paper-I
Course Code: U23NSS2CC01 Course Type: Co-curricular Credits: 2
Course Objectives:
The syllabus is aimed to achieve the following objectives:
1. To understand the Working, Framework and Contribution of NSS.
2. To Concept of Social Justice and its Importance
3. To understand themselves in relation to their community.
4. To identify the needs and problems of the community and involve them in problem
solving.
5. To develop among themselves a sense of social and civic responsibility.
6. To utilize their knowledge in finding practical solutions to individual and community
problems.
Learning Outcome:
The learners will be able to:
1. To understand Structural framework of NSS from National Level to College Level
2. Define Social Justice and how it helps the community
3. Enabling the students to contribute towards development of Community
4. Get involved in community betterment and active problem solving
5. Better Sense of social and civic responsibility. Have a better sense of Reduce, Recycle
and Reuse
6. Collaborate and Work towards Solving Individua and Community Problems.
Unit Topic No. of
No. Lectures
required
I Introduction to National Service Scheme (NSS) 5
Formation and development of NSS in India
Structural framework of NSS from National Level to College Level
Objectives of NSS
Symbol and Moto of NSS and its meaning
Basic Social Issues in India (Family System, Division of labour, Cast
System in India, Gender Issues, Regional Imbalance)
II Introduction to Social justice 5
Social Justice – the Concept and its features,
Contribution for Social Justice – Mahatma Jyotiba Phule, Dr.
Babasaheb Ambedkar, Shahu Maharaj, Chhatrapati Shivaji Maharaj,
Savitribai Phule.
III Suggested Projects: 20
Environment awareness – Waste management & segregation, Reduce,
Reuse & Recycle, Organic waste management by composting
(maintenance of compost project) Volunteering at study centers
managed by Stree Mukti Sanghatana
Total Lectures 30
Semester – I
Course Name: National Service Scheme (NSS) Course Code:
References:
1. National Service Scheme Manual (Revised) Government of India, Ministry of Youth
Affairs and Sports, New Delhi
2. National Service Scheme Manual University of Mumbai
3. National Service Scheme Manual for NSS District Coordinators National Service Scheme
Cell, Dept. of Higher and Technical Education, Mantralaya
4. Rashtriya Seva Yojana Sankalpana Prof. Dr. Sankey Chakane, Dr. Pramod Diamond
Publication, Pune
5. Annual Report of National Service Scheme (NSS) Dept. of Higher and Technical
Education Mantralaya. Dept. of Higher and Technical Education Mantralaya.
6. Training Programme on National Programme scheme, TISS.
7. Orientation Courses for N.S.S. Programme officers, TISS.
8. Social Problems in India, Ram Ahuja.
9. National Service Scheme in India : A Case Study of Karnataka, M. B. Dishad, Trust
Publications, 2001
10. http://www.thebetterindia.com/140/national-service-scheme-nss/
11. http://en.wikipedia.org/wiki/national-service-scheme
12. http://nss.nic.in/adminstruct
13. http://nss.nic.in/propexpan
14. http://nss.nic.in
15. http://socialworkness.org/about.html
Co –Curricular Course in Sports
Course Code: U23PE2CC01 Course Type: Co-curricular Credits: 2
I. MAJOR - (4 credit)
Description Marks
Internal test of 20 marks
20
Q.1 Multiple choice Questions / True or False - 10 Marks
Q.2 Attempt 2 questions out of 3 questions (5 marks each)- 10 Marks
One Project and Viva voce / Presentation / Case studies / Assignments
Poster Making / Quiz / Role Play / Subject Specific Activities 15
Duration: 2 hours
Total Marks: 60
Q. 1 Unit 1 A or B and P or Q 15
Q. 2 Unit 2 A or B and P or Q 15
Q. 3 Unit 3 A or B and P or Q 15
Total 60
Note:
Q.1, 2, 3 and 4 may be divided into sub questions with internal choice if required.
• Passing criteria: Minimum 40% in Internal (16 out of 40) and 40% (24 out of 60) in semester end
examination.
II. MINOR - (2 credit)
Description Marks
One question of 10 marks practical 10
Journal 5
Viva 5
Total 20
(B) Semester end examination 30 marks PAPER PATTERN
Duration: 1 hours
Total Marks: 30
Description Marks
Q.1 10 marks OR 10 marks 10
Q.2 10 marks OR 10 marks 10
Q.3 10 marks OR 10 marks 10
Total 30
Note:
1. Q.1, 2, 3 may be divided into sub questions if required.
2. Q.3 May include theory (short notes) /Case Study in one of the options.
• Passing criteria: Minimum 40% in Internal (08 out of 20) and 40% (12 out of 30) in
semester end examination.
III. VOCATIONAL COURSE (VSC)
& SKILL ENHANCEMENT COURSE (SEC)
Description Marks
One question of 10 marks practical 10
Journal 5
Viva 5
Total 20
Duration: 1 hours
Total Marks: 30
Description Marks
Q.1 10 marks OR 10 marks 10
Q.2 10 marks OR 10 marks 10
Total 30
Note:
3. Q.1, 2, 3 may be divided into sub questions if required.
4. Q.3 May include theory (short notes) /Case Study in one of the options.
• Passing criteria: Minimum 40% in Internal (8 out of 20) and 40% (12 out of 30) in semester
end examination.
IV. ABILITY ENHANCEMENT COURSE(AEC) /
VALUE EDUCATIONCOURSE (VEC)
Description Marks
Internal Test
Q.1 Multiple choice Questions/True or False - 5 Marks 10 Marks
Q.2. Attempt 1 question out of 3 questions- 5 Marks
Assignment/Presentation/Group Discussion/Role Play/Mock
05 Marks
Interviews / Subject Specific Activities
Attendance 05 Marks
Description Marks
Descriptive Question OR
Short Notes 2 out of 3 (5 Marks each) 10 Marks
From Unit 1
Descriptive Question OR
Short Notes 2 out of 3 (5 Marks each) From Unit 2 10 Marks
Descriptive Question OR
Short Notes 2 out of 3 (5 Marks each) From Unit 1,2 10 Marks
V. CO-CURRICULAR COURSES
CC in Cultural Activities
CC in DLLE
• Evaluation of 50 marks:
• Continuous evaluation pattern.
CC in NSS
Description
Marks
Description Marks
Description Marks
Total 20
Description Marks
Total 20
Duration : 1 hour
Total Marks: 30
Total 30