OSMANIA UNIVERSITY

HYDERABAD,TELANGANA

Mathematics Course Structure

(B.Sc. Common Core Syllabus for All Universities of Telangana State for the Students
Admitted from the Academic Year 2019-2020 Batch onwards)
Contents
1 B.Sc. Course Structure Template 2
1.1 Differential and Integral Calculus . . . . . . . . . . . . . . . . . . . . . . . . . 4
1.2 Differential Equations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6
1.3 Real Analysis . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8
1.4 Algebra . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9
1.5 Linear Algebra .......................................................................................... 11
1.6 Numerical Analysis ................................................................................... 12
1.7 Integral Transforms ........................................................................................ 13
1.8 Analytical Solid Geometry ........................................................................ 14
1.9 Theory of Equations ................................................................................. 15
1.10 Logic and Sets ........................................................................................... 16
1.11 Number Theory......................................................................................... 17
1.12 Vector Calculus ......................................................................................... 18
1.13 Basic Mathematics .................................................................................... 19
1.14 Mathematics for Economics and Finance ................................................. 20
1.15 Mathematical Modeling ............................................................................ 21

1
1 B.Sc. Course Structure Template

2
 OSMANIA UNIVERSITY, HYDERABAD
B.A/B.Sc. Mathematics Course Structure
(Common Core Syllabus for All Universities of Telangana State for the Students Admitted
from the Academic Year 2019-20 Batch onwards)
Hours/ Hours/per week Max.
Paper Semester Subject per week Theory *Tutorials
Credits
Marks
Differential & Integral
DSC - I I 6 5 1 100 5
Calculus

DSC - II II Differential Equations 6 5 1 100 5

DSC - III III Real Analysis 6 5 1 100 5

DSC - IV IV Algebra 6 5 1 100 5

DSC - V V Linear Algebra 6 5 1 100 5

DSE – VI(A) VI (A) Numerical Analysis 6 5 1 100 5

DSE – VI(B) VI (B) Integral Transforms 6 5 1 100 5
DSE – VI(C) VI (C) Analytical Solid Geometry 6 5 1 100 5
SEC-I III Communication Skills (OR) 2 2 - 50 2
Professional Skills
SEC-II III Theory of Equations (OR) 2 2 - 50 2
Logic & Sets
SEC-III IV Leadership & Management 2 2 - 50 2
Skill (OR)
Universal Human Values
SEC-IV IV Number Theory (OR) 2 2 - 50 2
Vector Calculus
V-A Basic Mathematics
Generic or or
4 4 - 100 4
Elective Mathematics for Economics
V-B
& Finance
Project/
VI** Mathematical Modelling 4 4 - 100 4
Optional

*Tutorials: Problems solving session for each 20 student’s one batch.

**The students are required to opt either the optional paper Mathematical Modeling or Project.
 SEMESTER-I

1.1 Differential and Integral Calculus

(w.e.f. academic year 2019-20)

DSC-1A BS:101

Theory: 5 credits and Tutorials: 0 credits

Theory: 5 hours /week and Tutorials: 1 hours /week
Objective: The course is aimed at exposing the students to some basic notions in differential
calculus.
Outcome: By the time students complete the course they realize wide ranging applications of the
subject.

Unit- I
Partial Differentiation: Introduction - Functions of two variables - Neighborhood of a point
(a, b) - Continuity of a Function of two variables, Continuity at a point - Limit of a Function of
two variables - Partial Derivatives - Geometrical representation of a Function of two Variables -
Homogeneous Functions.

Unit- II
Theorem on Total Differentials - Composite Functions - Differentiation of Composite Functions
- Implicit Functions - Equality of fxy(a, b) and f yz(a, b) - Taylor’s theorem for a function of two
Variables - Maxima and Minima of functions of two variables – Lagrange’s Method of undetermined
multipliers.

Unit- III
Curvature and Evolutes: Introduction - Definition of Curvature - Radius of Curvature - Length
of Arc as a Function, Derivative of arc - Radius of Curvature - Cartesian Equations - Newtonian
Method - Centre of Curvature - Chord of Curvature.
Evolutes: Evolutes and Involutes - Properties of the evolute.
Envelopes: One Parameter Family of Curves - Consider the family of straight lines - Definition -
Determination of Envelope.

Unit- IV
Lengths of Plane Curves: Introduction - Expression for the lengths of curves y = f (x) -
Expressions for the length of arcs x = f (y); x = f (t), y = ϕ(t); r = f (θ)
Volumes and Surfaces of Revolution: Introduction - Expression for the volume obtained by
revolving about either axis - Expression for the volume obtained by revolving about any line -
Area of the surface of the frustum of a cone - Expression for the surface of revolution - Pappus Theorems
- Surface of revolution.

Text:
• Shanti Narayan, P.K. Mittal Differential Calculus, S.CHAND, NEW DELHI
4
• Shanti Narayan Integral Calculus, S.CHAND, NEW DELHI
• References:

• William Anthony Granville, Percey F Smith and William Raymond Longley; Elements of the
differential and integral calculus
• Joseph Edwards , Differential calculus for beginners
• Smith and Minton, Calculus
• Elis Pine, How to Enjoy Calculus
• Hari Kishan, Differential Calculus

5
 SEMESTER-II

1.2 Differential Equations

(w.e.f. academic year 2019-20)

DSC-1B BS:201

Theory: 5 credits and Tutorials: 0 credits

Theory: 5 hours /week and Tutorials: 1 hours /week
Objective: The main aim of this course is to introduce the students to the techniques of solving
differential equations and to train to apply their skills in solving some of the problems of engineering
and science.
Outcome: After learning the course the students will be equipped with the various tools to solve
few types differential equations that arise in several branches of science.

Unit- I
Differential Equations of first order and first degree: Introduction - Equations in which
Variables are Separable - Homogeneous Differential Equations - Differential Equations Reducible to
Homogeneous Form - Linear Differential Equations - Differential Equations Reducible to Linear Form -
Exact differential equations - Integrating Factors - Change in variables - Total Differential Equations -
Simultaneous Total Differential Equations - Equations of the form dx = dy = dz . P Q R

Unit- II
Differential Equations first order but not of first degree: Equations Solvable for p -
Equations Solvable for y - Equations Solvable for x - Equations that do not contain x (or y)-
Equations Homogeneous in x and y - Equations of the First Degree in x and y - Clairaut’s equation.
Applications of First Order Differential Equations : Growth and Decay - Dynamics of
Tumour Growth - Radioactivity and Carbon Dating - Compound Interest - Orthogonal Trajectories
.

Unit- III
Higher order Linear Differential Equations: Solution of homogeneous linear differential
equations with constant coefficients - Solution of non-homogeneous differential equations P (D)y =
Q(x) with constant coefficients by means of polynomial operators when Q(x) = beax, b sin ax/b cos ax, bxk, V eax
- Method of undetermined coefficients.

Unit- IV
Method of variation of parameters - Linear differential equations with non constant coefficients -
The Cauchy - Euler Equation - Legendre’s Linear Equations - Miscellaneous Differential Equations.
Partial Differential Equations: Formation and solution- Equations easily integrable - Linear
equations of first order.

Text:
• Zafar Ahsan,Differential Equations and Their Applications
References

Frank Ayres Jr, Theory and Problems of Differential Equations.

6
• Ford, L.R ; Differential Equations.
• Daniel Murray, Differential Equations.
• S. Balachandra Rao, Differential Equations with Applications and Programs.
• Stuart P Hastings, J Bryce McLead; Classical Methods in Ordinary Differential Equations.

7
 SEMESTER-III

1.3 Real Analysis

(w.e.f. academic year 2020-21)

DSC-1C BS:301

Theory: 5 credits and Tutorials: 0 credits

Theory: 5 hours /week and Tutorials:1hours/week
Objective: The course is aimed at exposing the students to the foundations of analysis which will
be useful in understanding various physical phenomena.
Outcome: After the completion of the course students will be in a position to appreciate beauty
and applicability of the course.

Unit- I
Sequences: Limits of Sequences- A Discussion about Proofs-Limit Theorems for Sequences-
Monotone Sequences and Cauchy Sequences -Subsequences-Lim sup’s and Lim inf’s-Series-Alternating
Series and Integral Tests .

Unit- II
Continuity: Continuous Functions -Properties of Continuous Functions -Uniform Continuity -
Limits of Functions

Unit- III
Differentiation: Basic Properties of the Derivative - The Mean Value Theorem - ∗ L’Hospital Rule - Taylor’s Theorem.

Unit- IV
Integration : The Riemann Integral - Properties of Riemann Integral-Fundamental Theorem of Calculus.

Text:

• Kenneth A Ross,Elementary Analysis-The Theory of Calculus

References:

• S.C. Malik and Savita Arora, Mathematical Analysis, Second Edition, Wiley Eastern Limited, New Age International (P) Limited, New Delhi, 1994.

• William F. Trench, Introduction to Real Analysis

• Lee Larson , Introduction to Real Analysis I

• Shanti Narayan and Mittal, Mathematical Analysis

• Brian S. Thomson, Judith B. Bruckner, Andrew M. Bruckner; Elementary Real analysis

• Sudhir R., Ghorpade, Balmohan V., Limaye; A Course in Calculus and Real Analysis

8
1.4 Algebra
(w.e.f. academic year 2020-21)

DSC-1D BS:401

Theory: 5 credits and Tutorials: 0 credits

Theory: 5 hours /week and
Tutorials: 1 hours /week
Objective: The course is aimed at exposing the students to learn some basic algebraic structures
like groups, rings etc.
Outcome: On successful completion of the course students will be able to recognize algebraic
structures that arise in matrix algebra, linear algebra and will be able to apply the skills learnt in
understanding various such subjects.

Unit- I
Groups: Definition and Examples of Groups- Elementary Properties of Groups-Finite Groups -
Subgroups -Terminology and Notation -Subgroup Tests - Examples of Subgroups.
Cyclic Groups: Properties of Cyclic Groups - Classification of Subgroups Cyclic Groups.

Unit- II
Permutation Groups: Definition and Notation -Cycle Notation-Properties of Permutations -A
Check Digit Scheme Based on D5. Isomorphisms ; Motivation- Definition and Examples -Cayley’s
Theorem Properties of Isomorphisms -Automorphisms-Cosets and Lagrange’s Theorem Properties
of Cosets 138 - Lagrange’s Theorem and Consequences-An Application of Cosets to Permutation
Groups -The Rotation Group of a Cube and a Soccer Ball.

Unit- III
Normal Subgroups and Factor Groups: Normal Subgroups-Factor Groups -Applications of
Factor Groups -Group Homomorphisms - Definition and Examples -Properties of Homomorphisms
-The First Isomorphism Theorem.
Introduction to Rings: Motivation and Definition -Examples of Rings -Properties of Rings -
Subrings.
Integral Domains: Definition and Examples - Fields –Characteristics of a Ring.

Unit- IV
Ideals and Factor Rings: Ideals -Factor Rings -Prime Ideals and Maximal Ideals.
Ring Homomorphisms: Definition and Examples-Properties of Ring- Homomorphisms.

Text:
• Joseph A Gallian, Contemporary Abstract algebra (9th edition)
References:
• Bhattacharya, P.B Jain, S.K.; and Nagpaul, S.R,Basic Abstract Algebra
• Fraleigh, J.B, A First Course in Abstract Algebra.
9
• Herstein, I.N, Topics in Algebra
• Robert B. Ash, Basic Abstract Algebra
• I Martin Isaacs, Finite Group Theory
• Joseph J Rotman, Advanced Modern Algebra

10
 SEMESTER-V

1.5 Linear Algebra

(w.e.f. academic year 2021-22)

DSC-E BS:501

Theory: 5 credits and Tutorials: 0 credits

Theory: 5 hours /week and Tutorials: 1 hours /week

Objective: The students are exposed to various concepts like vector spaces , bases , dimension,
Eigen values etc.
Outcome: After completion this course students appreciate its interdisciplinary nature.

Unit- I
Vector Spaces: Vector Spaces and Subspaces -Null Spaces, Column Spaces, and Linear Transformations
-Linearly Independent Sets; Bases -Coordinate Systems -The Dimension of a Vector Space

Unit- II
Rank-Change of Basis - Eigenvalues and Eigenvectors - The Characteristic Equation

Unit- III
Diagonalization -Eigenvectors and Linear Transformations -Complex Eigenvalues - Applications to
Differential Equations.

Unit- IV
Orthogonality and Least Squares : Inner Product, Length, and Orthogonality -Orthogonal
Sets -Orthogonal Projections - The Gram-Schmidt Process.

Text:
• David C Lay,Linear Algebra and its Applications 4e
References:
• S Lang, Introduction to Linear Algebra
• Gilbert Strang , Linear Algebra and its Applications
• Stephen H. Friedberg, Arnold J. Insel, Lawrence E. Spence; Linear Algebra
• Kuldeep Singh; Linear Algebra
• Sheldon Axler; Linear Algebra Done Right

11
 1.6 Numerical Analysis
(w.e.f. academic year 2021-22)

DSE-1F/A BS:601/A

Theory: 5 credits and Tutorials: 0 credits

Theory: 5 hours /week and Tutorials: 1 hours /week

Objective: Students will be made to understand some methods of numerical analysis.

Outcome: Students realize the importance of the subject in solving some problems of algebra and
calculus.

Unit- I
Errors in Numerical Calculations - Solutions of Equations in One Variable: The Bisection
Method - The Iteration Method - The Method of False Position-Newton’s Method - Muller’s Method
- solution of Systems of Nonlinear Equations.

Unit- II
Interpolation and Polynomial Approximation: Interpolation - Finite Differences - Differences
of Polynomials - Newton’s formula for Interpolation - Gauss’s central differences formulae - Stirling’s
and Bessel’s formula - Lagrange’s Interpolation Polynomial - Divided Differences - Newton’s
General Interpolation formula - Inverse Interpolation.

Unit- III
Curve Fitting: Least Square Curve Fitting: Fitting a Straight Line-Nonlinear Curve Fitting.
Numerical Differentiation and Integration: Numerical Differentiation - Numerical Integration:
Trapezoidal Rule-Simpson’s 1/3rd-Rule and Simpson’s 3/8th-Rule - Boole’s and Weddle’s Rule -
Newton’s Cotes Integration Formulae.

Unit- IV
Numerical Solutions of Ordinary Differential Equations: Taylor’s Series Method - Picard’s
Method - Euler’s Methods - Runge Kutta Methods.

Text:

• S.S.Sastry,Introductory Methods of Numerical Analysis, PHI

References:

• Richard L. Burden and J. Douglas Faires,Numerical Analysis (9e)

• M K Jain, S R K Iyengar and R K Jain, Numerical Methods for Scientific and Engineering computation

• B.Bradie , A Friendly introduction to Numerical Analysis

1.7 Integral Transforms

(w.e.f. academic year 2021-22)

DSE - 1F/B BS:601/B

Theory: 5 credits and Tutorials: 0 credits

Theory: 5 hours /week and Tutorials: 1 hours /week

12
Objective: Students will be exposed to Integral Transforms. The students also learning the
Applications of Laplace Transforms to Differential Equations which arises in Physics and Engineering
Problems.
Outcome: Students apply their knowledge to solve some problems on special functions and
Differential Equations by using the Integral Transforms.

Unit- I
Laplace Transforms-Definition-Existence theorem-Laplace transforms of derivatives and integrals
– Periodic functions and some special functions.

Unit- II
Inverse Transformations - Convolution theorem - Heaviside’s expansion formula.

Unit- III
Applications to ordinary differential equations - solutions of simultaneous ordinary differential
equations - Applications to Partial differential equations.

Unit- IV
Fourier Transforms- Sine and cosine transforms-Inverse Fourier Transforms.

Text:
• Vasishtha and Gupta,Integral Transforms, Krishna Prakashan Media(P), Ltd,Meerut (2e)

13
 1.8 Analytical Solid Geometry
(w.e.f. academic year 2021-22)

DSE - 1F/C BS:601/C

Theory: 5 credits and Tutorials: 0 credits

Theory: 5 hours /week and Tutorials: 1 hours /week

Objective: Students learn to describe some of the surfaces by using analytical geometry.
Outcome: Students understand the beautiful interplay between algebra and geometry.

Unit- I
Sphere: Definition-The Sphere Through Four Given Points-Equations of a Circle- Intersection of
a Sphere and a Line-Equation of a Tangent Plane-Angle of Intersection of Two Spheres-Radical
Plane.

Unit- II
Cones and Cylinders: Definition-Condition that the General Equation of second degree Represents
a Cone-Cone and a Plane through its Vertex -Intersection of a Line with a Cone.

Unit- III
The Right Circular Cone-The Cylinder- The Right Circular Cylinder.

Unit- IV
The Conicoid: The General Equation of the Second Degree-Intersection of Line with a Conicoid-
Plane of contact-Enveloping Cone and Cylinder.

Text:
• Shanti Narayan and P K Mittal,Analytical Solid Geometry (17e)
References:
• Khaleel Ahmed, Analytical Solid Geometry
• S L Loney , Solid Geometry
• Smith and Minton, Calculus

14
Semester –III Sec - 1

15
16
17
Semester –III Sec - 1

18
19
20
21
22
23
 1.9 Theory of Equations
(w.e.f. academic year 2020-21)

SEC-II

Theory: 2 credits
Theory: 2 hours /week

Objective: Students learn the relation between roots and coefficients of a polynomial equation,
Descartes’s rule of signs in finding the number of positive and negative roots if any of a polynomial
equation bsides some other concepts.
Outcome: By using the concepts learnt the students are expected to solve some of the polynomial
equations.

Unit- I
Graphic representation of a polynomial-Maxima and minima values of polynomials-Theorems
relating to the real roots of equations-Existence of a root in the general equation -Imaginary roots-
Theorem determining the number of roots of an equation-Equal roots-Imaginary roots enter
equations in pairs-Descartes’ rule of signs for positive roots- Descartes’ rule of signs for negative
roots.

Unit- II
Relations between the roots and coefficients-Theorem-Applications of the theorem-Depression of
an equation when a relation exists between two of its roots-The cube roots of unity Symmetric
functions of the roots-examples.

Text:
• W.S. Burnside and A.W. Panton,The Theory of Equations
References:
• C. C. Mac Duffee, Theory of Equations
• Hall and Knight , Higher Algebra

24
1.10 Logic and Sets
(w.e.f. academic year 2020-21)

SEC - II

Theory: 4 credits and Tutorials: 0 credits

Theory: 4 hours /week and
Tutorials: 1 hours/week

Objective: Students learn some concepts in set theory and logic.

Outcome: After the completion of the course students appreciate its importance in the development
of computer science.

Unit- I
Basic Connectives and truth tables - Logical equivalence : Laws of Logic - Logical Implication :
Rules Inference : The Use of Quantifiers - Quantifiers, Definitions, and proofs of Theorems.

Unit- II
Sets and Subsets - Set Operations and the Laws of Set Theory - Counting and Venn Diagrams -
A First Word on Probability - The axioms of Probability - Conditional Probability: Independence
- Discrete Random variables .

Text:
• Ralph P Grimaldi,Discrete and Combinatorial Mathematics (5e)
References:
• P R Halmos, Naı̈ve Set Theory
• E Kamke , Theory of Sets

25
Semester – IV Sec- II

26
27
28
29
Semester – IV Sec-II

30
31
32
33
 1.11 Number Theory
(w.e.f. academic year 2020-21)

SEC-IV Theory : 2credits Theory : 2 hours /week

Objective: Students will be exposed to some of the jewels like Fermat’s theorem, Euler’s theorem
in the number theory.
Outcome: Student uses the knowledge acquired solving some divisor problems.

Unit- I
The Goldbach conjecture - Basic properties of congruences- Binary and Decimal Representation of
lntegers - Number Theoretic Functions; The Sum and Number of divisors- The Mobius Inversion
Formula- The Greatest integer function.

Unit- II
Euler’s generalization of Fermat’s Theorem: Euler’s Phi function- Euler’s theorem Some Properties
of the Euler’s Phi function.

Text:
• David M Burton,Elementary Number Theory (7e)
References:
• Thomas Koshy, Elementary Number Theory and its Applications
• Kenneth H Rosen, Elementary Number Theory

34
 1.12 Vector Calculus
(w.e.f. academic year 2020-21)

SEC-IV Theory:2credits
Theory:2hours/week

Objective: Concepts like gradient, divergence, curl and their physical relevance will be taught.
Outcome: Students realize the way vector calculus is used to addresses some of the problems of
physics.

Unit- I
Line Integrals: Introductory Example - Work done against a Force-Evaluation of Line Integrals
Conservative Vector Fields.
Surface Integrals: Introductory Example : Flow Through a PipeEvaluation of Surface Integrals.

Unit- II
Volume Integrals: Evaluation of Volume integrals
Gradient, Divergence and Curl: Partial differentiation and Taylor series-Partial differentiation
Taylor series in more than one variable-Gradient of a scalar field-Gradients, conservative fields and
potentials-Physical applications of the gradient.

Text:
• P.C. Matthews,Vector Calculus
References:
• G.B. Thomas and R.L. Finney, Calculus
• H. Anton, I. Bivens and S. Davis ; Calculus
• Smith and Minton, Calculus

35
S

1.13 Basic Mathematics

Generic Elective - V(A) BS:502(A)

Theory: 4 credits and Tutorials: 0 credits

Theory: 4 hours /week and Tutorials: 1 hours /week

Objective: Students learn the techniques which have been applied successfully to an increasingly
wide variety of complex problems in business. Also learn the scientific approach to managerial
decision making.

Outcome: Student realizes how the quantitative analysis will be an aid to decision-making process.
Also the quantitative analysis how it will be linked with other information in making decisions.

Unit- I
Coordinate Geometry: Fundamentals – Cartesian Coordinates system – Polar Coordinates –
Distance Formula – Section Formula -Centroid of a Triangle – Area of a Triangle.( Chapter 11)

Unit- II
Straight Line: Introduction - Definitions of the Terms - Different Forms of the Equations of a
Straight Line - Distance of a point from a Straight Line - Angle between two Lines and Condition
of Parallelism and Perpendicularity of Lines - Point of intersection of Two Lines – Condition
of Concurrency of Three Given Straight Lines - Position of a Point with respect to a given
Line.(Chapter 13)

Unit- III
Matrices: Introduction - Definitions and Notations - Operations on Matrices - Determinant of
a Square Matrix - Non Singular matrix and Singular Matrix - Sarrus Diagram for Expansion of
Determinant of a matrix 3X3 - Properties of Determinants.(15.1,15.2,15.3,15.5.1,15.5.2,15.5.3 of
Chapter 15)

Unit- IV
Linear System of Equations: Conversion of a business problem into a Linear System of
Equations – Rank of a Matrix – Application of Rank concept – Minor and Cofactor – Adjoint of a
Square matrix -Inverse of a Square Matrix – Matrix Equation – Methods to Solve Linear System of
Equations – Solution to the linear system of Equations – Types of Solutions - Cramer”s rule - Matrix
Inversion method. (15.4,15.5.4,15.5.5,15.5.6,15.5.7,15.5.8,15.6,15.7.1,15.7.2,15.7.3,15.7.4,15.7.4 of
Chapter 15).

Text:
• P. Mariappan , Business Mathematics,Pearson Publication 2015, New Delhi.

36
S

1.14 Mathematics for Economics and Finance

Generic Elective - V(B) BS:502(B)

Theory: 4 credits and Tutorials: 0 credits

Theory: 4 hours /week and Tutorials: 1 hours /week
Objective: Many models and problems in modern economics and finance can be expressed using
the language of mathematics and analysed using mathematical techniques. The aim is to show
how a range of important mathematical techniques work and how they can be used to explore and
understand the structure of economic models.

Outcome: Student were chiefly interested in learning the mathematics that had applications
to economics and finance. Students gain a familiarity with economics and finance principles and
are confident in applying them.

Unit- I
Linear Equations: Introduction – Solution of Linear Equations – Solutions of Simultaneous
Linear Equations – Graphs of Linear Equations – Budget Lines – Supply and Demand Analysis .
Quadratic Equations: Introduction – Graphys of Quadratic Functions – Quadratic Equations -
Applications to Economics.

Unit- II
Functions of a Single Variable: Introduction – Limitis – Polynomial Functions – Reciprocal
Functions – Inverse Functions. The Exponential and Logarithmic Functions: Introduction
– Exponential Functions – Logarithmic Functions – Returns to Scale of Production Functions –
Compounding of Interest.

Unit- III
Matrices and Determinants: Introduction – Matrix Operations – Solutions of Linear Systems
of Equations – Cramer’s Rule – More Determinants – Special Cases.

Unit-IV
Linear Difference Equations: Introduction – Difference Equations – First Order Linear Difference
Equations.

Text:
• Vassilis. C. Mavron and Timothy N.Phillips, Elements of Mathematics for Economics and
Finance; Springer Publishers.

37
S

1.15 Mathematical Modeling

Project/ Optional - VI BS:602

Theory: 4 credits and Tutorials: 0 credits

Theory: 4 hours /week and Tutorials: 1 hours /week
Objective: This topic is aims to provide the student with some basic modelling skills that will
have application to a wide variety of problems.
Outcome:The focus is on those mathematical techniques that are applicable to models involving
differential equations, and which describe rates of change. Student realizes some beautiful problems
can be modeled by using differential equations. The students also learn how to use the mathematical
technique in solving differential equations.

Unit- I
Introduction to Mathematical Modelling: Mathematical Models-Modelling for decision making.
Compartmental Models:-Exponential decay and radioactivity – Case Study: Detecting art
forgeries – Lake Pollution Models - First order Linear Differential Equations – Equilibrium points
and stability.

Unit- II
Models of Single Populations: Exponential growth – Density-dependent growth – Limited
growth with harvesting. Interacting Population Models: Model for an influenza outbreak –
Case Study: Cholera – Predators and prey – Competing Species.

Unit- III
Formulating Heat and Mass Transporot Models: Some basic physical laws -Model for a hot
water heater- Heat conduction and Fourier’s Law - Heat conduction through a wall – Radiative
heat conoduction - Diffusion.

Unit- IV
Boundary Value Problems – Heat loss through a wall – Insulating a water pipe – Introduction to
Partial Differential Equations: The heat conduction equation – Oscillating soil temperatures
– Case study: Detecting Land Mines – Lake Pollution.

Text:
• 1. B.Barnes and G.R.Fulford, Mathematical Modelling with Case Studies 3rd Edition, 2009,
CRC press.
References:

• 1. Shepley L. Ross, “Differential Equations”.

• 2. I. Sneddon , Elements of Partial Differential Equations
• 3.Zafar Ahsan, “Differential Equations and their Applications”

38
Few Websites
• NPTEL: nptel.ac.in
• COURSERA: www.coursera.org
• MITOCW: ocw.mit.edu
• ACADEMIC EARTH: www.academicearth.org
• EdX : www.edx.org
• KHAN ACADEMY :www.khanacademy.org
• ALISON: www.alison.com
• STANFORD ONLINE: www.online.stanford.edu
• VIDEO LECTURES: videolectures.net
• INTERACTIVE REAL ANALYSIS: mathcs.org
• VISUAL CALCULUS: archives.math.utk.edu/visual.calculus
• MOOCS CALCULUS: mooculus.osu.edu

Few Math Softwares

• Useful for Classroom teaching: Geogebra (Freeware)
• Type setting software:LaTeX
• High end commercial softwares: Mathematica , Maple , Matlab
• Answering search engine: www.wolframalpha.com
• Group theory software: group explorer 2.2 (Freeware)
• Visualization software: Mathematics Visualization Toolkit (freeware)

39
 OSMANIA UNIVERSITY
FACULTY OF SCIENCE
B.Sc. (Computer Science)
CBCS Pattern with Effect from the Academic Year 2019-2020
Structure of Curriculum
Course Title Hours/Week Credits
Theory Practical
Semester –I
Programming in C 4 3 4+1 = 5
Semester –II
Programming in C++ 4 3 4+1 = 5
Semester –III
Data Structures using C++ 4 3 4+1 = 5
Semester –IV
Data Base Management 4 3 4+1 = 5
Systems (DBMS)
Semester –V
Programming in Java 4 3 4+1 = 5
Semester –VI
Web Technologies 4 3 4+1 = 5

AECC
Hours/Week Credits
Theory
Fundamentals of Computers 2 2
SEC
Semester –III
Communication Skills(or) 2 2
Professional Skills (Sec –I)
Python –I (Sec –II) 2 2
Semester –IV
Leadership & Management 2 2
Skill (or) (Sec –III)
Universal Human Values
Python –II (Sec –IV) 2 2
Generic Elective (GE)

Information Technologies 4 4
Project/Optional
Semester –VI
PHP with MY SQL Theory Practical 3+1=4
3 3
 Prof.G.Kamala
Chairperson Board of Studies in Computer Science, OU
 OSMANIA UNIVERSITY
FACULTY OF SCIENCE
B.Sc. (Computer Science)
SEMESTER – I
Programming in C
Theory 4 Hours/Week 4 Credit Internal marks = 20
Practical 3 Hours/Week 1 Credit External Marks = 80
Unit – I
Computer Fundamentals: Introduction of Computers, Classification of Computers, Anatomy
of a Computer, Memory Hierarchy, Introduction to OS, Operational Overview of a CPU.
Program Fundamentals: Generation and Classification of Programming Languages,
Compiling, Interpreting, Loading, Linking of a Program, Developing Program, Software
Development.
Algorithms: Definitions, Different Ways of Stating Algorithms (Step-form, Pseudo-code,
Flowchart), Strategy for Designing Algorithms, Structured Programming Concept.
Basics of C: Overview of C, Developing Programs in C, Parts of Simple C Program, Structure
of a C Program, Comments, Program Statements, C Tokens, Keywords, Identifiers, Data
Types, Variables, Constants, Operators and Expressions, Expression Evaluation–precedence
and associativity, Type Conversions.

Unit – II
Input-Output: Non-formatted and Formatted Input and Output Functions, Escape Sequences,
Control Statements: Selection Statements – if, if-else, nested if, nested if-else, comma operator,
conditional operator, switch; Iterative Statements–while, for, do-while; Special Control
Statement–goto, break, continue, return, exit.
Arrays and Strings: One-dimensional Arrays, Character Arrays, Functions from ctype.h,
string.h, Multidimensional Arrays.

Unit – III
Functions: Concept of Function, Using Functions, Call-by-Value Vs Call-by-reference,
Passing Arrays to Functions, Score of Variables, Storage Classes, Inline Functions, and
Recursion.
Pointers: Introduction, Address of Operator (&), Pointer, Uses of Pointers, Arrays and Pointers,
Pointers and Strings, Pointers to Pointers, Array of Pointers, Pointer to Array, Dynamic
Memory Allocation.

Unit – IV
User-defined Data Types: Declaring a Structure (Union) and its members, Initialization
Structure (Union), Accessing members of a Structure (Union), Array of Structures (Union),
Structures verses Unions, Enumeration Types.
Files: Introduction, Using Files in C, Working with Text Files, Working with Binary Files,
Files of Records, Random Access to Files of Records, Other File Management Functions.

Textbook: Pradip Dey, Manas Ghosh, Computer Fundamentals and Programming in C (2e)
References:
1. Ivor Horton, Beginning C
2. Ashok Kamthane, Programming in C
3. Herbert Schildt, The Complete Reference C
4. Paul Deitel, Harvey Deitel, C How to Program
5. Byron S. Gottfried, Theory and Problems of Programming with C
6. Brian W. Kernighan, Dennis M. Ritchie, The C Programming Language
7. B. A. Forouzan, R. F. Gilberg, A Structured Programming Approach Using C
 OSMANIA UNIVERSITY
FACULTY OF SCIENCE
B.Sc. (Computer Science)
SEMESTER – I
Programming in C Lab
Practical 3 Hours/Week 1 Credit Marks: 25

Note:
• Programs of all the Concepts from Text Book including exercises must be practice and
execute.
• Faculty must take care about UG Standard Programs.
• In the external lab examination student has to execute two programs with compilation
and deployment steps are necessary. Write the Pseudo Code and draw Flow Chart for
the programs.
• Recommended to use Open Source Software: GCC on Linux; DevC++ (or) CodeBlocks
on Windows10.
• External Vice-Voce is compulsory.

1. Write a program to find the largest two (three) numbers using if and conditional
operator.
2. Write a program to print the reverse of a given number.
3. Write a program to print the prime number from 2 to n where n is given by user.
4. Write a program to find the roots of a quadratic equation using switch statement.
5. Write a program to print a triangle of stars as follows (take number of lines from user):
*
* * *
* * * * *
* * * * * **
6. Write a program to find largest and smallest elements in a given list of numbers.
7. Write a program to find the product of two matrices.
8. Write a program to find the GCD of two numbers using iteration and recursion.
9. Write a program to illustrate the use of storage classes.
10. Write a program to demonstrate the call by value and the call by reference concepts.
11. Write a program that prints a table indicating the number of occurrences of each
alphabet in the text entered as command line arguments.
12. Write a program to illustrate use of data type enum.
13. Write a program to demonstrate use of string functions string.h header file.
14. Write a program that opens a file and counts the number of characters in a file.
15. Write a program to create a structure Student containing fields for Roll No., Name,
Class, Year and Total Marks. Create 10 students and store them in a file.
16. Write a program that opens an existing text file and copies it to a new text file with all
lowercase letters changed to capital letters and all other characters unchanged.
 OSMANIA UNIVERSITY
FACULTY OF SCIENCE
B.Sc. (Computer Science)
SEMESTER – II
Programming in C++
Theory 4 Hours/Week 4 Credit Internal marks = 20
Practical 3 Hours/Week 1 Credit External Marks = 80
Unit – I
Introduction to C++: Applications, Example Programs, Tokens, Data Types, Operators,
Expressions, Control Structures, Arrays, Strings, Pointers, Searching and Sorting Arrays.
Functions: Introduction, Prototype, Passing Data by Value, Reference Variables, Using
Reference Variables as Parameters, Inline Functions, Default Arguments, Overloading
Functions, Passing Arrays to Functions.
Object Oriented Programming: Procedural and Object-Oriented Programming, Terminology,
Benefits, OOP Languages, and OOP Applications.
Unit – II
Classes: Introduction, Defining an Instance of a Class, Why Have Private Members?
Separating Class Specification from Implementation, Inline Member Functions, Constructors,
Passing Arguments to Constructors, Destructors, Overloading Constructors, Private Member
Functions, Arrays of Objects, Instance and Static Members, Friends of Classes, Member-wise
Assignment, Copy Constructors, Operator Overloading, Object Conversion, Aggregation.
Unit – III
Inheritance: Introduction, Protected Members and Class Access, Base Class Access
Specification, Constructors and Destructors in Base and Derived Classes, Class Hierarchies,
Polymorphism-Function Overloading, Function Overriding and Virtual Member Functions,
Abstract Base Classes and Pure Virtual Functions, Multiple Inheritance.
C++ Streams: Stream Classes, Unformatted I/O Operations, Formatted I/O Operations.
Unit – IV
Exceptions: Introduction, Throwing an Exception, Handling an Exception, Object-Oriented
Exception Handling with Classes, Multiple Exceptions, Extracting Data from the Exception
Class, Re-throwing an Exception.
Templates: Function Templates–Introduction, Function Templates with Multiple Type,
Overloading with Function Templates, Class Templates – Introduction, Defining Objects of
the Class Template, Class Templates and Inheritance, , Introduction to the STL.
Textbook: Tony Gaddis, Starting out with C++: from control structures through objects (7e)
References:
1. B. Lippman, C++ Primer
2. Bruce Eckel, Thinking in C++
3. K.R. Venugopal, Mastering C++
4. Herbert Schildt, C++: The Complete Reference
5. Bjarne Stroustrup, The C++ Programming Language
6. Sourav Sahay, Object Oriented Programming with C++TEXT BOOK:
7. Object Oriented Programming with C++ Sixth edition, E.Balaguruswamy.
8. A Structured Approach Using C++ By B.A.Forouzan & Rf Gilberg (Thomson Business
Information India)
9. Herbert Schilbt, C++ - The Complete Reference, TMH 2002
10. J.P. Cohoon and J.W. Davidson, C++ program design – An Introduction To
Programming and Object Oriented Design.- MGH 1999.
 OSMANIA UNIVERSITY
FACULTY OF SCIENCE
B.Sc. (Computer Science)
SEMESTER – II
Programming in C++ Lab
Practical 3 Hours/Week 1 Credit Marks: 25

Note:
• Programs of all the Concepts from Text Book including exercises must be practice and
execute.
• Faculty must take care about UG Standard Programs.
• In the external lab examination student has to execute two programs with compilation and
deployment steps are necessary. Write the Pseudo Code and draw Flow Chart for the
programs.
• Recommended to use Open Source Software: GCC on Linux; DevC++ (or) CodeBlocks on
Windows10.
• External Vice-Voce is compulsory.

1. Write a program to.

a. Print the sum of digits of a given number.
b. Check whether the given number is Armstrong or not
c. Print the prime number from 2 to n where n is natural number given.
2. Write a program to find largest and smallest elements in a given list of numbers and sort the
given list.
3. Write a program to read the student name, roll no, marks and display the same using class and
object.
4. Write a program to implement the dynamic memory allocation and de-allocation using new and
delete operators using class and object.
5. Write a program to find area of a rectangle, circle, and square using constructors.
6. Write a program to implement copy constructor.
7. Write a program using friend functions and friend class.
8. Write a program to implement constructors
a. Default Constructor, Parameterized Constructor, Copy Constructor
b. Define the constructor inside/outside of the class
c. Implement all three constructors within a single class as well as use multiple classes(
individual classes)
9. Write a program to implement the following concepts using class and object
a. Function overloading
b. Operator overloading (unary/binary(+ and -))
10. Write a program to demonstrate single inheritance, multilevel inheritance and multiple
inheritances.
11. Write a program to implement the overloaded constructors in inheritance.
12. Write a program to implement the polymorphism and the following concepts using class and
object.
a. Virtual functions
b. Pure virtual functions
13. Write a program to implement the virtual concepts for following concepts
a. Constructor (not applied)
b. Destructor (applied)
14. Write a program to demonstrate static polymorphism using method overloading.
15. Write a program to demonstrate dynamic polymorphism using method overriding and dynamic
method dispatch.
16. Write a program to implement the template (generic) concepts
a. Without template class and object
 b. With template class and object

OSMANIA UNIVERSITY
FACULTY OF SCIENCE
B.Sc. (Computer Science)
SEMESTER – III
Data Structures using C++
Theory 4 Hours/Week 4 Credit Internal marks = 20
Practical 3 Hours/Week 1 Credit External Marks = 80
Unit - I
Basic data Structure: Introduction to Data Structures, Types of Data Structures, and
Introduction to Algorithms, Pseudo code, and Relationship among data, data structures,
and algorithms, Implementation of data structures, Analysis of Algorithms.
Stacks: Concept of Stacks and Queues, Stacks, Stack Abstract Data Type, Representation of
Stacks Using Sequential Organization (Arrays), Multiple Stacks, Applications of Stack,
Expression Evaluation and Conversion, Polish notation and expression conversion, Processing
of Function Calls, Reversing a String with a Stack, Recursion.

Unit - II
Recursion: Introduction, Recurrence, Use of Stack in Recursion, Variants of Recursion,
Recursive Functions, Iteration versus Recursion.
Queues: Concept of Queues, Queue as Abstract Data Type, Realization of Queues Using
Arrays, Circular Queue, Multi-queues, Dequeue, Priority Queue, Applications of Queues,
Linked Lists: Introduction, Linked List, Linked List Abstract Data Type, Linked List Variants,
Doubly Linked List, Circular Linked List, Representation of Sparse Matrix Using Linked List,
Linked Stack, Linked Queue.

Unit - III
Trees: Introduction, Types of Trees, Binary Tree, Binary Tree Abstract Data Type, Realization
of a Binary Tree, Insertion of a Node in Binary Tree, Binary Tree Traversal, Other Tree
Operations, Binary Search Tree, Threaded Binary Tree, Applications of Binary Trees.
Searching and Sorting: Search Techniques-Linear Search, Binary Search, Sorting Techniques-
Selection Sort, Bubble Sort, Insertion Sort, Merge Sort, Quick Sort, Comparison of All Sorting
Methods, Search Trees: Symbol Table, Optimal Binary Search Tree, AVL Tree (Height-
balanced Tree).

Unit - IV
Graphs: Introduction, Representation of Graphs, Graph Traversal – Depth First Search, Breadth
First Search, Spanning Tree, Prim’s Algorithm, Kruskal’s Algorithm.
Hashing: Introduction, Key Terms and Issues, Hash Functions, Collision Resolution Strategies,
Hash Table Overflow, Extendible Hashing
Heaps: Basic Concepts, Implementation of Heap, Heap as Abstract Data Type, Heap Sort,
Heap
Applications.

Text books:
1. Varsha H. Patil “Data structures using C++” Oxford University press, 2012
 2. M.T. Goodrich, R. Tamassia and D. Mount, Data Structures and Algorithms in C++,
John Wiley and Sons, Inc., 2011.

References:

1. Adam Drozdek “Data structures and algorithm in C++” Second edition, 2001
2. T.H. Cormen, C.E. Leiserson, R.L. Rivest and C. Stein, Introduction to Algorithms,
2nd Ed., Prentice-Hall of India, 2006.
3. Robert L. Kruse and A.J. Ryba, Data Structures and Program Design in C++, Prentice
Hall, Inc., NJ, 1998.
4. B. Stroupstrup, The C++ Programming Language, Addison Wesley, 2004
5. D.E. Knuth, Fundamental Algorithms (Vol. I), Addison Wesley, 1997
 OSMANIA UNIVERSITY
FACULTY OF SCIENCE
B.Sc. (Computer Science)
SEMESTER – III
Data Structures using C++ Lab
Practical 3 Hours/Week 1 Credit Marks: 25

Note:
• Programs of all the Concepts from Text Book including exercises must be practice and
execute.
• In the external lab examination student has to execute two programs with compilation and
deployment steps are necessary.
• External Vice-Voce is compulsory.
1. Write C++ programs to implement the following using an array
a) Stack ADT b) Queue ADT
2. Write a C++ program to implement Circular queue using array.
3. Write C++ programs to implement the following using a single linked list.
a) Stack ADT b) Queue ADT
4. Write a C++ program to implement Circular queue using Single linked list.
5. Write a C++ program to implement the double ended queue ADT using double linked list.
6. Write a C++ program to solve tower of Hanoi problem recursively
7. Write C++ program to perform the following operations:
a) Insert an element into a binary search tree.
b) Delete an element from binary search tree.
c) Search for a key in a binary search tree.
8. Write C++ programs for the implementation tree traversal technique BFS.
9. Write a C++ program that uses recursive functions to traverse a binary search tree.
a) Pre-order b) In-order c) Post-order
10. Write a C++ program to find height of a tree.
11 Write a C++ program to find MIN and MAX element of a BST.
12 Write a C++ program to find Inorder Successor of a given node.
13. Write C++ programs to perform the following operations on B-Trees and AVL Trees.
a) Insertion b) Deletion
14 Write C++ programs for sorting a given list of elements in ascending order using the following
sorting methods.
a) Quick sort b) Merge sort
15. Write a C++ program to find optimal ordering of matrix multiplication.
16. Write a C++ program that uses dynamic programming algorithm to solve the optimal binary
search tree problem
17. Write a C++ program to implement Hash Table
18. Write C++ programs to perform the following on Heap
a) Build Heap b) Insertion c) Deletion
19. Write C++ programs to perform following operations on Skip List
a) Insertion b) Deletion
20. Write a C++ Program to Create a Graph using Adjacency Matrix Representation.
21. Write a C++ program to implement graph traversal techniques
a) BFS b) DFS
22. Write a C++ program to Heap sort using tree structure.
 OSMANIA UNIVERSITY
FACULTY OF SCIENCE
B.Sc. (Computer Science)
SEMESTER – IV
Data Base Management Systems
Theory 4 Hours/Week 4 Credit Internal marks = 20
Practical 3 Hours/Week 1 Credit External Marks = 80
Unit - I
Introduction: Database-System Applications, Purpose of Database Systems, View of Data,
Database Languages, Relational Databases, Database Design, Data Storage and Querying,
Transaction Management, Database Architecture, Database Users and Administrators.
Introduction to the Relational Model: Structure of Relational Databases, Database
Schema, Keys, Schema Diagrams, Relational Query Languages, Relational Operations.

Unit - II
Database Design and the E-R Model: Overview of the Design Process, The Entity-
Relationship Model, Constraints, Removing Redundant Attributes in Entity Sets, Entity-
Relationship Diagrams, Reduction to Relational Schemas, Entity-Relationship Design Issues,
Extended E-R Features, Alternative Notations for Modeling Data, Other Aspects of Database
Design.
Relational Database Design: Features of Good Relational Designs, Atomic Domains and First
Normal Form, Decomposition Using Functional Dependencies, Functional- Dependency
Theory, Decomposition Using Multivalued Dependencies, Normal Forms-2 NF, 3 NF, BCNF,
The Database Design Methodology for Relational Databases.

Unit - III
Introduction to SQL: Overview of the SQL Query Language, SQL Data Definition, Basic
Structure of SQL Queries, Additional Basic Operations, Set Operations, Null Values,
Aggregate Functions, Nested Subqueries, Modification of the Database.
Intermediate SQL: Join Expressions, Views, Transactions, Integrity Constraints, SQL Data
Types and Schemas, Authorization.
Advanced SQL: Accessing SQL from a Programming Language, Functions and Procedures,
Triggers, Recursive Queries.

Unit - IV
Transaction Management: Transaction Support–Properties of Transactions, Database
Architecture, Concurrency Control–The Need for Concurrency Control, Serializability and
Recoverability, Locking Methods, Deadlock, Time Stamping Methods, Multi-version
Timestamp Ordering, Optimistic Techniques, Granularity of Data Items, Database Recovery–
The Need for Recovery, Transactions and Recovery, Recovery Facilities, Recovery
Techniques, Nested Transaction Model. Security: Database Security–Threats, Computer-
Based Controls–Authorization, Access Controls, Views, Backup and Recovery, Integrity,
Encryption, RAID.

Text book:
1. Silberschatz, H. Korth and S. Sudarshan, Database System Concepts, 6th Ed., Tata
McGraw Hill, 2011
2. Thomas M. Connolly, Carolyn E. Begg, Database Systems–A Practical Approach to
Design, Implementation, and Management (6e)
 OSMANIA UNIVERSITY
FACULTY OF SCIENCE
B.Sc. (Computer Science)
SEMESTER – IV
Data Base Management Systems Lab
Practical 3 Hours/Week 1 Credit Marks: 25

Note:
• Programs of all the Concepts from Text Book including exercises must be practice and
execute.
• In the external lab examination student has to execute two programs with compilation and
deployment steps are necessary.
• External Vice-Voce is compulsory.

1. Create a database having two tables with the specified fields, to computerize a
library system of a University College.
LibraryBooks (Accession number, Title, Author, Department, PurchaseDate, Price),
IssuedBooks (Accession number, Borrower)

a) Identify primary and foreign keys. Create the tables and insert at least
5 records in each table.
b) Delete the record of book titled “Database System Concepts”.
c) Change the Department of the book titled “Discrete Maths” to “CS”.
d) List all books that belong to “CS” department.
e) List all books that belong to “CS” department and are written by author
“Navathe”.
f) List all computer (Department=”CS”) that have been issued.
g) List all books which have a price less than 500 or purchased between
“01/01/1999” and “01/01/2004”.

2. Create a database having three tables to store the details of students of Computer
Department in your college.
Personal information about Student (College roll number, Name of student, Date of
birth, Address, Marks(rounded off to whole number) in percentage at 10 + 2, Phone
number)
Paper Details (Paper code, Name of the Paper)
Student’s Academic and Attendance details (College roll number, Paper
Code, Attendance, Marks in home examination).

a) Identify primary and foreign keys. Create the tables and insert at least 5
records in each table.
b) Design a query that will return the records (from the second table) along with
the name of student from the first table, related to students who have more
than 75% attendance and more than 60% marks in paper2.
c) List all students who live in “Warangal” and have marks greater than 60 in
paper1.
d) Find the total attendance and total marks obtained by each student.
e) List the name of student who has got the highest marks in paper2.
3. Create the following tables and answer the queries given below:
Customer (CustID, email, Name, Phone, ReferrerID)
Bicycle (BicycleID, DatePurchased, Color, CustID, ModelNo)
BicycleModel(ModelNo, Manufacturer, Style)
Service (StartDate, BicycleID, EndDate)

a) Identify primary and foreign keys. Create the tables and insert at least 5
records in each table.
b) List all the customers who have the bicycles manufactured by manufacturer
“Honda”.
c) List the bicycles purchased by the customers who have been referred by
Customer “C1”.
d) List the manufacturer of red colored bicycles.
e) List the models of the bicycles given for service.

4. Create the following tables, enter at least 5 records in each table and answer the queries
given below.
Employee (Person_Name, Street, City )
Works (Person_Name, Company_Name, Salary)
Company (Company_Name, City )
Manages (Person_Name, Manager_Name )

a) Identify primary and foreign keys.

b) Alter table employee, add a column “email” of type varchar(20).
c) Find the name of all managers who work for both Samba Bank and NCB
Bank.
d) Find the names, street address and cities of residence and salary of all
employees who work for “Samba Bank” and earn more than $10,000.
e) Find the names of all employees who live in the same city as the company
for which they work.
f) Find the highest salary, lowest salary and average salary paid by each
company.
g) Find the sum of salary and number of employees in each company.
h) Find the name of the company that pays highest salary.

5. Create the following tables, enter at least 5 records in each table and answer the queries
given below.
Suppliers (SNo, Sname, Status, SCity)
Parts (PNo, Pname, Colour, Weight, City)
Project (JNo, Jname,Jcity)
Shipment (Sno, Pno, Jno, Qunatity)

a) Identify primary and foreign keys.

b) Get supplier numbers for suppliers in Paris with status>20.
c) Get suppliers details for suppliers who supply part P2. Display the supplier list in
increasing order of supplier numbers.
d) Get suppliers names for suppliers who do not supply part P2.
 e) For each shipment get full shipment details, including total shipment weights.
f) Get all the shipments where the quantity is in the range 300 to 750 inclusive.
g) Get part nos. for parts that either weigh more than 16 pounds or are supplied by
suppliers S2, or both.
h) Get the names of cities that store more than five red parts.
i) Get full details of parts supplied by a supplier in Hyderabad.

j) Get part numbers for part supplied by a supplier in Warangal to a project in

Chennai.
k) Get the total number of project supplied by a supplier (say, S1).
l) Get the total quantity of a part (say, P1) supplied by a supplier (say, S1).

6. Write a PL/SQL Program to demonstrate Procedure.

7. Write a PL/SQL Program to demonstrate Function.
8. Write a PL/SQL program to Handle Exceptions.
9. Write a PL/SQL Program to perform a set of DML Operations.
10. Create a View using PL/SQL program.
11. Write a PL/SQL Program on Statement Level Trigger.
12. Write a PL/SQL Program on Row Level Trigger.
 OSMANIA UNIVERSITY
FACULTY OF SCIENCE
B.Sc. (Computer Science)
SEMESTER – V
Programming in Java
Theory 4 Hours/Week 4 Credit Internal marks = 20
Practical 3 Hours/Week 1 Credit External Marks = 80
Unit - I
Introduction: Java Essentials, JVM, Java Features, Creation and Execution of Programs, Data
Types, Structure of Java Program, Type Casting, Conditional Statements, Loops, Classes,
Objects, Class Declaration, Creating Objects.

Unit - II
Method Declaration and Invocation, Method Overloading, Constructors – Parameterized
Constructors, Constructor Overloading, Cleaning-up unused Objects. Class Variables
&Method-static Keyword, this Keyword, One-Dimensional Arrays, Two-Dimensional Arrays,
Command-Line Arguments, Inner Class.
Inheritance: Introduction, Types of Inheritance, extends Keyword, Examples, Method
Overriding, super, final Keyword, Abstract classes, Interfaces, Abstract Classes Verses
Interfaces.
Packages: Creating and Using Packages, Access Protection, Wrapper Classes, String Class,
StringBuffer Class.

Unit - III
Exception: Introduction, Types, Exception Handling Techniques, User-Defined Exception.
Multithreading: Introduction, Main Thread and Creation of New Threads –By Inheriting the
Thread Class or Implementing the Runnable Interface, Thread Lifecycle, Thread Priority and
Synchronization.
Input/Output: Introduction, java.io Package, File Streams, FileInputStream Class,
FileOutputStream Class, Scanner Class, BufferedInputStream Class, BufferedOutputStream
Class, RandomAccessFile Class.

Unit - IV
Applets: Introduction, Example, Life Cycle, Applet Class, Common Methods Used in
Displaying the Output (Graphics Class).
Event Handling: Introduction, Types of Events, Example.
AWT: Introduction, Components, Containers, Button, Label, Checkbox, Radio Buttons,
Container Class, Layouts.
Swings: Introduction, Differences between Swing and AWT, JFrame, JApplet, JPanel,
Components in Swings, Layout Managers, JTable.

Text Book:
1. Sachin Malhotra, Saurabh Choudhary, Programming in Java (2e)
References:
1. Bruce Eckel, Thinking in Java (4e)
2. Herbert Schildt, Java: The Complete Reference (9e)
3. Y. Daniel Liang, Introduction to Java Programming (10e)
4. Paul Deitel, Harvey Deitel, Java: How To Program (10e)
5. Cay S. Horsttnann, Core Java Volume I –Fundamentals (10e)
 OSMANIA UNIVERSITY
FACULTY OF SCIENCE
B.Sc. (Computer Science)
SEMESTER – V
Programming in Java Lab
Practical 3 Hours/Week 1 Credit Marks: 25

Note:
• Programs of all the Concepts from Text Book including exercises must be practice and
execute.
• In the external lab examination student has to execute two programs with compilation and
deployment steps are necessary.
• External Vice-Voce is compulsory.

1. Write a program to find the largest of n natural numbers.

2. Write a program to find whether a given number is prime or not.
3. Write a menu driven program for following:
a. Display a Fibonacci series
b. Compute Factorial of a number
4. Write a program to check whether a given number is odd or even.
5. Write a program to check whether a given string is palindrome or not.
6. Write a program to print the sum and product of digits of an Integer and reverse the
Integer.
7. Write a program to create an array of 10 integers. Accept values from the user in that
Array. Input another number from the user and find out how many numbers are equal
to the number passed, how many are greater and how many are less than the number
passed.
8. Write a program that will prompt the user for a list of 5 prices. Compute the average of
the prices and find out all the prices that are higher than the calculated average.
9. Write a program in java to input N numbers in an array and print out the Armstrong
numbers from the set.
10. Write java program for the following matrix operations:
a. Addition of two matrices
b. Transpose of a matrix
11. Write a java program that computes the area of a circle, rectangle and a Cylinder using
function overloading.
12. Write a Java program for the implementation of multiple inheritance using interfaces
to calculate the area of a rectangle and triangle.
13. Write a java program to create a frame window in an Applet. Display your name,
address and qualification in the frame window.
14. Write a java program to draw a line between two coordinates in a window.
15. Write a java program to display the following graphics in an applet window.
a. Rectangles b. Circles
c. Ellipses d. Arcs e. Polygons
16. Write a program that reads two integer numbers for the variables a and b. If any other
character except number (0-9) is entered then the error is caught by
NumberFormatException object. After that ex.getMessage () prints the information
about the error occurring causes.
17. Write a program for the following string operations:
 a. Compare two strings b. concatenate two strings c. Compute length of a
string

18. Create a class called Fraction that can be used to represent the ratio of two integers. Include
appropriate constructors and methods. If the denominator becomes zero, throw and handle
an exception.
 OSMANIA UNIVERSITY
FACULTY OF SCIENCE
B.Sc. (Computer Science)
SEMESTER – VI
Web Technologies
Theory 4 Hours/Week 4 Credit Internal marks = 20
Practical 3 Hours/Week 1 Credit External Marks = 80
Unit – I
Introduction To XHTML– Introduction, first HTML, Headings, Linking, Images, special
characters and horizontal rules, Lists, Tables, Frames, Forms, internal linking, meta Elements.
CASCADING STYLE SHEETS – Introduction, Inline Styles, Embedded Style Sheets,
Conflicting Styles, Linking external sheets, position Elements, box model and text flow, media
types, building a CSS drop-down menu, user style sheets, CSS3.

Unit – II
Introduction To Java Scripting- introduction, simple program, prompt dialog and alert boxes,
memory concepts, operators, decision making, control structures, if… else statement, while,
counter-controlled repetitions, switch statement, do… while statement, break and continue
statements. Functions – program modules in JavaScript, programmer–defined functions,
functions definition, scope rules, global functions, Recursion.

Unit – III
Arrays- introduction, declaring and allocating arrays, references and reference parameters,
passing arrays to functions. Multidimensional arrays, EVENTS – registering event handling,
event onload, onmouseover, onmouseout, onfocus, onblur, onsubmit, onreset, event bubbling,
more events. JAVA SCRIPT OBJECTS – introduction to object technology, Math Object,
String Object, Date Object, Boolean and Number Object, document and window Objects,
using cookies.

Unit – IV
XML - Introduction, XML Basics, Structuring Data, XML Namespaces, Document Type
Definitions (DTDs), W3C XML Schema Documents, XML Vocabularies, Extensible Style
sheet Language and XSL Transformations, Document Object Model (DOM).

Ajax-Enabled Rich Internet Applications: introduction, history of Ajax, traditional web

applications Vs Ajax Applications, RIAs with Ajax, Ajax example using XMLHttpRequest
object, XML and DOM, creating full scale Ajax-enabled application, Dojo Toolkit.

Text Book:
1. Internet & World Wide Web: HOW TO PROGRAM- H. M. Deitel, P.J. Deitel, -
Fourth Edition- Pearson edition.
 OSMANIA UNIVERSITY
FACULTY OF SCIENCE
B.Sc. (Computer Science)
SEMESTER – VI
Web Technologies Lab
Practical 3 Hours/Week 1 Credit Marks: 25

1. Write a HTML program using basic text formatting tags, <p>, <br>, <pre>.
2. Write a HTML program by using text formatting tags.
3. Write a HTML program using presentational element tags <b>, <i>, <strike>, <sup>,
<sub>, <big>, <small>, <hr>
4. Write a HTML program using phrase element tags <blockquote>, <cite>, <abbr>,
<acronym>, <kbd>, <address>
5. Write a HTML program using different list types.
6. Create a HTML page that displays ingredients and instructions to prepare a recipe.
7. Write a HTML program using grouping elements <div> and <span>.
8. Write a HTML Menu page for Example cafe site.
9. Write a HTML program using images, audios, videos.
10. Write a HTML program to create your time table.
11. Write a HTML program to create a form using text inputs, password inputs, multiple
line text input, buttons, check boxes, radio buttons, select boxes, file select boxes.
12. Write a HTML program to create frames and links between frames.
13. Write a HTML program to create different types of style sheets.
14. Write a HTML program to create CSS on links, lists, tables and generated content.
15. Write a HTML program to create your college web site using multi column layouts.
16. Write a HTML program to create your college web site using for mobile device.
17. Write a HTML program to create login form and verify username and password.
18. Write a JavaScript program to calculate area of rectangle using function.
19. Write a JavaScript program to wish good morning, good afternoon, good evening
depending on the current time.
20. Write a JavaScript program using switch case?
21. Write a JavaScript program to print multiplication table of given number using loop.
22. Write a JavaScript programs using any 5 events.
23. Write a JavaScript program using JavaScript built in objects.
24. Write a JavaScript program to create registration Form with Validations.
25. Write a XML Program to represent Student Data using DTD.
26. Write a XML Program to represent Data using XML Schema Definition.
 OSMANIA UNIVERSITY
FACULTY OF SCIENCE
B.Sc. Computer Science
Semester-I
AECC

Fundamentals of Computers

Theory 2 Hours/Week 2Credits

Unit-I
Introduction to Computers: what is a computer, characteristics of Computers, Generations of
Computers, Classifications of Computers, Basic Computer organization, Applications of
Computers. Input and Output Devices: Input devices, Output devices, Softcopy devices, Hard
copy devices. Computer Memory and Processors: Introduction, Memory Hierarchy, Processor,
Registers, Cache memory, primary memory, secondary storage devices, magnetic tapes, floppy
disks, hard disks, optical drives, USB flash drivers, Memory cards, Mass storage devices, Basic
processors architecture.

Unit-II
Number System and Computer Codes: Binary number system, working with binary numbers,
octal number system, hexadecimal number system, working with fractions, signed number
representation in binary form, BCD code, other codes. Boolean algebra and logic gates:
Boolean algebra, Venn diagrams, representation of Boolean functions, logic gates, logic
diagrams and Boolean expressions using karnaugh map. Computer Software: Introduction to
computer software, classification of computer software, system software, application software,
firmware, middleware, acquiring computer software, design and implementation of correct,
efficient and maintainable programs.

Text Book:
Reema Thareja, Fundamentals of Computers.

References:
1. V.Rajaraman, 6th Edition Fundamentals of Computers, Neeharika Adabala.
2. Anita Goel, Computer Fundamentals.
 OSMANIA UNIVERSITY
FACULTY OF SCIENCE
B.Sc. (Computer Science)
SEMESTER – III
Python – I
(SEC – II)
Theory 2 Hours/Week 2Credits

Unit – I
Introduction to Python Programming: How a Program Works, Using Python, Program Development Cycle, Input, Processing,
and Output, Displaying Output with the Print Function, Comments, Variables, Reading Input from the Keyboard, Performing
Calculations (Operators. Type conversions, Expressions), More about Data Output. Decision Structures and Boolean Logic:
if, if-else, if-elif-else Statements, Nested Decision Structures, Comparing Strings, Logical Operators, Boolean Variables.
Repetition Structures: Introduction, while loop, for loop, Calculating a Running Total, Input Validation Loops, Nested Loops.

Unit – II
Functions: Introduction, Defining and Calling a Void Function, Designing a Program to Use Functions, Local Variables,
Passing Arguments to Functions, Global Variables and Global Constants, Value-Returning Functions- Generating Random
Numbers, Writing Our Own Value-Returning Functions, The math Module, Storing Functions in Modules. File and
Exceptions: Introduction to File Input and Output, Using Loops to Process Files, Processing Records, Exceptions.

Text Book:
Tony Gaddis, Starting Out With Python (3e)

References:
1. Kenneth A. Lambert, Fundamentals of Python
2. Clinton W. Brownley, Foundations for Analytics with Python
3. James Payne, Beginning Python using Python 2.6 and Python 3
4. Charles Dierach, Introduction to Computer Science using Python
5. Paul Gries, Practical Programming: An Introduction to Computer Science using Python 3
With Effect from the Academic Year 2019-2020
 OSMANIA UNIVERSITY
FACULTY OF SCIENCE
B.Sc. (Computer Science)
SEMESTER – IV
Python – II
(SEC – IV)
Theory 2 Hours/Week 2Credits

Unit – I
Lists and Tuples: Sequences, Introduction to Lists, List slicing, Finding Items in Lists with the in
Operator, List Methods and Useful Built-in Functions, Copying Lists, Processing Lists, Two-
Dimensional Lists, Tuples. Strings: Basic String Operations, String Slicing, Testing, Searching, and
Manipulating Strings. Dictionaries and Sets: Dictionaries, Sets, Serializing Objects.
Recursion: Introduction, Problem Solving with Recursion, Examples of Recursive Algorithms.

Unit – II
Object-Oriented Programming: Procedural and Object-Oriented Programming, Classes, Working with
Instances, Techniques for Designing Classes, Inheritance, Polymorphism.
GUI Programming: Graphical User Interfaces, Using the tkinter Module, Display text with Label
Widgets, Organizing Widgets with Frames, Button Widgets and Info Dialog Boxes, Getting Input with
Entry Widget, Using Labels as Output Fields, Radio Buttons, Check Buttons.

Text Book:
Tony Gaddis, Starting Out With Python (3e)

References:
1. Kenneth A. Lambert, Fundamentals of Python
2. Clinton W. Brownley, Foundations for Analytics with Python
3. James Payne, Beginning Python using Python 2.6 and Python 3
4. Charles Dierach, Introduction to Computer Science using Python
5. Paul Gries, Practical Programming: An Introduction to Computer Science using Python 3

With Effect from the Academic Year 2019-2020

 OSMANIA UNIVERSITY
FACULTY OF SCIENCE
OSMANIA UNIVERSITY
FACULTY OF SCIENCE
B.Sc. (Computer Science)
SEMESTER – IV
Information Technologies
(General Elective)
Theory 4 Hours/Week 4Credits

Unit – I
Computer Networks: Introduction, Connection Media, Data Transmission Mode, Data Multiplexing,
Data Switching, Network Topologies, Types of Networks, Networking Devices, OSI Model.
The Internet: Internet Services, Types of Internet Connections, Internet Security.
Introduction to Emerging Computer Technologies: Distributed Networking, Peer-to-peer Computing,
Grid Computing, Cloud Computing, Utility Computing, On-demand Computing, Wireless Network,
Bluetooth, Artificial Intelligence.

Unit – II
Email, Functions of Email, Browser, Web Browser, Internet Service Providers.
Introduction to Information Security – Need for Information Security, Threats to Information Systems,
Information Assurance, Cyber Security.
Introduction to Application Security and Counter Measures – Introduction to Application Security, Data
Security Considerations, Security Technologies, Security Threats, Security Threats to E-Commerce, E-
Cash and Electronic Payment System.

Text Books:
Dr. Surya Prakash T, Ritendra G, Praveen Kumar S, KLSI, Introduction to Information
Security and Cyber Laws (Dreamtech Publication)

With Effect from the Academic Year 2019-2020

 OSMANIA UNIVERSITY
FACULTY OF SCIENCE
B.Sc. (Computer Science)
SEMESTER – VI
PHP with MY SQL
(PROJECT/Optional)
Theory 3 Hours/Week 3 Credit Internal marks = 15
Practical 3 Hours/Week 1 Credit External Marks = 60
Unit – I
Introducing PHP – What is PHP? Why use PHP? Evolution of PHP, Installing PHP, Other ways to run
PHP, Creating your first script. PHP Language Basics – Using variables, Understanding Data Types,
Operators and Expressions, Constants. Decisions and Loops – Making Decisions, Doing Repetitive
Tasks with Looping, Mixing Decisions and Looping with HTML. Strings – Creating and Accessing
Strings, Searching Strings, Replacing Text with Strings, Dealing with Upper and Lowercase, Formatting
Strings. Arrays – Creating Arrays, Accessing Array Elements, Looping through Arrays with for-each,
Creating Function, Reading Data in Web pages: setting up web pages to communicate with PHP,
Handling Text Fields, Text Areas, Checkboxes, Radio Buttons, List Boxes, Password Controls, Image
Maps, File Uploads, Buttons, and PHP Browser.

Unit – II
Object oriented programming: creating Classes and objects, setting access to properties and methods,
constructors, destructors, Inheritance, overriding and overloading methods, auto loading classes.
Advanced OOP: Static members and inheritance, Abstract classes, Interfaces, object iteration,
comparing objects, class constants, final keyword, reflection.
File Handling: fopen, feof, fgets, closing a file, fgetc, file_get_contents, reading a file into an array with
file, file_exists, filesize, fread, fscanf, parse_ini_file, stat, fseek, copy, unlink, fwrite, reading and writing
binary files, appending a file, file_put_contents, locking files

Unit – III

Introducing Databases and SQL – Deciding How to Store Data, Understanding Relational Databases,
Setting Up MySQL, A Quick Play with MySQL, Connecting MySQL from PHP. Retrieving Data from
MySQL with PHP, Retrieving Data with SELECT, Creating a Member Record Viewer. Manipulating
MySQL Data with PHP – Inserting, Updating, and Deleting Records, Building a Member Registration
Application. Sessions, Cookies and FTP.

Text Books:
1. Steven Holzner, "PHP: The Complete Reference Paperback", McGraw Hill Education (India),
2007.
2. Timothy Boronczyk, Martin E. Psinas, "PHP and MYSQL (Create-Modify-Reuse)", Wiley
India Private Limited, 2008.

With Effect from the Academic Year 2019-2020

 OSMANIA UNIVERSITY
FACULTY OF SCIENCE
B.Sc. (Computer Science)
SEMESTER – VI
PHP with MY SQL Lab
Practical 3 Hours/Week 1 Credit Marks: 25

Note:
• Programs of all the Concepts from Text Book including exercises must be practice and execute.
• External Vice-Voce is compulsory.

1. Write a PHP script to display the Fibonacci sequence with HTML page.
2. Write a PHP script to create a chess board.
3. Write a PHP script using built-in string function like strstr(), strops(), substr_count(), etc...
4. Write a PHP script to transform a string to uppercase, lowercase letters, make a string’s first
Character uppercase.
5. Write a PHP script to count number of elements in an array and display a range of array
elements.
6. Write a PHP script using a function to display the entered string in reverse.
7. Write a PHP script to demonstrate inheritance.
8. Write a PHP script to demonstrate the object overloading with _get(), _set(), and _call().
9. Write a PHP script to demonstrate the method overloading and method overriding
mechanisms.
10. Write a PHP script to demonstrate the use of final classes and final methods.
11. Write a PHP script to demonstrate the use of interfaces.
12. Write a PHP script using constructors and destructors.
13. Write a PHP application to handling HTML forms with PHP script.
14. Write a PHP script to create a file, write data into file and display the file’s data.
15. Write a PHP script to check and change file permissions, copying, renaming and deleting files.
16. Write a PHP application for connecting to MySQL and reading data from database table.
17. Write a PHP application for inserting, updating, deleting records in the database table.
18. Develop a PHP application for student registration form.
19. Develop a PHP application for creating, updating, reading and deleting the Student records
from MYSQL Database.

With Effect from the Academic Year 2019-2020

 OSMANIA UNIVERSITY
FACULTY OF SCIENCE
B.Sc. (Computer Science)
Model Question Paper

3 Hours Max Marks -80 Credits -4

PART -A Answer any eight questions in part –A 8X4 M = 32 Marks

UNIT- I 1
2
3

UNIT- II 4
5
6

UNIT- III 7
8
9

UNIT- IV 10
11
12

Part – B Answer all Questions 12MX4 = 48 Marks

UNIT- I 13
Or
14

UNIT- II 15
Or
16

UNIT- III 17
Or
18

UNIT- IV 19
Or
20

With Effect from the Academic Year 2019-2020

 OSMANIA UNIVERSITY
FACULTY OF SCIENCE
B.Sc. (Computer Science)
Practical Question Paper
3 Hours Max Marks -25 Credits -1

Answer any Two 6 X 2 = 12 MARKS

UNIT – I 1 Program

UNIT- II 1 Program

UNIT-III 1 Program

UNIT-IV 1 Program

Viva - 8 Marks

Record – 5 Marks

With Effect from the Academic Year 2019-2020

 OSMANIA UNIVERSITY
FACULTY OF SCIENCE
B.Sc. (Computer Science)
Model Question Paper for Semester VI Project/optional only

3 Hours Max Marks -60 Credits -4

PART -A Answer any Six questions in part –A 6X4 M = 24 Marks

UNIT- I 1
2
3

UNIT- II 4
5
6

UNIT- III 7
8
9

Part – B Answer all Questions 12MX3 = 36 Marks

UNIT- I 13
Or
14

UNIT- II 15
Or
16

UNIT- III 17
Or
18

With Effect from the Academic Year 2019-2020

 B.Sc. Statistics Semester I to VI Syllabus for the Academic Year 2020-21

B.A/B.Sc. I Year I Semester (CBCS) : Statistics Syllabus

(With Mathematics Combination)
(Examination at the end of Semester - I)
Paper – I : Descriptive Statistics and Probability
[4 HPW :: 4 Credits :: 100 Marks (External:80, Internal:20)]
Unit-I

Descriptive Statistics: Concept of primary and secondary data, Classification of data,

Measures of central tendency (Arithmetic mean, median, mode, geometric mean and
harmonic mean) with simple applications, Absolute and relative measures of dispersion
(range, quartile deviation, mean deviation, standard deviation and variance) with simple
applications.
Importance of moments, central and non-central moments, their inter-relationships,
Sheppard’s correction for moments for grouped data, Measures of skewness based on
quartiles and moments, kurtosis based on moments with real life examples.

Unit-II

Probability: Basic concepts of probability, deterministic and random experiments, trial,

outcome, sample space, event, operations of events, mutually exclusive and exhaustive
events, equally likely and favorable events with examples, Mathematical, Statistical and
Axiomatic definitions of probability, their merits and demerits. Properties of probability
based on axiomatic definition.
Conditional probability and independence of events, Addition and multiplication theorems
for ‘n’ events, Boole’s inequality and Bayes’ theorem, Problems on probability using
counting methods and theorems.
Unit-III

Random Variables: Definition of random variable, discrete and continuous random

variables, functions of random variables, probability mass function and probability density
function with illustrations. Distribution function and its properties, Transformation of one-
dimensional random variable (simple 1-1 functions only).
Notion of bivariate random variable, bivariate distribution, statements of its properties,
Joint, marginal and conditional distributions, Independence of random variables.

Unit-IV

Mathematical Expectation: Mathematical expectation of a function of a random variable,

Raw and central moments, covariance using mathematical expectation with examples,
Addition and multiplication theorems of expectation. Chebyshev’s and Cauchy-Schwartz’s
inequalities and their applications.
Definitions of moment generating function (m.g.f), characteristic function (c.f), cumulant
generating function (c.g.f), probability generating function (p.g.f) and statements of their
properties with applications.

Page 1 of 39
 B.Sc. Statistics Semester I to VI Syllabus for the Academic Year 2020-21

Reference books:

1. Fundamentals of Statistics, (Vol-I) - Goon A M, Gupta M K, Das Gupta B, The World

Press (Pvt) Ltd., Kolkata.

2. Fundamentals of Mathematical Statistics - V. K. Kapoor and S. C. Gupta, Sultan

Chand & Sons, New Delhi.

Additional References:

1. Sanjay Arora and Bansilal: New Mathematical Statistics, Satya Prakashan , New Delhi.
2. William Feller: Introduction to Probability theory and its applications, (Vol-I), Wiley.
3. M. Jagan Mohan Rao and Papa Rao: A Text book of Statistics (Paper-I).
4. Hogg,Tanis, Rao: Probability and Statistical Inference, ( 7th edition), Pearson.
5. K.V.S. Sarma: Statistics Made Simple: Do it yourself on PC, PHI.
6. Gerald Keller: Applied Statistics with Microsoft Excel, Duxbury, Thomson Learning.
7. Levine, Stephen, Krehbiel, Berenson: Statistics for Managers using Microsoft Excel
(4th edition), Pearson Publication.

***

Page 2 of 39
 B.Sc. Statistics Semester I to VI Syllabus for the Academic Year 2020-21

B.A/B.Sc. I Year I Semester (CBCS) : Statistics Syllabus

(With Mathematics Combination)
(Examination at the end of Semester - I)

Practical-1 : Descriptive Statistics and Probability

[3 HPW :: 1 Credit :: 50 Marks]

Part - 1 (Using Calculator)

1. Graphical presentation of data (Histogram, frequency polygon, Ogives) and its

interpretation.
2. Diagrammatic presentation of data (Bar and Pie).
3. Computation of central tendency and dispersion measures for ungrouped and grouped
data.
4. Computation of non-central and central moments – Sheppard’s corrections for
grouped data.
5. Computation of coefficients of Skewness - Karl Pearson’s, Bowley’s, β1 and Kurtosis
– β2 and their interpretation.

Part - 2 (Using MS-Excel)

1. Basics of Excel - Data entry, editing and saving, establishing and copying formulae,
Built in Functions - copy and paste, Find and Replace, Sorting.
2. Basics of Excel - Built in Functions - Filtering, Conditional formatting and creating
Hyperlinks, Exporting to MS word document
3. Computation of descriptive Statistics using Pivote table - Univariate.
4. Data visualization through diagrams.
5. Computation of central tendency and dispersion measures, Coefficient of Variation
for ungrouped and grouped data.
6. Computation of Coefficients of Skewness, Kurtosis using MS-Excel and
interpretation.

Note : Training shall be on establishing formulae in Excel cells and deriving the results.
The Excel output shall be exported to MSWord for writing inferences.

***

Page 3 of 39
 B.Sc. Statistics Semester I to VI Syllabus for the Academic Year 2020-21

B.A/B.Sc. I Year II Semester (CBCS) : Statistics Syllabus

(With Mathematics Combination)
(Examination at the end of Semester - II)
Paper – II : Probability Distributions
[4 HPW :: 4 Credits :: 100 Marks (External:80, Internal:20)]

Unit-I

Discrete distributions – I : Uniform and Bernoulli distributions : definitions, mean, variance

and simple examples. Definition and derivation of probability mass functions of Binomial
distribution, Poisson distribution, properties of these distributions: median, mode, m.g.f,
c.g.f., p.g.f., c.f., and moments upto fourth order, reproductive property (wherever exists)
and their real life applications. Poisson approximation to Binomial distribution.

Unit-II

Discrete distributions – II: Negative binomial, Geometric distributions: Definitions and real
life applications, properties of these distributions: m.g.f, c.g.f., p.g.f., c.f. and moments upto
fourth order, reproductive property (wherever exists), lack of memory property for
Geometric distribution. Poisson approximation to Negative binomial distribution.
Hyper-geometric distribution: definition, real life applications, derivation of probability
function, mean, variance. Binomial approximation to Hyper-geometric distribution.

Unit-III

Continuous distributions – I : Normal distributions – definition, properties such as m.g.f.,

c.g.f., c.f. and moments up to fourth order, reproductive property, wherever exists and their
real life applications. Normal distribution as a limiting case of Binomial and Poisson
distributions.
Unit-IV

Continuous distributions – II : Rectangular, Exponential, Gamma distributions - definition,

properties: m.g.f., c.g.f., c.f. and moments up to fourth order, reproductive property
(wherever exists) and their real life applications. Beta distribution of two kinds: Definitions,
mean and variance.

Page 4 of 39
 B.Sc. Statistics Semester I to VI Syllabus for the Academic Year 2020-21

Reference books:

3. Fundamentals of Statistics, (Vol-I) - Goon A M, Gupta M K, Das Gupta B, The World

Press (Pvt) Ltd., Kolkata.

4. Fundamentals of Mathematical Statistics - V. K. Kapoor and S. C. Gupta, Sultan

Chand & Sons, New Delhi.

Additional References:

8. Sanjay Arora and Bansilal: New Mathematical Statistics, Satya Prakashan , New Delhi.
9. William Feller: Introduction to Probability theory and its applications, (Vol-I), Wiley.
10. M. Jagan Mohan Rao and Papa Rao: A Text book of Statistics (Paper-I).
11. Hogg,Tanis, Rao: Probability and Statistical Inference, ( 7th edition), Pearson.
12. K.V.S. Sarma: Statistics Made Simple: Do it yourself on PC, PHI.
13. Gerald Keller: Applied Statistics with Microsoft Excel, Duxbury, Thomson Learning.
14. Levine, Stephen, Krehbiel, Berenson: Statistics for Managers using Microsoft Excel
(4th edition), Pearson Publication.

***

Page 5 of 39
 B.Sc. Statistics Semester I to VI Syllabus for the Academic Year 2020-21

B.A/B.Sc. I Year II Semester (CBCS) : Statistics Syllabus

(With Mathematics Combination)
(Examination at the end of Semester - II)

Practical-2 : Probability Distributions

(3 HPW :: 1 Credit :: 50 Marks)

Part - 1 (Using Calculator)

1. Fitting of Binomial distribution-Direct method.

2. Fitting of Binomial distribution-Recurrence relation Method.
3. Fitting of Poisson distribution-Direct method
4. Fitting of Poisson distribution-Recurrence relation Method.
5. Fitting of Negative Binomial distribution.
6. Fitting of Geometric distribution.
7. Fitting of Normal distribution-Areas method.
8. Fitting of Normal distribution - Ordinates method.
9. Fitting of Exponential distribution.

Part - 2 (Using MS-Excel)

1. Data Visualization through graphs (Histogram, frequency polygon, Ogives) using MS-
Excel and their interpretation.
2. Computation of descriptive Statistics using Pivote table – Bivariate.
3. Fitting of Binomial distribution-Direct method.
4. Fitting of Poisson distribution-Direct method.
5. Fitting of Normal distribution-Areas method.
6. Fitting of Exponential distribution.

Note : Training shall be on establishing formulae in Excel cells and deriving the results.
The Excel output shall be exported to MSWord for writing inferences.

***

Page 6 of 39
 B.Sc. Statistics Semester I to VI Syllabus for the Academic Year 2020-21

B.A./B.Sc. (STATISTICS)
Theory Question Paper Pattern
(With Mathematics Combination)
Time : 3 hours] [Max. Marks : 80

Section - A

Answer any EIGHT questions. All questions carry equal marks.

(8Qx4m=32)

1. From Unit I
2. From Unit I
3. From Unit I
4. From Unit II
5. From Unit II
6. From Unit II
7. From Unit III
8. From Unit III
9. From Unit III
10. From Unit IV
11. From Unit IV
12. From Unit IV
Section - B
Answer ALL questions. All questions carry equal marks. (4Qx12m=48)
13. a) From Unit I
(or)
b) From Unit I

14. a) From Unit II

(or)
b) From Unit II

15. a) From Unit III

(or)
b) From Unit III

16. a) From Unit IV

(or)
b) From Unit IV

Page 7 of 39
 B.Sc. Statistics Semester I to VI Syllabus for the Academic Year 2020-21

B.A./B.Sc. (STATISTICS)
Practical Question Paper Pattern
(With Mathematics Combination)

Time: 3 hours] [Max. Marks: 50

Solve any THREE problems choosing at least one from each Section.
(3Qx15m=45m) and Record: 5m

Section-A

1. From Part 1
2. From Part 1
3. From Part 1

Section - B

4. From Part 2
5. From Part 2

***

Page 8 of 39
 B.Sc. Statistics Semester I to VI Syllabus for the Academic Year 2020-21

B.A/B.Sc. II Year III Semester (CBCS) : Statistics Syllabus

(With Mathematics Combination)
(Examination at the end of Semester - III)
Paper – III : Statistical Methods and Theory of Estimation
[4 HPW :: 4 Credits :: 100 Marks (External:80, Internal:20)]

Unit –I

Bivariate data, Scattered diagram, Principle of least squares, fitting of straight line, quadratic
and power curves. Concept of correlation, computation of Karl-Pearson correlation
coefficient for grouped and ungrouped data and its properties.
Correlation ratio, Spearman’s rank correlation coefficient and its properties. Simple linear
regression, correlation verses regression, properties of regression coefficients.

Unit –II
Concepts of partial and multiple correlation coefficients (only for three variables). Analysis
of categorical data, their independence, Association and partial association of attributes.
Various measures of association: (Yule’s) for two way data and coefficient of contingency
(Pearson and Tcherprow) and coefficient of colligation.

Unit – III
Concepts of Population, Parameter, Random sample, Statistic, Sampling distribution and
Standard error. Standard error of sample mean(s) and sample proportion(s). Exact sampling
distributions - Statement and properties of 2, t and F distributions and their
interrelationships. Independence of sample mean and variance in random sampling from
normal distributions.
Point estimation of a parameter, concept of bias and mean square error of an estimate.
Criteria of a good estimator- consistency, unbiasedness, efficiency and sufficiency with
examples.

Unit – IV
Statement of Neyman’s Factorization theorem, derivations of sufficient statistics in case of
Binomial, Poisson, Normal and Exponential (one parameter only) distributions. Estimation by
the method of moments, Maximum likelihood estimation (MLE), statements of asymptotic
properties of MLE. Concept of interval estimation. Confidence intervals of the parameters of
normal population by Pivot method.

Page 9 of 39
 B.Sc. Statistics Semester I to VI Syllabus for the Academic Year 2020-21

Reference Books:

1. Goon AM, Gupta MK, Das Gupta B : Outlines of Statistics , Vol-II, the World Press
Pvt. Ltd., Kolkata.
2. V. K. Kapoor and S. C. Gupta: Fundamentals of Mathematical Statistics, Sultan
Chand & Sons, New Delhi

Additional References:

1. Hoel P.G : Introduction to Mathematical statistics, Asia Publishing house.

2. Sanjay Arora and Bansilal :.New Mathematical Statistics Satya Prakashan , New
Delhi
3. Hogg and Craig : Introduction to Mathematical statistics. Prentice Hall
4. Siegal, S., and Sidney: Non-parametric statistics for Behavioral Science. McGraw
Hill.
5. Gibbons J.D and Subhabrata Chakraborti : Nonparametric Statistical Inference.
Marcel
Dekker.
6. Parimal Mukhopadhyay : Mathematical Statistics. New Central Book agency.
7. Conover : Practical Nonparametric Statistics. Wiley series.
8. V. K. Rohatgi and A. K. Md. Ehsanes Saleh : An introduction to probability and
statistics, Wiley series.
9. Mood A M, Graybill F A, Boe’s DC. Introduction to theory of statistics. TMH
10. Paramiteya Mariyu Aparameteya Parikshalu. Telugu Academy.
11. K.V. S. Sarma: Statistics made simple do it yourself on PC. PHI
12. Gerald Keller : Applied Statistics with Microsoft excel. Duxbury. Thomson Learning
13. Levin, Stephan, Krehbiel, Berenson: Statistics for Managers using Microsoft Excel.4th
Edition, Pearson Publication.
14. Hogg, Tanis, Rao. Probability and Statistical Inference.7th edition. Pearson
Publication.
15. Milton and Arnold (fourth Edition):Introduction to Probability and Statistics, Tata
McGraw Hill Publication.

Page 10 of 39
 B.Sc. Statistics Semester I to VI Syllabus for the Academic Year 2020-21

B.A/B.Sc. II Year III Semester (CBCS): Statistics Syllabus

(With Mathematics Combination)
(Examination at the end of Semester - III)
Practical – 3 : Statistical Methods and Theory of Estimation
(3 HPW, Credits 1 and Marks 50)

Part – A (Using Calculator)

1. Generation of random samples from Uniform (0,1), Uniform (a,b), Normal and
Poisson and Exponential Distributions.
2. Fitting of straight line and parabola by the method of least squares.
3. Fitting of power curves of the type y= a xb, y=a bx and y=a ebx by the method of
least squares.
4. Computation of Yule’s coefficient of association and Pearson’s, Tcherprows
coefficient of contingency.
5. Computation of correlation coefficient and regression lines for ungrouped data.
6. Computation of correlation coefficient, forming regression lines for ungrouped data.
7. Computation of correlation coefficient, forming regression lines for grouped data.
8. Computation of multiple and partial correlation coefficients.
9. Computation of correlation ratio

Part – B (Using Excel)

10. Simulation of random samples from Uniform (0,1), Uniform (a,b), Exponential,
Normal and Poisson distributions using MS Excel.
11. Fitting of straight line and parabola by the method of least squares using MS Excel.
12. Fitting of power curves of the type y= a xb, y=a bx and y=a ebx by the method of
least squares using MS Excel.
13. Computation of correlation coefficient, forming regression lines using MS Excel.
14. Computation of multiple and partial correlation coefficients using MS Excel.

Page 11 of 39
 B.Sc. Statistics Semester I to VI Syllabus for the Academic Year 2020-21

B.A/B.Sc. II Year III Semester (CBCS) : Statistics Syllabus

(With Mathematics Combination)
(Examination at the end of Semester - III)
SEC – 1 : UGC Specified Skill Enhancement Course
[2 HPW with 2 Credits and 50 Marks]

For Syllabus refer to

Page 12 of 39
 B.Sc. Statistics Semester I to VI Syllabus for the Academic Year 2020-21

B.A/B.Sc. II Year III Semester (CBCS) : Statistics Syllabus

(With Mathematics Combination)
(Examination at the end of Semester - III)
SEC - 2 : Data Collection, Presentation and Interpretation
[2 HPW with 2 Credits and 50 Marks]

UNIT –I

Basic Concepts on Population, Sample, Sampling unit, Parameter, Statistic, Standard error,
Sample Size and its Determination.
Steps in Sample design. Selecting the Problem and necessity of defining the Problem,
Designing a questionnaire and a schedule for collecting data for a set of objectives under
study with illustrated examples.
Methods for collecting Primary and Secondary data and their merits and demerits.

UNIT II

Graphical computation of Data and Interpretation : Histogram, frequency curve, frequency

polygon, ogive curves.
Diagrammatic computation of Data and Interpretation : Bar diagrams (simple, component,
multiple, percentage Bars), Pie diagram.
Classification and Tabulation of data. Data Interpretation techniques, Precaution in
Interpretation. Data interpretation problems.

Reference Books :

1. Kotahri, C.R (2009): Research Methodology: Methods and Techniques, 2nd Revised
Ed. Reprint, New Age International Publishers
2. S. P. Gupta : Statistical Methods.

Page 13 of 39
 B.Sc. Statistics Semester I to VI Syllabus for the Academic Year 2020-21

B.A/B.Sc. II Year IV Semester (CBCS) : Statistics Syllabus

(With Mathematics Combination)
(Examination at the end of Semester - IV)
Paper - IV : Statistical Inference
[4 HPW :: 4 Credits :: 100 Marks (External:80, Internal:20)]

Unit–I
Concepts of statistical hypotheses, Null and Alternative hypothesis, Critical region, two types
of errors, Level of significance and Power of a test. One and two tailed tests, test function
(non-randomized and randomized). Statement and Proof of Neyman-Pearson’s fundamental
lemma for Randomized tests. Examples in case of Binomial, Poisson, Exponential and
Normal distributions and their power of the test functions.

Unit-II
Large sample tests for single sample mean, difference of means, single sample proportion,
difference of proportions and difference of standard deviations. Fisher’s Z-transformation for
population correlation coefficient(s) and testing the same in case of one sample and two
samples. Definition of order statistics and statement of their distributions.

Unit – III

Tests of significance based on 2 - 2-test for specified variance, goodness of fit and test for
independence of attributes (rxs, 2xk and 2x2 contingency tables). Tests of significance based
on student’s - t – t-test for single sample specified mean, difference of means for independent
and related samples, sample correlation coefficient. F - test for equality of population
variances.

Unit – IV
Non-parametric tests - their advantages and disadvantages, comparison with parametric tests.
Measurement scale - nominal, ordinal, interval and ratio. Use of Central Limit Theorem in
testing. One sample runs test, sign test and Wilcoxon-signed rank tests (single and paired
samples). Two independent sample tests: Median test, Wilcoxon –Mann-Whitney U test,
Wald Wolfowitz’s runs test. Use of central limit theorem in testing.

Page 14 of 39
 B.Sc. Statistics Semester I to VI Syllabus for the Academic Year 2020-21

Reference Books:

1. Goon AM, Gupta MK, Das Gupta B : Outlines of Statistics , Vol-II, the World Press
Pvt. Ltd., Kolkata.
2. V. K. Kapoor and S. C. Gupta: Fundamentals of Mathematical Statistics, Sultan
Chand & Sons, New Delhi

Additional References:

1. Hoel P.G : Introduction to Mathematical statistics, Asia Publishing house.

2. Sanjay Arora and Bansilal :.New Mathematical Statistics Satya Prakashan , New
Delhi
3. Hogg and Craig : Introduction to Mathematical statistics. Prentice Hall
4. Siegal, S., and Sidney: Non-parametric statistics for Behavioral Science. McGraw
Hill.
5. Gibbons J.D and Subhabrata Chakraborti : Nonparametric Statistical Inference.
Marcel
Dekker.
6. Parimal Mukhopadhyay : Mathematical Statistics. New Central Book agency.
7. Conover : Practical Nonparametric Statistics. Wiley series.
8. V. K. Rohatgi and A. K. Md. Ehsanes Saleh : An introduction to probability and
statistics, Wiley series.
9. Mood A M, Graybill F A, Boe’s DC. Introduction to theory of statistics. TMH
10. Paramiteya Mariyu Aparameteya Parikshalu. Telugu Academy.
11. K.V. S. Sarma: Statistics made simple do it yourself on PC. PHI
12. Gerald Keller : Applied Statistics with Microsoft excel. Duxbury. Thomson Learning
13. Levin, Stephan, Krehbiel, Berenson: Statistics for Managers using Microsoft Excel.4th
Edition, Pearson Publication.
14. Hogg, Tanis, Rao. Probability and Statistical Inference.7th edition. Pearson
Publication.
15. Milton and Arnold (fourth Edition):Introduction to Probability and Statistics, Tata
McGraw Hill Publication.

Page 15 of 39
 B.Sc. Statistics Semester I to VI Syllabus for the Academic Year 2020-21

B.A/B.Sc. II Year IV Semester (CBCS) : Statistics Syllabus

(With Mathematics Combination)
(Examination at the end of Semester - IV)
Practical – 4 : Statistical Inference
[3 HPW, Credits 1 and Marks 50]

Part – A (Using Calculator)

1. Large sample tests for mean(s), proportion(s), Standard deviation(s) and correlation
coefficient.
2. Small sample tests for single mean and difference of means and correlation
coefficient.
3. Paired t-test.
4. Small sample test for single and difference of variances.
5. 2 – test for goodness of fit and independence of attributes.
6. Nonparametric tests for two independent samples (Median test,Wilcoxon Mann
Whitney - U test, Wald - Wolfowitz’s runs test)

Part – B (Using Excel)

7. Use of Look up and Reference functions for data analysis.

8. Creating and assigning Macros.
9. Small sample tests for mean(s), paired t-test and correlation coefficient using MS
Excel.
10. Small sample test for single and difference of variances using MS Excel.
11. 2 – test for goodness of fit and independence of attributes using MS Excel.
12. Nonparametric tests for single and related samples (sign test and Wilcoxon signed
rank test) and one sample runs test.

Note : Training shall be on establishing formulae in Excel cells and deriving the results.
The Excel output shall be exported to MSWord for writing inferences.

Page 16 of 39
 B.Sc. Statistics Semester I to VI Syllabus for the Academic Year 2020-21

B.A/B.Sc. II Year IV Semester (CBCS): Statistics Syllabus

(With Mathematics Combination)
(Examination at the end of Semester - IV)
SEC – 3 - UGC Specified Skill Enhancement Course
[2 HPW with 2 Credits and 50 Marks]

For Syllabus refer to

Page 17 of 39
 B.Sc. Statistics Semester I to VI Syllabus for the Academic Year 2020-21

B.A/B.Sc. II Year IV Semester (CBCS) : Statistics Syllabus

(With Mathematics Combination)
(Examination at the end of Semester - IV)
SEC - 4 : Data Scaling Techniques and Report writing
[2 HPW with 2 Credits and 50 Marks]

UNIT – I

Qualitative and Quantitative data, Measurement of Scales: nominal, ordinal, interval and ratio
scales. Scale Classification Bases, Important Scaling Techniques, Scale Construction
Techniques. Developing Likert-type Scales, Factor scales and Cumulative Scales their
advantages and limitations.
UNIT-II

Interpretation and Report Writing: meaning of interpretation, technique of interpretation,

precautions in interpretation, significance of report writing, different steps in writing report.
layout of the research report, types of reports, oral presentation, mechanics of writing a
research report.

Reference Books :

1. SC Gupta and VK Kapoor : Fundamentals of Applied Statistics, Sultan Chand & Sons
2. Goon AM, Gupta MK, Das Gupta B : Fundamentals of Statistics , Vol-I, The World
Press Pvt. Ltd., Kolkata.

Page 18 of 39
 B.Sc. Statistics Semester I to VI Syllabus for the Academic Year 2020-21

B.A/B.Sc. III Year V Semester (CBCS): Statistics Syllabus

(With Mathematics Combination)
(Examination at the end of III Year V Semester)
Paper-V: Sampling Theory, Time series, Index Numbers and Demand
Analysis
(DSC-2E)
(3 Hours Per Week with 3 Credits and 75 Marks)

UNIT-I
Sample Surveys: Concepts of population, sample, sampling unit, parameter, statistic, sample
frame and standard error. Principal steps in sample surveys - need for sampling, census
versus sample surveys, sampling and non- sampling errors, sources and treatment of non-
sampling errors, advantages and limitations of sampling.
Sampling Methods: Types of sampling: Subjective, probability and mixed sampling
methods. Methods of drawing random samples with and without replacement. Estimates of
population mean, total, and proportion, their variances and the estimates of variances in
Simple Random Sampling With and Without Replacement.
UNIT-II
Estimates of population mean, total, and proportion, their variances and the estimates of
variances in the following methods.
(i) Stratified Random Sampling with Proportional and Neyman allocation, and
(ii) Systematic Sampling when N= nk.
Comparison of relative efficiencies. Advantages and disadvantages of SRS, Stratified and
Systematic sampling methods.
Time series: Time series and its components with illustrations, additive, multiplicative and mixed
models. Determination of trend by least squares and moving average methods. Growth curves and
their fitting with reference to Modified exponential, Gompertz and Logistic curves. Determination of
seasonal indices by Ratio to moving average, ratio to trend and link relative methods.

UNIT-III
Demand Analysis: Introduction. Demand and supply, price elasticity of supply and demand.
Methods of determining demand and supply curves, Leontief’s ,Pigous’s methods of
determining demand curve from time series data, limitations of these methods Pigou’s method
from time series data. Pareto law of income distribution curves of concentration.
Index Numbers: Concept, construction, uses and limitations of simple and weighted index
numbers. Laspeyer’s, Paasche’s and Fisher’s index numbers, criterion of a good index
numbers, problems involved in the construction of index numbers. Fisher’s index as an ideal
index number. Fixed and chain base index numbers. Cost of living index numbers and
wholesale price index numbers. Base shifting, splicing and deflation of index numbers.

Page 19 of 39
 B.Sc. Statistics Semester I to VI Syllabus for the Academic Year 2020-21

Reference Books:

1. V.K. Kapoor and S.C. Gupta : Fundamentals of Applied Statistics. Sultan Chand
2. Parimal Mukhopadhyay : Applied Statistics, New Central Book agency.
3. Daroga Singh and Chowdhary: Theory and Analysis of Sample survey designs. Wiley Eastern.
4. M.R.Saluja : Indian Official Statistics. ISI publications.
5. B.L.Agarwal: Basic Statistics.New Age publications.
6. S.P.Gupta : Statistical Methods. Sultan Chand and Sons.
7. Anuvartita Sankhyaka Sastram – Telugu Academy.
8. Arora, SumeetArora,S.Arora: Comprehensive Statistical Methods. S.Chand.
9. A.M.Goon, M.K.Gupta, B. Dasgupta: Fundamentals of Statistics Vol II World Press
Private Ltd.,Calcutta
10. A.M.Goon,M.K.Gupta,B.Dasgupta An outline of Statistical Theory Vol II World Press
Private Ltd.,Calcutta17.

Note: Theory paper is for 60 Marks and Internal is 15 Marks

Page 20 of 39
 B.Sc. Statistics Semester I to VI Syllabus for the Academic Year 2020-21

B.A/B.Sc. III Year V Semester (CBCS): Statistics Syllabus

(With Mathematics Combination)
(Examination at the end of III Year V Semester)
Paper-VI A: Statistical Quality Control and Reliability (DSE-2E)
(3 Hours Per Week with 3 Credits and 75 Marks)

Unit –I
Statistical Quality Control: Importance of SQC in industry. Dimensions of quality, Statistical basis of
Shewart control charts. Construction of control charts for variables (mean, range and standard deviation)
and attributes (p , np with fixed and varying sample sizes) and their Interpretation.

Unit –II
Control charts for attributes (c and u charts with fixed and varying sample sizes) and their
Interpretation. Construction of control charts for Natural tolerance limits and specification
limits, process capability index and modified control charts.

Unit –III
Acceptance sampling plans:. Concept of AQL and LTPD. Producers risk and consumer’s
risk Single and Double sampling plans for attributes and their OC and ASN functions.
Design of single and double sampling plans for attributes using Binomial and Poisson
distributions. Construction of OC and ASN functions.
Reliability: Introduction. Hazard function, Exponential distribution as life model, its
memory- less property. Reliability function and its estimation.

System reliability - series, parallel and k out of N systems and their reliabilities with simple
examples.

Reference Books:
1. D.C. Montgomary: Introduction to Statistical Quality Control. Wiley
2. V.K. Kapoor and S.C.Gupta L Fundamentals of Applied Statistics. Sultan Chand
3. Parimal Mukhopadhyay : Applied Statistics . New Central Book agency
4. Anuvartita Sankhyakasastram – Telugu Academy.
5. R.C.Gupta: Statistical Quality Control.
6. S.K.Sinha: Reliability and life testing. Wiley Eastern

7. L.S.Srinath: Reliability Engineering. Affiliated East-West Press.

Note: Theory paper is for 60 Marks and Internal is 15 Marks

Page 21 of 39
 B.Sc. Statistics Semester I to VI Syllabus for the Academic Year 2020-21

B.A/B.Sc. III Year V Semester (CBCS): Statistics Syllabus

(With Mathematics Combination)
(Examination at the end of III Year V Semester)
Paper-VI B: Bio-Statistics - I (DSE-2E)
(3 HPW with 3 Credits and 75 Marks)

Unit –I
Bioassay : The purpose and structure of biological assay. Types of biological assays, Direct
assays, Ratio estimates, asymptotic distributions: Feller’s theorem. Regression approach to
estimate dose – response and relationships.

Unit –II

Logit and Probit approaches when dose-response curve for standard preparation is unknown,
quantal responses, methods of estimation of parameters, estimation of extreme quantiles,
dose allocation schemes, polychotomous quantal response, estimation of points on the
quantal response function.
Unit –III
Statistical Genetics: Basic terminology of genetics.Frequencies of genes and genotypes, Mendal’s
law, Hardy-Weinberg equilibrium. Mating Frequencies, estimation of allele frequency (dominant /
codominant cases). Multiple alleles.

Approach to equilibrium for X-linked gene, natural selection, mutation, genetic drift,
equilibrium when both natural selection and mutation are operative.

Reference Books:

1. D.J.Finney (1970): Statistical methods in Biological Assay. Charles Griffin.

2. Govindarajulu (2000): Statistical Techniques in Bioassay. Karger Publishers/Panther
Publishers.
3. C.C.Li (1976): First course in population genetics. Boxwood press, California.
4. Falcon and Mackay (1998) : Introduction to quantitative genetics. Longman
5. J.F.Lawless: Statistical models and methods of life data. Wiley.
6. James F Crow and Motoo Kimura: An Introduction to Population Genetics Theory.
Alpha edition.

Note: Theory paper is for 60 Marks and Internal is 15 Marks

Page 22 of 39
 B.Sc. Statistics Semester I to VI Syllabus for the Academic Year 2020-21

B.A/B.Sc. III Year V Semester (CBCS): Statistics Syllabus

(With Mathematics Combination)
(Examination at the end of III Year V Semester)
Paper-VI C: Actuarial Statistics - I (DSE-2E)
(3 HPW with 3 Credits and 75 Marks)

Unit –I

Utility theory, insurance and utility theory, models for individual claims and their sums,
survival function, curate future lifetime, force of mortality.

Unit –II

Life table and its relation with survival function examples, assumptions of fractional ages,
some analytical laws of mortality select and ultimate tables.

Multiple life functions, joint life and last survivor status, insurance and annuity benefits
through multiple life functions, evaluation for special mortality laws.
`
Unit –III

Multiple decrement models, deterministic and random survivorship groups, associated single
decrement tables, central rates of multiple decrement, net single premiums and their
numerical evaluations.
Distribution of aggregate claims, compound Poisson distribution and its applications.

Reference Books:

1. N.L.Bowers, H.U.Gerber, J.C.Hickman, D.A.Jones and C.J.Nesbitt (1986): Actuarial

Mathematics, Society of Actuaries, Ithaca, Illinois,USA .

2. Neill,A.(1977): Life contingencies, Heineman.

3. Spurgeon E.T.(1972): Life contingencies, Cambridge University Press

4. Benjamin,B and Pollard,J.H(1980): Analysis of Mortality and other Actuarial

Statistics.

5. Federation of Insurance Institutes study courses: mathematical basis of Life

Assurance (Published by Federation if Insurance Institutes, Bombay).

Note: Theory paper is for 60 Marks and Internal is 15 Marks

Page 23 of 39
 B.Sc. Statistics Semester I to VI Syllabus for the Academic Year 2020-21

B.A/B.Sc. III Year V Semester (CBCS): Statistics Syllabus

(With Mathematics Combination)
(Examination at the end of III Year V Semester)
Practical Paper-V: Theory Paper V and Elective VI A
(with 2 HPW, Credits 1 and 25 Marks)

Section – A

1. Estimation of Population mean, population total and variance of these estimates by

Simple random sampling with and without replacement. Comparison between SRSWR
and SRSWOR
2. Stratified random sampling with proportional and optimum allocations. Comparison
between proportional and optimum allocations with SRSWOR
3. Systematic sampling with N = nk. Comparison of Systematic sampling with Stratified
and SRSWOR
4. Measurement of trend by method of least squares and moving averages.
5. Determination of seasonal indices by the method of Ratio to moving averages.
6. Determination of seasonal indices by the method of Ratio to trend.
7. Determination of seasonal indices by the method of link Relatives.

Section – B

8. Construction of X , R and  - charts.

9. Construction of p, np, charts with fixed and varying n.
10. Construction of c and u charts.
11. Designing a single sampling plan and construction of its OC and ASN curves.
12. Designing a double sampling plan and construction of its OC and ASN curves.

Note: The question paper consists of TWO sections. Section A Consists of 2 Questions
From Section A of Practical paper V and Section B consists of 2 questions from
Section B of Practical paper V.

Page 24 of 39
 B.Sc. Statistics Semester I to VI Syllabus for the Academic Year 2020-21

B.A/B.Sc. III Year V Semester (CBCS): Statistics Syllabus

(With Mathematics Combination)
(Examination at the end of III Year V Semester)
Practical Paper-V: Theory Paper V and Elective VI B
(with 2 HPW, Credits 1 and 25 Marks)

Section – A

1. Estimation of Population mean, population total and variance of these estimates by

Simple random sampling with and without replacement. Comparison between SRSWR
and SRSWOR
2. Stratified random sampling with proportional and optimum allocations. Comparison
between proportional and optimum allocations with SRSWOR
3. Systematic sampling with N = nk. Comparison of Systematic sampling with Stratified
and
SRSWOR
4. Measurement of trend by method of least squares and moving averages.
5. Determination of seasonal indices by the method of Ratio to moving averages.
6. Determination of seasonal indices by the method of Ratio to trend.
7. Determination of seasonal indices by the method of link Relatives.

Section – B

8. Fitting of exponential growth model to data by linearization method.

9. Fitting of logistic growth model.
10. Dose response relation and its estimation by least squares method and by MLE method.
11. Estimation of extreme quantiles and points on the quantal response .
12. Hardy –Weinberg equilibrium frequencies and Estimation of allele frequencies.
13. Effects of mutation and selection and the Hardy -Weinberg test.
14. Equilibrium—Balance between selection and mutation.

Note : The question paper consists of TWO sections. Section A Consists of 2 Questions
from Section A of Practical paper V and Section B consists of 2 questions from
Section B of Practical paper V.

Page 25 of 39
 B.Sc. Statistics Semester I to VI Syllabus for the Academic Year 2020-21

B.A/B.Sc. III Year V Semester (CBCS): Statistics Syllabus

(With Mathematics Combination)
(Examination at the end of III Year V Semester)
Practical Paper-V: Theory Paper V and Elective VI C
(with 2 HPW, Credits 1 and 25 Marks)

Section – A

1. Estimation of Population mean, population total and variance of these estimates by

Simple random sampling with and without replacement. Comparison between SRSWR
and SRSWOR
2. Stratified random sampling with proportional and optimum allocations. Comparison
between proportional and optimum allocations with SRSWOR
3. Systematic sampling with N = nk. Comparison of Systematic sampling with Stratified
and
SRSWOR
4. Measurement of trend by method of least squares and moving averages.
5. Determination of seasonal indices by the method of Ratio to moving averages.
6. Determination of seasonal indices by the method of Ratio to trend.
7. Determination of seasonal indices by the method of link Relatives.

Section – B
8. Computation of values of utility function.
9. Computation of various components of life tables.
10. Construction of multiple decrement table for deterministic survival group.
11. Determination of distribution function, survival function and force of mortality.
12. Construction of multiple decrement table for random survivorship group.
13. Construction of select, ultimate and aggregate mortality.
14. Calculation of p.d.f. and distribution function of aggregate claims.

Note : The question paper consists of TWO sections. Section A Consists of 2 Questions
from Section A of Practical paper V and Section B consists of 2 questions from
Section B of Practical paper V.

Page 26 of 39
 B.Sc. Statistics Semester I to VI Syllabus for the Academic Year 2020-21

B.A/B.Sc. III Year V Semester (CBCS): Statistics Syllabus

(With Mathematics Combination)
(Examination at the end of III Year V Semester)
Practical Paper-VI: MS - EXCEL
(with 2 HPW, Credits 1 and 25 Marks)

Time Series Analysis

1. Measurement of trend by method of least squares and moving averages.

2. Determination of seasonal indices by the method of Ratio to moving averages.
3. Determination of seasonal indices by the method of Ratio to trend.
4. Determination of seasonal indices by the method of link Relatives.

Index Numbers

5. Base shifting, splicing and Deflation.

Statistical Quality Control

6 Construction of x , R and - charts.

7 Construction of p and np charts with fixed n.
8 Construction of p and np charts with varying n.
9 Construction of c and u charts.

Demand Analysis

10 Construction of Lorenz curve.

11 Fitting of Pareto law to an income data.

Note 1 : Training shall be on establishing formulae in Excel cells and deriving the results.
The Excel output shall be exported to MSWord for writing inferences.

Note 2 : The question paper consists of TWO sections. Section A Consists of 2 Questions
from Paper VI Practical and Section B consists of 2 questions on MS – Excel from
Semesters I and III respectively.

Page 27 of 39
 B.Sc. Statistics Semester I to VI Syllabus for the Academic Year 2020-21

B.A/B.Sc. III Year VI Semester (CBCS): Statistics Syllabus

(With Mathematics Combination)
(Examination at the end of III Year V Semester)
SEC-3: Big Data Analysis
(2 HPW with 2 Credits and 50 Marks)
UNIT I
The Rise of Big Data: What is Big Data and why does it matter; Web Data: The original Big
Data; The cross section of Big Data and the value they hold;

UNIT II
Taming Big Data: The Technologies, Process and Methods: The Evolution of Analytic
Scalability, The Evolution of Analytic Process, The Evolution of Analytic Tools and
Methods.

Text Book:

1. Bill Franks, “Taming the Big Data Tidal Wave: Finding Opportunities in Huge Data
Streams with Advanced Analytics”, John Wiley & sons, 2012. ( Chapters 1 to 6).

Reference Books:

1. Michael Berthold, David J. Hand, “Intelligent Data Analysis”, Springer, 2007.

2. Glenn J. Myatt, “Making Sense of Data”, John Wiley & Sons, 2007
3. Pete Warden, “Big Data Glossary”, O’Reilly, 2011.

Note: Theory paper is for 40 Marks and Internal is 10 Marks

Page 28 of 39
 B.Sc. Statistics Semester I to VI Syllabus for the Academic Year 2020-21

B.A/B.Sc. III Year: Statistics Syllabus

(Generic Elective-GE-1)
(Examination at the end of III Year, Semester V)
GE – 1 –Basic Statistics-1(with 2 HPW, Credits 2 and Marks 50).

Unit – I

Origin, Importance and growth of Statistics, Collection and tabulation of data.Frequency

distribution. Graphical and Pictorial representation of data. Measures of central tendency:
Mean, Median and Mode their merits and demerits with examples. Partition Values:
Quartiles, Deciles and percentiles and examples.
Measures of dispersion: Range and standard deviation, coefficient of variation. Central and
non-Central moments, coefficient of Skewness and Kurtosis, Examples.

Unit – II
Review of permutations and combinations. Deterministic and random experiment, Sample
space, event mutually exclusive, equally likely and independent events with examples.
Mathematical, Statistical and axiomatic definition of probability, Addition theorem,
conditional probability and multiplication theorem of probability. Statistical independence
and Bayes theorem –simple examples (all theorems without proofs and only statements).

List of reference books:

1. V.K.Kapoor and S.C.Gupta: Fundamentals of Mathematical Statistics, Sultan Chand

& Sons, New Delhi
2. GoonAM,GuptaMK,Das Gupta B : Fundamentals of Statistics , Vol-I, the World
Press Pvt.Ltd., Kolakota.
3. Charles M.Grinstead and Laurie Snell, J: Introduction to Probability, American
Mathematical Society

Note: Theory paper is for 40 Marks and Internal is 10 Marks

Page 29 of 39
 B.Sc. Statistics Semester I to VI Syllabus for the Academic Year 2020-21

B.A/B.Sc. III Year VI Semester (CBCS): Statistics Syllabus

(With Mathematics Combination)
(Examination at the end of III Year VI Semester)
Paper-VII: Design of Experiments, Vital Statistics, Official Statistics and Business
Forecasting (DSC-2F)
(3 HPW with 3 Credits and 75 Marks)

Unit –I
Analysis of Variance and Design of Experiments : Concept of Gauss-Markoff linear model with
examples, statement of Cochran’s theorem, ANOVA – one-way, two-way classifications with one
observation per cell Expectation of various sums of squares, Statistical l analysis, Importance and
applications of design of experiments.

Principles of experimentation: Analysis of Completely randomized Design (C.R.D), Randomized

Block Design (R.B.D)
Unit –II
Latin Square Design (L.S.D) including one missing observation, expectation of various sum
of squares. Comparison of the efficiencies of above designs.
Official Statistics: Functions and organization of CSO and NSSO. Agricultural Statistics, area
and yield statistics. National Income and its computation, utility and difficulties in the
estimation of national income.
Business Forecasting: Role of forecasting in Business, Steps in Forecasting, Methods of
Forecasting, Choice of a method of Forecasting, Theories of Business Forecasting, Cautions
while using Forecasting Techniques.
Unit – III
Vital statistics: Introduction, definition and uses of vital statistics. Sources of vital statistics, registration
method and census method. Rates and ratios, Crude death rates, age specific death rate, standardized
death rates, crude birth rate, age specific fertility rate, general fertility rate, total fertility rate.
Measurement of population growth, crude rate of natural increase- Pearl’s vital index. Gross
reproductive rate sand Net reproductive rate, Life tables, construction and uses of life tables and
Abridged life tables.

Reference Books:
1. V.K.Kapoor and S.C.Gupta : Fundamentals of Applied Statistics. Sultan Chand
2. ParimalMukhopadhyay : Applied Statistics . New Central Book agency.
3. M.R.Saluja : Indian Official Statistics. ISI publications.
4. B.L.Agarwal: Basic Statistics. New Age publications.
5. S.P.Gupta : Statistical Methods. Sultan Chand and Sons.
6. Pratirupa Sidhanthamulu – Telugu Academy. Prayoga Rachana and Visleshana –
Telugu Academy.

Note: Theory paper is for 60 Marks and Internal is 15 Marks

Page 30 of 39
 B.Sc. Statistics Semester I to VI Syllabus for the Academic Year 2020-21

B.A/B.Sc. III Year VI Semester (CBCS): Statistics Syllabus

(With Mathematics Combination)
(Examination at the end of III Year VI Semester)
Paper-VIII A: Operations Research (DSE-2F)
(3 Hours Per Week with 3 Credits and 75 Marks)

Unit –I

Operations Research: Meaning and scope of OR. Convex sets and their properties. Definition
of general LPP. Formulation of LPP. Solution of LPP by graphical method. Statements of
Fundamental theorem of LPP and other related theorems. Simplex algorithm.
Concept of artificial variables. Big –M /Penalty method and two-phase simplex methods.
Concept of degeneracy and resolving it.
Unit –II

Concept of duality of LPP. Dual Primal relationship, Statement of Fundamental Theorem of

Duality.
Definition of transportation problem, TPP as a special case of LPP, Initial basic feasible
solutions by North-West Corner Rule, Matrix minimum method and VAM. Optimal solution
through MODI tableau and stepping stone method for balanced and unbalanced
transportation problem.

Unit –III

Degeneracy in TP and resolving it. Concept of Transshipment problem.

Formulation and description of Assignment problem and its variations. Assignment problem
as special case of TP and LPP. Unbalanced assignment problem, optimal solution using
Hungarian method and traveling salesman problem and its solution.
Problem of Sequencing. Optimal sequence of N jobs on two and three machines without
passing.

Reference Books:

1. Kanti Swaroop, P.K.Gupta and ManMohan: Operations Research. Sultan Chand.

2. S.D. Sharma: Operations Research
3. J.K. Sharma: Operations Research Theory and Applications. Macmillan Publishers India LTD.
4. Parikriya Parishodhana - Telugu Academy.

Note: Theory paper is for 60 Marks and Internal is 15 Marks

Page 31 of 39
 B.Sc. Statistics Semester I to VI Syllabus for the Academic Year 2020-21

B.A/B.Sc. III Year VI Semester (CBCS): Statistics Syllabus

(With Mathematics Combination)
(Examination at the end of III Year VI Semester)
Paper-VIII B: Bio-Statistics - II (DSE-2F)
(3 HPW with 3 Credits and 75 Marks)

Unit –I
Survival Analysis: Survival functions and hazard rates. Types of censoring and likelihood in these
cases. Life distributions - Exponential, Gamma, Weibull, Lognormal, and Pareto. Linear failure rate.
Point estimation, confidence intervals, scores, likelihood ratio, MLE, tests for these distributions.

Unit –II

Life tables, failure rates, mean residual life and their elementary properties, Ageing classes
and their properties, Bathtub failure rate. Estimation of survival function.
Acturial estimator, Kaplan-Meier estimator, estimation under the assumption of IFR/ DFR.
Tests of exponentiality against nonparametric classes, total time on test.

Unit –III

Introduction to modern epidemiology, principles of epidemiological investigation,

serveillance and disease monitoring in populations.
Epidemiologic measures: Organizing and presenting epidemiologic data, measures of disease
frequency, measures of effect and association, causation and casual inference.

Design and analysis of epidemiologic studies. Types of studies, case-control studies, cohort
studies, cross over design, regression models for the estimation of relative risk.
Meta –analysis, quantitative methods in screening.

Reference Books:

1. Cox.D.R. and Oakes.D (1984): analysis of survival data. Chapman and Hall.
2. Miller, R.G. (12981): Survival analysis. John wiley.
3. Anil gore and S.A.Paranjpe (2000). A course in mathematical and statistical ecology.
Kulwer Academic Publishers.
4. Rielon E.C (1977): An introduction to Mathematical Ecology. Wiley.
5. J.F.Lawless: Statistical models and methods of life data. Wiley.
6. James F Crow and Motoo Kimura: An Introduction to Population Genetics Theory.
Alpha edition.
7. Abraham M.Lilienfeld : Foundations of Epidemiology. Oxford University Press.
Note: Theory paper is for 60 Marks and Internal is 15 Marks

Page 32 of 39
 B.Sc. Statistics Semester I to VI Syllabus for the Academic Year 2020-21

B.A/B.Sc. III Year VI Semester (CBCS): Statistics Syllabus

(With Mathematics Combination)
(Examination at the end of III Year VI Semester)
Paper-VIII C: Actuarial Statistics - II (DSE-2F)
(3 HPW with 3 Credits and 75 Marks)

Unit –I

Elements of compound interest (nominal and effective rate of interest)

Life annuities: single payment, continuous life annuities, discrete life annuities, life annuities
with monthly payments, communication functions.

Unit –II

Varying Life annuities, recursions and complete annuities- immediate and apportioable
annuities –due.
Net premiums: Continuous and discrete premiums, true monthly payment premiums,
apportionate premiums, commutation functions, and accumulation type benefits.

Unit –III

Net premium reserves: continuous and discrete net premium reserve, reserves on a semi
continuous basis, reserves based on true monthly premiums, reserves on an apportionable or
accounted continuous basis reserves at fractional durations.

Reference Books:

1. N.L.Bowers, H.U.Gerber, J.C.Hickman, D.A.Jones and C.J.Nesbitt (1986): Actuarial

Mathematics, Society of Actuaries, Ithaca, Illinois,USA .
2. Neill,A.(1977): Life contingencies, Heineman.
3. Spurgeon E.T.(1972): Life contingencies, Cambridge University Press
4. Benjamin,B and Pollard,J.H(1980): Analysis of Mortality and other Actuarial
Statistics.
5. Federation of Insurance Institutes study courses: mathematical basis of Life
Assurance
8. F.I.21 (Published by Federation if Insurance Institutes, Bombay).

Note: Theory paper is for 60 Marks and Internal is 15 Marks

Page 33 of 39
 B.Sc. Statistics Semester I to VI Syllabus for the Academic Year 2020-21

B.A/B.Sc. III Year VI Semester (CBCS): Statistics Syllabus

(With Mathematics Combination)
(Examination at the end of III Year VI Semester)
Practical Paper-VII: Theory Paper VII and Elective VIII A (DSC-2F)
(with 2 HPW, Credits 1 and Marks 25)

Section –A
1. Analysis of CRD
2. Analysis of RBD and Comparison of RBD with CRD with and without missing observation.
3. Analysis of RBD with one missing observation and computation of Critical Difference.
4. Analysis of LSD and Comparison of LSD with RBD with CRD.
5. Analysis of LSD with one missing observation and computation of Critical Difference.
6. Computation of Morality rates and Fertility rates and Construction of complete life tables.

Section –B
7. Solution of L.P. problem by simplex method and reading the solution of the dual problem
from Optimal Simplex table.
8. Solution of L.P. problem by Big-M Method.
9. Two-phase simplex method.
10. IBFS for a transportation problem by North-West corner rule, Matrix minimum method and
Vogel’s approximation method and also Optimum solution to balanced and unbalanced
transportation problem by MODI method.
11. Optimum solution to balanced and unbalanced Assignment problem by Hungarian method
and also Solution of traveling salesman problem.
12. Computation of Optimal Sequence and idle time for N jobs on 2 and 3 machines.

Note: The question paper consists of TWO sections. Section A Consists of 2 Questions from
Section A of Practical paper VII and Section B consists of 2 questions from Section
B of Practical paper VII.

Page 34 of 39
 B.Sc. Statistics Semester I to VI Syllabus for the Academic Year 2020-21

B.A/B.Sc. III Year VI Semester (CBCS): Statistics Syllabus

(With Mathematics Combination)
(Examination at the end of III Year VI Semester)
Practical Paper-VII: Theory Paper VII and Elective VIII B (DSC-2F)
(with 2 HPW, Credits 1 and Marks 25)

Section –A
1. Analysis of CRD
2. Analysis of RBD and Comparison of RBD with CRD with and without missing observation.
3. Analysis of RBD with one missing observation and computation of Critical Difference.
4. Analysis of LSD and Comparison of LSD with RBD with CRD.
5. Analysis of LSD with one missing observation and computation of Critical Difference.
6. Computation of Morality rates and Fertility rates and Construction of complete life tables.

Section –B
7. Parameter estimation in exponential and Weibull distributions—Type-I, Type-II
censoring.
8. LR tests for exponential and Weibull distribution.
9. Actuarial method of estimation.
10. Kaplan-Meier estimator.
11. Fitting bathtub shaped hazard function.
12. Risk difference, risk ratio and odd ratio.
13. Cox Regression.

Note: The question paper consists of TWO sections. Section A Consists of 2 Questions from
Section A of Practical paper VII and Section B consists of 2 questions from Section
B of Practical paper VII.

Page 35 of 39
 B.Sc. Statistics Semester I to VI Syllabus for the Academic Year 2020-21

B.A/B.Sc. III Year VI Semester (CBCS): Statistics Syllabus

(With Mathematics Combination)
(Examination at the end of III Year VI Semester)
Practical Paper-VII: Theory Paper VII and Elective VIII C (DSC-2F)
(with 2 HPW, Credits 1 and Marks 25)

Section –A
1. Analysis of CRD
2. Analysis of RBD and Comparison of RBD with CRD with and without missing observation.
3. Analysis of RBD with one missing observation and computation of Critical Difference.
4. Analysis of LSD and Comparison of LSD with RBD with CRD.
5. Analysis of LSD with one missing observation and computation of Critical Difference.
6. Computation of Morality rates and Fertility rates and Construction of complete life tables.

Section –B
7. Computation of compound interest (nominal and effective rate of interests).
8. Annuities and annuity dues.
9. Computation of discrete and continuous net premiums.
10. Annuities payable more frequently than one year.
11. Complete and special annuities.
12. Office premium
13. Assurances payable at the moment of death.

Note: The question paper consists of TWO sections. Section A Consists of 2 Questions from
Section A of Practical paper VII and Section B consists of 2 questions from Section
B of Practical paper VII.

Page 36 of 39
 B.Sc. Statistics Semester I to VI Syllabus for the Academic Year 2020-21

B.A/B.Sc. III Year VI Semester (CBCS): Statistics Syllabus

(With Mathematics Combination)
(Examination at the end of III Year VI Semester)
Practical Paper-VIII: (Practical using MS-Excel and TORA) (DSC-2F)
(with 2 HPW, Credits 1 and Marks 25)

Operations Research:

1 Solution of L.P. problem by Graphical method.

2 Solution of L.P. problem by simplex method.
3 Solution of L.P. problem by Big-M and two-phase simplex method.
4 Optimum solution to balanced and unbalanced transportation problem using North-West
corner rule, Matrix minimum method and Vogel’s approximation method for IBFS.
5 Solution of Assignment problem for both maximization and minimization
6 Solution of travelling salesman problem.
7 Computation of Optimal Sequence and idle time for N jobs on 2 and 3 machines.

Designs of Experiments

8. Analysis of CRD
9. Analysis of RBD with and without missing observation. Comparison of RBD with CRD
10. Analysis of LSD with and without missing observation. Comparison of LSD with RBD and
CRD

Vital Statistics

11. Computation of Morality rates, Fertility rates and Reproduction rates.

12. Construction of life tables and abridged life tables.

Note 1 : Training shall be on establishing formulae in Excel cells and deriving the results.
The excel output shall be exported to MSWord for writing inferences.

Note 2 : The question paper consists of TWO sections. Section A Consists of 2 Questions
from Paper VIII Practical and Section B consists of 2 questions on MS – Excel
from Semesters II and IV respectively.

Page 37 of 39
 B.Sc. Statistics Semester I to VI Syllabus for the Academic Year 2020-21

B.A/B.Sc. III Year VI Semester (CBCS): Statistics Syllabus

(With Mathematics Combination)
(Examination at the end of III Year VI Semester)
SEC-4: Statistical Techniques in Data Mining
(2 HPW with 2 Credits and 50 Marks)
UNIT-I
Introduction: Introduction to Data mining, The nature of Data sets, Types of structure,
Models and patterns, Data mining Tasks, components of data mining algorithms, The
Interacting roles of Statistics and Data mining, Data mining: Dredging, snooping and fishing.
Data mining: Definitions, KDD vs Data mining, DBMS vs DM, other related areas, DM
Techniques, other mining problems, Issues and challenges in Data mining,
Association Rules: What is an association rule, methods to discover association rules;
Apriori Algorithm, Partition Algorithm
UNIT-II
Association Algorithms: Dynamic Item Set Counting Algorithm, FP Tree growth algorithm.
Clustering Algorithms: Introduction, Clustering Paradigm, K-Medoid Algorithm,
DBSCAN
Classification Algorithms: Introduction, Nearest Neighbor methods
Decision tree Algorithms: Introduction, Pruning technique.

Reference Books:

1. David Hand, Heikki Manila and Padhraic Smyth (2012): Principles of Data
Mining, PHI, New Delhi, (Text Book: Ch. 1, Ch. 2, Ch. 10.6)

2. Arun K Pujari (2013): Data Mining Techniques, University Press Inia private Ltd.
Third Edition. (T.B-2: (T.B.2: Ch 5.4, 5.8, Ch. 6.18).

Note: Theory paper is for 40 Marks and Internal is 10 Marks

Page 38 of 39
 B.Sc. Statistics Semester I to VI Syllabus for the Academic Year 2020-21

B.A/B.Sc. III Year: Statistics Syllabus

(Generic Elective-GE-2)
(Examination at the end of III Year, Semester VI)
GE – 2 –Basic Statistics-2 (with 2 HPW, Credits 2 and Marks 50).

Unit – I

Definition and sample examples of random variables and distribution function, probability
mass function and probability density function. Mathematical expectation and moments-
simple examples.
Discrete probability distributions: Bernoulli, Binomial, Poisson. (Concept, definition,
statements of mean and variance only) with real life examples.
Continuous probability distributions: Uniform, Normal and Exponential distributions
(concept, definition, statements of mean, variance and other properties).

Unit – II
Empirical bivariate distributions, Covariance, Karl Pearson coefficient, Rank Correlation,
Curve fitting byleast squares principle. Simple linear regression.
Concept and definition of population, parameter, sample, statistic, sampling distribution and
standard error.
Properties of Estimates: Unbiasedness, Consistency and Efficiency (concept and definition
only), simple examples.
Concept of testing Statistical hypothesis-Definition of Null and Alternative hypothesis,
Critical region, Types of errors, level of Significance and Power of a Test.
Tests of significance based on Chi-Square, t and F distributions and ANOVA (One and Two
way) with examples (No mathematical derivation only methodology).

List of reference books:

1. V.K.Kapoor and S.C.Gupta: Fundamentals of Mathematical Statistics, Sultan Chand

& Sons, New Delhi
2. GoonAM,GuptaMK,Das Gupta B : Fundamentals of Statistics , Vol-I, the World
Press Pvt.Ltd.,Kolakota.
3. Charles M.Grinstead and Laurie Snell.J: Introduction to Probability, American
Mathematical Society

Note: Theory paper is for 40 Marks and Internal is 10 Marks

Page 39 of 39