Chikitsak Samuha’s

Sir Sitaram and Lady Shantabai Patkar College of Arts &Science and V. P. Varde
College of Commerce and Economics S. V. Road, Goregaon (West), Mumbai –
400062
AUTONOMOUS
"Reaccredited with 'A+ Grade' by NAAC (3rd Cycle), with an institutional score of
3.53, ISO 9001-2015, Best College 2016-17,
Approved For DBT STAR COLLEGE SCHEME“

SYLLABUS FOR
PROGRAM
(B.SC.) FIRST YEAR
COURSE:- COMPUTER SCIENCE
SEMESTER- I and SEMESTER- II
(Choice based Credit and Grading System with effect from the academic year
2021–2022)
 SYLLABUS COMMITTEE MEMBERS

Sr No. Name Designation

1. Mr. Madhav Palshikar Director of Computer Education YCMOU
2. Dr. Prachi Natu Assistant Professor, SVKM's NMIMS.
3. Mr. Siddhesh Kadam Assistant Professor, Kirti College
4. Mr. Deepak Kolhe Founder of Appeteria Technologies
5. Mr. Gaurav Kini Software Engineer BNP Paribas.
 Preamble
Since 1964, Chikitsak Samuhha’s Sir Sitaram and Lady Shantabai Patkar College of Arts and
Science and V.P. Varde College of Commerce and Economics, has been enriching lives by
impartinghighereducation.Thecollegehasbeenaccreditedwithan‘A+’gradeinthe3rdNAAC cycle.
Over the years, we have made great strides in the field of education and in 2019, the University
Grants Commission and the University of Mumbai has conferred an ‘Autonomy Status’ on our
College.
One of the principal outcomes of being granted autonomy is that we have the opportunity to
accommodate a ‘student centric system’, where we can infuse new methods of teaching with a
competitive and dynamic syllabus that keeps up with the changing industry requirements and
technology, and the changing aspirations and expectations of a driven society.
Officially, the syllabus is a document in academic learning that serves to outline the main
components of a subject, and its learning outcomes. It is a roadmap to accomplishing the course
objectives. We believe that it is also an opportunity for us to match our educator’s passion for
teaching with the student’s enthusiasm to learn and excel. Therefore, we have devised a ‘student
centric syllabus’ that shifts the focus from simply, “What will be covered in the semester?" to
“How can the course further the intellectual and academic growth of the student?” It is our aim to
enhance the quality of education, generate enthusiasm amongst students about academic pursuits,
improve the ability of the students to research and innovate, by designing a relevant syllabus,
relevant courses, better evaluation methods and impart flexibility to choose courses that match
their goals, interests and skills.
The manner in which our syllabus is framed helps the students to develop their cognitive skills—
such as evaluating, analyzing and understanding how all pieces of a ‘concept’ fit together, thereby,
giving them a strong foundation in the field of their choice. Additionally, we have introduced
certain extra credits that develop soft skills,(such as emotional intelligence, handling pressure and
stress, courage for making tough decisions, conflict resolution, building ethics), inculcate
community service and other skills that will help students to successfully navigate their lives and
be ready to be local, national and global citizen.
The new credit-based system will allow the students to obtain maximum benefits from all resources
made available to them by the College. A course is assigned credits based on classroom teaching
hours and the course content. It gives the students the benefit to select from a wide variety of
courses. Apart from assisting the students with the Course Content, the syllabus will also provide
the students with a guide to semester teaching schedule, examination pattern and grading policies.
Our Board of Studies for each subject is constituted in a manner that will benefit from diversity
and rich experience of renowned individuals from Mumbai and other Universities, industry experts
and our alumni. Our experienced faculty, along with the guidance of a judicious and perceptive
Governing Council, are dedicated to provide meaningful academic experiences and a rewarding
career for our students.
Thus, we have constructed a syllabus that is designed to enhance the rapport between students and
teachers, to motivate and empower the students, to focus on skill development for employability,
thereby making them locally relevant and globally competent.
 PEDAGOGY
1. Teachers impart their knowledge to the students using different mediums such as
Blackboard, PowerPoint presentations, Videos, Audios, and Animations, to give the
students an insight and to extend their horizons of understanding through better
visualizations of the concepts.
2. Students are given Case Studies to expand their interests and knowledge in the field of
research and analysis with respect to different topics. Case Studies inculcate research
culture and motivate students into further selecting their domain of interest.
3. Presentation of Case Studies and Review Paper is included to provide them a platform to
showcase skills and mannerisms to present their research work.
4. Our teachers propose and discuss questions in the classrooms, to engage the students into
actively participating in the interactions and helping the students groom their communication
skills and gain confidence to put forth their views, ideas and to share their knowledge with other
peers.
5. Regular Assignments and Mini Projects are given to the students helping them summarize
and revise the topics being covered in the curriculum.
 F.Y.B. Sc. (CS)
Choice based Credit and Grading System
(To be implemented from Academic Year (2021 -
22) Semester I & II

F.Y.B.Sc. CS
Semester Semester II
I
Course Course Course Course Course Course Course Course Course Course Course Course Course Course
I II III IV V VI VII I II III IV V VI VII

UNIT I
UNIT I UNIT I UNIT I UNIT I UNIT I UNIT I UNIT I UNIT I UNIT I UNIT I UNIT I UNIT I UNIT I

UNIT UNIT UNIT UNIT UNIT UNIT UNIT UNIT UNIT UNIT UNIT UNIT UNIT UNIT II
II II II II II II II II II II II II II

UNIT UNIT UNIT UNIT UNIT UNIT UNIT UNIT UNIT UNIT UNIT UNIT UNIT UNIT III
III III III III III III III III III III III III III
 Semester – I
Lectures/We
Course Code Course Type Course Title Credits
ek
PUSCS101 Core Subject Digital Systems & Architecture 2 3
PUSCS102 Core Subject Introduction to Programming with
2 3
Python
PUSCS103 Core Subject LINUX Operating System 2 3
PUSCS104 Core Subject Open Source Technologies 2 3
PUSCS105 Core Subject Discrete Mathematics 2 3
PUSCS106 Core Subject Descriptive Statistics 2 3
PUSCS107 Ability Soft Skills
Enhancement 2 3
Course
PUSCSP101 Core Subject Digital Systems & Architecture –
1 3
Practical Practical
PUSCSP102 Core Subject Introduction to Programming with
1 3
Practical Python –Practical
PUSCSP103 Core Subject LINUX Operating System – Practical
1 3
Practical
PUSCSP104 Core Subject Open Source Technologies – Practical
1 3
Practical
PUSCSP105 Core Subject Discrete Mathematics – Practical
1 3
Practical
PUSCSP106 Core Subject Descriptive Statistics – Practical
1 3
Practical
 Semester – II
Lectures/
Course Code Course Type Course Title Credits
Week
PUSCS201 Core Subject Design & Analysis of Algorithms 2 3
PUSCS202 Core Subject Advanced Python Programming 2 3
PUSCS203 Core Subject Introduction to OOPs using C++ 2 3
PUSCS204 Core Subject Database Systems 2 3
PUSCS205 Core Subject Calculus 2 3
PUSCS206 Core Subject Statistical Methods 2 3
PUSCS207 Ability E-Commerce & Digital Marketing
Enhancement 2 3
Course
PUSCSP201 Core Subject Design & Analysis of Algorithms-
1 3
Practical Practical
PUSCSP202 Core Subject Advanced Python Programming-
1 3
Practical Practical
PUSCSP203 Core Subject Introduction to OOPs using C++-
1 3
Practical Practical
PUSCSP204 Core Subject Database Systems- Practical
1 3
Practical
PUSCSP205 Core Subject Calculus- Practical
1 3
Practical
PUSCSP206 Core Subject Statistical Methods- Practical
1 3
Practical
SEMESTER I
 Course: Digital System & Architecture
PUSCS101 (Credits : 2 Lectures/Week : 3)
Objectives:
1) To have an understanding of Digital systems and operation of a digital computer.
2) To learn different architectures & organizations of memory systems, processor organization and control unit.
3) To understand the working principles of multiprocessor and parallel organization’s as advanced computer
architectures
Expected Learning Outcomes:
After successful completion of this course, students would be able to
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
Fundamentals of Digital Logic: Boolean algebra, Logic Gates, And Simplification of Logic
Circuits: Algebraic Simplification, Karnaugh Maps. Combinational Circuits: Adders, Mux, 15 L
De-Mux, Sequential Circuits: Flip Flops (SR, JK & D), Counters: synchronous and
asynchronous Counter
Computer System: Comparison of Computer Organization & Architecture, Computer
Unit I Components and Functions, Interconnection Structures. Bus Interconnections, Input / Output:
I/O Module, Programmed I/O, Interrupt Driven I/O, Direct Memory Access
Memory System Organization: Classification and design parameters, Memory Hierarchy,
Internal Memory: RAM, SRAM and DRAM, Interleaved and Associative Memory. Cache
Unit II Memory: Design Principles, Memory mappings, Replacement Algorithms, Cache performance, 15 L
Cache Coherence. Virtual Memory, External Memory: Magnetic Discs, Optical Memory, Flash
Memories, RAID Levels
Processor Organization: Instruction Formats, Instruction Sets, Addressing Modes, Addressing
Modes Examples with Assembly Language [8085/8086 CPU], Processor Organization,
Structure and Function. Register Organization, Basic Microprocessor operations: Data Transfer
(Register / Memory) Operations, Arithmetic & Logical Operations,
Instruction Cycle, Instruction Pipelining. Introduction to RISC and CISC Architecture,
Instruction Level Parallelism and Superscalar Processors: Design Issues.
Control Unit: Micro-Operations, Functional Requirements, Processor Control, Hardwired
Implementation, and Micro-programmed Control.
Unit III Fundamentals of Advanced Computer Architecture: Parallel Architecture: Classification 15 L
of Parallel Systems, Flynn’s Taxonomy, Array Processors, Clusters, and NUMA Computers.
Multiprocessor Systems: Structure & Interconnection Networks, Multi-Core Computers:
Introduction, Organization and Performance
Text books:
1. M. Mano, Computer System Architecture 3rd edition, Pearson
2. Carl Hamacher et al., Computer Organization and Embedded Systems, 6 ed., McGraw-Hill 2012
3. R P Jain, Modern Digital Electronics, Tata McGraw Hill Education Pvt. Ltd. , 4th Edition, 2010
Additional References:
1. William Stallings (2010), Computer Organization and Architecture- designing for performance, 8th edition,
Prentice Hall, New Jersy.
2. Anrew S. Tanenbaum (2006), Structured Computer Organization, 5th edition, Pearson Education Inc,
3. John P. Hayes (1998), Computer Architecture and Organization, 3rd edition, Tata McGrawHill.

Course: Introduction to Programming with Python

PUSCS102 (Credits : 2 Lectures/Week : 3)
Objectives:
1) To learn how to design and program Python applications.
2) To explore the innards of Python Programming and understand components of Python Program
3) To define the structure and components of a Python program.
4) To learn how to write loops and decision statements in Python
5) To learn about inbuilt input/output operations and compound data types in Python
Expected learning outcomes
After successful completion of this course, students would be able to:
1) Ability to store, manipulate and access data in Python
2) Ability to implement basic Input / Output operations in Python
3) Ability to define the structure and components of a Python program.
4) Ability to learn how to write loops and decision statements in Python.
5) Ability to learn how to write functions and pass arguments in Python.
6) Ability to create and use Compound data types in Python
Overview of Python: History & Versions, Features of Python, Execution of a Python Program,
Flavours of Python, Innards of Python, Python Interpreter, Memory Management in Python,
Garbage Collection in Python, Comparison of Python with C and Java, Installing Python,
Writing and Executing First Python Program, Getting Help, IDLE
Data Types, Variables and Other Basic Elements: Comments, Docstrings, Data types-
Numeric Data type, Compound Data Type, Boolean Data type, Dictionary, Sets, Mapping,
Basic Elements of Python, Variables
Unit I Input and Output Operations: Input Function, Output Statements, The print() function, The 15 L
print(“string”) function, The print(variables list) function, , The print(object) function, The
print(formatted string) function, Command Line Arguments
Control Statements: The if statement, The if … else Statement, The ‘if … elif … else’
Statement, Loop Statement- while loop, for loop, Infinite loop, Nested loop, The else suite,
break statement, continue statement, pass statement, assert statement, return statement
 Operators: Arithmetic operators, Assignment operators, Unary minus operator, Relational
operators, Logical operators, Bitwise operators, Membership operators, Identity operators,
Precedence of Operators, Associativity of Operators
Unit II Arrays: Creating Arrays, Indexing and Slicing of Arrays, Basic Array Operations, Arrays 15 L
Processing, Mathematical Operations on Array, Aliasing Arrays, Slicing and Indexing in
NumPy Arrays, Basic slicing, Advanced Indexing, Dimensions of Arrays, Attributes of an
Array, The ndim Attribute, The shape Attribute, The size Attribute, The itemsize Attribute
Functions: Function definition and call, Returning Results, Returning Multiple Values from a
Function, Built-in Functions, Difference between a Function and a Method, Pass Value by
Object Reference, Parameters and Arguments, Formal and Actual Arguments, Positional
Arguments, Keyword Arguments, Default Arguments, Arbitrary Arguments, Recursive
Functions, Anonymous or Lambda Functions, Using Lambda with the filter() Function, Using
Lambda with the map() Function, Using Lambda with the reduce() Function Modules:
Introduction to Modules in Python
Strings: Creating Strings, Functions of Strings, Working with Strings, Length of a String,
Indexing and Slicing, Repeating and Concatenating Strings, Checking Membership, Comparing
Unit III Strings, Removing Spaces, Finding Substrings, Counting Substrings, Immutability, Splitting 15 L
and Joining Strings, Changing Case, Checking Starting and Ending of a String, Sorting Strings,
Searching in the Strings, Testing Methods, Formatting Strings, Finding the Number of
Characters and Words, Inserting Substrings into a String
List and Tuples: Lists, List Functions and Methods, List Operations, List Slices, Nested Lists,
Tuples, Functions in Tuple
Dictionaries: Creating a Dictionary, Operators in Dictionary, Dictionary Methods, Using for
Loop with Dictionaries, Operations on Dictionaries, Converting Lists into Dictionary,
Converting Strings into Dictionary, Passing Dictionaries to Functions, Sorting the Elements of
a Dictionary using Lambda, Ordered Dictionaries

Text books:
1. Practical Programming: An Introduction to Computer Science Using Python 3, Paul Gries , Jennifer Campbell,
Jason Montojo, Pragmatic Bookshelf, 2nd Edition, 2014
.2. Programming through Python, M. T Savaliya, R. K. Maurya& G M Magar, Sybgen Learning India, 2020
Additional References:
1. Python: The Complete Reference, Martin C. Brown, McGraw Hill, 2018
2. Beginning Python: From Novice to Professional, Magnus Lie Hetland, Apress, 2017
3. Programming in Python 3. Mark Summerfield, Pearson Education, 2nd Ed, 2018
4. Python Programming: Using Problem Solving Approach, ReemaThareja, Oxford University Press, 2017
5. Let Us Python, Yashwant. B. Kanetkar, BPB Publication, 2019
 Course:
PUSCS103 Linux Operating System

(Credits : 2 Lectures/Week: 3)

Objectives:

1) This course introduces various tools and techniques commonly used by Linux programmers, system
administrators and end users to achieve their day to day work in the Linux environment.

2) It is designed for computer students who have limited or no previous exposure to Linux.

Expected Learning Outcomes:

1) Upon completion of this course, students should have a good working knowledge of Linux, from both a graphical
and command line perspective, allowing them to easily use any Linux distribution.

2) This course shall help students to learn advanced subjects in computer science practically.

3) Students shall be able to progress as a Developer or Linux System Administrator using the acquired skill set.

Introduction and Overview of Operating Systems: Definition of Operating System, Operating

System’s role, Operating-System Operations, Functions of Operating System, Computing
Environments

Unit I Operating-System Structures: Operating-System Services, User and Operating-System 15 L

Interface, System Calls, Types of System Calls, Operating-System Structure

Processes: Process Concept, Process Scheduling, Operations on Processes, Interprocess

Communication

Threads: Overview, Multicore Programming, Multithreading Models

Linux operating system and Basics: History, GNU Info and Utilities, Various Linux
Unit II Distributions, The Unix/Linux architecture, Features of Unix/Linux, Starting the shell, Shell 15 L
prompt, Command structure, File Systems and Directory Structure, man pages, more
documentation pages.

Basic Bash shell commands: General purpose utility Commands, basic commands, Various file
 types, attributes and File handling Commands, Handling Ordinary Files. More file attributes

Advanced Bash shell commands: Simple Filters, Filters using regular expressions.
The Linux environment variable: Setting, Locating and removing environment variables like
PATH etc, Default shell environment variables, Using command aliases.

Understanding Linux file permission : Linux security, Using Linux groups, Decoding file
permissions, Changing security setting, Sharing files.(chmod, chgrp, chown, etc)
Unit III 15 L
Linux Security: Understanding Linux Security, uses of root, sudo command, working with
passwords, Understanding ssh.

Networking : TCP/IP Basics, TCP/IP Model, Resolving IP addresses, Applications, ping, telnet,
ftp, DNS
Working with Editors: awk, sed and Introduction to vi.

Text book:

1) Abraham Silberschatz, Peter Galvin, Greg Gagne, Operating System Concepts, Wiley, 8th Edition.

2) Official Ubuntu Book, 8th Edition, by Matthew Helmke & Elizabeth K. Joseph with Jose Antonio Rey and Philips
Ballew, Prentice Hall

3) Unix Concepts and Applications by Sumitabha Das

Additional References:

1) Achyut S. Godbole, Atul Kahate, Operating Systems, Tata McGraw Hill

2) Linux kernel Home: http://kernel.org

3) Open Source Initiative: https://opensource.org/

4) The Linux Foundation: http://www.linuxfoundation.org/

 Course: Open Source Technologies
PUSCS104 (Credits : 2 Lectures/Week:3)

Course Objectives:
1) Understand the difference between open-source software and commercial software.
2) Understand the policies, licensing procedures and ethics of FOSS.
3) Understand open-source philosophy, methodology and ecosystem.
4) Awareness with Open-Source Technologies.
Expected Learning Outcome:
1) Differentiate between Open Source and Proprietary software and Licensing.
2) Recognize the applications, benefits and features of Open-Source Technologies
Gain knowledge to start, manage open-source projects.

Introduction to Open-Source:
Open Source, Need and Principles of OSS, Open-Source Standards, Requirements for
Software, OSS success, Free Software, Free Software vs. Open Source software, Public
Domain Software, Proprietary Vs Open-Source Licensing Model, use of Open Source
Software, FOSS does not mean no cost. History: BSD, The Free Software Foundation and the
GNU Project.

I Open-Source Principles and Methodology:

Open Source History, Open Source Initiatives,Open Source Principle, methodologies,
Philosophy, Software Freedom, Open Source Development, Intellectual Property Rights:
Introduction, What is Intellectual Property Rights (IPR).Importance and Significance of IPR. 15 L
Different forms of IPR, Copyrights vs. Copyleft, Trademark, Logo, Patents, Zero marginal
cost, Income-generation Opportunities, Internationalization.

Licensing: What Is A License, How to create your own Licenses, Important FOSS Licenses
(Apache, BSD, PL, LGPL), Various types of creative common licenses.

Open Source Ethics and Social Impact: Open source vs. closed source, Open source
government, Ethics of Open source, Social and Financial impacts of open source technology,
Shared software, Shared source, Open Source as a Business Strategy
Case Studies:
Example Projects: Apache web server, BSD, Mozilla (Firefox), Wikipedia, Drupal,
WordPress, GCC, GDB, Open Office, Git, GitHub, Open Office, LibreOffice.
II Study: Understanding the developmental models, licensings, and modes of funding,
commercial /non-commercial use. 15 L
Open Source Projects:
Open Source Design, Open source Teaching, Open source media. How to identify whether the
software is open source or not?
 Collaboration :
Community and Communication, Contributing to Open Source Projects: Introduction to
GitHub, interacting with the community on GitHub, Communication and etiquette, testing open
source code, reporting issues, contributing code.

Introduction to Wikipedia:
Contributing to Wikipedia Or contributing to any prominent open source project of a student's
III choice. Starting and Maintaining my own Open Source Project.Open Education Resources. 15 L

Understanding Open Source Ecosystem

Open Source Operating Systems: GNU/Linux, Android, Free BSD, Open Solaris. Open Source
Hardware, Virtualization Technologies, Containerization Technologies: Docker, Development
tools, IDEs, debuggers, Programming languages, LAMP, Open Source Database
Technologies, Open Source Testing Technology :Selenium

Books and References:

Sr. No. Title
1. “Open-Source Technology”, Kailash Vadera & Bhavyesh Gandhi, University Science Press, Laxmi
Publications
2. “Understanding Open Source and Free Software Licensing”, Andrew M. St. Laurent, O’Reilly Media.
3. “Open Source for the Enterprise”, Dan Woods, Gautam Guliani, O’Reilly Media

4. “Open-Source Technology and Policy”, Fadi P. Deek and James A. M. McHugh, Cambridge University
Press, 2008
Additional references:
1. The Linux Documentation Project: http://www.tldp.org/
2. Docker Project Home: http://www.docker.com
3. Linux kernel Home: http://kernel.org
4. Open Source Initiative: https://opensource.org/
5. Linux Documentation Project: http://www.tldp.org/
6. Wikipedia: https://en.wikipedia.org/
7. https://en.wikipedia.org/wiki/Wikipedia:Contributing_to_Wikipedia
8. Github: https://help.github.com/
9. The Linux Foundation: http://www.linuxfoundation.org/
 Course: Discrete Mathematics
PUSCS105 (Credits : 2 Lectures/Week:3)
Objectives:
1) The purpose of the course is to familiarize the prospective learners with mathematical structures that are
fundamentally discrete.
2) This course will enhance prospective learners' reasoning and ability to articulate mathematical problems.
3) This course will introduce functions, forming and solving recurrence relations and different counting principles.
These concepts will be useful to study or describe objects or problems in computer algorithms and programming
languages and these concepts can be used effectively in other courses.
Expected Learning Outcomes:
1) Define mathematical structures (relations, functions, graphs) and use them to model real life situations.
2) Understand, construct and solve simple mathematical problems.
3) Solve puzzles based on counting principles.
4) Provide basic knowledge about models of automata theory and the corresponding formal languages.
5) Develop an attitude to solve problems based on graphs and trees, which are widely used in software.

Recurrence Relations
(a) Functions: Definition of function; Domain, co-domain, range of a function; Examples of
standard functions such as identity and constant functions, absolute value function,
logarithmic and exponential functions, flooring and ceiling functions; Injective, surjective
and bijective functions; Composite and inverse functions.
(b) Relations: Definition and examples of relation; Properties of relations, Representation
Unit I of relations using diagraphs and matrices; Equivalence relation; Partial Order relation, Hasse 15 L
Diagrams, maximal, minimal, greatest, least element, Lattices.
(c) Recurrence Relations: Definition and Formulation of recurrence relations; Solution of a
recurrence relation; Solving recurrence relations- Back tracking method, Homogeneous
solution of linear homogeneous recurrence relation with constant coefficients; Particular
solution of non-linear homogeneous recurrence relation with constant coefficients; General
solution of non-linear homogeneous recurrence relation with constant coefficients;
Applications- Formulate and solve recurrence relation for Fibonacci numbers, Tower of
Hanoi, Intersection of lines in a plane, Sorting Algorithms.

Counting Principles , Languages and Finite State Machine

Unit II 15 L
(a) Counting Principles: Basic Counting Principles (Sum and Product Rule); Pigeonhole
Principle (without proof) - Simple examples; Inclusion Exclusion Principle (Sieve formula)
(without proof); Counting using Tree diagrams.
(b) Permutations and Combinations: Permutation without and with repetition; Combination
without and with repetition; Binomial numbers and identities: Pascal Identity, Vandermonde’s
Identity, Pascal triangle, Binomial theorem (without proof) and applications;
(c) Languages, Grammars and Machines: Languages and Grammars – Introduction, Phase
structure grammar, Types of grammar, Derivation trees; Finite-State Machines with Output;
Finite-State Machines with No Output; Regular Expression and Regular Language.
 Graphs and Trees
a) 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; Eulerian and Hamiltonian paths; Planar
Unit III graphs, Graph coloring and chromatic number. 15 L
b) 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 Book:
1. Discrete Mathematics and Its Applications, Seventh Edition by Kenneth H. Rosen, McGraw Hill Education
(India) Private Limited. (2011)
2. Norman L. Biggs, Discrete Mathematics, Revised Edition, Clarendon Press, Oxford 1989.
3. Data Structures Seymour Lipschutz, Schaum’s out lines, McGraw- Hill Inc
4. Discrete Mathematics: Semyour Lipschutz, Marc Lipson, Schaum’s out lines, McGraw- Hill Inc. 3rd Edition

Additional References:
1. Elements of Discrete Mathematics: C.L. Liu , Tata McGraw- Hill Edition.
2. Concrete Mathematics (Foundation for Computer Science): Graham, Knuth, Patashnik Second Edition, Pearson
Education.
3. Foundations in Discrete Mathematics: K.D. Joshi, New Age Publication, NewDelhi.

Course: Descriptive Statistics

PUSCS106 (Credits : 2 Lectures/Week: 3)
Objectives:
1) To develop the students ability to deal with different types of data.
2) To enable the use of different measures of central tendency and dispersion wherever relevant.
3) To make learners aware about the techniques to check the Skewness and Kurtosis of data.
4) To make learners able to find the correlation between different variables and further apply the regression analysis
to find the exact relation between them.
5) To develop the ability to analyse statistical data through R software.
Expected Learning Outcomes:
1) Organize, manage and present data.
2) Analyse statistical data using measures of central tendency and dispersion.
3) Apply basic concepts of moments.
4) Use various techniques to calculate Skewness and Kurtosis.
5) Analyse the correlation and extent of correlation between variables.
6) Use the techniques of Regression analysis.
7) Analyse Statistical data using basics techniques of R
 Data Types and Data Presentation:
Data types: Attribute and Variable ,Discrete and Continuous variable, Different types of
Unit I scales: nominal, ordinal, interval and ratio , Univariate and Bivariate distribution, Types of 15 L
Classification
Data presentation: Frequency distribution, Histogram, Ogive curves , stem and leaf display
Introduction to R: Data input, Arithmetic Operators, Vector Operations, Matrix Operations,
Data Frames, Built-in Functions (eg: seq(), round(), rep(), sort(), cut(), etc)
Frequency Distribution, Grouped Frequency Distribution, Diagrams and Graphs, Summary
statistics for raw data and grouped frequency distribution
Measures of Central tendency: Concept of average/central tendency, Characteristics of good
measure of central tendency. Arithmetic Mean (A.M.), Median, Mode - Definition, examples for
ungrouped and grouped data, effect of shift of origin and change of scale, merits and demerits.
Combined arithmetic mean. Partition Values: Quartiles, Deciles and Percentiles - examples for
ungrouped and grouped data.
Measures dispersion:
Concept of dispersion, Absolute and Relative measure of dispersion, Characteristics of good
measure of dispersion. Range, Semi-interquartile range, Quartile deviation, Standard deviation -
Unit II Definition, examples for ungrouped and grouped data, effect of shift of origin and change of 15 L
scale, merits and demerits. Combined standard deviation, Variance.
Coefficient of range, Coefficient of quartile deviation and Coefficient of variation (C.V.)
Moments: Concept of Moments, Raw moments, Central moments, Relation between raw and
central moments.
Measures of Skewness and Kurtosis: Concept of Skewness and Kurtosis, Measures based on
moments, quartiles.
Correlation: Concept of correlation, Types and interpretation, Measure of Correlation:
Scatter diagram and interpretation;
Karl Pearson’s coefficient of correlation (r): Definition, examples for ungrouped and grouped
Unit III data, effect of shift of origin and change of scale, properties; Spearman’s rank correlation 15 L
coefficient: Definition, examples of with and without repetition. Concept of Multiple correlation.
Regression: Concept of dependent (response) and independent (predictor) variables,
Concept of regression, Types and prediction,
Difference between correlation and regression, Relation between correlation and regression.
Linear Regression - Definition, examples using least square method and regression coefficient,
coefficient of determination, properties. Concept of Multiple regression and Logistic regression.
Text Book:
1. Probability, Statistics, Design of Experiments and Queuing theory, with applications of Computer Science
2. Schaum’s Outline Of Theory And Problems Of Beginning Statistics, Larry J. Stephens, Schaum’s Outline Series
Mcgraw-Hill
Additional References:
1. Gupta, S.C. and Kapoor, V.K. (1987): Fundamentals of Mathematical Statistics, S. Chand and Sons, New Delhi
2. Statistics Using R by Purohit, S. G., Gore S. D., Deshmukh S. R. (2008), Narosa Publishing House, New Delhi
 Course: Soft Skills
PUSCS107 (Credits : 2 Lectures/Week: 3)
Course Objectives:
1) Understand the significance and essence of a wide range of soft skills.
2) Learn how to apply soft skills in a wide range of routine social and professional settings
3) Learn how to employ soft skills to improve interpersonal relationships
4) Learn how to employ soft skills to enhance employability and ensure workplace and career Success
Expected Learning Outcomes:
1) Learners will be able to understand the importance and types soft skills
2) Learners will develop skills for Academic and Professional Presentations.
3) Learners will be able to understand Leadership Qualities and Ethics.
4) Ability to understand the importance of stress management in their academic & professional life.

Soft Skills: An Introduction – Definition and Significance of Soft Skills; Process, Importance
and Measurement of Soft Skill Development.
Personality Development: Knowing Yourself, Positive Thinking, Johari’s Window, Physical
Fitness
Emotional Intelligence: Meaning and Definition, Need for Emotional Intelligence, Intelligence
Unit I Quotient versus Emotional Intelligence Quotient, Components of Emotional Intelligence,
Competencies of Emotional Intelligence, Skills to Develop Emotional Intelligence 15 L
Positivity and Motivation: Developing Positive Thinking and Attitude; Driving out
Negativity; Meaning and Theories of Motivation; Enhancing Motivation Levels
Etiquette and Mannerism: Introduction, Professional Etiquette, Technology Etiquette
Ethical Values: Ethics and Society, Theories of Ethics, Correlation between Values and
Behavior, Nurturing Ethics, Importance of Work Ethics, Problems in the Absence of Work
Ethics

Components of effective communication: Communication process and handling them,

Composing effective messages, Non – Verbal Communication: its importance and nuances:
Facial Expression, Posture, Gesture, Eye contact, appearance (dress code).
Communication Skills: Spoken English, Phonetics, Accent, Intonation
Employment Communication: Introduction, Resume, Curriculum Vitae, Scannable Resume,
Unit II Developing an Impressive Resume, Formats of Resume, Job Application or Cover Letter 15 L
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
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
Professional Presentation: Nature of Oral Presentation, planning a Presentation, Preparing the
Presentation, Delivering the Presentation
Creativity at Workplace: Introduction, Current Workplaces, Creativity, Motivation, Nurturing
Hobbies at Work, The Six Thinking Hat Method.
Unit III Capacity Building: Learn, Unlearn and Relearn: Capacity Building, Elements of Capacity
Building, Zones of Learning, Ideas for Learning, Strategies for Capacity Building
15 L
Leadership and Team Building: Leader and Leadership, Leadership Traits, Culture and
Leadership, Leadership Styles and Trends, Team Building, Types of Teams.
Decision Making and Negotiation: Introduction to Decision Making, Steps for Decision
Making, Decision Making Techniques, Negotiation Fundamentals, Negotiation Styles, Major
Negotiation Concepts
Stress and Time Management: Stress, Sources of Stress, Ways to Cope with Stress
 Text book:
1 .Managing Soft Skills for Personality Development – edited by B.N.Ghosh, McGraw Hill India, 2017.
2. Soft Skills: An Integrated Approach to Maximize Personality, Gajendra S. Chauhan, Sangeeta Sharma, Wiley India

Additional References:
1. Personality Development and Soft Skills, Barun K. Mitra, Oxford Press
2. Business Communication, Shalini Kalia, Shailja Agrawal, Wiley India
3. Cornerstone: Developing Soft Skills, Sherfield, Pearson India
 Suggested List of Practical- SEMESTER I

Course: Practical of PUSCS101

PUSCSP101 (Credits : 1, Lectures/Week: 3)
1 To Study and verify the truth table of various logic gates (NOT, AND, OR, NAND, NOR,
EX-OR, and EX-NOR).
2 Simplify given Boolean expression and realize it
a. (A+B).(A.B)
b. (B+~B)+(A.B)+C
3 Design and verify a half/full adder
4 Design and verify half/full subtractor
5 Design a 4 bit magnitude comparator using combinational circuits.
6 Design and verify the operation of flip-flops using logic gates.
a. S-R Flip Flop
b. D Flip Flop
c. J-K Flip Flop
d. D Flip Flop
e. T Flip Flop
7 Verify the operation of a counter.
a. Synchronous Counter
b. Asynchronous Counter
8 Verify the operation of a 4 bit shift register
a. Serial In Serial Out
b. Serial In Parallel Out
c. Parallel In Serial Out
d. Parallel In Parallel Out
9 Design and implement expression using multiplexers / demultiplexers.

10 Design and implement 3-bit binary ripple counter using JK flip flops.
11 Using MARS, Simple microprocessor programs for data transfer operations

12 Using MARS Simple microprocessor programs for arithmetic & logical transfer operations

Note Practical 1 – 10 can be performed using any open source simulator (like Logisim)
(Download it from https://sourceforge.net/projects/circuit/)
Practical 11 – 12 can be performed on any simulation software like Jubin’s 8085
simulator,Using MARS.
 Course: Practical of PUSCS102
PUSCSP102 (Credits : 1, Lectures/Week: 3)
1 Perform the following:
Installing and setting up the Python IDLE interpreter. Executing simple statements like
expression statement
a. Numeric and Boolean type
b. Assert Statements
c. Delete Statements
d. Print Function
e. Input Function with output
2 Write a Python program to demonstrate the precedence and associativity of operators

3 Write a program to design and develop python program to implement various control
statement using suitable examples
4 Write a program in Python to define and call functions for suitable problems.

5 Write a Python program to demonstrate different types of function arguments.

6 Write a suitable Python program to implement recursion for problems such as Fibonacci
series, Factorial, Tower of Hanoi etc.
7 Write Python program to implement and use lambda function in python

8 Write a python program to create and manipulate arrays in Python. Also demonstrate
use of slicing and indexing for accessing elements from the array.
9 Write a program to implement a list in Python for suitable problems. Demonstrate
various operations on it.
10 Write a program to implement tuples in Python for suitable problems. Demonstrate
various operations on it.
11 Write a program to implement a dictionary in Python for suitable problems.
Demonstrate various operations on it
 Course: Practical of PUSCS103
PUSCSP103 (Credits : 1, Lectures/Week: 3)
1
Installation of Ubuntu Linux operating system.

a) Booting and Installing from ( USB/DVD)

b) Using Ubuntu Software center / Using Synaptic
c) Explore useful software packages.

2
Becoming an Ubuntu power user

a) Administering system and User setting

b) Learning Unity keyboard
c) Using the Terminal
d) Working with windows programs

3
File System Commands: touch, help, man, more, less, pwd, cd, mkdir, rmdir, ls,
find, ls, etc

File handling Commands: cat, cp, rm, mv, more, file, wc, od, cmp, diff, comm,
chmod, chown, chgrp, gzip and gunzip, zip and unzip, tar, ln, umask,, chmod, chgrp,
chown, etc

4
General purpose utility Commands: cal, date, echo, man, printf, passwd, script,
who, uname, tty, stty, etc

Simple Filters and I/O redirection: head, tail, cut paste, sort, grep family, tee,
uniq, tr, etc. Networking Commands: who, whoami, ping, telnet, ftp, ssh, etc

5 Editors: vi, sed, awk

6
Process Communication:

(i) Give a solution to the producer–consumer problem using shared memory.

 (ii) Give a solution to the producer–consumer problem using message passing.

(iii) One form of communication in a Client–Server Systems environment is

Remote method invocation (RMI). RMI is a Java feature similar to RPCs. RMI
allows a thread to invoke a method on a remote object. Objects are considered
remote if they reside in a different Java virtual machine (JVM). Demonstrate
RMI program for adding/subtracting/multiplying/dividing two numbers.
7
Threads:

(i) The Java version of a multithreaded program that determines the summation of a
non-negative integer. The Summation class implements the Runnable interface. Thread
creation is performed by creating an object instance of the Thread class and passing the
constructor a Runnable object.

(ii) Write a multithreaded Java program that outputs prime numbers. This program
should work as follows: The user will run the program and will enter a number on the
command line. The program will then create a separate thread that outputs all the prime
numbers less than or equal to the number entered by the user.

(iii) The Fibonacci sequence is the series of numbers 0, 1, 1, 2, 3, 5. 8, ... Formally, it

can be expressed as: fib0 = 0, fib1 = 1, fibn = fibn-1 + fibn-2 Write a multithreaded
program that generates the Fibonacci sequence using either the Java,
8
Synchronization:

(i) Give a Java solution to the Bounded buffer problem.

(ii) Give a solution to the readers–writers problem using Java synchronization.

(iii) The Sleeping-Barber Problem: A barber shop consists of a waiting room with n
chairs and a barber room with one barber chair. If there are no customers to be served,
the barber goes to sleep. If a customer enters the barbershop and all chairs are
occupied, then the customer leaves the shop. If the barber is busy but chairs are
available, then the customer sits in one of the free chairs. If the barber is asleep, the
customer wakes up the barber. Write a program to coordinate the barber and the
customers using Java synchronization.
 9
Implement FCFS scheduling algorithm in Java or any programming language.

10
Implement SJF (with no preemption) scheduling algorithm in Java or any
programming language.

Course: Practical of PUSCS104

PUSCSP104 (Credits : 1, Lectures/Week: 3)
1 Identify any Open Source software and create detailed reports about it.
a. Idea
b. What problem does it solve?
c. Licensing model
d. Intent behind making it open source
e. Monetization models
f. Popularity
g. Impact

Learn at least two different open source licenses and create a brief report about
them.
a. History of license
b. Idea
c. What problems does it solve?
d. Detailed licensing model
e. Which popular software is released under this license?
f. Any popular news associated with this license?
g. Popularity
h. Impact

2 Hands on with LibreOffice

● Learn it from practical view-point
● Give a brief presentation about it to the class

3 Hands on with GIMP Photo Editing Tool

● Learn it from practical view-point
● Give a brief presentation about it to the class
4 Hands on with Shotcut Video Editing Tool
● Learn it from practical view-point
● Give a brief presentation about it to the class

5 Contributing to Wikipedia:
1. Introduction to wikipedia: operating model, license, how to
contribute?
2. Create your user account on wikipedia
3. Identify any topic of your choice and contribute the missing
information

6 Github
1. Create and publish your own open source project: Write any simple program
using your choice of programming language.
2. Create a repository on github and save versions of your project. You‘ll learn
about the staging area, committing your code, branching, and merging,
3. Using GitHub to Collaborate:Get practice using GitHub or other remote
repositories to share your changes with others and collaborate on multi-
developer projects. You‘ll learn how to make and review a pull request on
GitHub.
4. Contribute to a Live Project: Students will publish a repository containing
their reflections from the course and submit a pull request.

7 Hands on with WordPress CMS

● Learn it from practical view-point
● Give a brief presentation about it to the class

8 Open Source Operating Systems

1. Learn any open source operating system of your choice: Linux, Android,
FreeBSD, Open Solaris etc.
2. Learn the installation.
3. Identify the unique features of the OS of your choice.

9 Hands on with Blender Graphics and Animation Tool

• Learn it from practical view-point
• Give a brief presentation about it to the class

10 Containerization:
● Install and configure the following containerization technologies: docker,
rocket, LXD
● Create and use containers using it
 Course: Practical of PUSCS105
PUSCSP105 (Credits : 1, Lectures/Week: 3)
1 Functions :
a)Identify if the given mapping is a function
b) Finding domain and range of a given function
c) Check if the given function is injective/surjective/bijective
d) Find the inverse of a given function
e) Operations on functions
f) Graphs of functions using any online tool
2 Relations :
a ) Representation of relations
b) Determine if the given relation satisfies equivalence relation/partial order relation
c) Draw Hasse diagrams
d) Find maximal, minimal, greatest, least element in a Poset
e) Determine if a given Poset is a Lattice

3 Recurrence Relation
a) Solve recurrence relation using backtracking method
b) Solve linear homogeneous recurrence relations with constant coefficients
c) Find homogeneous, particular, general solution of a recurrence relation
d) Formulate and solving recurrence relation
4 Counting Principles
a) Sum and product rule
b) Pigeonhole Principle
c) Inclusion Exclusion Principle
d) Counting using Tree diagrams

5 Permutations and Combinations

a) Permutations
b) Permutations with repetitions
c) Combinations
d) Combinations with repetitions
e) Binomial numbers and Identities
f) Applications on Binomial theorem
6 Languages and Grammars
a) Find the language generated by given grammar
b) Check if a given string belongs or not to a given language/grammar
c) Operations on languages
d) Identify the type of grammar

7 Finite State Machines

a) Check if a given string is accepted or rejected by FSM without output
b) Find the output for a FSM with output
c) Describe a machine (diagram/table)

8 Regular Expression and Regular Language

a) Describe the regular expressions represented by given language
b) Describe the language represented by given regular expression
 9 Graphs
a) Types of graph
b) Properties of graph
c) Representation of graph
d) Graph Isomorphism
e) Connectivity in graphs – path, trail, walk
f) Euler and Hamilton graphs
g) Planar graphs
h) Graph coloring and chromatic number

10 Trees
a) Tree terminologies
b) Types of tree
c) Properties of tree
d) Representation of tree
e) Expression tree
f) Binary Search tree
g) Tree traversal

Course: Practical of PUSCS106

PUSCSP106 (Credits : 1, Lectures/Week: 3)
1. Basics of R

2. Frequency distribution and data presentation

3. Measures of central tendency

4. Measures of dispersion

5 Moments

6. Measures of Skewness

7. Summary statistics using R

8. Measures of kurtosis

9. Correlation

10 Regression
SEMESTER II
 Course: Design & Analysis of Algorithms
PUSCS201 (Credits : 2 Lectures/Week: 3)
Course Objectives:
● To make students understand the basic principles of algorithm design
● To give idea to students about 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.
Expected Learning Outcomes:
1. Students should be able to understand and evaluate efficiency of the programs that they write based on
performance of the algorithms used.
2. Students should be able to appreciate the use of various data structures as per need
3. To select, decide and apply appropriate design principle by understanding the requirements of any real life
problems
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 like solving linear equations, Polynomial
Representation, Infix-to-Postfix conversion
Unit I 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,
15 L
Asymptotic Notation, Big-O Notation, Omega-Ω Notation, Theta-Θ Notation, Asymptotic
Analysis, Performance characteristics of algorithms, Estimating running time / number of steps
of executions on paper, Idea of Computability

Recursion - What is recursion, Recursion vs Iteration, recursion applications: Factorial of a

number, Fibonacci series & their comparative analysis with respect to iterative version, Tower
of hanoi problem.
Searching Techniques - Linear Search and its types, Binary Search and their comparative
analysis. 15 L
Unit II
Basic Sorting Techniques - Bubble, Selection and Insertion Sort & 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.
Algorithm Design Techniques -Introduction to various types of classifications/design criteria
and design techniques.
Greedy Technique - Concept, Advantages & Disadvantages, Applications, Implementation
using problems: file merging problem.
Unit III Divide-n-Conquer - Concept, Advantages & Disadvantages, Applications, Implementation
using problems: merge sort, Strassen's Matrix Multiplication.
15 L
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
 Text book:
1. “Introduction to Algorithms”, Thomas H. Cormen, 3rd Edition, PHI.
2. “Data Structure and Algorithm Using Python”, Rance D. Necaise, Wiley India Edition, 2016.
3. “Data Structures and Algorithms Made Easy”, NarasimhaKarumanchi, CareerMonk
4. Publications, 2016.
5. Data Structure and Algorithm in Python, Michael T. Goodrich, Robertom Tamassia, M. H. Goldwasser, 2016
Wiley India Edition
Additional References:
1. “Introduction to the Design and Analysis of Algorithms”, Anany Levitin, Pearson, 3rd Edition, 2011.
2. “Design and Analysis of Algorithms”, S. Sridhar, Oxford University Press, 2014.

Course: Advanced Python Programming

PUSCS202 (Credits : 2 Lectures/Week: 3)
Course Objectives:
● To learn how to design object‐oriented programs with Python classes.
● To learn about reading, writing and implementing other operations on files in Python.
● To implement threading concept and multithreading in Python
● To design GUI Programs and implement database interaction using Python.
● To know about use of regular expression and handling exceptions for writing robust python
programs.

Expected Learning Outcomes:

1. Ability to implement OOP concepts in Python including Inheritance and Polymorphism.
2. Ability to work with files and perform operations on it using Python.
3. Ability to implement regular expression and concept of threads for developing efficient programs.
4. Ability to implement exception handling in Python applications for error handling.
5. Knowledge of working with databases, designing GUI in Python and implement networking in Python

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, working with xml 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
Unit I Regular expressions: What is a regular expression?, sequence characters in regular expressions,
quantifiers in regular expressions, special characters in regular expressions, using regular
15 L
expression on files, retrieving information from an html file,
Threads in python: Difference between process and thread, types of threads, benefits of threads,
creating threads, single tasking and multitasking, thread synchronization, deadlock in threads,
daemon threads
Date and time in python: Date and time now, combining date and time, formatting dates and
times, finding durations using “time delta”, comparing two dates, sorting dates, stopping
execution temporarily, knowing the time taken by a program, calendar module.
 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.
Exceptions in python: Errors in a python program, compile & run-time errors, logical error,
exceptions-exception handling, types of exceptions, the except block, the assert statement, user- 15 L
Unit II
defined exceptions, logging the exceptions
Networking: Protocols,server-client architecture, tcp/ip and udp communication
Graphical user interface: Creating a GUI in python, Widget classes, Working with Fonts and
Colours, working with Frames, Layout manager, Event handling
.
OOPs in python: Features of Object Oriented Programming system (oops)-classes and objects,
encapsulation, abstraction, inheritance, polymorphism, constructors and destructors
Classes and objects: Creating a class, the self-variable, types of variables, namespaces, types of
methods, instance methods, class methods, static methods, passing members of one class to
Unit III another class, inner classes
Inheritance and polymorphism: Inheritance in python, types of inheritance- single inheritance,
15 L
multilevel inheritance, hierarchical inheritance, multiple inheritance, constructors in inheritance,
overriding superclass constructors and methods, the super() method, method
resolution order (mro), polymorphism, duck typing, operator overloading, method overloading,
method overriding,
Abstract classes and interfaces: Abstract class, abstract method, interfaces
in python, abstract classes vs. Interfaces

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
4. Beginning Python: From Novice to Professional, Magnus Lie Hetland, Apress, 2017
5. Programming in Python 3, Mark Summerfield, Pearson Education, 2nd Ed, 2018
 Course: Introduction to OOPs using C++
PUSCS203 (Credits : 2 Lectures/Week: 3)
Course Objectives:
● The course aims to introduce a new programming paradigm called Object Oriented Programming.
● This will be covered using C++ programming language. C++ is a versatile programming language, which
supports a variety of programming styles, including procedural, object-oriented, and functional programming.
● This makes C++ powerful as well as flexible.
● It can be used to develop software such as operating systems, databases, and compilers.

Expected Learning Outcomes:

1. After successful completion of this course, students would be able to
2. Work with numeric, character and textual data and arrays.
3. Understand the importance of OOP approach over procedural language.
4. Understand how to model classes and relationships using UML.
5. Apply the concepts of OOPS like encapsulation, inheritance and polymorphism.
6. Handle basic file operations.

Introduction to Programming Concepts: Object oriented programming paradigm, basic

concepts of object oriented programming, benefits of object oriented programming, object
oriented languages, applications of object oriented programming.
Tokens-keywords, identifiers, constants-integer, real, character and string constants, backslash
Unit I constants, features of C++ and its basic structure, simple C++ program without class, compiling
and running C++ program.
15 L
Data Types, Data Input Output and Operators: Basic data types, variables, rules for naming
variables, programming constants, the type cast operator, implicit and explicit type casting, cout
and cin statements, operators, precedence of operators.
Decision Making, Loops, Arrays and Strings: Conditional statements-if, if...else, switch
loops- while, do...while, for, types of arrays and string and string manipulations
Unified Modeling Language (UML): Introduction to UML & class diagrams.
Classes, Abstraction & Encapsulation: Classes and objects, Dot Operator, data members,
member functions, passing data to functions, scope and visibility of variables in function
Constructors and Destructors: Default constructor, parameterized constructor, copy
constructor, private constructor, destructors.
Working with objects:Accessor - mutator methods, static data and static function, access
specifiers, array of objects.
Polymorphism - Binding-static binding & overloading, constructor overloading function 15 L
Unit II
overloading, operator overloading, overloading unary and binary operators.
Modelling Relationships in Class Diagrams: Association, Aggregation Composition and
examples covering these principles
 Inheritance: Defining base class and its derived class, access specifiers, types of inheritance-
single, multiple, hierarchical, multilevel, hybrid inheritance, friend function and friend class,
constructors in derived classes.
Unit III Modelling Relationships: Generalization-Specialization and examples covering these
principles
Run time Polymorphism - Dynamic Binding, Function overriding, virtual function, pure virtual 15 L
function, virtual base class, abstract class.
Pointers: Introduction to pointers, * and & operators, assigning addresses to pointer variables,
accessing values using pointers, pointers to objects & this pointer, pointers to derived classes
File Handling: File Stream classes, opening and closing file-file opening modes, text file
handling, binary file handling.
Exception Handling: Introduction,Definition,Syntax,try and catch block,examples,types of
exception.
Applying OOP to solve real life applications: To cover case studies like library management,
order management etc. to design classes covering all relationships

Text book:
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

Course: Database Systems

PUSCS204 (Credits : 2 Lectures/Week: 3)
Course Objectives:
The objective of this course is to introduce the concept of the DBMS with respect to the relational model, to
specify the functional and data requirements for a typical database application and to understand creation,
manipulation and querying of data in databases
Expected Learning Outcomes:
1. Students should be able to evaluate business information problems 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 the database.
3. Students should be able to create, manipulate, query and back up the database
 Introduction to DBMS – Database, DBMS – Definition, Overview of 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,
Unit I Additional constraints (key constraints, participation constraints, weak entities, aggregation /
generalization, Conceptual Design using ER (entities VS attributes, Entity Vs relationship, 15 L
binary Vs ternary, constraints beyond ER)
ER to Table- Entity to Table, Relationship to tables with and without key constraints.
DDL Statements - Creating Databases, Using Databases, data types, 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
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
Relational Algebra operations (selection, projection, set operations union, intersection,
difference, cross product, Joins –conditional, equi join and natural joins, division)
Unit II Functions – String Functions (concat, instr, left, right, mid, length, lcase/lower, ucase/upper, 15 L
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)
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
Schema refinement and Normal forms: Functional dependencies, first, second, third, and
BCNF normal forms based on primary keys, lossless join decomposition.
Database Protection: Security Issues, Threats to Databases, Security Mechanisms, Role of
DBA, Discretionary Access Control, Backing Up and Restoring databases
Unit III Views (creating, altering dropping, renaming and manipulating views)
DCL Statements (creating/dropping users, privileges introduction, granting/revoking privileges,
15 L
viewing privileges), Transaction control commands – Commit, Rollback
Conceptual Designing using ER Diagrams (Identifying entities, attributes, keys and relationships
between entities, cardinalities, generalization, specialization etc.)
Indexing: Introduction to Indexing, Syntax an example of db indexing.

Text book:
1. “Fundamentals of Database System”, ElmasriRamez, NavatheShamkant, Pearson Education, Seventh edition,
2017.
2. “Database Management Systems”, Raghu Ramakrishnan and Johannes Gehrke, 3rd Edition, 2014 .
3. “Murach's MySQL”, Joel Murach, 3rd Edition, 3rd Edition, 2019.
Additional References:
1. “Database System Concepts”, Abraham Silberschatz,HenryF.Korth,S.Sudarshan, McGraw Hill, 2017.
2. “MySQL: The Complete Reference”, Vikram Vaswani , McGraw Hill, 2017.
3. “Learn SQL with MySQL: Retrieve and Manipulate Data Using SQL Commands with Ease”, AshwinPajankar,
BPB Publications, 2020.
 Course: Calculus
PUSCS205 (Credits : 2 Lectures/Week: 3)
Course Objectives:
● The primary objective of this course is to introduce the basic tools of Calculus which are helpful
in understanding their applications to real world problems.
● The course is designed to have a grasp of important concepts of Calculus in a scientific way.
● It covers topics from as basic as definition of functions to partial derivatives of functions in a
gradual and logical way.
● The learner is expected to solve as many examples as possible to a get complete clarity and
understanding of the topics covered.

Expected Learning Outcomes:

1. Develop mathematical skills and enhance thinking power of learners.
2. Understand mathematical concepts like limit, continuity, derivative, integration of functions,
partial derivatives.
3. Appreciate real world applications which use the learned concepts.
4. Skill to formulate a problem through Mathematical modelling and simulation.

DERIVATIVES AND ITS APPLICATIONS:

Review of Basic Concepts: Functions, limit of a function, continuity of a function, derivative
function. 15 L
Derivative In Graphing And Applications: Increase, Decrease, Concavity, Relative Extreme;
Unit I Graphing Polynomials, Rational Functions, Cusps and Vertical Tangents. Absolute Maxima and
Minima, Applied Maximum and Minimum Problems, Newton’s Method.
INTEGRATION AND ITS APPLICATIONS:
Integration: An Overview of the Area Problem, Indefinite Integral, Definition of Area as a
Limit; Sigma Notation, Definite Integral, Evaluating Definite Integrals by Substitution,
Numerical Integration: Simpson’s Rule.
15 L
Applications of Integration: Area between two curves, Length of a plane curve.
Unit II
Mathematical Modeling with Differential Equations: Modeling with Differential
Equations,Separation of Variables, Slope Fields, Euler’s Method, First-Order Differential
Equations and Applications.

PARTIAL DERIVATIVES AND ITS APPLICATIONS:

Functions of Several Variables: Functions of two or more variables, Limits and Continuity of
functions of two or three variables.
Partial Derivatives: Partial Derivatives, Differentiability, Differentials, and Local Linearity, 15 L
Unit III Chain Rule, Implicit Differentiation, Directional Derivatives and Gradients,
Applications of Partial Derivatives: Tangent Planes and Normal Vectors, Maxima and Minima
of Functions of Two Variables.

Textbooks:
1. Calculus: Early transcendental (10th Edition): Howard Anton, IrlBivens, Stephen Davis, John
Wiley & sons, 2012.
Additional References:
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.

Course: Statistical Methods

PUSCS206 (Credits : 2 Lectures/Week: 3)
Course Objectives:
This course is designed to provide learners with an understanding of the data and to develop an
understanding of the quantitative techniques from Statistics. It also provides the knowledge of different
statistical tools used for primary statistical analysis of data.
Expected Learning Outcomes:
1. To develop the learners ability to deal with different types of data.
2. To enable the use of different measures of central tendency and dispersion wherever relevant.
3. To make learners aware about the techniques to check the Skewness and Kurtosis of data.
4. To make learner enable to find the correlation between different variables and further apply the
regression analysis to find the exact relation between them.
5. To develop the ability to analyze statistical data through R software.
Probability: Random experiment, sample space, events types and operations of events,
Probability definition: classical, axiomatic, Elementary Theorems of probability (without
proof). Conditional probability, ‘Bayes’ theorem, independence, Examples on Probability.
Random Variables: Concept and definition of a discrete random variable and continuous 15 L
Unit I random variable. Probability mass function, Probability density function and cumulative
distribution function of discrete and continuous random variable, Properties of cumulative
distribution function.
Mathematical Expectation and Variance: Expectation of a function, Variance and S.D of a
Unit II random variable, properties. 15 L
Standard Probability distributions: Introduction, properties, examples and applications of
each of the following distributions: Binomial distribution, Normal distribution, Chi-square
distribution, t distribution, F distribution
Hypothesis testing: One sided, Two sided hypothesis, critical region, p value, tests based on
Unit III t, Normal and F, confidence intervals. Analysis of Variance: One-way, two-way analysis of
15 L
variance.
Non-parametric tests: Need of non-parametric tests, Sign test, Wilicoxon’s signed rank test,
run test, Kruskal-Walis tests, Chi square test

Text book:
1. Goon, A. M., Gupta, M. K. and Dasgupta, B. (1983). Fundamentals of Statistics, Vol. 1, Sixth
Revised Edition, The World Press Pvt. Ltd., Calcutta.
2. Gupta, S.C. and Kapoor, V.K. (1987): Fundamentals of Mathematical Statistics, S. Chand and
Sons, New Delhi
Additional References:
1. Sarma, K. V. S. (2001). Statistics Made it Simple: Do it yourself on PC. Prentce Hall of India,
NewDelhi.
2. Agarwal, B. L. (2003). Programmed Statistics, Second Edition, New Age International
Publishers, NewDelhi.
3. Purohit, S. G., Gore S. D., Deshmukh S. R. (2008). Statistics Using R, Narosa Publishing
House, NewDelhi.
4. Schaum’s Outline Of Theory And Problems Of Beginning Statistics, Larry J. Stephens,
Schaum’s Outline Series Mcgraw-Hill
 Course: E-Commerce & Digital Marketing
PUSCS207 (Credits : 2 Lectures/Week: 3)
Course Objectives:
● To understand increasing significance of E-Commerce and its applications in Business and Various Sectors
● To provide an insight on Digital Marketing activities on various Social Media platforms and its emerging
significance in Business
● To understand Latest Trends and Practices in E-Commerce and Digital Marketing, along with its Challenges
and Opportunities for an Organization
Expected Learning Outcomes:
After successful completion of this course, students would be able to
1. Understand the core concepts of E-Commerce.
2. Understand the various online payment techniques
3. Understand the core concepts of digital marketing and the role of digital marketing in business. • Apply
digital marketing strategies to increase sales and growth of business
4. Apply digital marketing through different channels and platforms
5. Understand the significance of Web Analytics and Google Analytics and apply the same.

Introduction to E-Commerce and E- Business: Definition and competing in the digital

economy, Impact of E-Commerce on Business Models, FactorsDriving e-commerce and e-
Business Models, Economics and social impact of e-Business, opportunities and Challenges, e-
Commerce vs m
Commerce, Different e-Commerce Models (B2B, B2C, C2B, C2C, B2E), e-Commerce
Unit I Applications: e-Trading, e-Learning, e-Shopping, Virtual Reality & Consumer Experience,
Legal and Ethical issues in e-Commerce.
Overview of Electronic Payment systems: Types of Electronic payment schemes (Credit 15 L
cards, Debit cards, Smartcards, Internet banking), E checks, E-Cash Concepts and applications
of EDI and Limitation
Introduction & origin of Digital Marketing: Traditional v/s Digital Marketing. Digital
Marketing Strategy, The P-O-E-M Framework, Segmenting & Customizing Messages, The
Digital landscape, Digital Advertising Market in India. Skills required in Digital Marketing.
Digital Marketing Plan.

Introduction to E-mandates: Define e-mandate,advantages of e-mandate,Working of e-

mandates,use of e-mandates in today's digital era.

Social Media Marketing: Meaning, Purpose, types of social media websites, Social Media
Engagement, Target audience, Facebook Marketing: Business through Facebook Marketing,
Creating Advertising Campaigns, Adverts, Facebook Marketing Tools, LinkedIn Marketing:
Importance of LinkedIn Marketing, Framing LinkedIn Strategy, Lead Generation through
LinkedIn, Content Strategy, Analytics and Targeting, Twitter Marketing: Framing content 15 L
Unit II
strategy, Twitter Advertising Campaigns, YouTube Marketing: Video optimization, Promoting
on YouTube, Monetization, YouTube Analytics

Email Marketing: Types of Emails, Mailing List, Email Marketing tools, Email
Deliverability & Email Marketing automation

Mobile Marketing: Introduction, Mobile Usage, Mobile Advertising, Mobile Marketing

Types, Mobile Marketing Features, Mobile Campaign Development, Mobile Advertising
Analytics

Content Marketing: Introduction, Content marketing statistics, Types of Content, Types of

Blog posts, Content Creation, Content optimization, Content Management & Distribution,
 Content Marketing Strategy, Content creation tools and apps, Challenges of Content Marketing.

Search Engine Optimization: Meaning, Common SEO techniques, Understanding Search

Engines, basics of Keyword search, Google rankings, Link Building, Steps to optimize website,
On-page and off-page optimization

Unit III Search Engine Marketing: Introduction to SEM, Introduction to Ad Words - Google Ad
Words, Ad Words fundamentals, Ad Placement, Ad Ranks, Creating Ad Campaigns, Campaign
Report Generation, Display marketing, Buying Models: Cost per Click (CPC), Cost per Milli 15 L
(CPM), Cost per Lead (CPL), Cost per Acquisition (CPA).

Web Analytics: Purpose, History, Goals & objectives, Web Analytic tools & Methods. Web
Analytics Mistakes and Pitfalls.

Google Analytics: Basics of Google Analytics, Installing Google Analytics in website,

Parameters of Google Analytics, Reporting and Analysis

Text book:
1. “E-Commerce Strategy, Technologies and Applications”, Whitley, David, Tata McGraw Hill, 2017
2. Digital Marketing, Seema Gupta, McGraw Hill Education, 2nd Edition

Additional References:
1. E-Commerce by S. Pankaj, A.P.H. Publication, New Delhi
2. Fundamentals of Digital Marketing, Punit Singh Bhatia, Pearson, 2nd Edition
3. “Understanding Digital Marketing: MarketingStrategies for Engaging the Digital Generation”, Damian Ryan,
Calvin Jone. Kogan Page, 4th Edition
 Suggested List of Practical- SEMESTER II

Course: Practical of PUSCS201

PUSCSP201 (Credits : 1 Lectures/Week: 3)
1. Programs on 1-d arrays like - sum of elements of array, searching an element in 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.
2. Programs on 2-d arrays like row-sum, column-sum, sum of diagonal elements, 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 create a list-based stack and perform various stack operations.

4. Program to perform linear search and binary search on list of elements. Compare the
algorithms by calculating time required in milliseconds using readymade libraries.
5 Programs to sort elements of list by using various algorithms: bubble, selection sort, and
insertion sort. Compare the efficiency of algorithms.
6. Programs to select the Nth Max/Min element in a list by using various algorithms. Compare
the efficiency of algorithms.

7. Programs to find a pattern in a given string - general way and brute force technique.
Compare the efficiency of algorithms.

8. Programs on recursion like factorial, fibonacci, tower of hanoi. Compare algorithms to find
factorial/fibonacci using iterative and recursive approaches.
9. Program to implement file merging, coin change problems using Greedy Algorithm and to
understand time complexity.
10. Program to implement merge sort, Straseen’s Matrix Multiplication using D-n-C Algorithm
and to understand time complexity.
11. Program to implement fibonacci series, Longest Common Subsequence using dynamic
programming and to understand time complexity. Compare it with the general recursive
algorithm.
12. Program to implement N-Queen Problem, Binary String generation using Backtracking
Strategy and to understand time complexity.

Course: Practical of PUSCS202

PUSCSP202 (Credits : 1 Lectures/Week: 3)
1. a) Write a Python program to implement various file operations..
b) Working with xml files
2. Write a Python program to demonstrate use of regular expressions for suitable application.
3. Write a Program to demonstrate the concept of threading and multitasking in Python.
4. Write a Python Program to work with databases in Python to perform operations such
as
a. Connecting to database
b. Creating and dropping tables
 c. Inserting and updating into tables

5 Write a Python Program to demonstrate different types of exception handling..

6. Write a GUI Program in Python to design application that demonstrates

a. Different fonts and colors
b. Different Layout Managers
c. Event Handling

7. Write a Python Program to create an application which uses date and time in Python.

8. Write a Python program to create server-client and exchange basic information

9. Write a program to Python program to implement concepts of OOP such as
a. Types of Methods
b. Inheritance
c. Polymorphism
10. Write a program to Python program to implement concepts of OOP such as
a. Abstract methods and classes
b. Interfaces

Course: Practical of PUSCS203

PUSCSP203 (Credits : 1 Lectures/Week: 3)
1 Program to demonstrate use of data members & member functions.

2 Programs based on branching and looping statements using classes.

3 Program to demonstrate one and two dimensional arrays using classes

4 Program to use scope resolution operator. Display the various values of the same variables
declared at different scope levels.
5 Programs to demonstrate various types of constructors and destructors.

6 Programs to demonstrate use of public, protected & private scope specifiers.

7 Programs to demonstrate single and multilevel inheritance.

8 Programs to demonstrate multiple inheritance and hierarchical inheritance.

9 Programs to demonstrate inheritance and derived class constructors.

10 Programs to demonstrate friend function, inline function, this pointer

11 Programs to demonstrate function overloading and overriding.

12 Programs to demonstrate use of pointers.

13 Programs to demonstrate text and binary file handling.

 14 Programs to demonstrate exception handling.

Course: Practical of PUSCS204

PUSCSP204 (Credits : 1 Lectures/Week: 3)
1. Conceptual Designing using ER Diagrams (Identifying entities, attributes, keys and
relationships between entities, cardinalities, generalization, specialization etc.)
2. Perform the following:
• Viewing all databases
• Creating a Database
• Viewing all Tables in a Database
• Creating Tables (With and Without Constraints)
• Inserting/Updating/Deleting Records in a Table
3. Perform the following:
• Altering a Table
• Dropping/Truncating/Renaming Tables
• Backing up / Restoring a Database

4. Perform the following:

• Simple Queries
• Simple Queries with Aggregate functions
5 Queries involving
• Date Functions
• String Functions
• Math Functions
6. Join Queries
• Inner Join
• Outer Join

7. Subqueries
• With IN clause
• With EXISTS clause

8. Converting ER Model to Relational Model and applying Normalization on database.

(Represent entities and relationships in Tabular form, Represent attributes as columns,
identifying keys and normalization up to 3rd Normal Form).
9. Views
• Creating Views (with and without check option)
• Dropping views
• Selecting from a view
10. DCL statements
• Granting and revoking permissions
• Saving (Commit) and Undoing (rollback)
11. Creating Indexes on data tables.
 Course: Practical of PUSCS205
PUSCSP205 (Credits : 1 Lectures/Week: 3)
1. Review of Basic Concepts –
a. Functions of one variable, its domain and range, Operations on functions
b. Limits of functions of one variable
c. Continuity of functions of one variable
d. Derivatives of functions of one variable
2. Applications of Derivatives I –
a. Increasing and Decreasing functions
b. Concavity and inflection points
c. Relative Extrema
d. Absolute Extrema
3. Applications of Derivatives II –
a. Analysis of polynomials
b. Graphing rational functions
c. Graphs With Vertical Tangents And Cusps
d. Newton’s method to find approximate solution of an equation
4. Integration –
a. Finding area using rectangle method and antiderivative method
b. Indefinite and definite integrals
c. Properties of integrals
d. Numerical integration using Simpson’s rule.
5 Applications of Integration –
a. Area between two curves
b. Length of a plane curve.
6. Differential Equations –
a. Solution of a first order first degree differential equation using variable separable method
b. Solution of a first order linear differential equation using integrating factor
c. Numerical solution of first-order equations using Euler’s method
d. Modeling using differential equation

7. Functions of Several Variables –

a. Functions of two or more variables, its domain and range, Operations on functions, level
curves
b. Limits of functions of two or three variables
c. Continuity of functions of two or three variables

8. Partial Derivatives I –
a. Partial derivatives of functions, First and Second order partial derivatives, Mixed
derivative theorem, Higher order partial derivatives
b. Differential for functions of two or three variables
c. Local linear approximation for functions of two or three variables
9. Partial Derivatives II –
a. Chain rule for functions of two or three variables
b. Implicit differentiation
c. Directional derivatives and gradient
 10. Applications of Partial Derivatives–
a. Tangent Planes and Normal Vectors for functions of two or three variables
b. Maxima and Minima of Functions of Two Variables

Course: Practical of PUSCS206

PUSCSP206 (Credits : 1 Lectures/Week: 3)
1. Basics of R-
a. Data input, Arithmetic Operators
b. Vector Operations, Matrix Operations
c. Data Frames, Built-in Functions
d. Frequency Distribution, Grouped Frequency Distribution
e. Diagrams and Graphs
2. Frequency distribution and data presentation-
a. Frequency Distribution (Univariate data/ Bivariate data)
b. Diagrams
c. Graphs
3. Measures of Central Tendency-
a. Arithmetic Mean
b. Median
c. Mode
d. Partition Values
4. Measures dispersion-
a. Range and Coefficient of range
b. Quartile deviation and Coefficient of quartile deviation
c. Standard deviation, Variance and Coefficient of variation (C.V.)
5 Moments-
a. Raw moments
b. Central moments
6. Measures of Skewness -
a. Karl Pearson’s measure of Skewness
b. Bowley’s measure of Skewness
c. Moment coefficient of Skewness

7. Measures of Kurtosis-
a. Moment coefficient of Kurtosis (Absolute measure)
b. Moment coefficient of Kurtosis (Relative measure)

8. Correlation-
a. Karl Pearson’s correlation coefficient
b. Spearman’s Rank correlation
9. Regression-
a. Method of least squares
b. Using regression coefficients
c. Properties of regression lines & regression coefficients
10. Summary Statistics using R-
a. Summary statistics for raw data
b. Summary statistics for grouped frequency distribution
c. Simple Correlation & Regression using R
 Scheme of Examination and Paper Pattern

Evaluation Scheme

I. Internal Exam- 40 Marks

(i) Test–10 Marks
20 marks Test – Duration 40 minutes
It will be conducted either using any open source learning management system such as
Moodle (Modular object-oriented dynamic learning environment) or a test based on an
equivalent online course on the contents of the concerned course (subject) offered by or
build using MOOC (Massive Open Online Course) platform.

(ii) Research Work- 25 marks: Includes research documentation and presentation work.

(iii) Active participation in routine class instructional deliveries – 5 Marks

Overall conduct as a responsible student, manners, skill in articulation, leadership qualities

demonstrated through organizing co-curricular activities, etc.

II. External Examination- 60 Marks

(i) Duration – 2 Hours.

(ii) Theory question paper pattern:

Question Unit No. Based on and Pattern Total Marks

No. (All questions are compulsory)
Q. 1. One Mark Questions (MCQ, Fill in the blanks, Short one 12 Marks
line answer)
(Marks: 12 Questions, 1 Mark per question)
Q. 2. (Unit-I) Attempt any 3 out of 6 12 Marks
(Marks: 4+4+4)
Q. 3. (Unit-II) Attempt any 3 out of 6 12 Marks
(Marks: 4+4+4)
Q. 4. (Unit-III) Attempt any 3 out of 6 12 Marks
(Marks: 4+4+4)
Q. 5. (Unit-I,II and III) Attempt any 3 out of 5 12 Marks
(Marks: 4+4+4)
 -All questions shall be compulsory with internal choice within the questions.
-Each Question may be subdivided into sub questions as a, b, c, d & e, etc & the
allocation of Marks depends on the weightage of the topic.

III. Practical Examination – 300 marks (50 marks x 6 core papers)

-Each core subject carries 50 Marks: 40 marks + 05 marks (journal) + 05marks (viva)
-Minimum 75 % practical from each core subject are required to be completed and written in the
journal.
(Certified Journal is compulsory for appearing at the time of Practical Exam)
A Certified copy journal is essential to appear for the practical examination.

1. Practical Question 1 20 Marks

2. Practical Question 2 20 Marks
3. Journal 05 Marks
4. Viva Voice 05 Marks

OR

1. Practical Question 1 40 Marks

2. Journal 05 Marks
3. Viva Voice 05 Marks

***