Scribd
Upload
41 views4 pages

CS-304 IMP Midterm-1

The document contains questions related to digital logic systems including: 1. Converting between binary, decimal, hexadecimal, and other number systems. 2. Minimizing Boolean functions using K-maps and implementing them with logic gates. 3. Performing binary arithmetic operations like addition, subtraction, and conversion between binary coded decimal and decimal. 4. Proving theorems like De Morgan's theorem and realizing logic gates using universal gates.

Uploaded by

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

CS-304 IMP Midterm-1

The document contains questions related to digital logic systems including: 1. Converting between binary, decimal, hexadecimal, and other number systems. 2. Minimizing Boolean functions using K-maps and implementing them with logic gates. 3. Performing binary arithmetic operations like addition, subtraction, and conversion between binary coded decimal and decimal. 4. Proving theorems like De Morgan's theorem and realizing logic gates using universal gates.

Uploaded by

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

CS-304(Digital System)

Convert the following:


1. (72.625)10 = ( )2
2. (10001101)2 = ( )10
3. (237)8 = ( )10
4. (381B)16 = ( ) 8
5. (101101011010) Gray  to  (?) Binary                                              

Minimize the given switching functions using K Map:


f (ABCD) = ∑m (3,4,5,8,13,15)+d(0,7,11,12) and implement minimized expression by
NAND  gates only.    

What is Universal gate? Implement AND, OR, NOT gate using NAND gates.

Perform BCD subtraction:


a. (79)10 – (18)10 using the 9’s complement method.
b. (36)10 – (86)10 using the 10’s complement method

Convert the following :-


(i) (10010111)BCD = (?)10
(ii) (10101)2 = (?)BCD
(iii) (387)10 = (?)EXCESS-3
(iv) (111011)BINARY = (?)GRAY
(v) (10101011)GRAY = (?)BINARY

State and prove De-Morgan theorem for 2 variables?

Simplify the Boolean function using K-map –


F ( A,B,C,D )= ∑( 0,1,2,4,5,6,8,9,10,12,13,14)

Design NAND Gate by using NOR Gate only ?

Explain Look ahead carry Generator.

Convert the following :-


(i) (11011.101)2 = (?)10
(ii) (256.652)10 = (?)2
(iii) (A4E)16 = (?)8
(iv) (36)8 =(?)16
(v) (10011.1101)2 =(?)16
(vi) (10.111)2= (?)16
(vii) (1100101011.1110)2=(?)8
(viii) (A92)16= (?)8
ix) (36170.AB)16 = (?)10 =(?)8
x) (725.25)8 = (?)10 = (?)2 =(?)16

Draw the circuit of BCD adder and explain its working.

Simplify the Boolean expression using Boolean algebra.


i. Z =[A+A’B+A’B’C’+A’B’C’D]
ii. A’B’+AC+ BC’+ B’C+AB

Realize all gates using universal NOR gate.

Realize all gates using universal NAND gate.

Convert the following :-

(i) (11.101)2 = (?)10

(ii) (126.62)10 = (?)2

(iii) (10111.1011)2 = (?)8

Convert the following :-

(i) (10111)BCD = (?)10

(ii) (101)2 = (?)BCD

(iii) (245)10 = (?)EXCESS-3

Convert the following:

1. (72.625)10 = ( )2

2. (10001101)2 = ( )10

3. (237)8 = ( )10

4. (381B)16 = ( ) 8

5. (101101011010) Gray to (?) Binary

Minimize the given switching functions using K Map:


f (ABCD) = ∑m (3,4,5,8,13,15)+d(0,7,11,12) and implement minimized expression by
NAND gates only.

Perform BCD subtraction:


a. (79)10 – (18)10 using the 9’s complement method.
b. (36)10 – (86)10 using the 10’s complement method

Convert the following :-


(i) (10010111)BCD = (?)10

(ii) (10101)2 = (?)BCD

(iii) (387)10 = (?)EXCESS-3

(iv) (111011)BINARY = (?)GRAY

(v) (10101011)GRAY = (?)BINARY

What are the various self-complementary codes. Represent (7431)8 in Gray Codes.

Convert F(A,B,C,D) = 𝐴̅+𝐴̅𝐶𝐷̅+𝐵̅𝐶 to canonical Sum of Product, and Product of Sum


form.

Determine the base of following relation 36 + 15 = 45,

Find the value of (X)16 represented in the form 1101101.10101

Minimize the following Boolean expression using K-Map


F(A,B,C,D) = Σ𝑚(0,1,4,5,6,8,9,10,12,14,15)

Draw the circuit diagram of Half Adder using NAND Gate. What are the minimum
number of NOR gates are required to implement the Half Subtractor.

Design a Full Subtractor Circuit.

How many Half adders are required to implement the following functions
(i) F1 = A⨁𝐵⊕𝐶 and (ii) F2 = 𝐴̅𝐵𝐶+𝐴𝐵̅𝐶

Explain the difference between Combinational and Sequential Circuits


Convert the following :-

(i) (11.101)2 = (?)10


(ii) (126.62)10 = (?)2
(iii) (10111.1011)2 = (?)8

Convert the following :-


(i) (10111)BCD = (?)10
(ii) (101)2 = (?)BCD
(iii) (245)10 = (?)EXCESS-3

Simplify the following Boolean expression by using K-Map:


a).F (A,B,C,D) = ∑m(1, 3,7,11,15)+∑d(0,2,5).
b).F(A,B,C,D) = ∑m(0,1, 2, 9, 11, 15) + ∑d(8,10,14).
c).F(A,B,C) = ∑m(0, 5,7) + ∑d(1,2,3).
d)F(A,B,C,D)= ∑m(4,5,7,12,14,15) + ∑d(3,8,10).

Implement the basics gates using universal gate ?

Design Y=AB+CD by using NAND Gate?

Design Ex-or and Ex-nor gate by using Universal gates?

Convert the Boolean expression Y=A+BC into canonical SOP and Canonical POS form?

Draw the truth table & circuit diagram of Full adder and half adder?

You might also like