Scribd
Upload
11 views3 pages

Assignment 1

Hello how are you

Uploaded by

23bec95
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
11 views3 pages

Assignment 1

Hello how are you

Uploaded by

23bec95
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

Institute of Technology, Nirma University

Electronics and Communication Engineering


2EC201: Digital Logic Design

Assignment – 1: Number System, Codes, Boolean Algebra

Reading:
Book 1: A. Anand Kumar, Fundamentals of Digital Circuits, PHI.

Number System (Read topic 2.2.1 to 2.2.5 of ref. book 1)


1 Convert the following into binary:
(45.5)10 (725.5)8 (B5.A)16 (43.6)10
2 Convert the following into Decimal:
(10010.101)2 (564.32)8 (CA.D)16
3 (10010.11)2 = (______)8 = (______)16
4 Perform:
1. 10011.101 + 1010.1101
2. 10010.101 – 1001.111
3. 1010 - 1100 (Using 2’s compliment)
4. 110 - 1100 (Using 1’s compliment)
5 Find 1’s and 2’s compliment
1. 10010.101
2. 1001.0111
3. 0.1101
Signed Number (Read topic 2.3.1 to 2.3.3 of ref. book 1)
6 Represent below signed number using all three methods. (consider 12 bit
representation)
1. -151
2. -34.5
3. +100.00
7 Perform signed arithmetic using 8-bit 2’s complement representation:
1. 56-75
2. -65-34
8 Perform signed arithmetic using 8-bit 1’s complement representation:
1. 76-67
2. -54-32
Binary Codes (Read topics 3.1 to 3.2.1, 3.4.1, 3.4.2, 3.5.1 of ref. book 1)
9 1. Convert binary to BCD: 100101010
2. Convert binary to XS-3: 100101
10 Convert BCD to binary: 1001 1000 0101
11 Convert binary to Gray
1. 10010101
2. 1010101
12 Convert Gray to Binary
1. 1110111
2. 1000101
13 In the even parity scheme which data contains an error?
1. 10010111
2. 10010101
14 Do BCD addition. (Read topic 3.2.1) (Optional)
1. 163+291
2. 139+388
Boolean Algebra (Read ch 4 and topics 5.2, 5.3, 5.4, 5.5, 5.6 of ref. book
1)
15 Perform
1. AB ( A+ B )
2. AB XOR (A+B)’
16 Implement using NAND and NOR gates only (Without reducing):
1. [ ABC’ + (AC)’ ] (A’ + C)’ BC
2. (AB’ + B’C) [(AB)’ +C]
17 Apply D-Morgan’s theorem without minimizing.

18 Prove: AB + A’C = (A+C) (A’+B)


19 A + AB + ABC + ABCD ….. = ______
20 Solve using Boolean’s law
1. Simplify: (AB + AC’) (A+B) + AB (B’+C’)
2. Prove: ABCD + AB (CD)’ + (AB)’ CD = AB + CD
21 Find dual of below expression

22 Draw the logic diagram


Y = (A+B) (A’+B’) and plot waveform for Y for given waveform of A and B.

23 Find the dual of the below expressions. (Study Topic 5.4)

SOP and POS representation (Read topics 5.6, 5.7, 5.9 of ref. book 1)
24 Minimize
1. Σm(1,3,4,5)
2. πM(2,3,5,6)
25 Represent in standard SOP form:
1. ABC’ + BC + ABD
2. (A +B’) (A’ + C)
26 Represent in standard POS form:
1. (A+B+C’) (B+C) (A+B+D)
2. A’B + BC
K-Map
27 Prove using K-map: AB + A ‘C + BC = AB + A’C
28 Reduce using K-map
1. F(A, B, C, D) = Σm(2, 4, 6, 8, 10, 12, 15 )
2. F(A, B, C, D) = AB + AC’ + C + AD + AB’C + ABC
3. F(A, B, C, D) = Σm(1, 3, 4, 5, 10, 11, 12, 13, 14, 115 )
4. F(A, B, C, D) = Σm(0, 1, 4, 5, 6, 7, 9, 11, 15) + d(10, 14)
5. F(A, B, C, D) = πm(3, 6, 8, 11, 13, 14) . d(1, 5, 7, 10)

You might also like