UNDERGRADUATE PROGRAM IN ELECTRONICS AND INSTRUMENTATION

FACULTY OF MATHEMATICS AND NATURAL SCIENCE

UNIVERSITAS GADJAH MADA

MIDTERM EXAM
EVEN PERIOD FOR 2020/2021 ACADEMIC YEAR
Courses : Digital Electronics Class B
Day, Date : Monday, 5 April 2021
Time : 120 menit
Lecturer : Ika Candradewi, S.Si, M.Cs.,
Pattern of exam : Open Book, Limited Internet Access

PLO 2: CO-1 (7.5%): Able to understand number systems and their relation to digital electronics
1. Number Systems
a. Explain the reasons why the binary and hexadecimal number systems are used in
digital electronics!
b. Convert these numbers to binary and hexadecimal form!
46,28125
c. Work on the principle of 2’ complement !
- 11101 (Convert to the decimal form with a signed number)
- 10011001 (Convert to the decimal form with a signed number)
- Adding Operation for +14 and -17 (Used 8 bit number including the signed bit for
each number)
PLO 3 : CO-2 (15%) Able to use boolean algebra, truth tables, karnaugh maps and tabulation
as a means of manipulating boolean functions.
2. Using the theorem of boolean algebra, prove the equation below!
a. (𝑥 + 𝑦 + 𝑥𝑦)(𝑥𝑦 + 𝑥̅ 𝑧 + 𝑦𝑧) = 𝑥𝑦 + 𝑥̅ 𝑦𝑧
b. If 𝐹(𝐴, 𝐵, 𝐶) = 𝐴𝐵 ⊕ 𝐵𝐶 , 𝑝𝑟𝑜𝑣𝑒 𝑡ℎ𝑎𝑡 𝐹 + 𝐹 = 1
c. 𝐹 = 𝑥𝑦𝑧 + 𝑥̅ 𝑦𝑧 + 𝑤 𝑥𝑦 + 𝑤𝑥̅ 𝑦 + 𝑤𝑥𝑦 (simplify this boolean equation)

3. Simplify the following boolean function with a karnaugh map and after that, create their
digital circuit!
a. F(A,B,C,D) = 𝜋 (0,2,4,5,6,7,12,13,14,15)
b. 𝐹(𝑃, 𝑄, 𝑅, 𝑆, 𝑇) = ∑(8,9,12,13,25,27,29,31) + 𝑑(10,11,15,14)
c. 𝐹(𝐴, 𝐵, 𝐶, 𝐷) = ∑(2,4,8,10,12,14) + 𝑑(0,1,5,9), Change it to POS Form, then Create
the POS circuit.
PLO2 : CO-3 (17,5%) Able to analyze and synthesize combinational circuits
4. The circuit analysis below:

Determine the truth table and boolean equations from the circuit above!
5. An instruction in a program is if A > B then writeln (A) else writeln (B). The values of A
and B being compared are each two bits long ( a1a2 and b1b2). For example a1a2 > b1b2
= 01 > 00, please make a truth table, karnaugh map, and Boolean equations using
the SOP method
a. Create a (simplified) logic circuit that produces an output of 1 if A < B or 0 otherwise.
b. Redraw the logic circuit using only NAND gates (hint : use de Morgan's law)