Professional Documents
Culture Documents
Tutorial 1
Tutorial 1
Tutorial # 1
Question 1
(a) Define number system, radix, bit, nibble, byte and Boolean algebra.
(b) Describe four basic number systems
Question 1
Question1
(a)
Show that:
(i) (13A7)16 = (5031)10;
(ii) (3F2)16 = (1111110010)2.
(b) Find the octal equivalent of (2F.C4)16 and the hex equivalent of (762.013)8
(c) Find the binary equivalent of (374.26)8 and the octal equivalent of (1110100.0100111)2
(d) Determine the hexadecimal equivalent of (82.25)10
Question 2
(a) Assume a radix-32 arbitrary number system with 0–9 and A–V as its basic digits. Express
the mixed binary number (110101.001)2 in this arbitrary number system.
1
(b) Convert to of (73.75)10 octal equivalent.
Question 3
(a) Apply suitable Boolean laws and theorems to modify the expression for a two-input EX-
OR gate in such a way as to implement a two-input EX-OR gate by using the minimum
number of two-input NAND gates only.
(b) How do you implement three-input and four-input EX-OR logic functions with the help of
two-input EX-OR gates?
Question 4
(a) Starting with the Boolean expression for a two-input OR gate, apply Boolean laws and
theorems to modify it in such a way as to facilitate the implementation of a two-input OR
gate by using two-input NAND gates only.
(b) Using NAND gates only to implement the following circuits.