Unit 3 - Practice Quiz

1 Who is the mathematician credited with formalizing Boolean algebra?

2 In Boolean algebra, variables typically take on one of how many distinct values?

3 Which of the following operators typically represents the Boolean AND operation?

4 What is the complement (NOT) of the Boolean value $0$?

5 According to the principle of duality in Boolean algebra, to find the dual of an expression, you must swap $0$s with $1$s, and swap the OR operation () with which operation?

6 What is the dual of the Boolean identity ?

7 Which Boolean theorem is expressed by the equation ?

8 What is the result of the Involution Law (Double Negation) ?

9 According to De Morgan's Laws, is equal to:

10 A Boolean algebra can be defined as a lattice that is bounded, distributive, and what else?

11 In the context of a lattice, the Boolean OR operation () represents which of the following?

12 According to Stone's Representation Theorem, every finite Boolean algebra is isomorphic to the Boolean algebra of the power set of a finite set. If the set has elements, how many elements are in the Boolean algebra?

13 In a finite Boolean algebra, what are the minimal non-zero elements called?

14 In a Boolean function, what is a product (AND) term called if it contains every variable of the function exactly once (either complemented or uncomplemented)?

15 A sum-of-products (SOP) expression consists of:

16 What is the primary purpose of finding a minimal Boolean expression?

17 Which widely used diagrammatic method helps in finding minimal Boolean expressions for up to 4 variables?

18 A product term that implies the Boolean function and cannot be simplified further by combining it with another term is called a:

19 If a prime implicant is the ONLY prime implicant that covers a specific minterm of a function, it is known as an:

20 What does the Boolean Absorption Law state?

21 Find the dual of the Boolean expression .

22 Simplify the Boolean expression using basic Boolean theorems.

23 Convert the Boolean function into the standard (canonical) sum-of-products form.

24 In a Boolean algebra, which of the following identities correctly represents the Involution Law?

25 For a Boolean algebra treated as a lattice , the partial order is defined if and only if which of the following algebraic conditions holds?

26 Stone's Representation Theorem states that every finite Boolean algebra is isomorphic to the Boolean algebra of which of the following structures?

27 Consider the 3-variable Boolean function . What is the essential prime implicant of ?

28 Simplify the Boolean function to its minimal sum-of-products form.

29 Simplify the expression using Boolean algebra theorems.

30 What is the dual of the Boolean theorem ?

31 In the context of Karnaugh maps and logic simplification, a prime implicant of a Boolean function is defined as an implicant that:

32 If a finite Boolean algebra has at least two elements, what is the only possible cardinality (number of elements) for ?

33 In a lattice representing a Boolean algebra, the greatest lower bound (GLB) and least upper bound (LUB) of elements and correspond respectively to which Boolean operations?

34 Who is credited with introducing the algebraic structure that formalizes the rules of logic, which is now known as Boolean Algebra?

35 Which of the following Boolean expressions is in a valid Sum-of-Products (SOP) form?

36 The Consensus Theorem states that the expression is logically equivalent to which of the following?

37 What is the minimal Boolean expression for the function defined by the minterms for a 3-variable function ?

38 In Boolean algebra, elements $0$ and $1$ act as identity elements. Which of the following pairs correctly represents the identity laws for Boolean addition and multiplication?

39 For a Boolean function, an essential prime implicant is definitively characterized as a prime implicant that:

40 Given the Boolean function , what is its canonical (standard) sum-of-products expression assuming a two-variable system ?

41 Consider the set of positive divisors of 30, which forms a Boolean algebra under the operations , , and complement . What is the evaluated result of ?

42 In a Boolean algebra viewed as a lattice , which of the following conditions is strictly algebraically equivalent to the partial order relation ?

43 Let denote the total number of distinct self-dual Boolean functions of variables. What is the algebraic ratio ?

44 For a given Boolean algebra, the algebraic equation has a valid solution for if and only if which of the following bounding conditions holds true?

45 By Stone's Representation Theorem, any infinite Boolean algebra is guaranteed to be isomorphic to which of the following mathematical structures?

46 For the -variable parity function , what is the total number of prime implicants?

47 Let a Boolean function be defined as . Which of the following is the completely minimized sum-of-products form for ?

48 When minimizing a Boolean function that yields a 'cyclic prime implicant chart' (where no essential prime implicants exist), how does Petrick's Method algorithmically resolve the minimum cover?

49 Let denote the dual of a Boolean function . Based on the generalized De Morgan's Laws, which of the following identities correctly describes the algebraic relationship between , its complement , and its dual ?

50 In any Boolean algebra , a subset forms an ideal if it is downward directed and closed under the supremum (join) operation. Which of the following statements strictly defines a maximal ideal in ?

51 Which of the following singleton sets of logical connectives forms a functionally complete set for Boolean algebra, enabling the representation of any arbitrary Boolean function without assuming the availability of constant signals 0 and 1?

52 Using the Consensus Theorem, the expression minimizes to . What is the fully minimized result of applying the dual of the Consensus Theorem to the Product-of-Sums expression ?

53 According to the Representation Theorem for finite Boolean algebras, if is a Boolean algebra with cardinality , what is the exact number of distinct sub-algebras of that have exactly 16 elements?

54 Given the Boolean function . What is the total number of essential prime implicants required to cover this function?

55 Which of the following identically represents the Shannon Expansion of an arbitrary Boolean function with respect to variable in a valid Product-of-Sums format?

56 In the context of Boolean algebras viewed as lattices, the two absorption laws and are mathematically powerful enough to immediately imply which of the following core algebraic properties without invoking other postulates?

57 Consider the constant logic-high Boolean function . What is the uniquely valid prime implicant of this function?

58 Let . What is the precise algebraic expression for the dual function ?

59 Which of the following strictly enumerates the original set of Huntington Postulates, which are sufficient to axiomatize a Boolean Algebra over a set with two binary operations?

60 Let be a Boolean function of variables. The Reed-Muller expansion is an alternative canonical form based on rings, using only XOR () and AND () operations. Which of the following accurately describes the structure of the Reed-Muller canonical form compared to the standard Sum-of-Products (SOP)?