Scribd
Upload
6 views

Practice

This document contains a summative quiz for a course on logic and digital circuits design. The quiz has three parts testing knowledge of logic gates, simplifying boolean expressions, and designing logic circuits based on given scenarios. Part 1 contains multiple choice questions about logic gates. Part 2 asks students to simplify boolean expressions. Part 3 provides a scenario and asks students to design a logic circuit for it, provide a truth table, and write the boolean expression.

Uploaded by

Dennis A
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
6 views

Practice

This document contains a summative quiz for a course on logic and digital circuits design. The quiz has three parts testing knowledge of logic gates, simplifying boolean expressions, and designing logic circuits based on given scenarios. Part 1 contains multiple choice questions about logic gates. Part 2 asks students to simplify boolean expressions. Part 3 provides a scenario and asks students to design a logic circuit for it, provide a truth table, and write the boolean expression.

Uploaded by

Dennis A
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Logic and Digital Circuits Design

CS 2613

Summative Quiz 1

Aligned PO Course Intended Learning Outcomes (CILOs)


CS1 CILO1 Differentiate the characteristics of different logic gates
CS1, CS6 CILO2 Simplify Boolean Functions using Boolean Algebra or Karnaugh Map.

PART I. Choose the letter of the best answer. (2pts each)

1. How many truth table entries are necessary for a four-input circuit?
a) 4 b) 8 c) 12 d) 16

2. Which input values will cause an AND logic gate to produce a HIGH output?
a) At least one input is HIGH b) At least one input is LOW c) All inputs are HIGH d) All inputs are LOW

3. The inputs of a NAND gate are connected together. The resulting circuit is ………….
a. OR gate b. AND gate c. NOT gate d. None of the these

4. The NOR gate is OR gate followed by ………………


a. AND gate b. NAND gate c. NOT gate d. None of the these

5. The expression of an XOR gate is ____________. (Hint: Verify using truth table)

a) A’B+AB’ b) AB+A’B’ c) A+A.B d) A’+B’

PART II. Simplify the given logic expression using Boolean algebra. Show solution to get a full mark (5pts each)

1. Find the simplified expression A’BC’+AC’


a) B b) A+C c) (A+B)C’ d) B’C

2. Evaluate the expression: (X + Z)(X + XZ’) + XY + Y

a) XY+Z’ b) Y+XZ’+Y’Z c) X’Z+Y d) X+Y

3. Simplify the expression: A’(A + BC) + (AC + B’C).

a) (AB’C+BC’) b) (A’B+C’) c) (A+ BC) d) AC

4. Find the simplified term Y’ (X’ + Y’) (X + X’Y)

a) XY’ b) X’Y c) X + Y d) X’Y’

5. What is the simplification value of MN(M + N’) + M(N + N’)?

a) M b) MN+M’N’ c) (1+M) d) M+N’

PART III. Design of digital logic circuit

An electronic system will only operate if three input switches R, S and T are correctly set.
An output signal (X = 1) will occur if:

Statement 1: R AND S are both in the ON position (logic 1) OR if R is in the OFF position (logic 0)

AND

Statement 2: S AND T are both in the ON position (logic 1).

1. Design a logic circuit (network) to represent the above situation (5 pts)


2. Give the truth table (5pts)
3. Give the logic expression that represents your designed circuit (5pts)

Design Guide Questions


a. What are the input and output variables?
b. What would be the number of possible combinations of inputs and outputs in my truth table?
c. For statement 1, what are the inputs involve and their initial states? What circuit that would give an output of TRUE if the statement
is satisfied?
d. For statement 2, what are the inputs involve and their initial states? What circuit that would give an output of TRUE if the statement
is satisfied?
d. Verify if the truth table satisfies the given case scenario.

Answer Sheet

SET:________
Logic and Digital Circuits Design
CS 2613

Summative Quiz 1

NAME:_________________________________________________
SECTION:____________

LETTE PART II. Solution Boolean Simplification


R
1.
PART I.
1.
2.
3.
4.
5.
2.

3.

4.

5.

PART III.

1. Logic Circuit Design

2. TRUTH TABLE

3. Logic Expression

You might also like