Code No: RR411501

Set No. 1

IV B.Tech I Semester Supplementary Examinations, February 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 Geometric distribution. Find PGF of Geometric distribution. (b) Define modified Geometric distribution. Find PGF of modified Geometric distribution. [8+8] 2. (a) Define moment of a random variable x. Explain. (b) Explain coefficient of variation of a random variable x. (c) State and prove the theorem of linear translation. [8+4+4]

3. (a) Define stochastic processes and explain classification of stochastic process. (b) Define and explain strictly stationary process. 4. (a) Define and explain irreducible Markov chain. (b) Differentiate a periodic state and absorbing state. (c) Consider a cascade of binary communication channel. Assume a=1/4 and b=1/2 find out p(n). [4+4+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. (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. Define skewing degree. Explain skewed memory allocation scheme for the prime memory. [16] 8. (a) Explain Routing mechanism in HEP. (b) Explain in detail how protection mechanism is implemented in HEP. ⋆⋆⋆⋆⋆ [8+8] [8+8]

1 of 1

Code No: RR411501

Set No. 2

IV B.Tech I Semester Supplementary Examinations, February 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. 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] [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. 5. (a) Draw and explain the state diagram the two stage tandem network. (b) A repair facility shared by a large number of machines has two sequential stations with respective rates one per hour and two per hour. The cumulative failure rate of all the machines is 0.5 per hour. Assume the system behavior may be approximated by the two stage tandem queue. Determine the average repair time. [8+8] 6. (a) Differentiate array and associate processors. (b) Based on space how array processors are classified. Explain with examples. [8+8] 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. Explain the internal logical structure of the S-1 Mark II-A uni processor. ⋆⋆⋆⋆⋆ [8+8] [16] [8+8]

1 of 1

Code No: RR411501

Set No. 3

IV B.Tech I Semester Supplementary Examinations, February 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. 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. Explain the key renewal theorem. 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. (a) Differentiate array and associate processors. (b) Based on space how array processors are classified. Explain with examples. [8+8] 7. Draw the functional Scheme of PE in MPP explain each component. 8. (a) Explain Routing mechanism in HEP. (b) Explain in detail how protection mechanism is implemented in HEP. ⋆⋆⋆⋆⋆ [8+8] [16] [16] [8+8]

1 of 1

Code No: RR411501

Set No. 4

IV B.Tech I Semester Supplementary Examinations, February 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 independent Random Variable explain mutually independent and pair wise independent random variables. (b) Define PDF of a continuous random variable x. Explain its properties. [8+8] 2. (a) Define moment of a random variable x. Explain. (b) Explain coefficient of variation of a random variable x. (c) State and prove the theorem of linear translation. [8+4+4]

3. (a) Explain the notation Fy /Fx /m to describe the queuing system with examples. (b) Define and explain renewal counting process. 4. (a) Derive Chapman – Kol Mogorov equitation. (b) Define i. Transient state ii. Recurrent state [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] [8+8]

7. Define skewing degree. Explain skewed memory allocation scheme for the prime memory. [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

Master your semester with Scribd & The New York Times

Special offer for students: Only $4.99/month.

Master your semester with Scribd & The New York Times

Cancel anytime.