Scribd
Upload
3 views2 pages

Midterm2 Answer

This document outlines the mid-term examination for the Digital & Logic Circuits Design course at Nahda University, detailing the structure, including the number of questions and marks. It includes four questions focusing on Boolean functions, simplification techniques, K-map implementations, and designing a 4-bit adder. The document specifies the examiner and provides a time allowance for the exam.

Uploaded by

moustafa11122002
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
3 views2 pages

Midterm2 Answer

This document outlines the mid-term examination for the Digital & Logic Circuits Design course at Nahda University, detailing the structure, including the number of questions and marks. It includes four questions focusing on Boolean functions, simplification techniques, K-map implementations, and designing a 4-bit adder. The document specifies the examiner and provides a time allowance for the exam.

Uploaded by

moustafa11122002
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/ 2

Nahda University Semester: Fall 2022-2023

Faculty of Engineering Date: 27/11/2022


Department: Electrical and Communication Time Allowed: 1 hr
Course Code: CCE332 Marks: 20 Marks
Course Title: Digital & Logic Circuits Design Mid Term No. of Questions: 4
Examiner: Dr. Alaa Rabie Examination No. of Pages: 1

Answer the following questions:


Question (1) (3 marks)
Determine the Boolean functions for outputs F as a function of the inputs in the circuit in
the following Figure.

Solution:
T1=(XZ)’, T2=Y’
T3=(Y’Z)’
F=((XZ)’. (Y’Z)’)’

Question (2) (3 marks)


Simplify using Boolean algebra techniques:

Solution:

Question (3) (7 marks)


Simplify the following Boolean expressions using K–maps and implement them using
digital NAND gates only

F (A, B, C, D) = Σm(0, 1, 2, 9, 11) and Φ(A, B, C, D) = Σm(8, 10, 14, 15)


Solution:
Question (4) (7 marks)
Design a 4-bit adder using full adder module and use it to sum A={1001}, and B={0111}.
Solution:

Result=10000

You might also like