Login to track your progress, bookmark questions, and view history.
Q#1
Boolean Algebra
GATE EC 1999
MSQ
+2 marks
-0 marks
In a certain application, four inputs A, B, C, D (both true and complement forms available) are fed to logic circuit, producing an output F, which operates a relay. The relay turns on when for the following states of the input and . States ‘1000’ and ‘1001’ do not occur, and for the remaining states, the relay is off. Minimize F with the help of a Karnaugh map and Find the minimum number of 3 – input NAND gates required to realize this.
Minimum of 5, 3-input NAND gates are required
Minimum of 4, 3-input NAND gates are required
Sign in to see the solution
Log in to view the explanation, track your attempts, and keep your progress.
Sign in to Unlock
Login to keep track of your progress with the tool with daily goals, questions preparation and more.
Browse Practice Questions by Chapters / Topics in Browse Practice Questions by Chapters / Topics in GATE Electronics and Communications
Total Questions
Attempted
% Attempted
Correct
% Correct
Login to keep track of your progress with the tool with daily goals, questions preparation and more.
| Topic | Questions | Attempted | Correct | |
|---|---|---|---|---|
| Network Analysis | 273 | 0 | 0 | |
| Electronic Devices | 69 | 0 | 0 | |
| Analog Electronics | 395 | 0 | 0 | |
| Digital Electronics | 351 | 0 | 0 | |
| Signals and Systems | 22 | 0 | 0 | |
| Control Systems | 224 | 0 | 0 | |
| Communication System | 200 | 0 | 0 | |
| EMFT - ECE | 14 | 0 | 0 | |
| Engineering Mathematics | 24 | 0 | 0 | |
| General Aptitude | 30 | 0 | 0 |