Question Papers and Solutions




CS-12 : Computer Architecture of December 1999

Filed under: IGNOU MCA  

Question Paper of CS-12 : Computer Architecture of December 1999

Qns 1.(i) Draw a table showing performance factors versus system attributes and explain them.

(ii) A 50 MHz processor was used to execute a benchmark program with the following instruction and clock cycles counts.

Instruction type Instruction count Clock cycles count
Integer Arithmetic 45000 1
Data transfer 32000 2
Floating point 15000 2
Control transfer 8000 2

Determine the effective CPI, MIPS rate and execution time for this program.

(iii) What cause a processor pipeline to be underpipelined?

(iv) What are the factors limiting the degree of superscalar design?

(v) Illustrate a diagram showing asynchronous bus timing using a four edge handshaking (interlocking ) with variable length signals for different speed devices.

Qns 2.(i) Draw a comparison table of Control-flow, Data flow and Reduction computers explaining the following:
· Basic definition
· Advantages
· Disadvantages

(ii) Describe the important characteristics of static connection networks.

Qns 3(i) Provide several definitions of scalability. Sketch diagrams for scalability matrices and programmability vs scalability and explain them in detail.

(ii) What are tradeoffs in scalability analysis?

Qns 4.(i) Explain the following terms associated with cache design
· Write through Vs Write-back catches
· Cacheable Vs Non-cacheable data
· Private catch Vs Shared cache
· Cache flushing policies

(ii) With each cache organization explain the effects of block mapping policies on the hit ratio issues.

Qns 5. Discuss the following with proper examples and illustrations as applied to superscalar pipeline design:
· Superpipeline structure
· Data dependence
· Pipeline stalling

Qns 6. Explain the following terms associated with Multiprocessors and Multi computers:

· Buffer deadlock vs Channel deadlock
· Buffer flow control using virtual cut-through routing
· Blocking flow control in wormhole routing
· Network communication latency
· Network partitioning for multicasting communications






Related Posts to: CS-12 : Computer Architecture of December 1999

CS-12 : Computer Architecture of December 1997

Question Paper of CS-12 : Computer Architecture of December1997 Qns 1.(a) Analyse the data dependence of the statements of the following program: S1 : LOAD R1, 1000 / R1ß1000 / S2 : LOAD

CS-12 : Computer Architecture of June 1998

Question Paper of CS-12 : Computer Architecture of June 1998 Qns 1. (a) What is superpipelining? How is it different from Superscalar pipeline? (b) Analyse the data dependence of the statements of

CS-12 : Computer Architecture of June 1999

Question Paper of CS-12 : Computer Architecture of June 1999 Qns 1.(a) Compare dynamic connection networks such as bus systems, multistage interconnection networks and crossbar switch networks in terms of the

CS-12 : Computer Architecture of Decemer 2000

Question Paper of CS-12 : Computer Architecture December 2000 Qns 1. (i) Consider a catch (M1) and memory (M2) hierarchy with the following characteristics: M1: 16 K words, 50 ns access

CS-12 : Computer Architecture of June 1977

Question Paper of CS-12 : Computer Architecture of June 1997> Qns No. 1. (a) Compare and contrast the characteristics of control flow versus Data flow computers. (b) What is meant by Superscalar

CS-12 : Computer Architecture of December 1998

Question Paper of CS-12 : Computer Architecture of December 1998 Qns 1.(a) Explain in brief how instruction set, compiler technology, cache and memory hierarchy and CPU implementation affect the CPU performance

CS-12 : Computer Architecture of June 2001

Question Paper of CS-12 : Computer Architecture of June 2001 Qns 1. (i) Consider a catche (M1) and memory(M2) hierarchy with the following characteristics : M1 : 16 K words, 50

CS-12 : Computer Architecture of January 2001

Question Paper of CS-12 : Computer Architecture of January 2001 Qns 1(i) The execution times (in seconds) of four programs on three computers are given below: Execution Time (in seconds) Program Computer A

CS-12 : Computer Architecture of June 2002

Question Paper of CS-12 : Computer Architecture of June 2002 Qns 1. (i) Consider the execution of the following code segment. Use Bernstein’s condition to detect the maximum parallelism embedded in

CS-12 : Computer Architecture of December 2001

Question Paper of CS-12 : Computer Architecture December 2001 Qns 1. (i) What are the design parameters for pipeline processors? Discuss them briefly with examples. 5 (ii) Discuss the structure of superscalar





Submit

Contact Us



Search



Categories


Archives


Other Details


Links Listing
Gasket Supplier in Delhi
Lawyer in Gurgaon