Professional Documents
Culture Documents
MATHEMATICAL FOUNDATIONS FOR COMPUTER SCIENCE Paper
MATHEMATICAL FOUNDATIONS FOR COMPUTER SCIENCE Paper
MATHEMATICAL FOUNDATIONS FOR COMPUTER SCIENCE Paper
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
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
***
Page 2 of 2