ITER, SIKSHA ‘O’ ANUSANDHAN (Deemed to be
Assignment
University)
Branch Computer Science and Engineering, Programme B.Tech
Computer Science and Information Technology
Course Name Digital Logic Design Semester III
Course Code EET1211 Academic Year 2024/Odd
Topic-Number System, Binary Codes and
Assignment-1 Boolean Algebra GP-1
Learning Level L1: Remembering L3: Applying L5: Evaluating
(LL) L2: Understanding L4: Analyzing L6: Creating
Q’s Questions COs LL
Decimal 43 in hexadecimal and BCD number system is, respectively,
(a) B2, 01000011
1 (b) 2B, 01000011 CO1 L1
(c) 2B, 0011 0100
(d) B2, 0100 0100 GATE[2005]
2 The number of Bytes required to represent the number 1856357 in a packed BCD CO1 L3
(Binary Coded Decimal) form is __________________ [2014]
In which base system, 24+17=40 holds good?
a. 11
3 b. 16 CO1 L3
c. 4
d. 6
The code where all successive numbers differ from their preceding number by single
bit is
4 a. Binary Code CO1 L1
b. Gray Code
c. BCD
d. Excess-3
Convert the following binary number to decimal.
5 a. (10110.0101)2 CO2 L3
b. (16.5)16
c. (26.24)8
d. (FAFA.B)16
Obtain the 1’s and 2’s complement of the following numbers:
6 CO2 L3
a. (10000000)2
b. (00000000)2
c. (11011010)2
d. (11111111)2
e. (-35)10
f. (45)10
Perform the subtraction on the given binary numbers using 2’s and 1’s complement of
the subtrahend.
7 a. 10011-10001 CO2 L3
b. 100010-100011
c. 1001-101000
d. 110000-10101
8 Represent the following decimal number in BCD, excess-3 code, 2421, 6311, and gray
code.
CO2 L3
a. 872
b. 45
a.
9. Simplify the following Boolean expressions to a minimum number of literals using
Boolean theorem and postulates:
a. 𝑥𝑦 + 𝑥𝑦 ′ CO2 L3
b. (𝑥 + 𝑦)(𝑥 + 𝑦 ′ )
c. 𝑥𝑦𝑧 + 𝑥 ′ 𝑦 + 𝑥𝑦𝑧 ′
d. 𝑥𝑦𝑧 ′ + 𝑥 ′ 𝑦𝑧 + 𝑥𝑦𝑧 + 𝑥 ′ 𝑦𝑧 ′
e. (𝑥 + 𝑦)′ (𝑥 ′ + 𝑦 ′ )
f. 𝐴′ 𝐶 ′ + 𝐴′ 𝐵 + 𝐴𝐵𝐶 ′ + 𝐴𝐶
10 CO2 L3
Devise a scheme for converting base 3 numbers directly to base 9. Use your method to
CO1 L1
convert the following number to base 9:
11
1110212.202113.
Write Boolean expressions and construct the truth tables that describe the outputs of
the circuits:
12
CO2 L3
13 The Boolean Function Y=AB+CD is to be realized using 2 –input NAND gates. The
minimum Number of gates required is
a. 2 CO2 L3
b. 4
c. 3
d. 5
The Logical expression Y=A+A’B is equivalent to
14 a. y=AB
b. y=A’B CO2 L3
c. y=A’+B
d. y=A+B
15 CO2 L2
16 CO2 L3
17 CO2 L2
18
CO2 L3
19
CO2 L3
20
CO2 L4
Assignment 1 Topic: Number Systems, Binary Codes Date of Assignment1: Date of Submission:
and Boolean Algebra 10.10.2024 19.10.2024
Note:
1. assignment carries weightage of 20 marks out of 100
2. Course outcome CO1 to CO2 was covered.
CO1 Able to State and explain different number systems, binary codes
Able to apply the principles of Boolean algebra and Karnaugh map to simplify logic
CO2 expressions and implement it using gates
CO3 Able to Analyse and design various combinational circuits
Course
Outcomes Able to Analyse and design different synchronous and asynchronous sequential
CO4 circuits
Able to Analyse and design various Memory, Programmable Logic circuits and
CO5 register transfer level
CO6 Able to implement various digital circuits using HDL and Standard ICs.
