Scribd
Upload
35 views4 pages

First Exam Logic Design 2018-1

This document is an exam paper for the Logic Circuits course at Philadelphia University, detailing instructions and guidelines for students. It consists of 6 questions totaling 20 marks, covering topics such as digital systems, binary number systems, and Boolean algebra. Students are required to submit their solutions on labeled sheets and adhere to specific rules regarding allowed materials during the exam.

Uploaded by

fakhar_fast
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
35 views4 pages

First Exam Logic Design 2018-1

This document is an exam paper for the Logic Circuits course at Philadelphia University, detailing instructions and guidelines for students. It consists of 6 questions totaling 20 marks, covering topics such as digital systems, binary number systems, and Boolean algebra. Students are required to submit their solutions on labeled sheets and adhere to specific rules regarding allowed materials during the exam.

Uploaded by

fakhar_fast
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/ 4

Philadelphia University Student Name:

Student Number:
Faculty of Engineering Serial Number:

First Exam, First Semester: 2018/2019


Dept. of Computer Engineering
Course Title: Logic Circuits Date: 18/11/2018
Course No: 630211 Time Allowed: 50 Minutes
Lecturer: Dr. Qadri Hamarsheh No. Of Pages: 4

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 20 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 and Basic Logic Gates.

Question 1 Multiple Choice (8 marks)

Identify the choice that best completes the statement or answers the question.
1) Convert the hexadecimal number 14B16 to binary.
a) 1101010000012 b) 0001010011012
c) 0001010010112 d) 1011010000012
2) (734)8 = ( )16
a) 1DC b) C1D
c) DC1 d) 1CD
3) Convert 59.7210 to BCD.
a) 111011 b) 0101100101110010
c) 1110.11 d) 01011001.01110010
4) The range of decimal numbers that can be written in 6 bit sign magnitude form:
a) -31 to 31 b) 0 to 64
c) -32 to 31 d) -64 to 64
5) The circuit given below implements the equation, .

a) True b) False

1
6) The logic circuit shown can be minimized to

a) A b) B
c) C d) D
7) From the truth table below, determine the standard SOP expression.

a)
b)
c)
d)
8) The K-map in the figure below shows the correct implementation of the expression:
X= ACD + AB (CD + BC).

a) True b) False

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
Boolean Expression Simplification, Karnaugh Maps and Logic Diagrams.
Question 2 (2 marks)
Draw the Logic Circuit diagram for the following Boolean expression
Q  A  B  A.(C  B)

Solution

Question 3 (2 marks)
Simplify the following expression.
Q  B.C .(C  D)  C . D  C  A
Solution

3
Question 4 (2 marks)
Examine the following truth table and then write both SOP and POS Boolean expressions describing the output:

Solution

Question 5 (2 marks)
Express 𝐱 + 𝐲𝐳 as the sum of minterms.
Solution

Question 6 (4 marks)
Simplify the following Boolean expressions using a Karnaugh map. `
𝑭(𝑨, 𝑩, 𝑪, 𝑫) = ̅̅̅̅̅̅̅̅̅̅
(𝑪 + 𝑫) + 𝑨̅ 𝑪𝑫
̅ + 𝑨𝑩
̅𝑪̅+𝑨
̅𝑩̅ 𝑪𝑫 + 𝑨𝑪𝑫
̅
Solution

GOOD LUCK
4

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy