Scribd
Upload
263 views4 pages

Assignment 1 Solution

This document contains the solution to an assignment with 8 questions. Question 1 involves binary and decimal conversions. Question 2 covers number systems and arithmetic. Question 3 discusses binary coded decimal. Question 4 presents Boolean algebra equations. Question 5 provides truth tables. Questions 6-8 further cover Boolean logic functions and gate symbols. The document provides detailed step-by-step workings and solutions to problems involving number systems, Boolean algebra, and logic gates.

Uploaded by

Manoranjan Das
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
Download as docx, pdf, or txt
263 views4 pages

Assignment 1 Solution

This document contains the solution to an assignment with 8 questions. Question 1 involves binary and decimal conversions. Question 2 covers number systems and arithmetic. Question 3 discusses binary coded decimal. Question 4 presents Boolean algebra equations. Question 5 provides truth tables. Questions 6-8 further cover Boolean logic functions and gate symbols. The document provides detailed step-by-step workings and solutions to problems involving number systems, Boolean algebra, and logic gates.

Uploaded by

Manoranjan Das
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
Download as docx, pdf, or txt
Download as docx, pdf, or txt
You are on page 1/ 4

ASSIGNMENT 1 SOLUTION

1 a (8000)10 = (2, 13,20)60


One number can be represented using 6 bits
b 296 + 57 = 331
2r 9r 6 5r 7 3r 3r 1
2 2

r 11r 12 0
2

r 11r 12 0
2

11 121 48 11 13
r
2 2
r 12
We expect that the Martians have 12 digits
c (123)5 = (x8)y
5 2*5 3 xy 8
2

xy 8 38
xy 30
As y > 8,
y =10, x = 3
y =15, x = 2
y = 30, x = 1
d i. (1001010.01101)2 = (74.40625)2 = (4A.68)16 = (112.32)8
ii. (123.8)10 = (1111011.11001100)2 = (173.63146314)8 = (7B.CC)16
iii. (AB9E)16 = (1010101110011110)2
iv. (28)7 It cannot be solved as digit 8 does not exist in base 7

2 a Both are correct


Solve by taking example.
b (935)11
Akash 113 1 (935)11 = 1331 1 -1127 = (203)10 = (175)11
Kunal (175)11 by subtracting each digit from 10
c i. 5260 435
10s Complement of 435 = 9565
5260 + 9565 = (1)4825 ( Carry 1)
Ans. 48259s Complement of 435 = 9564
5260+9564=(1)4824 (add 1 to units place)
Ans. - 4825
ii. 234 428
10s Complement of 428 = 572
234 + 572 = 806 (No carry)

Solution compiled by M.R. Das, M.K. Naik & A. Wunnava


Ans. - -(10s complement of 806)= (-194)
9s Complement of 428 = 571
243 + 571 = 805 (No carry)
Ans. - -(9s complement of 871) = (-194)
iii. 15 7
Using 2s Complement (1000)2
Using 1s Complement (1000)2
iv. 5 - 15
Using 2s Complement (-1010)2
Using 1s Complement (-1010)2
v. (11010)2 (1101)2
Using 2s Complement (01101)2
Using 1s Complement (01101)2

3 a 2 2 1 2 1 2 1 2 2 3 1 1
0 0 0 0 0 0 0 0 0 0 0 0 0
1 0 0 1 0 1 0 1 0 0 0 0 1
2 0 1 0 0 0 1 0 1 0 0 1 1
3 1 0 1 1 1 0 1 0 1 1 0 0
4 1 1 0 1 0 1 0 1 1 1 1 0
5 1 1 1 1 1 1 1 1 1 1 1 1
b (9865)10 = (1001 1000 0110 0101)2 in BCD
= (1100 1011 1001 1000)2 in Excess3
= (1111 1110 1100 1011)2 in 2421
4 ABC ' m6
A ' B C M 4
A B ' C ' M 3
AB ' C m5
A ' BC ' m2
A ' B ' C M 6
A ' B ' C ' M 7

5 A B C D F x1 = A, x0 = B, y1 = C, y0 = D
0 0 0 0 1
0 0 0 1 0 F ' A ' B ' C ' D A ' B ' CD ' A ' B ' CD A ' BC ' D '
0 0 1 0 0 A ' BCD ' A ' BCD AB ' C ' D ' AB ' C ' D
0 0 1 1 0 AB ' CD ABC ' D ' ABC ' D ABCD '
0 1 0 0 0
0 1 0 1 1

Solution compiled by M.R. Das, M.K. Naik & A. Wunnava


0 1 1 0 0 F ' A ' B '(C ' C ) D A ' B ' C ( D ' D) ( A ' A) BC ' D '
0 1 1 1 0 ( A ' A) BC ' D ' A ' BC ( D ' D) AB ' C '( D ' D)
1 0 0 0 0 AB '(C ' C ) D ( A ' A) BCD '
1 0 0 1 0 A ' B ' D A ' B ' C BC ' D ' A ' BC
1 0 1 0 1 AB ' C ' AB ' D ABC ' BCD '
1 0 1 1 0 ( A A ') B ' D A '( B ' B)C B(C ' C ) D ' A( B ' B)C '
1 1 0 0 0 B ' D A ' C BD ' AC '
1 1 0 1 0
1 1 1 0 0 F ( B D ')( A C ')( B ' D)( A ' C )
1 1 1 1 1 ( x0 y0' )( x1 y1' )( x0' y0 )( x0' y1 )

6 s x1 x2 F F s ' x1x2' s ' x1x2 sx1' x2 sx1x2


0 0 0 0
s ' x1( x2' x2 ) s( x1' x1) x2
0 0 1 0
0 1 0 1
s ' x1 sx2
0 1 1 1
1 0 0 0 F s ' x1 sx2
1 0 1 1 s ' x1 sx2
1 1 0 0
1 1 1 1 s ' x1 sx2

7 a F A[ B C '( AB ' AC ')]


A[ B AB 'C ' AC ']
AB AB 'C ' AC '
AB AC '( B ' 1)
AB AC ' A( B C ')
b F A B[ AC ( B C ') D]
A B[ AC BD C ' D]
A ABC BD BC ' D
A(1 BC ) BD(1 C ')
A BD
c F AB ' C B BD ' ABD ' A ' C
( AB ' A ')C B(1 D ' AD ')
( A ' B ')C B
A 'C B 'C B
A 'C C B
BC

Solution compiled by M.R. Das, M.K. Naik & A. Wunnava


d F ( B BC )( B BC ')( B D)
( B B BC ' B BC BC BC ')( B D)
( B BC ' BC )( B D)
B(1 C ' C )( B D)
B( B D)
B BD B(1 D)
B
8 Variables Various Logic Functions
A B f1 f2 f3 f4 f5 f6 f7 f8
0 0 1 1 0 0 0 1 1 1
0 1 0 1 1 0 1 0 0 1
1 0 0 1 1 0 1 1 1 1
1 1 0 0 0 1 1 0 0 0
Gate Name NOR NAND XOR AND OR XNOR XNOR NAND
Gate Symbol GATE symbols as in Book
Expression
+
A+B

Solution compiled by M.R. Das, M.K. Naik & A. Wunnava

You might also like