0% found this document useful (0 votes)
14 views3 pages

Practice Questions For MTE-IDS

Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
14 views3 pages

Practice Questions For MTE-IDS

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

Practice Questions for MTE-2024

(a) Recognize the highest single digit number in the following number system:

1. Decimal Number System


2. Binary Number System
3. Octal Number System
4. Hexadecimal Number System

(b) Convert hexadecimal (FF216) to binary.


1.
OR
I. Solve the following using Binary Arithmetic operations:
(a) Addition: (b) Subtraction:
0 1 1 1 1 1 0
+ 1 0 1 - 1 0 0 1
------------------------------- ---------------------------------
------------------------------- ---------------------------------
II. Obtain the 1’s & 2’s complement of the following numbers: (1010)2 & (10110010)2.

Prove the following identities using Boolean laws:


(i) A+A.B=A
(ii) (A + B) . (A + C) = A + B . C
2. OR
Prove the following:
(i) A + A’B +AB =A + B
(ii) AB + ABC + AB’ = A

Subtract (9)10 from (4)10, Using 2’s complement method.


OR
3. Convert the Octal number (1072) to decimal.
Convert the hexadecimal number (1FF) to Octal.

4. State De-Morgan’s law of Boolean algebra and Justify them using truth table.

For the given expression, Y = ABC + BC’D + A’BC

5. (1) Simplify this equation and realize using basic gates.


(2) Realize the simplified equation using only NOR gates.

6. (a) Differentiate Signed Binary number and Unsigned Binary number.


(b) Represent +127 and -127 using 8-bit 1’s compliment form

Watsapp : https://chat.whatsapp.com/JPLQSCGVNaUCOgdLvwYYuA?mode=ems_copy_t

Telegram : https://t.me/+H6qCPG1cbdk3MjFl
OR
Solve the following using Binary Arithmetic operations:
III. Addition: (b) Subtraction:
0 1 0 1 1 1 0
+ 1 1 1 - 1 0 0 1
------------------------------- ---------------------------------
------------------------------- ---------------------------------
IV. Convert the Octal number (1072) to decimal.

Prove the following identities using Boolean laws:


(iii) A+A.B=A
(iv) (A + B) . (A + C) = A + B . C

8. OR
Simplify the following Boolean expressions and design circuit using logic gates:
(i) Y = [(A . B)’ + (A . C)’]’

(ii) Y = [(A + B)’ . (A + C)’]’


Subtract (5)10 from (9)10, Using 2’s complement method.
OR
9. (a) Convert the binary number 1010 1111 1011 0010 into the equivalent hex number. Obtain the
1’s & 2’s complement of the following numbers: (1010)2 & (10110010)2.

10. State De-Morgan’s law of Boolean algebra and Justify them using truth table.

(a) Realize AND logic, using NOR gates only.


(b) Write the smallest TWO digit number in the following number systems:
11.
I. Binary
II. Octal iii. Hexadecimal

For the given function, F=xy’ + xy’, find the complement of ‘F’.
12. Realize the following Boolean expression using only NAND gates:
Y=(ABC+B’C’)C
(b) Perform (1010)2 - (101)2 Using 2’s complement method.
13. (c) Convert the binary number 1010 1111 1011 0010 into the equivalent hex number.
(d) Obtain the 1’s & 2’s complement of the following numbers: (1010)2 & (10110010)2.

14. Sketch the equivalent circuit of AND, OR & NOT logics using NOR gate.

Simplify the following Boolean expressions using Boolean Laws:


15.
(i) (X + Y).(X’ + Y)

Watsapp : https://chat.whatsapp.com/JPLQSCGVNaUCOgdLvwYYuA?mode=ems_copy_t

Telegram : https://t.me/+H6qCPG1cbdk3MjFl
(ii) (A + B).(A + C)

16. Represent the decimal number 396 and 4096 in binary using (i) Binary code (ii) BCD code (iii) Excess-
3 Code (iv) Gray Code.
Convert (A+B).(A+C).(B+C’) into standard POS form.
17.
Minimize the four-variable logic function using K-Map, 𝑓(𝐴, 𝐵, 𝐶, 𝐷) = ∑𝑚(0,1,2,3,5,7,8,9,11,14).

18. Minimize the four-variable logic function using K-Map, 𝑓(𝐴, 𝐵, 𝐶, 𝐷) = ¶M (4,6,10,12,13,15).

Minimize the four-variable logic function using K-Map, 𝑓(𝐴, 𝐵, 𝐶, 𝐷) = ABC′D + A′BCD + A′B′C′ +
19.
A′B′D′ + AC′ + AB′C + B′.

20. Minimize the four-variable logic function using K-Map, 𝑓(𝐴, 𝐵, 𝐶, 𝐷) = (𝐴 + 𝐵 + 𝐶′ +𝐷′).(𝐴′
+𝐶+𝐷′).(𝐴′ +𝐵+𝐶′ +𝐷′).(𝐵′ +𝐶).(𝐵′ +𝐶′).(𝐴+𝐵′)(𝐵′ + 𝐷′).

21. (a) Make a K-map for the function f= AB+AC’+C+AD+AB’C+ABC. (b) Express ‘f’ in standard SOP
form.

22. Given the logic equation f= ABC+ BC’D+ A’BC. (a) Make a truth table. (b) Simplify using K-map. (c)
Realize the function using NAND gates only.

Watsapp : https://chat.whatsapp.com/JPLQSCGVNaUCOgdLvwYYuA?mode=ems_copy_t

Telegram : https://t.me/+H6qCPG1cbdk3MjFl

You might also like