Question Paper Solved Computer System Architecture |digital Electronics

Channel:

Athar Hashmi Sir

Subscribers:

3,800

Published on July 23, 2022 2:33:19 PM ● Video Link: https://www.youtube.com/watch?v=h4EB3rQ14Cg

Duration: 21:31

187 views

11

#numbersystem #kmap #complements #binarysubtractiontion #subtractiontricks #subtraction #2scomplement
solution to this question paper

Set A
Question 1: Convert the following:
1. (1001010101010111)2 - (?)16
2. (23615)8 – (?)16
3. (23.0625)10 – (?)2
4. (12)8 – (?)10
5. (123)10 – (?)16
Question 2 Subtract using binary subtraction method:
1. 100 – 10 2. 10011 – 11 3. 10101010 – 1010
Subtract using 2’s complement method:
4. 100100 – 111 5. 111 – 100100
Question 3 What are error detection and correction codes? Also explain parity code.
Question 4. Simplify the following Boolean functions in SOP form by using K-map:
f (A, B, C, D) = ∑ (0,1,2,3,4,5,6,7,9,11,13,15)

Set B
Question 1: Convert the following:
1. (1010101000111010)2 - (?)16
2. (75124) 8 – (?)16
3. (45.001250) 10 – (?)2
4. (21)8 – (?)10
5. (213)10 – (?)16

Question 2 Subtract using subtraction method:
1. 110 – 11 2. 101100 – 100 3. 101011 - 1011
Subtract using 2’s complement method:
4. 100100 – 110 5. 110 – 100100
Question 3 What are floating and fixed-point representation? Explain with example.
Question 4. Simplify the following Boolean functions in SOP form by using K-map:
f (A, B, C, D) = ∑ (1,3,5,7,8,9,10,11,12,13,14,15)

Set C
Question 1: Convert the following:
1. (10010010010100)2 - (?)16
2. (32561)8 – (?)16
3. (85.0025)10 – (?)2
4. (15)8 – (?)10
5. (231)10 – (?)16
Question 2 Subtract using binary subtraction method:
1. 1110 – 110 2. 11111 – 11 3. 10111011 – 1011
Subtract using 2’s complement method:
4. 100000 – 1001 5. 101 – 1010
Question 3 Explain the following codes:
1. GRAY Codes 2. EXCESS-3 GRAY
Question 4. Simplify the following Boolean functions in SOP form by using K-map:
f (A, B, C, D) = ∑ (2,3,4,5,6,7,10,11,12,13,14,15)