Programme Code : MCA
Course Code : MCS-012
| More

Year : 2012 Views: 882 Submitted By : ANEETTA ANTONY On 10th March, 2013

Do you have solution for this Question. If yes    I aslo want solution.

Q.


Question 1 (covers Block 1)

(a) Perform the following arithmetic operations using binary signed 2âs

complement notation for integers. You may assume that the maximum

size of integers is of 12 bits including the sign bit. (Please note that the

numbers given here are in decimal notation) (3 Marks)

i) Add – 512 and 298

ii) Subtract 512 from – 64

ii) Add 1025 and 1023

Please indicate the overflow if it is occurs.

(b) Convert the hexadecimal number: AB CD EF into binary, octal and

decimal equivalent. (1 Mark)

(c) Convert the following string into equivalent “UTF 8” code –

“Copyright sign is © and you must check it prior to using copyrighted

material”. Are these codes same as that used in ASCII? (2 Marks)

(d) Design a logic circuit that takes a four digit binary input, counts the

number of 1s in it, and produces it as the output. For example, if the

input is 1101, then output will be 11 (as there are three ones in the

input). Draw the truth table and use K-map to design the Boolean

expressions for each of the output bits. Draw the resulting circuit

diagram using AND – OR – NOT gates. (5 Marks)

(e) Design a two bit counter (a sequential circuit) that counts as 0, 2, 0,

2... and so on. You should show the state table, state diagram, the kmap for circuit design, logic diagram of the resultant design using

D flip-flop. (5 Marks)5

(f) Design a floating point representation of 16 bits closer to IEEE 754

format. The number should have a biased exponent of 5 bits. You may

assume that the mantissa is in normalised form; the exponent bias of

15; and one bit is used for the sign bit in the mantissa. Represent the

number (24.125) 10 using this format . (4 Marks)


No Answer Found