Scribd
Upload
63 views

Engineering Mathematics-III Syllabus 220902 204109

This document outlines the course Engineering Mathematics-III for the third semester of Computer Science and Electronics Engineering programs. The course aims to teach students probability theory, statistics, and their applications. It is taught over 3 hours per week with no tutorials and assessed through two midterm tests, assignments, and a final exam. The course contains 6 units covering topics like probability axioms, random variables, statistical inference, Markov chains, random processes, and queuing theory. Recommended textbooks and online resources are also listed.

Uploaded by

priyanshu rane
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
63 views

Engineering Mathematics-III Syllabus 220902 204109

This document outlines the course Engineering Mathematics-III for the third semester of Computer Science and Electronics Engineering programs. The course aims to teach students probability theory, statistics, and their applications. It is taught over 3 hours per week with no tutorials and assessed through two midterm tests, assignments, and a final exam. The course contains 6 units covering topics like probability axioms, random variables, statistical inference, Markov chains, random processes, and queuing theory. Recommended textbooks and online resources are also listed.

Uploaded by

priyanshu rane
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Engineering Mathematics-III (CSE & ECE) Sem-III

Teaching Scheme: Examination Scheme:


Lectures : 3 Hrs/week T1: 20 marks, T2: 20 marks
Tutorial : 0 Hr/week End-Sem Exam – 60 marks
Course Outcomes:
Students will be able to:
1. Solve problems related to basic probability theory
2. Solve problems related to basic concepts and commonly used techniques of statistics
3. Model a given scenario using continuous and discrete distributions appropriately and
estimate the required probability of a set of events
4. Apply theory of probability and statistics to solve problems in domains such as machine
learning, data mining, computer networks etc.
5. Demonstrate the use of R language for data analysis.

Unit I: Basic Probability Theory: Probability axioms, conditional probability, independence of


events, Bayes’ rule
[02 Hrs]
Unit II: Random Variables: Discrete and continuous random variables; distribution of a
random variable (cdf and pdf); Discrete Distributions such as Binomial, Poisson, Geometric etc.;
Continuous Distributions such as Exponential, Normal etc.; Expectation: Moments; Central
Limit theorem and its significance; Some sampling
distributions like chi-square, t, F; Markov inequality, Chebyshev inequality, and Chernoff
bound
[10 Hrs]
Unit III: Statistical Inference: Estimation - introduction, classical methods of estimation, single
sample: estimating the mean and variance, two samples: estimating the difference between two
means and ratio of two variances; Tests of hypotheses - introduction, testing a statistical
hypothesis, tests on single sample and two samples concerning means and variances; ANOVA -
One–way, Two–way with/without interactions; Covariance, correlation coefficient
[12 Hrs]

Unit IV: Discrete-time Markov Chains Definitions, examples, Time-homegenous


Markov Chains, Transition probability matrix. Recurrence time, transient and recurrent states,
classification of states (open, closed). Period of a state, stationary distributions, irreducible and
reducible Markov chains, ergodicity.
[06 Hrs]

Unit V: Random Processes


Strict Sense Stationarity, Wide Sense Stationarity. Cross-correlation and cross-covariance,
Cyclo-stationary processes, Random processes in linear systems. WSS processes in
LTI systems. [3 Hrs]

Unit VI: Introduction to Queuing Theory: Stochastic Processes, Markov Processes and
Markov Chains, Birth-Death Process, Basic Queuing Theory (M/M/-/-) Type Queues
[02 Hrs]
Text Books:
• Ronald E, Walpole, Sharon L. Myers, Keying Ye, “Probability and Statistics for
Engineers and Scientists”, Pearson, 9th edition, ISBN-13: 978-9332519084
• V. Sundarapandian, “Probability, Statistics and Queuing Theory”, PHI, 1 st edition,
ISBN13: 978-8120338449
Reference Books:
• Sheldon M. Ross, “Introduction to Probability and Statistics for Engineers and
Scientists”, Elsevier, 4th edition, ISBN-13: 978-8190935685
• Kishor Trivedi, “Probability and Statistics with Reliability, Queuing, and Computer
Science Applications”, John Wiley and Sons, New York, 2001, ISBN number 0-471-
33341-7

Useful links/web resources:


• http://nptel.ac.in/courses/117103017/
• Introduction to R for Data Science on edX

You might also like