Scribd
Upload
105 views8 pages

Exam II - Sample PDF

This document is a sample exam for CSCI345 that contains multiple choice and circuit design questions. The exam has three parts: 1. Multiple choice questions about logic circuit concepts like complements, logic functions, and circuit minimization. 2. Circuit design questions involving implementing logic functions with NAND, NOR, XOR and XNOR gates, including a truth table and k-map minimization. 3. Combinational logic design questions including writing a truth table for a majority function, deriving a sum of products expression, and implementing the circuit using a multiplexer.

Uploaded by

wael mahfouz
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
105 views8 pages

Exam II - Sample PDF

This document is a sample exam for CSCI345 that contains multiple choice and circuit design questions. The exam has three parts: 1. Multiple choice questions about logic circuit concepts like complements, logic functions, and circuit minimization. 2. Circuit design questions involving implementing logic functions with NAND, NOR, XOR and XNOR gates, including a truth table and k-map minimization. 3. Combinational logic design questions including writing a truth table for a majority function, deriving a sum of products expression, and implementing the circuit using a multiplexer.

Uploaded by

wael mahfouz
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 8

CSCI345 Exam II - Sample

Part I: MCQ
Question 1 [10 points]: Select the appropriate answer for each question.

1. The complement of 𝑋. (𝑋̅𝑌̅ + 𝑋𝑌) is

a. 𝑋̅ + (𝑋 + 𝑌). (𝑋̅ + 𝑌̅)


b. 𝑋̅ + (𝑋 + 𝑌̅). (𝑋̅ + 𝑌̅)
c. 𝑋̅ + ̅̅̅̅̅̅̅̅̅̅
(𝑋 + 𝑌). (𝑋̅ + 𝑌̅)
d. 𝑋̅ + (𝑋). (𝑋̅ + 𝑌̅)

2. What is the simplest form to represent the function F(a, b, c ) = ∑ 𝑚 ( 1, 2, 4, 7)

a. F= a’ + c’ + c b
b. F= a’ ⨁ b’
c. F= a’ b’ c + a’ b c’ + a b’ c’ + a b c
d. F= a ⨁ b ⨁ c

Page 1 of 8
CSCI345 Exam II - Sample

3. What type of logic circuit is represented by the figure shown below?

a) XOR
b) XNOR
c) AND
d) XAND

4. The following function 𝑓 = 𝐴  (𝐴  𝐵) can be minimized as:

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

Page 2 of 8
CSCI345 Exam II - Sample

Part II: Implementation of Digital Circuits with NAND, NOR, XOR and XNOR
Question 1 [25 points]: Consider the following truth table where A, B, C and D are considered as
inputs and F is the output:
A B C D F
0 0 0 0 0
0 0 0 1 0
0 0 1 0 0
0 0 1 1 0
0 1 0 0 0
0 1 0 1 0
0 1 1 0 1
0 1 1 1 1
1 0 0 0 0
1 0 0 1 0
1 0 1 0 1
1 0 1 1 1
1 1 0 0 0
1 1 0 1 0
1 1 1 0 1
1 1 1 1 1

a- Express the function F in terms of S.O.P.

b- Verify that F can be minimized to F = BC + AC

Page 3 of 8
CSCI345 Exam II - Sample

c- Realize the simplified function using NAND gates only.

Page 4 of 8
CSCI345 Exam II - Sample

Question 2 [20 points]: Having the following function:


𝐹(𝐴, 𝐵, 𝐶, 𝐷) = ∑ 𝑚(1,2,3,6,7,8,9,12,13,15)
1) Minimize F using k-map

2) Draw the minimized logic circuit of F with digital logic gates.

Page 5 of 8
CSCI345 Exam II - Sample

Part III: Combinational Logic Design


Question 1 [25 points]: Given a Boolean function ‘F’ of 4 Boolean variables A, B, C & D.
The output of ‘F’ is 1 when the number of 1’s in the input is greater than the number of 0’s,
otherwise, F outputs 0.
Example: F = 1 when ABCD = 1011 because there are 3 ones and only 1 zero, and 3 > 1
a- Write the corresponding truth table

b- Write the Sum-of-Products expression for the output

Page 6 of 8
CSCI345 Exam II - Sample

c- Implement the circuit using a 8 to 1 Multiplexer.

Page 7 of 8
CSCI345 Exam II - Sample

Question 2 [20 points]: Consider the following truth table where X, Y and Z are considered as
inputs and A, B and C are the outputs:

a- Write the Sum-of-Products expression for the outputs.

b- Implement the circuit using a 3 to 8 decoder.

Page 8 of 8

You might also like