Following Table - Computer Engineering - Solved Exam, Exams of Computer Science

Download Following Table - Computer Engineering - Solved Exam and more Exams Computer Science in PDF only on Docsity!

ECE 2030 F

Exam I – Solutions

September 15

th

1. Fill in the missing entries in the following table

Decimal 4-bit Binary 8-bit Binary 8 1000 00001000 11 1011 00001011

2. Say you were provided with the sequence of binary numbers below and told it was an ASCII string. Decode this string.

E X A M 1

4. The following is a correct CMOS implementation of a Boolean function F.

However, you are told it is inefficient and F can be implemented with a smaller number of transistors. Provide a CMOS transistor implementation that computes F but uses less number of transistors.

A

B

A

C

C

B

A B C

A B^ C

Vdd

F

F  ABC  ABC

 AC ( B  B )

 AC

6. The following circuit was designed using a mixed logic design methodology. Re- implement this circuit using only using only 2-input NOR gates and inverters. Compare the two circuits in terms of the number of transistors.

F  A  CDB ( D  CDB ) (^) 32 Transistors

Also 32 transistors

Note: There is more than one solution.

F

B

D

D

A

C

7. Construct any truth table on 3 variables, A, B, and C (the function should not evaluate to all 0 or all 1). For this truth table provide the following.

A B C F (A,B,C)

a. The Boolean expression in Sum of Minterms (SOM) form

F = ABC  ABC

b. The Boolean expression in Product of Maxterms form

F = ( A^ ^ B^ ^ C )( A^ ^ B^ ^ C )( A^ ^ B^ ^ C )( A^ ^ B^ ^ C )( A^ ^ B^ ^ C )( A^ ^ B^ ^ C )