DIGITAL LOGIC FUNDAMENTALS

TWO MARKS

1. Define Digital Systems.

A system which processing discrete or digital signal is called as Digital System.

2.What is meant by bit?

A binary digit is called bit.

3. What is the best example of digital system?

Digital computer is the best example of a digital system.

4. Define Radix.
It specifies the number of symbols used for corresponding number system.

5. Define Nibble and Byte.

i). In binary number a group of four bits.ii). A group of 8 bits are called Byte.

6. List the number systems?

i) Decimal Number system ii) Binary Number system iii) Octal Number systemiv) Hexadecimal
Number system

7. Define binary logic?

Binary logic consists of binary variables and logical operations. The variables are designated by the
alphabets such as A, B, C, x, y, z, etc., with each variable having only two distinct values: 1 and
0. There are three basic logic operations: AND, OR, and NOT.

8. What is a Logic gate?

Logic gates are the basic elements that make up a digital system. The electronic gate is a circuit
that is able to operate on a number of binary inputs in order to perform a particular logical function.

9. What are the basic digital logic gates?

The three basic logic gates are:1. AND gate2. OR gate3. NOT gate

10.Which gates are called as the universal gates? What are its advantages?
The NAND and NOR gates are called as the universal gates. These gates are used to perform any type of
logic application.

11. How to represent a positive and negative sign in computers?

Positive (+) sign by 0 Negative (-) sign by 1.

12. What are the applications of octal number system?

The applications of octal number system are:
i. It is used for entering the binary data and displaying certain information’s.
ii.It is very important for the efficient use of microprocessors and other digital circuits.
13. Why is a hexadecimal number system called as an alpha numeric number system?
Hexa decimal number system has the base as 16 and therefore it requires 16 distinct symbols to
represent the numbers. These are numerals 0 to 9 and alphabets A to F. Since both numeric digits
and alphabets are used to represent the digits in hexadecimal number system, it is also called as an
alphanumeric number system.

14. Define Boolean algebra & Boolean Expression.

i). A system of algebra that operates on Boolean variables. The binary nature of Boolean algebra
makes it useful for analysis, simplification and design of logic circuits.

15. What are basic properties of Boolean algebra?

The basic properties of Boolean algebra are commutative property, associative property and
distributive property.

16. State the associative property of Boolean algebra.

The associative property of Boolean algebra states that the OR ing of severalvariables results in the
same regardless of the grouping of the variables. The associative property is stated as follows:i). A+
(B+C) = (A+B) +Cii). A (B C) = (A B) C

17. State the commutative property of Boolean algebra.

The commutative property states that the order in which the variables are OR ed makes no
difference. The commutative property is:i). A+B=B+Aii). AB = BA

18. State the distributive property of Boolean algebra.

The distributive property states that AND ing several variables and OR ing the result with a
single variable is equivalent to OR ing the single variable with each of the the several variables
and then AND ing the sums. The distributive property is:i). A+BC = (A+B) (A+C)ii). A (B+C) =
AB + AC

19. State De Morgan's theorem.

De Morgan suggested two theorems that form important part of Boolean algebra.They are,1) The
complement of a product is equal to the sum of the complements. (A . B)' = A' + B'
(Truth Table)
2) The complement of a sum term is equal to the product of the complements.(A + B)' = A'B'
(Truth Table)

20. What are the 2 forms of Boolean expression?

The two forms of Boolean expressions are:
i).Sum of Products Form
ii).Product of Sum Form

21. Define Minterm & Maxterm.

The products of Boolean expression where all possible variables appear once in complement or
un complement variables are called
Minterm.
A sum terms in a Boolean expression where all possible variables appear once, incomplement or
uncomplement form are called
Maxterm.

22. What is meant by karnaugh map or K-Map method?

A karnaugh map or k map is a pictorial form of truth table, in which the map diagram is made up of cells,
with each cell representing one minterm or maxterm of the function. This method provides a simple
straight forward procedure for minimizing Boolean function.

23. Define Cell.

The smallest unit of a karnaugh map, corresponding to one rows of a truth table. The input
variables are the cells coordinates and the output variable is the cells contents.

24. Define Pair, Quad, and Octet.

i).Pair:
A group of two adjacent cells in a karnaugh map. A pair cancels one variable in a K-Map simplification.
ii).Quad:
A group of four adjacent cells in a karnaugh map. A quad cancels two variable in a K-Map
simplification.
iii). Octet:
A group of eight adjacent cells in a karnaugh map. A pair cancels three variable in a K-Map
simplification.
25. What are called don’t care conditions?

In some logic circuits certain input conditions never occur, therefore the corresponding output
never appears. In such cases the output level is not defined, it can be either high or low. These output
levels are indicated by ‘X’ or ‘d’ in the truth table sand are called don’t care conditions or incompletely
specified functions.

26. What is tabulation method?

A method involving an exhaustive tabular search method for the minimum expression to solve a Boolean
equation for more variables is called as a tabulationmethod.

27. State the limitations of karnaugh map.

i) Generally it is limited to six variable map (i.e.) more then six variable involving expressions
are not reduced.ii) The map method is restricted in its capability since they are useful for simplifying only
Boolean expression represented in standard form.
28. What is a prime implicant?
A prime implicant is a product term obtained by combining the maximum possible number of
adjacent squares in the map. They cannot be reduced further.(Or)A prime implicant is a group of
minterms which cannot be combined with any other minterm or groups.

29. What is an essential prime implicant?

The Essential Prime Implicant is a prime implicant in which one or more minterms are unique, it contains
at least one minterm which is not contained in any other prime implicant.

30. Explain or list out the advantages and disadvantages of K-mapmethod?

The advantages of the K-map method are:
i). It is a fast method for simplifying expression up to four variables.
ii). It gives a visual method of logic simplification.
iii). Prime implicants and essential prime implicants are identified fast.
iv). Suitable for both SOP and POS forms of reduction.
v). It is more suitable for class room teachings on logic simplification.
The disadvantages of the K-map method are:
i). It is not suitable for computer reduction.
ii). K-maps are not suitable when the number of variables involved exceed four.
iii). Care must be taken to fill in every cell with the relevant entry, such as a 0, 1 (or)don’t care terms.

31. List out the advantages and disadvantages of Quine-Mc Cluskeymethod?

The advantages are:
i). This is suitable when the number of variables exceed four
.ii). Digital computers can be used to obtain the solution fast.
iii). Essential prime implicants, which are not evident in K-map, can be clearly seen in the final
results.
The disadvantages are:
i). Lengthy procedure than K-map.
ii). Requires several grouping and steps as compared to K-map.
iii). It is much slower.
iv). No visual identification of reduction process.v).
The Quine Mc Cluskey method is essentially a computer reduction method.

32. Define Duality Theorem.

The Duality theorem states that starting with a Boolean relation we can derive another Boolean
relation by:
i). Changing OR (operation) i.e., + (Plus) sign to an AND (operation) i.e., (dot) and Vice-versa.
ii). Complement any 0 or 1 appearing in the expression i.e., replacing contains 0 and 1by 1 and 0
respectively.

33. List the characteristics of digital ICs

i) Propagation delay ii) Power dissipation iii) Fan-in iv) Fan-out v) Noise margin

34. What is propagation delay?

It is defined as the time taken for the output of a gate to change after the inputs have changed.Propagation
delay times are defined as follows:- It is the propagation delay time in going from low level (0)
to high level (1).- It is the propagation delay time in going from High level (1) to high level
(0).Propagation delay - Propagation delay -
35. State De Morgan's theorem.

De Morgan suggested two theorems that form important part of Boolean algebra. They are,
1) The complement of a product is equal to the sum of the complements.

(AB)' = A' + B'

2) The complement of a sum term is equal to the product of the complements. (A + B)' = A'B'

36. Reduce A.A'C

A.A'C = 0.C [A.A' = 1]

=0

37. Reduce A(A + B)

A(A + B) = AA + AB

= A(1 + B) [1 + B = 1]

= A.

38. Reduce A'B'C' + A'BC' + A'BC

A'B'C' + A'BC' + A'BC = A'C'(B' + B) + A'B'C

= A'C' + A'BC [A + A' = 1]

= A'(C' + BC)

= A'(C' + B) [A + A'B = A + B]

39. Reduce AB + (AC)' + AB'C(AB + C)

AB + (AC)' + AB'C(AB + C) = AB + (AC)' + AAB'BC + AB'CC

= AB + (AC)' + AB'CC [A.A' = 0]

= AB + (AC)' + AB'C [A.A = 1]

= AB + A' + C' =AB'C [(AB)' = A' + B']

= A' + B + C' + AB'C [A + AB' = A + B]

= A' + B'C + B + C' [A + A'B = A + B]

= A' + B + C' + B'C

=A' + B + C' + B'

=A' + C' + 1

= 1 [A + 1 =1]

40. Simplify the following expression Y = (A + B)(A + C' )(B' + C' )

Y = (A + B)(A + C' )(B' + C' )

= (AA' + AC +A'B +BC )(B' + C') [A.A' = 0]

= (AC + A'B + BC)(B' + C' )

= AB'C + ACC' + A'BB' + A'BC' + BB'C + BCC'

= AB'C + A'BC'

41. Show that (X + Y' + XY)( X + Y')(X'Y) = 0

(X + Y' + XY)( X + Y')(X'Y) = (X + Y' + X)(X + Y' )(X' + Y) [A + A'B = A + B]

= (X + Y' )(X + Y' )(X'Y) [A + A = 1]

= (X + Y' )(X'Y) [A.A = 1]

= X.X' + Y'.X'.Y

= 0 [A.A' = 0]

42. Prove that ABC + ABC' + AB'C + A'BC = AB + AC + BC

ABC + ABC' + AB'C + A'BC=AB(C + C') + AB'C + A'BC

=AB + AB'C + A'BC

=A(B + B'C) + A'BC

=A(B + C) + A'BC

=AB + AC + A'BC

=B(A + C) + AC

=AB + BC + AC
=AB + AC +BC ...Proved

43. Convert the given expression in canonical SOP form Y = AC + AB + BC

Y = AC + AB + BC

=AC(B + B' ) + AB(C + C' ) + (A + A')BC

=ABC + ABC' + AB'C + AB'C' + ABC + ABC' + ABC

=ABC + ABC' +AB'C + AB'C' [A + A =1]

44. Define duality property.

Duality property states that every algebraic expression deducible from the postulates of Boolean
algebra remains valid if the operators and identity elements are interchanged. If the dual of an
algebraic expression is desired, we simply interchange OR and AND operators and replace 1's by
0's and 0's by 1's.

45. Simplify the following expression

Y = (A + B) (A = C) (B + C)

= (A A + A C + A B + B C) (B + C)

= (A C + A B + B C) (B + C)

=ABC+ACC+ABB+ABC+BBC+BCC

=ABC