Term-End Examination
December, 2006
CS-64 : INTRODUCTION TO COMPUTER ORGANISATION
Time : 3 hours Maximum Marks : 75
Note : Question number 1 is compulsory. Answer any three questions from the rest.
1. (a) A machine uses a 32-bit two's complement representation for integers. What is the largest integer
that can be represent ed ? (2)
(b) What is the smallest integer that can be represented ? (2)
(c) How many different integers are represented ? (2)
(d) Give reasons why an ADD instruction that is part of a stack-based instruction set would be smaller
(require fewer bits to encode) than an ADD instruction in a general purpose instruction set architecture.(4)
(e) Convert the two's complement number 1101 1010 to decimal equivalent.(2)
(f) Simplify the following Boolean function using sum of product form, by K-map :(6)
F(A, B, C, D) : ) (0, 2, 4, 6, 9, 12, 14)
and design the circuit.
(g) Assume that in a 8086 microprocessor the registers have following values :(6)
BX : 6788H
SI: 23A4H
Offset/displacement : 8085H
Find the effective address using the above data for
the following addressing modes :
(i) Register Indirect Addressing (using SI)
(ii) Register Addressing (using BX)
(iii) Displacement Addressing using base register BX
(iv) Based-lndex Relative Addressing of 8086 microprocessor
(h) Why is a multiplexer required ? How is it different from a decoder ? Draw the circuit diagram of a 4 x 1 multiplexer and a 2 x 4 line decoder with enable input and also give the corresponding truth tables.(6)
2. (a) Why is parity bit required ? How is it used in correcting single bit errors ? Explain it with the help of an example. How do you determine size of SEC Code for 32 bit of data ?(5)
(b) Show that NOR is a functionally complete set of gates. (5)
(p) Design and draw a 4 bit Adder.(5)
3. (a) Design a 4 bit ripple counter using J-K flip flops. (4)
(b) Differentiate among different.levels of RAID. (5)
(c) Write an 8086 assembly language program to compare two strings.(6)
4. (a) Design a floating print number format for the following requirements :
base 2
possible maximum number 1 x 1015
possible minimum number -1x 1015
The mantissa of number should be large enough to support at least two equivalent decimal digits after the decimal point correctly. The number should be represented in normalized form. The exponent should be biased exponent. (6)
(b) Write an assembly program for evaluating A + B x C/D E using one address instructions . (6)
(c) Why are coprocessors required ? Draw a general structure of CPU-coprocessor.(3)
5. (a) Compare Polling and Daisy chaining mechanisms of arbitration and explain them with the help of a diagram.(5)
(b) Differentiate between Associative memory versus Interleaved memory.(5)
(c)Explain logic micro-operations and their implementation on at least two inputs.(5)