Scribd
Upload
61 views2 pages

MATHEMATICAL FOUNDATIONS FOR COMPUTER SCIENCE Paper

This document contains information about the units and questions for a 3-hour exam on the mathematical foundations of computer science. It includes 6 units covering topics like Markov chains, probability distributions, estimators, graph theory, arrangements, and applications of computer science concepts. Students must answer one question from each unit, with each question worth 10 marks. The questions involve proving properties of Markov chains, determining probability mass functions, analyzing estimators, proving graph properties, and counting arrangements under certain conditions.

Uploaded by

Amrutha Tarigopula
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
61 views2 pages

MATHEMATICAL FOUNDATIONS FOR COMPUTER SCIENCE Paper

This document contains information about the units and questions for a 3-hour exam on the mathematical foundations of computer science. It includes 6 units covering topics like Markov chains, probability distributions, estimators, graph theory, arrangements, and applications of computer science concepts. Students must answer one question from each unit, with each question worth 10 marks. The questions involve proving properties of Markov chains, determining probability mass functions, analyzing estimators, proving graph properties, and counting arrangements under certain conditions.

Uploaded by

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

MATHEMATICAL FOUNDATION OF COMPUTER SCIENCE

(Common to CSE and SE)


Time: 3Hours Max. Marks: 60M
****
Answer any ONE from each UNIT
Each Question carries 10 Marks

UNIT-I
1. Assume that a computer system is in one of three states: busy, idle, or undergoing repair, respectively
denotes the states 0, 1, and 2. Observing its state at 2 P. M. each day, we believe that the system
approximately behaves like a homogeneous Markov Chain with the transition probability matrix:

( )
0.6 0.2 0.2
P= 0.1 0.8 0.1
0.6 0.0 0.4
Prove that the chain is irreducible, and determine the steady-state probabilities.
OR
2. Discuss about parametric families of distributions with suitable illustrations.

UNIT-2
3. A mischievous student wants to break into a computer file, which is password-protected. Assume that there
are n equally likely passwords, and that student chooses passwords independently and at random and tries
them. Let N n be the number of trials required to break into the file. Determine the p. m. f. of N n
(a) if unsuccessful passwords are not eliminated from further selections, and
(b) if they are.
OR
4. Analyze methods of moments and maximum likelihood estimators with suitable examples.

UNIT-3

5. Illustrate about regression , classification and principal component analysis.


OR
6. Show that the method-of-moments estimators of the population mean and of the population variance are
( n−1 ) S 2
given by the sample mean, X and , respectively. Show that the method-of-moments estimator of the
n
population variance is biased.
UNIT-4

7. Prove that K5 is non-planer with different illustrations.

OR
8. How many arrangements of the letters in PEPPERMILL are there with.
a) The M appearing to the left of all the vowels?
b) The first P appearing before the first L?

UNIT-5

Page 1 of 2
9. Explain briefly the applications of computer science and engineering in Network protocols, Computer
security
OR
10. Explain briefly the applications areas such as Bioinformatics, Computer architecture

UNIT-6

11. Apply mathematical concepts in the field of soft computing


OR
12. Illustrate the usage of distribution functions in the computer science fields with an example

***

Page 2 of 2

You might also like