## Are you sure?

This action might not be possible to undo. Are you sure you want to continue?

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) Deﬁne Geometric distribution. Find PGF of Geometric distribution. (b) Deﬁne modiﬁed Geometric distribution. Find PGF of modiﬁed Geometric distribution. [8+8] 2. (a) Deﬁne moment of a random variable x. Explain. (b) Explain coeﬃcient of variation of a random variable x. (c) State and prove the theorem of linear translation. [8+4+4]

3. (a) Deﬁne stochastic processes and explain classiﬁcation of stochastic process. (b) Deﬁne and explain strictly stationary process. 4. (a) Deﬁne and explain irreducible Markov chain. (b) Diﬀerentiate a periodic state and absorbing state. (c) Consider a cascade of binary communication channel. Assume a=1/4 and b=1/2 ﬁnd out p(n). [4+4+8] 5. (a) Explain the diﬀerence between open queue network and closed queue network. (b) Deﬁne Jackson technique. Draw the open network with feed back ﬁnal 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. Deﬁne 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) Deﬁne 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) Deﬁne stochastic processes and explain classiﬁcation of stochastic process. (b) Deﬁne and explain strictly stationary process. [8+8] [8+8]

4. (a) Deﬁne 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) Diﬀerentiate array and associate processors. (b) Based on space how array processors are classiﬁed. 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) Deﬁne 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) Deﬁne 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. ﬁnd 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 diﬀerence between open queue network and closed queue network. (b) Deﬁne Jackson technique. Draw the open network with feed back ﬁnal out its equalant network without feedback and also draw the state diagram. [8+8] 6. (a) Diﬀerentiate array and associate processors. (b) Based on space how array processors are classiﬁed. 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) Deﬁne independent Random Variable explain mutually independent and pair wise independent random variables. (b) Deﬁne PDF of a continuous random variable x. Explain its properties. [8+8] 2. (a) Deﬁne moment of a random variable x. Explain. (b) Explain coeﬃcient 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) Deﬁne and explain renewal counting process. 4. (a) Derive Chapman – Kol Mogorov equitation. (b) Deﬁne i. Transient state ii. Recurrent state [8+8] 5. (a) Explain the diﬀerence between open queue network and closed queue network. (b) Deﬁne Jackson technique. Draw the open network with feed back ﬁnal out its equalant network without feedback and also draw the state diagram. [8+8] 6. Explain BSP prime memory system. [16] [8+8]

7. Deﬁne 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

- Queueing Systems Volume 1 Theory - Kleinrock - Wiley - 1975uploaded byVivek Mohan
- Skill Matrixuploaded byAnish Nair
- Queueing Systems.pdfuploaded bymamashaly
- Modeling of Drilling Operationuploaded byNirwana Sembilan Benua
- LIFO policy for Perishable Inventory systems under fuzzy environmentuploaded byIJSRP ORG
- 01621112(Packet Delay in Ocs)uploaded byssuetengineer
- Estimations of Parameters in a Three State Reliability Semi Markov Model 2004 Applied Mathematics and Computationuploaded byCruzOrtiz
- markov-chainsuploaded byelgianka
- A Study on the Quality of Credit Leasinguploaded bysuperpekok
- nomor 19uploaded byHendy Kurniawan
- Unit 4uploaded byKrishna Raaj
- Probability Questionsuploaded byahmadnawaaz
- Igor Farkasuploaded byPrayag Gowgi
- Lyapunovuploaded byMichael Pearson
- OCR Wiley - Kleinrock - Queueing Systems (1975)uploaded bylcallesar
- Framework for Developing Scientific Applications: Solving 1D and 2D Schrodinger Equation by using Discrete Variable Representation Methoduploaded byBojana Koteska
- The Calendaruploaded byJack Fielding
- Full Body Gesture Recognition Method for Indonesian Traditionaluploaded byEry Muchyar
- 1% 2014 Deprivayion-XU MultiDimensionalDeprivationuploaded byAlexandra Ioana Rotaru
- Multiple Choice Question 101 120 06 Sep16uploaded byAiDLo
- Crowdfunding quantification and social mediauploaded byMax Valentin
- 6755065uploaded bywoodlandsoup7
- Fuzzy Logicuploaded bybeesah
- Auto Correlations in Hybrid Monte Carlo Simulationsuploaded byadam_s_burgess
- kldemonewuploaded byRadhika Kalawat
- Manpower Supplyuploaded byshipraasrivastav
- Hungarian Algorithm for Excel_VBAuploaded byYinghui Liu
- 3rdreviewuploaded byEzhilarasi Periyathambi
- onehotuploaded byPrashanth Mohan
- Vitali et. all.pdfuploaded byBlaber

- r05320403 Microwave Engineeringuploaded bySrinivasa Rao G
- 41 Mca Nr Software Engineeringuploaded bySrinivasa Rao G
- 42 Mca Nr Programming in Javauploaded bySrinivasa Rao G
- r6 42 Mca Advanced Java Programming Set1uploaded bySrinivasa Rao G
- 43-Mca-Or-Design and Analysis of Algorithmuploaded bySrinivasa Rao G
- r6 43 Mca Data Warehousing and Mining Set1uploaded bySrinivasa Rao G
- 41 Mca or Software Engineeringuploaded bySrinivasa Rao G
- r5 402 Mba Management of Technology Set1uploaded bySrinivasa Rao G
- 41 Mca Nr Software Engineeringuploaded bySrinivasa Rao G
- r5 401 Mba Strategic Management Set1uploaded bySrinivasa Rao G
- r05320205 Switchgear and Protectionuploaded bySrinivasa Rao G
- r05320305 Design of Machine Members IIuploaded bySrinivasa Rao G
- 43-Mca-Or-Design and Analysis of Algorithmuploaded bySrinivasa Rao G
- Rr322305 Immunologyuploaded bySrinivasa Rao G
- r5 401 Mba Strategic Management Set1uploaded bySrinivasa Rao G
- r6 34 Mca Management Information Systems Set1uploaded bySrinivasa Rao G
- r6 43 Mca Data Warehousing and Mining Set1uploaded bySrinivasa Rao G
- r6 33 Mca Unix Networks Programming Set1uploaded bySrinivasa Rao G
- r6 48 Mca Mobile Computing Set1uploaded bySrinivasa Rao G
- r5 304 Mba Enterprise Resource Planninguploaded bySrinivasa Rao G
- r5 305 Mba Retailing Management Set1uploaded bySrinivasa Rao G
- Nr-35-Mca-Design and Analysis of Algorithmuploaded bySrinivasa Rao G
- r6 47 Mca Distributed Operating Systems Set1uploaded bySrinivasa Rao G
- Or 32 Mcacomputer Communication Networksuploaded bySrinivasa Rao G
- r5 410 Mba Management of Change Set1uploaded bySrinivasa Rao G
- Or 34 Mca Management Information Systemsuploaded bySrinivasa Rao G
- Nr 31 Mca Database Management Systemsuploaded bySrinivasa Rao G
- Nr 302 Mba Cost and Management Accounting Set1uploaded bySrinivasa Rao G
- r5 408 Mba Decision Support Systems Set1uploaded bySrinivasa Rao G
- Nr 305 Mba Retailing Management Set1uploaded bySrinivasa Rao G

Read Free for 30 Days

Cancel anytime.

Close Dialog## Are you sure?

This action might not be possible to undo. Are you sure you want to continue?

Loading