Explore topic-wise MCQs in Computer Fundamentals.

This section includes 17 Mcqs, each offering curated multiple-choice questions to sharpen your Computer Fundamentals knowledge and support exam preparation. Choose a topic below to get started.

1.

The ___________ of all the variables in direct or complemented from is a maxterm.

A. addition
B. product
C. moduler
D. subtraction
Answer» B. product
2.

The logic gate that provides high output for same inputs ____________

A. NOT
B. X-NOR
C. AND
D. XOR
Answer» C. AND
3.

A ________ value is represented by a Boolean expression.

A. Positive
B. Recursive
C. Negative
D. Boolean
Answer» E.
4.

F(X,Y,Z,M) = X`Y`Z`M`. The degree of the function is ________

A. 2
B. 5
C. 4
D. 1
Answer» D. 1
5.

Boolean algebra can be used ____________

A. For designing of the digital computers
B. In building logic symbols
C. Circuit theory
D. Building algebraic functions
Answer» B. In building logic symbols
6.

Algebra of logic is termed as ______________

A. Numerical logic
B. Boolean algebra
C. Arithmetic logic
D. Boolean number
Answer» D. Boolean number
7.

The output of AND gates in the SOP expression is connected using the ________ gate.

A. XOR
B. NOR
C. AND
D. OR
Answer» E.
8.

The number of cells in a K-map with n-variables.

A. 2n
B. n2
C. 2n
D. n
Answer» D. n
9.

The expression A+BC is the reduced form of ______________

A. AB+BC
B. (A+B)(A+C)
C. (A+C)B
D. (A+B)C
Answer» C. (A+C)B
10.

The number of values applicable in Boolean Algebra.

A. 1
B. 2
C. 3
D. 4
Answer» C. 3
11.

Who proposed the use of Boolean algebra in the design of relay switching circuits?

A. George Boole
B. Claude E. Shannon
C. Claude E. Boole
D. George Shannon
Answer» C. Claude E. Boole
12.

Truth table is used to represent Boolean __________

A. functions
B. algebra
C. operators
D. addition
Answer» B. algebra
13.

Boolean Function is of the form of ________

A. Truth values
B. K=f(X,Y,X)
C. Algebraic Expression
D. Truth Table
Answer» B. K=f(X,Y,X)
14.

The gate which is called an inverter is called _________

A. NOR
B. NAND
C. EXOR
D. NOT
Answer» E.
15.

The ________ gate is an OR gate followed by a NOT gate.

A. NAND
B. EXOR
C. NOR
D. EXNOR
Answer» D. EXNOR
16.

Which of the following correctly describes the distributive law.

A. ( A+B)(C+D)=AB+CD
B. (A+B).C=AC+BC
C. (AB)(A+B)=AB
D. (A.B)C=AC.AB
Answer» C. (AB)(A+B)=AB
17.

The universal gate that can be used to implement any Boolean expression is __________

A. NAND
B. EXOR
C. OR
D. AND
Answer» B. EXOR