Question 1

Odd parity of word can be conveniently tested by

Accepted Answer

A) or gate 
B) and gate 
C) nand gate 
D) xor gate 
A) or gate 
B) and gate 
C) nand gate 
D) xor gate

Question 2

What is the complement of X'Y'Z?

Accepted Answer

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

Question 3

The result of X+X.Y is X.

Accepted Answer

A) True 
 B)False

Question 4

A product term containing all K variables of the function in either complemented or uncomplemented form is called a______________

Accepted Answer

A) minterm 
B) maxterm 
C) midterm 
D) ? term 
A) minterm 
B) maxterm 
C) midterm 
D) ? term

Question 5

The number of full and half adders are required to add 16-bit number is______________

Accepted Answer

A) 8 half adders, 8 full adders 
B) 1 half adders, 15 full adders 
C) 16 half adders, 0 full adders 
D) 4 half adders, 12 full adders 
A) 8 half adders, 8 full adders 
B) 1 half adders, 15 full adders 
C) 16 half adders, 0 full adders 
D) 4 half adders, 12 full adders

Odd parity of word can be conveniently tested by

What is the complement of X'Y'Z?

The result of X+X.Y is X.

A product term containing all K variables of the function in either complemented or uncomplemented form is called a______________

The number of full and half adders are required to add 16-bit number is______________

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

Odd parity of word can be conveniently tested by

What is the complement of X'Y'Z?

The result of X+X.Y is X.

A product term containing all K variables of the function in either complemented or uncomplemented form is called a______________

The number of full and half adders are required to add 16-bit number is______________

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