Which of the following about truth table is NOT true?

Question 1 options:

	A visual representation of a Boolean function.
	A truth table only lists true cases for a Boolean function. @ It includes false cases too.
	Input variables to the left, and an output the right
	All possible input values (combinations) are listed.

Save

Question 2 (1 point)

Which of the following can be the sum of an one-bit binary adder?

Question 2 options:

	AND gate
	OR gate
	XOR gate
	NAND gate

Save

Question 3 (1 point)

What is the last stage of a Product of Sum (POS) circuit?

Question 3 options:

	AND
	OR
	NOT
	NOR

Save

Question 4 (1 point)

Who proposed Boolean algebra?

Question 4 options:

	Donald Knuth
	Alan Turing
	George Boole
	Alonzo Church

Save

Question 5 (1 point)

How many possible Boolean functions are there for two-variable Boolean functions?

Question 5 options:

	16
	32
	8
	4

Save

Question 6 (1 point)

What is the arithmetic equivalence for a shift left operation?

Question 6 options:

	half the value
	double the value
	add by two
	minus by two

Save

Question 7 (1 point)

How many control lines are there for a 16x1 multiplexer?

Question 7 options:

	2
	4
	8
	16

Save

Question 8 (1 point)

Which of the following is NOT a Boolean function? Given x, y, z are Boolean variables.

Question 8 options:

	x AND y
	x OR y AND z
	true @ true is a Boolean function that maps whatever to true always.
	x + 2 @ The operator + would never be defined to operate two different objects (Boolean, and integer).

Save

Question 9 (1 point)

How many outputs are there for a 4-input decoder?

Question 9 options:

	8
	16
	32
	64

Save

Question 10 (1 point)

Which of the following is a computational complete component?

Question 10 options:

	AND
	OR
	XOR
	NOR

Save