Scribd
Upload
8 views1 page

Digital Logic ASS Bure

The document outlines assignments for a Digital Logic Design course, focusing on number base conversions, binary arithmetic, Boolean expression simplification, and the use of K-map methods. It includes specific tasks such as converting decimal numbers to octal, hexadecimal, and binary, as well as finding complements of binary numbers and simplifying Boolean expressions. Additionally, it discusses the function of comparators in combinational circuits.

Uploaded by

Tesfalegn Yakob
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
8 views1 page

Digital Logic ASS Bure

The document outlines assignments for a Digital Logic Design course, focusing on number base conversions, binary arithmetic, Boolean expression simplification, and the use of K-map methods. It includes specific tasks such as converting decimal numbers to octal, hexadecimal, and binary, as well as finding complements of binary numbers and simplifying Boolean expressions. Additionally, it discusses the function of comparators in combinational circuits.

Uploaded by

Tesfalegn Yakob
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/ 1

Digital Logic Design

Assignments

Max Weight(20%)
1.Convert the following decimal numbers to the indicated bases:
(a) 7562.45 to octal.
(b) 1938.257 to hexadecimal.
(c) 175.175 to binary.
2. Convert the hexadecimal numbers 1FB2 and 9AC2 to binary and octal
3. Determine the value of base x if (211) x = (152)8.
4. Find the 1's and 2's complements of the following 8-digit binary numbers: 10101110;
10000001; 00000001; and 00000000.
5. Perform the arithmetic operations (+54) +(-13) and (-42) - (-13) in binary using the signed-
2's-complement.
6. Simplify the following Boolean expressions to a minimum number of literals:
(a) ABC + A 'B + ABC'
(b) x'yz + xz
(c) (x + y)'(x' + y')
8. Simplify the following Boolean expression by using K map method
A. F(x, y, z)=∑(0, 2, 4, 5, 6)
B. F(A, B, C, D)=∑(1, 3, 5, 7, 9, 11, 13, 15)
C. F(w, x, y, z)= π(0, 2, 4, 6, 8, 10, 12, 14)
D. F(A, B, C)= π(2, 3, 5, 6, 7)
10. Describe the function of comparator in combinational ckt and Check whether A=1001 equal
to B=1001 or not using comparator ckt.

You might also like