Computer Fundamentals Boolean Functions Online Exam Quiz
Computer Fundamentals Boolean Functions GK Quiz. Question and Answers related to Computer Fundamentals Boolean Functions. MCQ (Multiple Choice Questions with answers about Computer Fundamentals Boolean Functions
The general form for calculating the number of rows in a truth table is ________
Options
A : 2n
B : 2n+1
C : 2n
D : 2n+1
The number of literals in the expression F=X.Y’ + Z are _____________
Options
A : 4
B : 3
C : 2
D : 1
The minterm of any expression is denoted by ___________
Options
A : Mt
B : m
C : M
D : min
In the boolean function w=f(X,Y,Z), what is the RHS referred to as ________
Options
A : right hand side
B : expression
C : literals
D : boolean
The result of X+X.Y is X.
Options
A : True
B : False
C :
D :
Boolean Function is of the form of ________
Options
A : Truth values
B : K=f(X,Y,X)
C : Algebraic Expression
D : Truth Table
The max term when X=Y=Z=1 is ________
Options
A : x’+y’+z’
B : xyz
C : x’y’z’
D : x+y+z
The min term when X=Y=Z=0 is _____________
Options
A : x’+y’+z’
B : xyz
C : x’y’z’
D : x+y+z
What is the complement of X’Y’Z?
Options
A : X+YZ
B : X’+Y+’Z’
C : X+Y+Z’
D : XYZ’
The complement term for X’.Y’.Z + X.Y will be _____________
Options
A : XYZ’+X’Y’
B : (X+Y+Z’)(X’+Y’)
C : (X+Y+Z’)(X’+Y)
D : (X+Y+Z’)(X’+Y)
Chemical Engineering Basics - Part 1 more Online Exam Quiz
Computer Fundamentals Assessment
Computer Fundamentals Binary Multiplication Division
Computer Fundamentals Binary Number System
Computer Fundamentals Booths Algorithm
Computer Fundamentals Cache Memory
Computer Fundamentals Campus Interviews