Question 1

There are many situations in logic design in which simplification of logic expression is possible in terms of XOR and______________ operations.

Accepted Answer

A) x-nor 
B) xor 
C) nor 
D) nand 
A) x-nor 
B) xor 
C) nor 
D) nand A

Question 2

The code where all successive numbers differ from their preceding number by single bit is______________

Accepted Answer

A) alphanumeric code 
B) bcd 
C) excess 3 
D) gray 
A) alphanumeric code 
B) bcd 
C) excess 3 
D) gray D

Question 3

In case of XOR/XNOR simplification we have to look for the following______________

Accepted Answer

A) diagonal adjacencies 
B) offset adjacencies 
C) straight adjacencies 
D) both diagonal and offset adjencies 
A) diagonal adjacencies 
B) offset adjacencies 
C) straight adjacencies 
D) both diagonal and offset adjencies D

Question 4

Canonical form is a unique way of representing

Accepted Answer

A) sop 
B) minterm 
C) boolean expressions 
D) pos 
A) sop 
B) minterm 
C) boolean expressions 
D) pos

Question 5

There are______________  Minterms for 3 variables (a, b, c).

Accepted Answer

A) 0 
B) 2 
C) 8 
D) 1 
A) 0 
B) 2 
C) 8 
D) 1

Question 6

A variable on its own or in its complemented form is known as a______________

Accepted Answer

A) product term 
B) literal 
C) sum term 
D) word 
A) product term 
B) literal 
C) sum term 
D) word

Question 7

The K-map based Boolean reduction is based on the following Unifying Theorem: A + A' = 1.

Accepted Answer

A) impact 
B) non impact 
C) force 
D) complementarity 
A) impact 
B) non impact 
C) force 
D) complementarity

Question 8

It should be kept in mind that don't care terms should be used along with the terms that are present in

Accepted Answer

A) minterms 
B) expressions 
C) k-map 
D) latches 
A) minterms 
B) expressions 
C) k-map 
D) latches

Question 9

How many two input AND gates and two input OR gates are required to realize Y = BD + CE + AB?

Accepted Answer

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

Question 10

Which of following are known as universal gates?

Accepted Answer

A) nand & nor 
B) and & or 
C) xor & or 
D) ex-nor & xor 
A) nand & nor 
B) and & or 
C) xor & or 
D) ex-nor & xor

Question 11

A full adder logic circuit will have______________

Accepted Answer

A) two inputs and one output 
B) three inputs and three outputs 
C) two inputs and two outputs 
D) three inputs and two outputs 
A) two inputs and one output 
B) three inputs and three outputs 
C) two inputs and two outputs 
D) three inputs and two outputs

Question 12

____________expressions can be implemented using either (1) 2-level AND-OR logic circuits or (2) 2-level NAND logic circuits.

Accepted Answer

A) pos 
B) literals 
C) sop 
D) pos. 
A) pos 
B) literals 
C) sop 
D) pos.

Question 13

Each group of adjacent Minterms (group size in powers of twos) corresponds to a possible product term of the given______________

Accepted Answer

A) function 
B) value 
C) set 
D) word 
A) function 
B) value 
C) set 
D) word

Question 14

Using the transformation method you can realize any POS realization of OR-AND with only.

Accepted Answer

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

Question 15

There are____________cells in a 4-variable K-map.

Accepted Answer

A) 12 
B) 16 
C) 18 
D) 8 
A) 12 
B) 16 
C) 18 
D) 8

Question 16

The NOR gate output will be high if the two inputs are______________

Accepted Answer

A) 00 
B) 01 
C) 10 
D) 11 
A) 00 
B) 01 
C) 10 
D) 11

Question 17

Maxterm is the sum of______________    of the corresponding Minterm with its literal complemented.

Accepted Answer

A) terms 
B) words 
C) numbers 
D) nibble 
A) terms 
B) words 
C) numbers 
D) nibble

Question 18

Each product term of a group, w'.x.y' and w.y, represents the______________       in that group.

Accepted Answer

A) input 
B) pos 
C) sum-of-minterms 
D) sum of maxterms 
A) input 
B) pos 
C) sum-of-minterms 
D) sum of maxterms

Question 19

The prime implicant which has at least one element that is not present in any other implicant is known as

Accepted Answer

A) essential prime implicant 
B) implicant 
C) complement 
D) prime complement 
A) essential prime implicant 
B) implicant 
C) complement 
D) prime complement

Question 20

Product-of-Sums expressions can be implemented using______________

Accepted Answer

A) 2-level or-and logic circuits 
B) 2-level nor logic circuits 
C) 2-level xor logic circuits 
D) both 2-level or-and and nor logic circuits 
A) 2-level or-and logic circuits 
B) 2-level nor logic circuits 
C) 2-level xor logic circuits 
D) both 2-level or-and and nor logic circuits

There are many situations in logic design in which simplification of logic expression is possible in terms of XOR and______________ operations.

The code where all successive numbers differ from their preceding number by single bit is______________

In case of XOR/XNOR simplification we have to look for the following______________

Canonical form is a unique way of representing

There are______________ Minterms for 3 variables (a, b, c).

A variable on its own or in its complemented form is known as a______________

The K-map based Boolean reduction is based on the following Unifying Theorem: A + A' = 1.

It should be kept in mind that don't care terms should be used along with the terms that are present in

How many two input AND gates and two input OR gates are required to realize Y = BD + CE + AB?

Which of following are known as universal gates?

A full adder logic circuit will have______________

____________expressions can be implemented using either (1) 2-level AND-OR logic circuits or (2) 2-level NAND logic circuits.

Each group of adjacent Minterms (group size in powers of twos) corresponds to a possible product term of the given______________

Using the transformation method you can realize any POS realization of OR-AND with only.

There are____________cells in a 4-variable K-map.

The NOR gate output will be high if the two inputs are______________

Maxterm is the sum of______________ of the corresponding Minterm with its literal complemented.

Each product term of a group, w'.x.y' and w.y, represents the______________ in that group.

The prime implicant which has at least one element that is not present in any other implicant is known as

Product-of-Sums expressions can be implemented using______________

Number Systems and Binary Codes

Boolean Algebra

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 3: Boolean Algebra and Logic Circuits

There are many situations in logic design in which simplification of logic expression is possible in terms of XOR and______________ operations.

The code where all successive numbers differ from their preceding number by single bit is______________

In case of XOR/XNOR simplification we have to look for the following______________

Canonical form is a unique way of representing

There are______________ Minterms for 3 variables (a, b, c).

A variable on its own or in its complemented form is known as a______________

The K-map based Boolean reduction is based on the following Unifying Theorem: A + A' = 1.

It should be kept in mind that don't care terms should be used along with the terms that are present in

How many two input AND gates and two input OR gates are required to realize Y = BD + CE + AB?

Which of following are known as universal gates?

A full adder logic circuit will have______________

____________expressions can be implemented using either (1) 2-level AND-OR logic circuits or (2) 2-level NAND logic circuits.

Each group of adjacent Minterms (group size in powers of twos) corresponds to a possible product term of the given______________

Using the transformation method you can realize any POS realization of OR-AND with only.

There are____________cells in a 4-variable K-map.

The NOR gate output will be high if the two inputs are______________

Maxterm is the sum of______________ of the corresponding Minterm with its literal complemented.

Each product term of a group, w'.x.y' and w.y, represents the______________ in that group.

The prime implicant which has at least one element that is not present in any other implicant is known as

Product-of-Sums expressions can be implemented using______________

Number Systems and Binary Codes

Boolean Algebra

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