Scribd
Upload
30 views3 pages

Digital Ele Assignment Unit1 Goswami

Uploaded by

pratham kumar
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
30 views3 pages

Digital Ele Assignment Unit1 Goswami

Uploaded by

pratham kumar
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/ 3

United College of Engineering and Research (UCER)

Digital Electronics (KOE-049)

Assignment on Unit I

AKTU last 5 years questions:


1. Find the base B of the system. if roots of the quadratic equation x2-11x+22=0 are x=3
and x-6. (2019-20)

2. Simply the expression F = ACD +A’B +D’ by K-map. (2019-20)

3. How are binary digits used to express the integer and fractional parts of a number? (2021-
22)

4. Explain how BCD addition is carried out. (2021-22)

5. Minimize the following using Tabular method F(A,B,C,D,E)


=∑m(0,1,2,3,6,7,14,15,16,19,31) (2021-22)

6. Reduce the expression f = ∑ m (0,1,2,3,5,7,8,9,10,12,13) using K-maps and implement


the real minimal expression using NAND logic. (2021-22)

7. Determine the value of base x, if (193)x = (623)8 (2018-19)

8. Simplify the following Boolean function using K-map Y = ∑m(3,4,5,7,9,13,14,15)


(2018-19)

9. Simplify the following Boolean function using tabulation method

Y = ∑m(0,1,9,15,24,29,30) + ∑d(8,11,13) (2018-19)

10. What is (33)6 + (45)6 (2017-18)

11. Implement the Expression Y = ABC’ + BD + E using Nand gate only. (2017-18)

12. Convert the following (i) (562.13)7 = (?)10 (ii) (467.342)8 = (?)10 (2017-18)

13. Simplify the following Boolean function using K-map Y =


∑m(0,1,3,5,6,7,9,11,16,18,19,20,21,22,24,26) (2017-18)

More questions for exercise:


1. Find the binary equivalent of (222)3 and (175.175) 10.

2. Convert the hexadecimal number F3A7C2 to binary, octal and decimal.

1|S ANJA Y GOSWA MI , UCER - Pra yagr aj


3. Determine the value of base x if (211)x = (152)8.

4. Draw and explain the working of NAND and NOR gates using transistor-resistor circuit.

5. Perform the following subtraction: i) 20-100 (using 10’s complement) ii) 1010100-
1010100 (using 2’s complement).

6. Obtain the 5’s complement of numbers (543210), (354322) and (67345) with base 6.

7. Decode the following ASCII code: 1001010, 1101111, 1101000, 0100000, 1100101.

8. Show the bit configuration that represents the decimal number 295 in i) binary, ii) BCD,
iii) ASCII, iv) excess-3, v) Gray codes.

9. Show that the dual of the exclusive-OR gate is equal to its complement.

10. Show the following:


i) the inhibition operation is neither commutative nor associative.
ii) the NAND and NOR operations are commutative and but not associative.

11. Define Fan-out, Fan-in, power Dissipation and Propagation delay.

12. Simplify the following Boolean expressions to a minimum number of literal and draw the
corresponding logic diagram using NAND and NOR gates only: i) xy + x’y’ + x’y
ii) (x + y) (x + y’) iii) xy + x(wz + wz’) iv) (BC’ + A’D) (AB’ + CD’)

13. Find the complement of F= x+ yz; then show that F * F’ = 0 and F + F = 1.

14. Simplify the Boolean expressions using K-map method: i) F(A,B,C) = ∑(0,2,3,4,6) ii)
F(A,B,C,D) = П(1,3,5,7,13,15) iii) F(a,b,c,d,e) = ∑(0,1,4,5,16,17,21,25,29) iv) F(x,y,z) =
∑(0,1,2,4,5) and d(x,y,z) = ∑(3,6,7)

15. A logic circuit implements the following Boolean function: F = A’C + AC’D’, it is found
that the circuit input combination A = C = 1 can never occur. Find a simpler expression
for F using the proper don’t care conditions.

16. Prove the following: i) A Ex-OR B = A’ Ex-OR B’ ii) B Ex-OR (B Ex-OR A*C) = A*C

17. Realize the following function using Ex-OR: F = ABC’D’ + AB’C’D + A’B’CD +
A’BCD’.

18. Consider the expression: Z = ABCD…. Show that Z = 1 if an odd number of variables
are 1 and Z = 0, if an even number of variables are 1.

2|S ANJA Y GOSWA MI , UCER - Pra yagr aj


19. Make a k-map for the function F = AB+AC’+C+AD+AB’C+ABC
i) express F in standard SOP form
ii) minimize it and realize the minimized expression using number NAND gate.

20. Answer the following:


i) A printer is capable of printing 132 characters in a single line and each character is
represented by ASCII code. How many bits are used to print each line?
ii) How many bits of memory are required for storing 100 names, assuming that no name
occupies more than 20 characters, including space (each character is represented by
ASCII code with parity bit)?

21. Find the base B of the following:


a) (461/32)(B) = (12 + remainder 11)(8)
b) the (radix-1)’s complement of the number(87)(B) in decimal (25)(10)
c) roots of the quadratic equation x2-13x+36 in number system of base B are 5 and 6

3|S ANJA Y GOSWA MI , UCER - Pra yagr aj

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy