EENG (INFE) 115 F16-17 Midterm Exam - Solutions

Download as pdf or txt
Download as pdf or txt
You are on page 1of 8

Faculty of Engineering

DEPARTMENT of ELECTRICAL AND ELECTRONIC ENGINEERING

EENG (INFE)115 Introduction to Logic Design

Instructors:

M. K. Uyguroğlu
G. Yemişcioğlu

Midterm EXAMINATION

November 17, 2016

Duration : 90 minutes

Number of Questions: 4

Good Luck

STUDENT’S
NUMBER
NAME
SURNAME
GROUP NO

Question Points
1 25

2 25

3 25

4 25

TOTAL 100

Read the following instructions carefully:


1. Calculators are not allowed.
2. Switch off mobile phones and do not borrow any stationery from your friends.
3. In your solutions, show all details you claim credit for.
EENG (INFE)115 Introduction to Logic Design – Midterm Examination
Question 1
a) Convert the binary number 11011.0101 to decimal. Show your steps. Show only the first two
digits after the decimal point. (3 pts.)

1 1
1 24  1 23  1 21  1  1 22  1 24  16  8  2  1  
4 16
 27.31

b) Convert the following decimal numbers to binary: (Show your steps.) (8 pts.)
i. 37
Remainder
37/2 = 18 1
18/2 = 9 0
9/2 = 4 1
4/2 = 2 0
2/2 = 1 0
½=0 1

 37 10  1001012

ii. 0.9
.
0.9 x 2 = 1.8 1
0.8 x 2 = 1.6 1
0.6 x 2 = 1.2 1
0.2 x 2 = 0.4 0
0.4 x 2 = 0.8 0
0.8 x 2 = 1.6 1
.
.

 0.910  0.11100  2
1100 is repeated 

c) Convert (10100101010.11)2 to hexadecimal and to octal. (4 pts.)

 
 010100101010.1100    52 A.C 16
 5 2 A C 
 
 010100101010.110    2452.6 8
 2 4 5 2 6 

M. K. Uyguroğlu, G. Yemişcioğlu Nov 17, 2016


EENG (INFE)115 Introduction to Logic Design – Midterm Examination

d) Convert +20 and +45 to binary, using the signed-2’s complement representation and
enough digit to accommodate the numbers. Then perform the binary equivalent of (-20) –
(+45). (10 pts.)

 20 10  10100 2   20    00010100   20   11101100 


 4510  1011012   45   00101101 (45)  (11010011)
 6510  10000012  (65)   01000001 8bits are required.
(20)  (45)  (20)  ( 45)
1 1 1 0 1 1 0 0
 1 1 0 1 0 0 1 1
_______________________
1 1 0 1 1 1 1 1 1    01000001   65 

M. K. Uyguroğlu, G. Yemişcioğlu Nov 17, 2016


EENG (INFE)115 Introduction to Logic Design – Midterm Examination

Question 2
a) Simplify the Boolean function F  x, y, z    1,3, 6, 7  in sum of products
using algebraic manipulation and implement it
i. with AND and inverter gates
ii. with OR and inverter gates

(15 pts.)

F  x, y , z    1,3, 6, 7     0, 2, 4,5 
F  x, y, z   xyz   xyz   xyz   xyz  xz   y  y '   xy  z  z '  xz   xy
1 1

F  x, y , z     xz  xy  implementation with AND and inverters


F  x, y, z    x  z    x  y  implementation with OR and inverters.

M. K. Uyguroğlu, G. Yemişcioğlu Nov 17, 2016


EENG (INFE)115 Introduction to Logic Design – Midterm Examination

b) Express the following function as a sum of minterms and as a product of


maxterms (10 pts.)

F  a, b, c, d   a  b  d   acd   ab  ad  acd 


a b c d ab ad acd  F min term
0 0 0 0 1 0 0 1 0
0 0 0 1 1 1 0 1 1
0 0 1 0 1 0 0 1 2
0 0 1 1 1 1 0 1 3
0 1 0 0 0 0 0 0 4
0 1 0 1 0 1 0 1 5
0 1 1 0 0 0 0 0 6
0 1 1 1 0 1 0 1 7
1 0 0 0 0 0 0 0 8
1 0 0 1 0 0 0 0 9
1 0 1 0 0 0 1 1 10
1 0 1 1 0 0 0 0 11
1 1 0 0 0 0 0 0 12
1 1 0 1 0 0 0 0 13
1 1 1 0 0 0 1 1 14
1 1 1 1 0 0 0 0 15

F  a, b, c, d     0,1, 2,3,5, 7,10,14 


F  a, b, c, d     4, 6,8,9,11,12,13,15 

M. K. Uyguroğlu, G. Yemişcioğlu Nov 17, 2016


EENG (INFE)115 Introduction to Logic Design – Midterm Examination

Question 3

For a given Boolean function F  w, x, y, z    1, 4,5, 6,12,14,15  which has the don’t
care conditions d  w, x, y, z     3, 7,11
a) Determine the sum of products (SOP).
b) Implement F with only NAND gates.
c) Determine the product of sums (POS).
d) Implement F with only NOR gates.
(25 pts.)

yz  yz yz yz 
wx 0 1  0
wx 1 1  1
wx 1 0 1 1
wx 0 0  0

F  w, x, y, z   wz  xy  xz 
F   w, x, y, z   xz   wyz
F  w, x, y, z    x  z  w  y  z  

M. K. Uyguroğlu, G. Yemişcioğlu Nov 17, 2016


EENG (INFE)115 Introduction to Logic Design – Midterm Examination

Question 4

Implement the following Boolean function F   x, y , z   y   xz  using the two-level


forms.
a) Karnaugh map of F’
b) NAND-AND for sum of products (SOP)
c) AND-NOR for sum of products (SOP)
d) OR-NAND for product of sums (POS)
e) NOR-OR for product of sums (POS)
(25 pts.)
a)
yz  yz yz yz 
x 0 0 1 0
x 0 0 1 1

F   x, y , z   y   xz 
F  x, y , z    y  xz   '

F  x, y, z   yz  xy
F   x, y, z    y  z   x  y 

F  x, y, z     y   z   x  y   

M. K. Uyguroğlu, G. Yemişcioğlu Nov 17, 2016


EENG (INFE)115 Introduction to Logic Design – Midterm Examination

M. K. Uyguroğlu, G. Yemişcioğlu Nov 17, 2016

You might also like