0% found this document useful (0 votes)
129 views6 pages

Midterm 1

This document contains the details of an exam for an electronics course. It lists 10 questions to be answered on the exam paper covering topics such as Boolean algebra, logic circuits, number conversions, and full adder simulations. The exam is worth a total of 75 marks and students are allowed one crib sheet with notes for the exam. Calculators are not permitted.

Uploaded by

miso
Copyright
© Attribution Non-Commercial (BY-NC)
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)
129 views6 pages

Midterm 1

This document contains the details of an exam for an electronics course. It lists 10 questions to be answered on the exam paper covering topics such as Boolean algebra, logic circuits, number conversions, and full adder simulations. The exam is worth a total of 75 marks and students are allowed one crib sheet with notes for the exam. Calculators are not permitted.

Uploaded by

miso
Copyright
© Attribution Non-Commercial (BY-NC)
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/ 6

ELEC 2607 (13)

Midterm 1 - Feb 9th

75 Marks

Answer all 10 questions. Write your answers in the space provided on the question paper. Anything written on the reverse side wont be marked. Authorized Memoranda: One crib sheet allowed per student; maximum letter-size paper. Crib sheet can be lled on both sides. Calculators are NOT allowed. Name: Student No.: Section: Question Marks Q1 Q2 Q3 Q4 Q5 Q6 Q7 Q8 Q9 Q10 Instructors Pavan Gunupudi Maitham Shams Total

1. Find the inverse for the following functions such that there are bars only on single letters. (a) a b(cd + e)

4 Marks

(b) (a + b)(c + d) + e

2. Perform conversion between number systems and ll out the empty boxes. All numbers are unsigned. Each entry in this question will be marked independently. 9 Marks Binary 110101101.11 200.25 Octal 156.4 Decimal Hex

3. Let A = 01100010 = (+98)10 , B = 11011101 = (35)10 in 8-bit 2s complement system. Perform the following operations to obtain the 8-bit answers and indicate if there is an overow (i.e. answer not valid). 8 Marks (a) A B

(b) A + B

(c) B A

(d) B + B

4. Simplify the following expressions using Boolean algebra. (a) z = a dc + a bd + abd + a bc d + bcd to 1 literal

10 Marks

(b) z = (x + z )(w + y ) + wxz to 4 literals

5. Use exhaustive proof to show whether the following equations are valid. bc (a) a + b + c = a

6 Marks

(b) ab + c = a + bc

6. Write the duals of the following expressions such that there are bars only on single letters. (a) a b+c a + bc

4 Marks

(b) ab(cd + e)

7. Prove the following identities using Boolean algebra. (a) Distributive Law: XY + Z = (X + Z )(Y + Z )

9 Marks

= XY + XZ (b) Consensus Theorem: XY + Y Z + XZ

+ Z )(X + Y )(X + Z ) = Z (X + Y ) (c) (X

8. Draw the simplest logic gate or circuit for the following descriptions. The inputs are a, b, c and the output is z . (a) z = 1 only when abc = 110 2 Marks

(b) z = 0 only when abc = 010

2 Marks

(c) z = 0 if abc = 010 or abc = 111

3 Marks

9. A 3-input full adder is being tested in a simulation. The following gure shows the waveforms for the inputs A, B and C. Determine the correct values of the output waveforms for Carry and Sum. 8 Marks

A( A( B( B(
Input(1( Input(2( Carry( in(

Carry( out(

C( C(

Sum(

Carry(

3"input(full(adder(
Sum(

10.

(a) Convert the following AND-OR circuit to a circuit consisting of only 2-input NAND gates and inverters (bubbles not allowed). 6 Marks
c a b
AND OR

AND

AND

OR AND AND

OR AND

(b) Convert the following NAND-NOR circuit to an AND-OR circuit (bubbles allowed). Skip the rst and third layer during conversion. 4 Marks
a b
NAND

NOR

c d

NOR

NOR

NAND

You might also like