Scribd
Upload
4 views3 pages

Assignment 1.1 (2)

The document is an assignment for the IDS course at Galgotias University, consisting of multiple-choice questions related to digital systems and Boolean algebra. It includes questions on number systems, logic gates, binary conversions, and simplifications of Boolean expressions. Additionally, it contains theoretical questions regarding universal logic gates and DeMorgan's theorem.

Uploaded by

subhash.chandra
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
Download as pdf or txt
4 views3 pages

Assignment 1.1 (2)

The document is an assignment for the IDS course at Galgotias University, consisting of multiple-choice questions related to digital systems and Boolean algebra. It includes questions on number systems, logic gates, binary conversions, and simplifications of Boolean expressions. Additionally, it contains theoretical questions regarding universal logic gates and DeMorgan's theorem.

Uploaded by

subhash.chandra
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
Download as pdf or txt
Download as pdf or txt
You are on page 1/ 3

IDS Assignment-1

Galgotias University
Department of Electrical, Electronics & Communication Engineering
Multiple Choice Question:
1. The base or radix a Hexadecimal number system is
a) 2
b) 8
c) 15
d) 16
2. The two’s complement of the number 100101000 is
a) 011010110
b) 111111111
c) 011010111
d) None
3. The ones complement of ones complement of the given binary number is
a) Same binary number
b) Zero
c) Non-zero
d) None
4. Identify the binary number represented by the decimal number 10.625
a) 1010.11
b) 1010.101
c) 1010.110
d) None
5. The decimal equivalent of the binary number 11010111 is
a) 215
b) 225
c) 250
d) None
6. Complement of the expression A’B + CD’ is _________
a) (A’ + B)(C’ + D
b) (A + B’)(C’ + D)
c) (A’ + B)(C’ + D)
d) (A + B’)(C + D’)
7. Simplify Y = AB’ + (A’ + B) C.
a) AB’ + C
b) AB + AC
c) A’B + AC’
d) AB + A
8. An equivalent representation for the Boolean expression (A' + 1) is
a) A
b) 0
c) 1
d) A’
9. From the truth table below, determine the standard SOP expression
a) X=A’B’C’+ABC+AB’C
b) X=ABC+ABC+ABC
c) X=AB’C+A’BC+ABC’
d) X=A’B’C+A’BC+ABC’

Answer the following questions:


Q1. What are the universal logic gates? Make all the gates using universal gates.
Q2. Find a). (10010)2=(?)10 , b) (125.0125)10=(?)2, c) (8AFC0)16=(?)2=(?)10=(?)8
Q3. Represent 27 and 132 in a) binary, b) BCD code), c) Excess-3 code, d) Gray code.
Q4. Find 1’s and 2’s complement of following binary nos.
(1) (10001.101)2 (2) (101011.11101)2
Q5. Write a short note on the following:
(i) Demorgan’s theorem
(ii) Canonical sum of product (SOP) and Canonical product of sum (POS)
Q6. Reduce the expression: A+B (AC+(B+C’) D) using Boolean Algebra.
Q7. Prove the following Boolean expression:

(i) A+AB=A
(ii) (A+B) (A+C) =A+BC
(iii) A+A’B=A+B
Q8. A logical expression in the standard SOP form is given as follows:

Y=A’B’C’ + A’BC’ + A’BC + AB’C

Minimize it using K-Map technique.


Q9. Simplify the following Boolean expression using k-map
i. F (A, B, C, D) =Σ m (0,1,3,7,8,9,11,15)

ii. F (A, B, C) =Σ m (0,1,3,7) + Σ d (2,6)

iii. F (A, B, C) =Σ m (0,4,2,6) + Σ d (5,7)

iv. F (A, B, C, D) =Σ m (0,1,3,7,9,11,15) +Σ d (8,10)

v. F (A, B, C, D) =∏ 𝑀 (0,2,3,7,8,9,14,15)
vi. F (A, B, C) =∏ 𝑀 (0,1,3,7,8,12,15) + Σ d (2,6)

You might also like