Name- Sai Prasanna Krishna Yalamanchili STUDENT ID-11533220

ITC411 Introduction to Information Technology PG Assignment-2 Name SAI PRASANNA KRISHNA YALAMANCHILI Student ID 11533220 Assessment item 2 Assessment submission date-30/08/2013 Assessment due date-30/08/2013 Name of the lecturer- Dr Abeer Alsadoon

1. Represent the following decimal numbers in binary using 8-bit signed magnitude, one's complement and two's complement: a. 77 b. 129 Answer: a. The binary equivalent of 77 is 1001101 Signed magnitude: 01001101 One's complement: 01001101 Two's complement: 01001101

Name- Sai Prasanna Krishna Yalamanchili STUDENT ID-11533220

b. -129 cannot be represented by in 8-bit signed magnitude. Because 8-bit signed magnitude represent the decimal numbers in positive numbers from 0 to 127 and negative number from -0 to -127. So the above given decimal number -129 we cannot represent its magnitude, ones complement and twos complement in 8-bit signed magnitude

2. Answer: a. Signed magnitude For a 3-bit data Binary value 000 001 010 011 100 101 110 111 signed magnitude 0 1 2 3 -0 -1 -2 -3

b) ones complement

Binary value 000 001 010 011

ones complementmagnitude 000 001 010 011 0 1 2 3

2

Name- Sai Prasanna Krishna Yalamanchili STUDENT ID-11533220

100 101 110 111

011 010 001 000

-3 -2 -1 -0

c) Twos complement Binary value 000 001 010 011 100 101 110 111 twos complement 000 001 010 011 100 011 010 001 Magnitude 0 1 2 3 -4 -3 -2 -1

3. Answer: a.

Largest positive number= 0.1111 x 2^3 =111.12 Largest positive number = 7.5 Smallest positive number=0.1x 2^-4 = .000012 = 1/32 = 0.03125.

Name- Sai Prasanna Krishna Yalamanchili STUDENT ID-11533220

b. We need the bias as 4 in the exponent to prefer all exponents to be non-negative.

4. Answer: No, the given function is distributive law invalid. Let us assume F1= x XOR (y AND z), F2= (x XOR y) AND (x XOR z) The truth table for F1 is x 0 0 0 0 1 1 1 1 y 0 0 1 1 0 0 1 1 z 0 1 0 1 0 1 0 1 (y AND z) 0 0 0 1 0 0 0 1 F1 0 0 0 1 1 1 1 0

The truth table for F2 is x 0 0 0 0 1 1 1 y 0 0 1 1 0 0 1 z 0 1 0 1 0 1 0 (x XOR y) 0 0 1 1 1 1 0 (x XOR z) 0 1 0 1 1 0 1 F2 0 0 0 1 1 0 0

Name- Sai Prasanna Krishna Yalamanchili STUDENT ID-11533220

Since F1

F2 F2

Distributive law is not valid for the above given function.

5. Answer: The given statement is xy+xz+yz =xy+xz Now let us take xy+xz+yz Step 1: xy+xz+yz = xy+xz+(1)yz [ identity law 1x=x] Step2: xy+xz+(x+x)yz [Inverse law x+x=1 ] Step3: xy+xz+xyz+xyz [Distributie law x(y+z)= xy+xz] Step4: xy+xyz+xz+xyz [Associative law law x+y=y+x] Step5: xy(1+z)+xz(1+y) Step6: xy+xz Hence xy+xz+yz=xy+xz

6. Answer: Since there are 3 variables the possible situations are 2*2*2= 8 Let us consider, S for Sit , W for Wiggles, B for Barking, F for Biscuit function. The truth table is: S 0 0 0 0 1 W 0 0 1 1 0 B 0 1 0 1 0 F 0 0 0 1 1
5

Name- Sai Prasanna Krishna Yalamanchili STUDENT ID-11533220

1 0 1 1 1 0 1 1 1 The Boolean function for the above truth table is, F= SWB+SWB+SWB+SWB =SBW+SWB+SW(B+B){inverse law x+x=1}

0 1 1

The simplified logic Boolean function for a above situation is F=SBW+SWB+SW

7. Answer: a. b. c. d. 16 RAM chips are necessary 2 RAM chips are there per memory word. 18 address chips are needed to address each RAM chip. It will have 8 banks of memory.

8. Answer: a) hexadecimal code for each instruction. Hex Addr 100 101 102 103 104 105 106 107 108 A, Label Start, Instruction LOAD A ADD B STORE D CLEAR OUTPUT ADDI D STORE B HALT HEX 00FC Hexadecimal code 1108 3109 210B 0000 6104 3000 2109 7000 00FC

Name- Sai Prasanna Krishna Yalamanchili STUDENT ID-11533220

109 10A 10B

B, C, D,

DEC 14 HEX 0108 HEX 0000

000E 0108 0000

b) Draw the symbol table Start C D B A 100 10A 10B 109 108

c) What is the value stored in the AC when the program terminates? 14.

Name- Sai Prasanna Krishna Yalamanchili STUDENT ID-11533220