Question 1

The time required for a gate or inverter to change its state is called______________

Accepted Answer

A) rise time 
B) decay time 
C) propagation time 
D) charging time 
A) rise time 
B) decay time 
C) propagation time 
D) charging time C

Question 2

The general form for calculating the number of rows in a truth table is______________

Accepted Answer

A) 2n 
B) 2n+1. 
C) 2n. 
D) 2n+1 
A) 2n 
B) 2n+1. 
C) 2n. 
D) 2n+1 C

Question 3

The min term when X=Y=Z=0 is______________

Accepted Answer

A) x'+y'+z' 
B) xyz 
C) x'y'z' 
D) x+y+z 
A) x'+y'+z' 
B) xyz 
C) x'y'z' 
D) x+y+z C

Question 4

In which of the following gates the output is 1 if and only if at least one input is 1?

Accepted Answer

A) and 
B) nor 
C) nand 
D) or 
A) and 
B) nor 
C) nand 
D) or

Question 5

Which of the following will give the sum of full adders as output?

Accepted Answer

A) three point major circuit 
B) three bit parity checker 
C) three bit comparator 
D) three bit counter 
A) three point major circuit 
B) three bit parity checker 
C) three bit comparator 
D) three bit counter

Question 6

Simplify Y = AB' + (A' + B)C.

Accepted Answer

A) ab' + c 
B) ab + ac 
C) a'b + ac' 
D) ab + a 
A) ab' + c 
B) ab + ac 
C) a'b + ac' 
D) ab + a

Question 7

The boolean function A + BC is a reduced form of

Accepted Answer

A) ab + bc 
B) (a + b)(a + c) 
C) a'b + ab'c 
D) (a + c)b 
A) ab + bc 
B) (a + b)(a + c) 
C) a'b + ab'c 
D) (a + c)b

Question 8

The max term when X=Y=Z=1 is______________

Accepted Answer

A) x'+y'+z' 
B) xyz 
C) x'y'z' 
D) x+y+z 
A) x'+y'+z' 
B) xyz 
C) x'y'z' 
D) x+y+z

Question 9

The number of literals in the expression F=X.Y' + Z are______________

Accepted Answer

A) 4 
B) 3 
C) 2 
D) 1 
A) 4 
B) 3 
C) 2 
D) 1

Question 10

The complement term for X'.Y'.Z + X.Y will be

Accepted Answer

A) xyz'+x'y' 
B) (x+y+z')(x'+y') 
C) (x+y+z')(x'+y) 
D) (x+y+z')(x'+y). 
A) xyz'+x'y' 
B) (x+y+z')(x'+y') 
C) (x+y+z')(x'+y) 
D) (x+y+z')(x'+y).

Question 11

An OR gate can be imagined as______________

Accepted Answer

A) switches connected in series 
B) switches connected in parallel 
C) mos transistor connected in series 
D) bjt transistor connected in series 
A) switches connected in series 
B) switches connected in parallel 
C) mos transistor connected in series 
D) bjt transistor connected in series

Question 12

Boolean Function is of the form of______________

Accepted Answer

A) truth values 
B) k=f(x,y,x) 
C) algebraic expression 
D) truth table 
A) truth values 
B) k=f(x,y,x) 
C) algebraic expression 
D) truth table

Question 13

(A + B)(A' * B') = ?

Accepted Answer

A) 1 
B) 0 
C) ab 
D) ab' 
A) 1 
B) 0 
C) ab 
D) ab'

Question 14

How many full adders are required to construct an m-bit parallel adder?

Accepted Answer

A) m/2 
B) m 
C) m-1 
D) m+1 
A) m/2 
B) m 
C) m-1 
D) m+1

Question 15

The involution of A is equal to______________

Accepted Answer

A) a 
B) a' 
C) 1 
D) 0 
A) a 
B) a' 
C) 1 
D) 0

Question 16

The minterm of any expression is denoted by

Accepted Answer

A) mt 
B) m 
C) m. 
D) min 
A) mt 
B) m 
C) m. 
D) min

Question 17

What is the minimum number of two input NAND gates used to perform the function of two input OR gates?

Accepted Answer

A) one 
B) two 
C) three 
D) four 
A) one 
B) two 
C) three 
D) four

Question 18

The canonical sum of product form of the function y(A,B) = A + B is______________

Accepted Answer

A) ab + bb + a'a 
B) ab + ab' + a'b 
C) ba + ba' + a'b' 
D) ab' + a'b + a'b' 
A) ab + bb + a'a 
B) ab + ab' + a'b 
C) ba + ba' + a'b' 
D) ab' + a'b + a'b'

Question 19

According to boolean law: A + 1 = ?______________

Accepted Answer

A) 1 
B) a 
C) 0 
D) a' 
A) 1 
B) a 
C) 0 
D) a'

Question 20

In the boolean function w=f(X,Y,Z), what is the RHS referred to as______________

Accepted Answer

A) right hand side 
B) expression 
C) literals 
D) boolean 
A) right hand side 
B) expression 
C) literals 
D) boolean

The time required for a gate or inverter to change its state is called______________

The general form for calculating the number of rows in a truth table is______________

The min term when X=Y=Z=0 is______________

In which of the following gates the output is 1 if and only if at least one input is 1?

Which of the following will give the sum of full adders as output?

Simplify Y = AB' + (A' + B)C.

The boolean function A + BC is a reduced form of

The max term when X=Y=Z=1 is______________

The number of literals in the expression F=X.Y' + Z are______________

The complement term for X'.Y'.Z + X.Y will be

An OR gate can be imagined as______________

Boolean Function is of the form of______________

(A + B)(A' * B') = ?

How many full adders are required to construct an m-bit parallel adder?

The involution of A is equal to______________

The minterm of any expression is denoted by

What is the minimum number of two input NAND gates used to perform the function of two input OR gates?

The canonical sum of product form of the function y(A,B) = A + B is______________

According to boolean law: A + 1 = ?______________

In the boolean function w=f(X,Y,Z), what is the RHS referred to as______________

Number Systems and Binary Codes

Boolean Algebra and Logic Circuits

Logic Circuit and Arithmetic Unit

Digital Number Systems and Comparators

Digital Comparators, Encoders, and Multiplexers

Digital Circuits and HDL Applications

Understanding Flip-Flop and Sequential Circuits

Registers and Counters in Digital Logic

Sequential Circuits and Fault Detection Techniques

Ram, Memory, and Storage Technology

Transmission, Memory and PLDS

Programmable Logic Devices PLDS and Field-Programmable Gate Arrays FPGAS

Filters

Exam 2: Boolean Algebra

The time required for a gate or inverter to change its state is called______________

The general form for calculating the number of rows in a truth table is______________

The min term when X=Y=Z=0 is______________

In which of the following gates the output is 1 if and only if at least one input is 1?

Which of the following will give the sum of full adders as output?

Simplify Y = AB' + (A' + B)C.

The boolean function A + BC is a reduced form of

The max term when X=Y=Z=1 is______________

The number of literals in the expression F=X.Y' + Z are______________

The complement term for X'.Y'.Z + X.Y will be

An OR gate can be imagined as______________

Boolean Function is of the form of______________

(A + B)(A' * B') = ?

How many full adders are required to construct an m-bit parallel adder?

The involution of A is equal to______________

The minterm of any expression is denoted by

What is the minimum number of two input NAND gates used to perform the function of two input OR gates?

The canonical sum of product form of the function y(A,B) = A + B is______________

According to boolean law: A + 1 = ?______________

In the boolean function w=f(X,Y,Z), what is the RHS referred to as______________

Number Systems and Binary Codes

Boolean Algebra and Logic Circuits

Logic Circuit and Arithmetic Unit

Digital Number Systems and Comparators

Digital Comparators, Encoders, and Multiplexers

Digital Circuits and HDL Applications

Understanding Flip-Flop and Sequential Circuits

Registers and Counters in Digital Logic

Sequential Circuits and Fault Detection Techniques

Ram, Memory, and Storage Technology

Transmission, Memory and PLDS

Programmable Logic Devices PLDS and Field-Programmable Gate Arrays FPGAS

Filters