Computer Organization and Architecture: Time Allotted: 3 Hrs Full Marks: 70
Computer Organization and Architecture: Time Allotted: 3 Hrs Full Marks: 70
Group – A
(Multiple Choice Type Questions)
CSEN 2202 1
B.TECH/CSE/CSE(AI&ML)/CSE(DS)/4TH SEM/CSEN 2202/2023
(ix) The Exchange function E(an-1 …. a1a0) is mathematically given by
(a) an-2 …. a1a0 an-1 (b) a’n-1 …. a1a0
(c) a0anan-1 …. a1 (d) an-1 …. a1a’0
Where a0,a1,a2, …., an are binary numbers and the symbol (’) denotes the
complement
(x) From the entry in a segment table, it is understood that the segment #0 has a
base address 220 and length 400 words and the segment #1 has a base address
1000 and length 100 words. What are the physical addresses corresponding to
the logical addresses Segment #0, Offset = 128 and Segment #1, Offset = 130
respectively?
(a) 348, 1130 (b) TRAP, 1130
(c) 348, TRAP (d) 1128, 350
Group- B
3. (a) In a PC-relative addressing mode, there is a “BR 15” instruction at the word
address 102 F16 of the memory. If the instruction length is 1 word, what will be
the content of the Program Counter after execution of the instruction? (Assume
the number 15 in the instruction is in decimal). [(CO1)(Analyse/IOCQ)]
(b) Why Indexed Addressing Mode is useful? [(CO1)(Understand/LOCQ)]
(c) (i) Which type of Instruction Set Architecture does a RISC have?
(ii) RISC computers are less costly compared to CISC. Why?
[(CO1)(Understand/LOCQ)]
(d) In the following instructions, the destination is at the left of the source registers/
memory locations/ data. Initially, registers R1 and R2 contain 800 and 700
respectively. Memory location 1000 contains 600. Assuming all the number
given are in decimal, find out the contents of the (i) registers R2, R3 and R4,
after execution of the instructions, (ii) effective address of the memory operand
for the LOAD instruction and the (iii) addressing modes in case of each of the
following instructions?
MOVE R4, #150
LOAD R3, 50(R1, R4)
ADD R2, R3. [(CO1)(Evaluate/HOCQ)]
2 + 1 + 2 + 7 = 12
CSEN 2202 2
B.TECH/CSE/CSE(AI&ML)/CSE(DS)/4TH SEM/CSEN 2202/2023
Group - C
4. (a) (i) State one reason why Write-back policy is better than Write-through Policy.
(ii) “In case of Direct Mapping Cache, no replacement policy is required”. Justify.
[(CO3)(Understand/LOCQ)]
(b) Briefly describe, with example, one software technique to reduce Cache Miss
Rate. [(CO3)(Remember/LOCQ)]
(c) A computer has 64 K Words of main memory and 1K Words of cache. The block
size is 128 words.
(i) Find out the number of cache lines and the number of memory blocks.
(ii) Draw the address partition, clearly showing the tag bits, cache line bits, and
word offset bits for a direct mapped cache. [(CO3)(Analyze/IOCQ)]
(d) Consider the following Segment Table.
Segment # Base Address Segment Length
0 31916 6916
1 123416 ADD16
Find out the physical addresses corresponding to the following logical addresses?
(i) 0, 4316 (ii) 1, BAD16. [(CO3)(Evaluate/HOCQ)]
(e) Mention the steps followed by the CPU, when an external device interrupts the
CPU. [(CO4)(Understand/IOCQ)]
(1 + 1) + 3 + 3 + 2 + 2 = 12
Group - D
6. (a) Consider the following Reservation Table.
1 2 3 4 5 6
S1 X X
S2 X X
S3 X X
(i) Draw a neat diagram of the corresponding Pipelined processor, showing
the input, output and various stages alongwith the interconnection between
the stages.
(ii) Determine the set of Forbidden Latencies, and the Initial Collision Vector.
CSEN 2202 3
B.TECH/CSE/CSE(AI&ML)/CSE(DS)/4TH SEM/CSEN 2202/2023
(iii) Draw the state diagram for scheduling the pipeline, showing the steps for at
least one state.
(iv) List all simple cycles and point out the Greedy cycle.
(v) Determine the Minimum Average Latency (MAL) of the pipeline? Find out
the lower and upper bounds of MAL. [(CO2,CO6)(Create,Evaluate/HOCQ)]
2 + 2 + 3 + 2 + 3 = 12
Group - E
8. (a) Illustrate the necessity of data routing in an array processor by showing the
execution details to compute
S(k) = 𝑘𝑖=0 𝐴𝑖 for k = 0, 1, ……, (n-1). [(CO6)(Analyse/IOCQ)]
(b) Consider two sorted sequences {10, 21, 47, 89} and {19, 35, 63, 72}. Load these
numbers on a linear array of 8 Processing Elements (PEs). With the help of
diagrams, show the various operations performed in the Batcher’s odd-even
merge sort algorithm to sort these numbers in ascending order.
[(CO6)(Apply,Analyse/IOCQ)]
(c) Taking an example, show how a perfect shuffle can be implemented by a
sequence of ‘Interchange’ operations. [(CO6)(Analyse/IOCQ)]
5 + 5 + 2 = 12
9. (a) Describe the Omega and Crossbar interconnection network with diagram.
[(CO5)(Understand/LOCQ)]
(b) State the factors which affect the performance of an interconnection network.
[(CO5)(Analyze/IOCQ)]
8 + 4 = 12