You are on page 1of 4

Code No: RR411501 Set No.

1
IV B.Tech I Semester Regular Examinations, November 2007
PERFORMANCE EVALUATION OF COMPUTER SYSTEMS
(Computer Science & Systems Engineering)
Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
⋆⋆⋆⋆⋆

1. (a) State the theorem of total probability. Explain.


(b) Explain Baye’s rule.
(c) A packet takes either link L1 or L2 with probabilities P1 , P2 . The links have
it error probabilities b1 and b2 . What is the probability of transferring good
packet. [4+4+8]

2. (a) Define MTTF of the component. If component life time is exponentially dis-
tributed find out MTTF of component.
(b) Find MTTF of TMR / Simplex system. [8+8]

3. (a) Explain the notation Fy /Fx /m to describe the queuing system with examples.
(b) Define and explain renewal counting process. [8+8]

4. Draw the state diagram of the discrete parameter birth – death process and compute
the steady state probability vector V. [16]

5. (a) Explain the difference between open queue network and closed queue network.
(b) Define Jackson technique. Draw the open network with feed back final out its
equalant network without feedback and also draw the state diagram. [8+8]

6. (a) Draw the internal structure of PE in Illiac IV explain.


(b) Draw the functional block diagram of Illiac IV control unit explain each block.
[8+8]

7. Draw the functional Scheme of PE in MPP explain each component. [16]

8. (a) Write short notes on exploratory systems.


(b) Write short notes on commercial multi processor. [8+8]

⋆⋆⋆⋆⋆

1 of 1
Code No: RR411501 Set No. 2
IV B.Tech I Semester Regular Examinations, November 2007
PERFORMANCE EVALUATION OF COMPUTER SYSTEMS
(Computer Science & Systems Engineering)
Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
⋆⋆⋆⋆⋆

1. (a) What are the main performance measures of a computer systems?


(b) Explain three approaches to evaluate a computer systems. [8+8]

2. (a) Define MTTF of the component. If component life time is exponentially dis-
tributed find out MTTF of component.
(b) Find MTTF of TMR / Simplex system. [8+8]

3. (a) Explain the notation Fy /Fx /m to describe the queuing system with examples.
(b) Define and explain renewal counting process. [8+8]

4. (a) Define Markov chain. Distinguish between discrete parameter Markov chain
and continuous parameter Markov chain.
(b) Derive stochastic matrix for one step transition probabilities. [8+8]

5. (a) Explain the difference between open queue network and closed queue network.
(b) Define Jackson technique. Draw the open network with feed back final out its
equalant network without feedback and also draw the state diagram. [8+8]

6. Draw the 64 PE Illiac IV array explain its architecture. [16]

7. Define skewing degree. Explain skewed memory allocation scheme for the prime
memory. [16]

8. (a) Explain the instruction pipe line in S – 1.


(b) Explain Amber operating system. [8+8]

⋆⋆⋆⋆⋆

1 of 1
Code No: RR411501 Set No. 3
IV B.Tech I Semester Regular Examinations, November 2007
PERFORMANCE EVALUATION OF COMPUTER SYSTEMS
(Computer Science & Systems Engineering)
Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
⋆⋆⋆⋆⋆

1. (a) Define CDF of a continuous random variable x. Explain its properties.


(b) The time (measured in years)x, required to complete a software project has a
kx (1 − x) 0 < x <
pdf of the random fx (x) = find the value of k and
0 other wise
the probability that the project will be completed less than 4 months. [8+8]

2. (a) Define expectation of a random variable x and explain.


(b) Let x be a continuous random variable with an exponential density given by:
f(x) = λ.e−λx x > 0. [8+8]

3. (a) Define stochastic processes and explain classification of stochastic process.


(b) Define and explain strictly stationary process. [8+8]

4. (a) Define a stationary probability vector of the Markov chain.


(b) Consider a communication net consisting of a cascade of binary communication
channels with the matrix P given by
i. find the average number of stages over with a 0 can be transmitted without
an error.
ii. Find the average number of stages over a ‘1’ can be transmitted without
an error. [4+6+6]

5. (a) Explain the difference between open queue network and closed queue network.
(b) Define Jackson technique. Draw the open network with feed back final out its
equalant network without feedback and also draw the state diagram. [8+8]

6. Explain BSP prime memory system. [16]

7. (a) Explain the control unit of the PE array in MPP.


(b) How PE and RAM chips are inter connected in the MPP array. [8+8]

8. (a) Explain the lock systems of Hydra operating system.


(b) Explain semaphore mechanism of Hydra. [8+8]

⋆⋆⋆⋆⋆

1 of 1
Code No: RR411501 Set No. 4
IV B.Tech I Semester Regular Examinations, November 2007
PERFORMANCE EVALUATION OF COMPUTER SYSTEMS
(Computer Science & Systems Engineering)
Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
⋆⋆⋆⋆⋆

1. (a) Define CDF of a continuous random variable x. Explain its properties.


(b) The time (measured in years)x, required to complete a software project has a
kx (1 − x) 0 < x <
pdf of the random fx (x) = find the value of k and
0 other wise
the probability that the project will be completed less than 4 months. [8+8]

2. (a) Define and explain conditional expectation.


(b) Consider a series system of two independent components with the respective
life distributions x – Exp (x1 ) and y – Exp (x2 ). Determine the probability
that component 2 is the cause of system failure. [8+8]

3. (a) Define stochastic processes and explain classification of stochastic process.


(b) Define and explain strictly stationary process. [8+8]

4. (a) Define Markov chain. Distinguish between discrete parameter Markov chain
and continuous parameter Markov chain.
(b) Derive stochastic matrix for one step transition probabilities. [8+8]

5. (a) Explain the difference between open queue network and closed queue network.
(b) Define Jackson technique. Draw the open network with feed back final out its
equalant network without feedback and also draw the state diagram. [8+8]

6. Explain BSP prime memory system. [16]

7. Draw the functional Scheme of PE in MPP explain each component. [16]

8. (a) Draw the computer module of the C.mmp explain each block?
(b) Explain the functions of inter processor bus. [8+8]

⋆⋆⋆⋆⋆

1 of 1