NIMCET 2023
The number of minterms in an -variable truth table is
Answer (Detailed Solution Below)View answer ▾Hide ▴
Answer: Option C —
Detailed Solution
Each of the variables is 0 or 1, so the truth table has rows, and each row is one minterm.
For there are 8 minterms, while option (A) would give .
Quick tip
Each of variables is 0 or 1: rows, one minterm per row
💬 Discussions on this question
Ask a doubt ›Still stuck on this question? Ask our faculty and fellow students — answers appear here.
Ask a doubtMore Digital Electronics Questions
View all ›- Q1.The simplified Boolean value of the expression is:
- Q2.Simplify the Boolean expression .
- Q3.Consider , where the minterms 2, 7, 8 and 13 are don't-care terms. The minimal sum of products form for F is
- Q4.A bulb in a staircase has two switches, one on the ground floor and the other on the first floor. The bulb can be turned ON and also turned OFF by either switch, irrespective of the state of the other switch. The logic of the switching of the bulb resembles
- Q5.Consider the Boolean expression . The minimal sum of products form of F is
More Computer Awareness Questions
- Q1.Which of the following is hardware, not software?Organization, CPU, I/O Devices
- Q2.What is stored in an email address?Internet
- Q3.To take any text from its original place to another place without deleting it is calledMicrosoft Office
- Q4.________ are attempts by individuals to obtain confidential information from you by falsifying their identity.Computer Security
- Q5.Which of the following is used to move a document (or selected text)?Microsoft Office
Digital Electronics — Preparation
This question tests your understanding of Digital Electronics, a key topic in the Computer Awareness section. The detailed solution above uses a step-by-step approach to show the reasoning, and where available, a shortcut that helps you solve similar questions in under 90 seconds during the actual exam.
Digital electronics is the study of circuits that work with binary signals, and it forms the hardware basis of every computer. This topic covers logic gates (AND, OR, NOT, NAND, NOR, XOR and XNOR) and their truth tables, Boolean algebra and its laws, De Morgan's theorems, and simplifying Boolean expressions, including with Karnaugh maps (K-maps). It also covers combinational circuits such as half adders, full adders, multiplexers, demultiplexers, encoders and decoders, and sequential circuits such as flip-flops (SR, JK, D and T), registers and counters. Exam questions test writing or reading truth tables, simplifying expressions, and identifying the output of a given circuit. Remember that NAND and NOR are universal gates, which means any other gate can be built using only NAND gates or only NOR gates. Practise the digital electronics questions below, each with a step-by-step solution.