0% found this document useful (0 votes)
231 views8 pages

Final Exam Logic Design 20182-1

Final exam of logic design

Uploaded by

sadaldeen7745
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
0% found this document useful (0 votes)
231 views8 pages

Final Exam Logic Design 20182-1

Final exam of logic design

Uploaded by

sadaldeen7745
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

Philadelphia University Student Name:

Student Number:
Faculty of Engineering Serial Number:

Final Exam, Second Semester: 2018/2019


Dept. of Computer Engineering
Course Title: Logic Circuits Date: 02/06/2019
Course No: 630211 Time Allowed: 2 hours
Lecturer: Dr. Qadri Hamarsheh No. Of Pages: 8

Instructions:
 ALLOWED: pens and drawing tools (no red color).
 NOT ALLOWED: Papers, calculators, literatures and any handouts. Otherwise, it will lead to the non-approval of your
examination.
 Shut down Telephones, and other communication devices.
Please note:
 This exam paper contains 6 questions totaling 40 marks
 Write your name and your matriculation number on every page of the solution sheets.
 All solutions together with solution methods (explanatory statement) must be inserted in the labelled position on the solution
sheets.
 You can submit your exam after the first hour.
Basic notions: The aims of the questions in this part are to evaluate the required minimal student knowledge and skills. Answers in the
pass category represent the minimum understanding of basic concepts: Digital Systems, Binary Number Systems, Boolean Algebra,
Basic Logic Gates, Boolean Expression Simplification, Karnaugh Maps, Combinational and Sequential Circuits.
Question 1 Multiple Choice (10 marks)
Identify the choice that best completes the statement or answers the question.
1) The binary number 11101011000111010 can be written in hexadecimal as ________.
a) DD63A16 b) 1D63A16
c) 1D63116 d) 1D33A16

2) Refer to the following figure. If A = 0 and B = 1, what will be the logic states at X, Y and Z?

a) X=1, Y=1, Z=0 b) X=1, Y=0, Z=0


c) X=0, Y=0, Z=1 d) X=0, Y=1, Z=0

̅̅̅̅̅̅
̅ 𝑩𝑪
3) The simplification of the Boolean expression (𝑨 ̅ ) + (̅̅̅̅̅̅̅̅
𝑨𝑩̅ 𝑪 ) is
a) 0 b) 1
c) A d) BC
4) The equivalent canonical (standard) form for the following logical expression
𝐅 = 𝐀𝐁 + 𝐂 is
a) 𝐅 = 𝐀𝐁𝐂 + 𝐀 ̅ 𝐁𝐂 + 𝐀𝐁 ̅𝐂 + 𝐀̅𝐁̅𝐂
b) 𝐅 = 𝐀𝐁𝐂 + 𝐀𝐁 ̅𝐂 + 𝐀 ̅ 𝐂 + 𝐀𝐁𝐂̅
̅𝐁
c) 𝐅 = 𝐀𝐁𝐂 + 𝐀 ̅ 𝐁𝐂 + 𝐀𝐁 ̅𝐂 + 𝐀̅𝐁̅ 𝐂 + 𝐀𝐁𝐂̅
d) None of the above

1
5) The function 𝐅(𝐀, 𝐁, 𝐂) = ∑(𝟏, 𝟐, 𝟑, 𝟓, 𝟕) is equivalent to
a) ̅+𝑨
𝑪 ̅𝑩 b) 𝑪 + 𝑨𝑩
c) ̅
𝑪 + 𝑨𝑩 d) ̅
𝑪 + 𝑨𝑩

6) Which of the following circuits come under the class of combinational logic circuits?
1. Full adder 2. Full subtracter
3. Half adder 4. J-K flip
5. Counter
Select the correct answer from the codes given below:
a) 1 only b) 3 and 4
c) 4 and 5 d) 1, 2, and 3

7) The Boolean function realized by the logic circuit shown is

a) 𝐅 = Ʃ𝐦 (𝟎, 𝟏, 𝟑, 𝟓, 𝟗, 𝟏𝟎. 𝟏𝟒) b) 𝐅 = Ʃ𝐦 (𝟐, 𝟑, 𝟓, 𝟕, 𝟖, 𝟏𝟐. 𝟏𝟑)


c) 𝐅 = Ʃ𝐦 (𝟏, 𝟐, 𝟒, 𝟓, 𝟏𝟏, 𝟏𝟒. 𝟏𝟓) d) 𝐅 = Ʃ𝐦 (𝟐, 𝟑, 𝟓, 𝟕, 𝟖, 𝟗. 𝟏𝟐)

8) The circuit shown here is most likely a ________.

a) Adder b) Multiplexer
c) Demultiplexer d) Parity generator

9) If the input combination A=0, B=1 is applied to this circuit, the (steady state) output will be:

a) X=0, Y=0 b) X=0, Y=1


c) X=1, Y=0 d) X=1, Y=1
10) The characteristic equation for the T-Flip Flop is:
a) 𝑸(𝒕 + 𝟏) = 𝑻. 𝑸 ̅ + 𝑻 ̅. 𝑸 b) 𝑸(𝒕 + 𝟏) = 𝑻 ̅ + 𝑻. 𝑸
̅. 𝑸

2
Familiar and Unfamiliar Problems Solving: The aim of the questions in this part is to evaluate that the student has some basic
knowledge of the key aspects of the lecture material and can attempt to solve familiar and unfamiliar problems of Combinational and
Sequential Circuits and Analysis of Sequential Circuits.
Question 2 (6 marks)
a) List three weighted Binary codes. (1.5 marks)
Solution

b) For the following logic circuit, find 𝐃 = 𝐟(𝐀, 𝐁, 𝐂), that is, express the output D in terms of the inputs A,
B and C, simplify the Boolean expression obtained, and draw the circuit. (2.5 marks)

Solution

c) Express the function (2 marks)

in a sum of minterms form.


Solution

3
Question 3 (7 marks)
a) Construct the full adder using two half adders (use XOR gates) and one OR gate (you must proof
your answer with the help of equations). (4 marks)
Solution

b) Give the Characteristic equations and the Excitation tables for the 𝑺𝑹 and 𝑱𝑲 flip-flops.
(3 marks)
Solution

4
Question 4 (7 marks)
a) A combinatorial circuit is defined by the following three Boolean functions: (3 marks)
𝐅𝟏 = ̅̅̅̅̅̅̅̅̅̅̅
(𝐗 + 𝐙) + 𝐗𝐘𝐙
𝐅𝟐 = ̅̅̅̅̅̅̅̅̅̅̅
(𝐗 + 𝐙) + 𝐗 ̅𝐘𝐙
𝐅𝟑 = 𝐗𝐘̅𝐙 + (𝐗 ̅̅̅̅̅̅̅̅̅̅̅
+ 𝐙)
Design a circuit with a single decoder and external OR gates.
Solution

b) Design a 32-to-1 multiplexer using only 8-to-1 multiplexer. Use block diagram for the components.
(2 marks)
Solution

5
c) Complete the timing diagram, showing the state of the Q output over time as (SR Latch) the Set and
Reset switches are actuated. Assume that Q begins in the low state: (2 marks)

6
Question 5 (5 marks)
A sequential circuit with two D Flip-Flops, A and B; two inputs, x and y; and one output, z, is specified by the
following next-state and output equations:
𝑨(𝒕 + 𝟏) = 𝒙
̅𝒚 + 𝒙𝑨
𝑩(𝒕 + 𝟏) = 𝒙̅𝑩 + 𝒙𝑨
𝒛=𝑩
a) Draw the circuit. (1.5 marks)
b) List the state table for the sequential circuit. (2 marks)
c) Draw the corresponding state diagram. (1.5 marks)

Solution

7
Question 6 (5 marks)
Design a clocked sequential circuit that operates according to the following state diagram
(use JK Flip-Flops).

Solution

GOOD LUCK
8

You might also like