ECE 2030 C Exam I - September 15th, 2008, Exams of Computer Science

The instructions and questions for an electrical and computer engineering (ece) exam, specifically for the course ece 2030 c. The exam consists of 9 questions and lasts for 50 minutes. Students are required to write legibly and document their partial solutions. Topics such as boolean functions, switch level implementation, and mixed logic design.

Typology: Exams

2012/2013

Uploaded on 04/08/2013

seetamraju_555
seetamraju_555 🇮🇳

3.6

(5)

67 documents

1 / 10

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
ECE 2030 C
Exam I
September 15th, 2008
1. The Georgia Tech Honor Code governs this examination.
2. There are 9 questions and 11 pages including two blank worksheets. Make sure
you have all of them.
3. Please write/draw legibly. Use the work sheets for generating the solutions before
providing the final answer.
4. State any assumptions you feel you have to make or ask for clarification
5. Keep in mind it is difficult to give partial credit without written material. Please
make sure you document any partial solutions.
6. The exam is 50 minutes
7. Plan your work! Points are noted next to each problem.
Problem Max Points Graded
1 10
2 10
3 10
4 10
5 10
6 5
7 10
8 10
9 15
Total 100
Student Name: __________________________________
Student Number: ________________________________
pf3
pf4
pf5
pf8
pf9
pfa

Partial preview of the text

Download ECE 2030 C Exam I - September 15th, 2008 and more Exams Computer Science in PDF only on Docsity!

ECE 2030 C

Exam I

September 15

th

  1. The Georgia Tech Honor Code governs this examination.
  2. There are 9 questions and 11 pages including two blank worksheets. Make sure you have all of them.
  3. Please write/draw legibly. Use the work sheets for generating the solutions before providing the final answer.
  4. State any assumptions you feel you have to make or ask for clarification
  5. Keep in mind it is difficult to give partial credit without written material. Please make sure you document any partial solutions.
  6. The exam is 50 minutes 7. Plan your work! Points are noted next to each problem.

Problem Max Points Graded 1 10 2 10 3 10 4 10 5 10 6 5 7 10 8 10 9 15 Total 100

Student Name: __________________________________

Student Number: ________________________________

  1. Fill in the missing entries in the following table

Decimal 6-bit Binary 8-bit Binary Octal Hexadecimal 33 1A

  1. Provide a switch level implementation of the Boolean function defined by the following truth table.
  1. This question deals with Mixed Logic Design. Implement the following expression using only NOR and NOT gates. Use the mixed logic notation we have used in class. Do not assume that the complements of the inputs are available. Do not simplify the expression. Provide the number of transistors in the implementa- tion.

F ( BC ) CDAC ( BD )

Number of Transistors: ___________

  1. The following circuit was designed using a mixed logic design methodology. Write the Boolean expression that is computed by this circuit.

F

B D

D

A

C

F = _______________________________________

  1. Draw the DeMorgan equivalent gates.
  1. The following is a truth table for a Boolean expression.

a. Write the expression in sum-of-minterms form and product-of-maxterms form.

A B C F

F (POS) = ___________________________________________

F (SOP) = ___________________________________________

b. Now simplify the preceding expression algebraically.