Unit
– 1
Part – A
1)
Explain: Seek time
2)
Explain: Latency Time
3)
Explain: Transfer Time
4)
Explain: Memory access time
5)
Differentiate: Static and Dynamic Ram
6)
What is Control Word
7)
Define: DRO (Destructive Read Out)
8)
Define: NDRO (Non-Destructive Read out)
9)
Define: Micro operation
10)
Define: Micro routine
11)
Define control word
12)
Define Bit-oring in miroprogrammed routine
13)
Explain ENIAC &UNIAC
14)
Write short notes on: Locality of reference.
15)
What are the differences between I/O mapped I/O
and memory mapped I/O?
Part – B
16)
Explain in detail about Micro program control
and Hardwired control
17)
Different Addressing mode
18)
Micro operation for the given instruction
(Example ADD, SUB, etc.,)
19)
Explain: Bus Architecture
20)
Explain: Static and Dynamic RAM with neat
diagram
21)
Describe
Von Neuman Architecture with neat diagram
22)
Explain the stack organization with diagram and
example
23)
Explain the basic functional units of the
Computer with neat diagram
24)
Explain different generation of computers
25)
Explain the general purpose register
organization
26)
Explain the Processor organization organization
27)
Explain the common memory hierarchies.
28)
Explain
how I/O operations are performed under programmed I/O.
29)
Describe
the process of transferring data between I/O and MM using DMA
30)
Explain
how to transfer data using interrupts.
31)
Explain
all the address translation techniques.
32)
Write
detailed notes on: Cache memory.
33)
Give a
detailed account on: IOP.
34)
Explain i) Direct Mapping ii) Associative
Mapping iii) Set Associative addressing
Unit
– 2
Part – A
1)
Explain the elements of modern computer system
2)
Explain the Flynn’s classification
3)
Explain the two types of parallel computers
4)
Write down the performance equation
5)
Explain the system attributes
6)
Explain: Five types of data dependencies.
7) Explain about Bensteins' condition for parallelism
8) Differentiate about data flow and control flow
9) Explain: Demand driven mechanisms
10) Discuss the operational model of an SIMD
11) What is dependence graph? Explain with an
example
12) What is grain size or granularity?
Part – B
13)
Describe the Evolution of computer Architecture
14)
Explain briefly about Implicit and Explicit
Parallelism
15)
Explain: Evolving Performance factor
16)
Explain briefly about Flynn’s Classification
17)
Explain: SIMD Architecture
18)
Explain: MIMD Architecture
19)
Explain: UMA, NUMA, COMA models
20)
Discuss about Distributed Memory in
multicomputer environment
21)
Discuss the Vector supercomputers with neat
diagram
22)
Explain the SIMD machine model with neat diagram
23)
Discuss Architecture and development tracks with
neat diagram
24)
Discuss: Three types of data dependencies , flow
architecture
25)
Discuss: Hardware and Software parallelism
26)
Explain various processing level in parallelism
27)
Explain the dataflow architecture with neat
diagram
Unit
- 4
Part - A
28)
What is Vector and Vectorization?
29)
Define: Vector Instruction types
30)
Define: Gather, Scatter, Masking
31)
Explain Vector memory access organization
32)
Explain Relative Vector and Scalar performance
equation
33)
Define: Distributed memory model of SIMD
34)
Define: Shared memory model of SIMD
35)
Define SIMD instruction set with example
36)
Explain : SIMD architecture
37)
Explain: SIMD parallel Architecture
38)
What is stride?
Part - B
39)
Explain briefly about Vector instruction types
40)
Explain briefly about Vector memory access
architecture
41)
Explain in detail about SIMD architecture
42)
Discuss: SIMD Instruction types with an
examples.
43)
Discuss : SIMD parallel Algorithm
44)
Explain the performance factor of SIMD computer
45)
Explain the compound vector processing
No comments:
Post a Comment