Computer Organization and Architecture (01CE0402) Lab Manual
Computer Organization and Architecture (01CE0402) Lab Manual
Faculty of Technology
(Computer Engineering/ Information Technology)
Year- 2020-21
The timing variables are mutually exclusive, which means that only one variable is equal
to 1 at any given time, while the other three are equal to 0. Draw a block diagram
showing the hardware implementation of the register transfers. Include the connections
necessary from the four timing variables to the selection inputs of the multiplexers and
to the load input of register R5.
3 Represent the following conditional control statement by two register transfer
statements with control functions.
If (P=1) then (R1R2) else if (Q = 1) then (R1 R3)
1 A digital computer has a common bus system for 16 registers of 32 bits each. The bus is
constructed with multiplexers.
1 The Micro programmed control organization shown in figure has the following
propagation delay times. 40ns to generate the next address, 10 ns to transfer the
address into the control address registers, 40 ns to access the control memory ROM, 10
ns to transfer the microinstructions into the control data register, and 40 ns to perform
the required microinstructions specified by the control word. What is the maximum clock
frequency that the control can use? What would the clock frequency be if control data
4 register is not used?
2 The control memory as in figure has 4096 words of 24 bit each.
a. How many bits are there in the control address register?
b. How many bits are there in each of the four inputs shown going into the
multiplexers?
c. What are the number of inputs in each multiplexer and how many multiplexes
are needed?
1 Using table of symbol of Binary code of instruction, give the 9 bit micro operation field
for the following micro operations:
a. AC AC+1, DRDR+1
b. PCPC+1, DR M[AR]
5
c. DRAC, ACDR
2 Using table of symbol of Binary code of instruction, convert the following symbolic micro
operations to register transfer statements and to binary.
a. READ, INCPC
b. ACTDR, DRTAC
c. ARTPC, DRTAC, WRITE
1 A bus organized CPU has 16 registers with 32 bits in each an ALU, and a destination
decoder.
a. How many multiplexers are there in the A bus and what is the size of each
multiplexer?
b. How many selection inputs are needed for MUX A and MUX B
c. How many inputs and outputs are there in decoder
d. How many inputs and outputs are there in the ALU for data, including input and
output carries?
2 Specify the control word that must be applied to the processor of ALU to implement the
following micro operations.
a. R1R2+R3
6
b. R4R4
c. R5R5-1
d. R6 SHL R1
e. R7INPUT
3 Determine the micro operations that will be executed in the processor of ALU when the
following 14 bit control words are applied.
a. 00101001100101
b. 00000000000000
c. 01001001001100
d. 00000100000010
e. 11110001110000
1 Convert the following arithmetic expression from infix to reverse polish notation.
a. A*B+C*D+E*F
b. A*B+A*(B*D+C*E)
c. A+B*[C*D+E*(F+G)]
7 d. A*[B+C*(D+E)] / F*(G+H)
2 Convert the following numerical arithmetic expression into reverse polish notation and
show the stack operations for evaluating numerical result
(3+4) [10(2+6)+8]
8 1 The memory unit of a computer has 256K words of 32 bits each. The computer has an
instruction format with four fields: an operation code field, a mode field to specify one of
seven addressing modes, a register address field to specify one of 60 processor registers,
and a memory address. Specify the instruction format and the number of bits in each
field if the in instruction is in one memory word.
1 A non-pipeline system takes 50 ns to process a task. The same task can be processed in a
six-segment pipeline with a clock cycle of 10 ns. Determine the speedup ratio of the
9 pipeline for 100 tasks. What is the maximum speedup that can be achieved?
2 Draw a space time diagram for a six segment pipeline showing the time it takes to
process eight tasks.
10 1 Determine the number if clock cycles that it takes to process 200 tasks in a six segment
pipeline.
11 1 Explain the Booth’s algorithm with the help of flowchart also show the steps for (-7) * (-
3) using Booth’s Algorithm
1 a. How many 128*8 RAM chips are needed to provide a memory capacity of 2048
bytes?
b. How many lines of the address bus must be used to access 2048 bytes of
memory? How many of these lines will be common to all chips?
c. How many lines must be decoded for chips select? Specify the size of the
12 decoders.
2 A computer uses RAM chips of 1024 * 1 capacity.
a. How many chips are needed, and how should their address lines be connected to
provide a memory capacity of 1024 bytes?
b. How many chips are needed to provide a memory capacity of 16K bytes? Explain
in words how the chips are to be connected to the address bus.