Scribd
Upload
43 views4 pages

Ak Digital Electronics Unit 1

Uploaded by

Shirin Razdan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
43 views4 pages

Ak Digital Electronics Unit 1

Uploaded by

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

AMORAH VENKATESHWARA COLLEGE

ASSIGNMENT UNIT- 1

COURSE: B. TECH

SUBJECT: DIGITAL ELECTRONICS (IEC-301)

BRANCH: ECE

SUBMITTED BY: ARTI KAK


SEMESTER: 3rd
STUDENT ID: SVU66850724
I. OBJECTIVE TYPE QUESTIONS

1. Convert one number system to another

i. Convert hexadecimal value 16 to decimal.


Correct answer: b. 1610

ii. Convert the following decimal number to 8-bit binary 187


Correct answer: c. 101111012

iii. Convert binary 111111110010 to hexadecimal.


Correct answer: d. FD216

2. Find complement

i. 2’s complement of 11001011 is ____________


Correct answer: d. 11100010

ii. 1’s complement of 1011101 is ____________


Correct answer: a. 0101110

3. Perform the binary arithmetic operations i. Perform binary addition:


101101 + 011011 =
Correct answer: c. 101110

ii. Perform binary subtraction: 101111 – 010101 =


Correct answer: d. 011001

4. Codes

i. The excess-3 code for 597 is given by __________


Correct answer: b. 100010100111

ii. The decimal equivalent of the excess-3 number 110010100011.01110101 is


_____________
Correct answer: c. 861.75

5. Boolean functions
i. The corresponding min term when x=0, y=0 and z=1.
Correct answer: d. x’. y

ii. The expression A+BC is the reduced form of ______________


Correct answer: b. (A+B) (A+C)
II. VERY SHORT QUESTIONS

1. Answer the following:


i. The output of an AND gate with three inputs, A, B, and C, is
HIGH when all inputs A, B, and C are HIGH.
ii. The output of an OR gate with three inputs, A, B, and C, is LOW
when all inputs A, B, and C are LOW.
iii. Output will be LOW for any case when one or more inputs are
zero for a NAND gate.

2. Answer the following:


i. If a signal passing through a gate is inhibited by sending a LOW
into one of the inputs, and the output is HIGH, the gate is a NAND
gate.
ii. The format used to present the logic output for the various
combinations of logic inputs to a gate is called a truth table. iii.
The Boolean expression for a 3-input AND gate is Z=A⋅B⋅C.

3. Answer the following:


i. The small bubble on the output of the NAND gate logic symbol
indicates inversion, i.e., it represents the NOT operation on the
output.
ii. The output of a NOT gate is HIGH when the input is LOW.

4. Encoding a binary word 11001 into the even parity Hamming code:
Answer: Original word: 11001
Parity bits calculation: P1 = 1 (odd parity), P2 = 0 (even parity), P3 = 0
(even parity), P4 = 1 (odd parity)
Encoded Hamming code: 1101011

5. Simplify the Boolean equation:


a. z=xy+x′ (x +y)
Simplified: z=xy+x′
b. =∑ (2,6) f (x, y, z) =∑ (2,6)
Simplified: f (x, y, z) =x′z+yz

III. LONG ANSWER QUESTIONS

1. Simplify the Boolean function =∑ (2,3,4,5) F (x, y, z) ∑ (2,3,4,5) using a


Karnaugh map:
Answer: xy\z00011110000110010110xy\z00010000011111111000
Grouping:
z=xˉy+xy=y
So, F (x, y, z) =y.

2. Simplify the Boolean function =∑ (0,1,2,4,5,6,8,9,12,13,14) F (w, x, y, z)


=∑ (0,1,2,4,5,6,8,9,12,13,14) using a Karnaugh map:
wx\yz00011110001100011100110000101111wx\yz00011110001101
011101110001100001
Grouping:
w=x
So, F (w, x, y, z) =x.

3. Let's assume the even parity Hamming code from the given example is
transmitted and the received code is (110001101). Now, we need to
detect and correct the error.
Detected error: The parity bit is incorrect.
Corrected code: Change the incorrect parity bit to make the total number of
1s even.
So, the corrected code is (110001101).

4. Minimize the following Boolean functions:


a. ∑ (0,1,2,5,7,8,9,10,13,15) F (A, B, C, D) =∑m (0,1,2,5,7,8,9,10,13,15)
Simplified:
(A, B, C, D) =A′D′+BD′+ACD+ABCD
b. ∑ (0,1,3,5,7,8,9,11,13,15) F (A, B, C, D) =∑m (0,1,3,5,7,8,9,11,13,15)
Simplified: F (A, B, C, D) =D′+B′D+ACD+AB

5. Minimize the expression using Quine McCluskey method: =∑


(0,1,2,5,6,7,8,9,10,14) F (A, B, C, D) =∑m (0,1,2,5,6,7,8,9,10,14)
Simplified: ′F (A, B, C, D) =D′+ACD+A′C′

You might also like