ECE 2030 Exam II, October 1st, 2009, Exams of Computer Science

Information about exam ii for ece 2030, held on october 1st, 2009. The exam covers various topics including boolean algebra, decoders, multiplexors, and encryption. Students are required to simplify expressions using k-maps, implement boolean expressions using decoders and multiplexors, and design circuits using given specifications. The exam is closed-book, closed-notes, and no calculators are allowed. It consists of 8 problems with varying points.

Typology: Exams

2012/2013

Uploaded on 04/08/2013

seetharaman_sehgal
seetharaman_sehgal 🇮🇳

4.4

(11)

117 documents

1 / 11

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
ECE 2030 E
12:05 – 13:25
Exam II
October 1st, 2009
1. The Georgia Tech Honor Code governs this examination.
2. There are 8 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 closed notes, closed text, no calculators, and no helper sheet.
7. The exam is 80 minutes
8. Plan your work! Points are noted next to each problem.
Problem Max Points Graded
1 10
2 5
3 10
4 15
5 10
6 10
7 5
8 10
Total 75
Student Name: __________________________________
Student Number: ________________________________
pf3
pf4
pf5
pf8
pf9
pfa

Partial preview of the text

Download ECE 2030 Exam II, October 1st, 2009 and more Exams Computer Science in PDF only on Docsity!

ECE 2030 E

Exam II

October 1

st

  1. The Georgia Tech Honor Code governs this examination.
  2. There are 8 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 closed notes, closed text, no calculators, and no helper sheet.
  7. The exam is 80 minutes 8. Plan your work! Points are noted next to each problem.

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

Student Name: __________________________________

Student Number: ________________________________

  1. Simplify the following expression to a sum of products form using K-maps.. In doing so i) draw the K-Map and clearly label all of the components, ii) list or otherwise identify clearly all prime implicants, and iii) and identify those which are essential.

F  ( BC ) DABD

  1. Construct a 16-1 multiplexor using 4-1 multiplexors. Clearly show all the signals and provide the truth table.
  1. Consider and encryption device where each 3 bit input number is encrypted by performing a bit by bit xor with the secret key 101. For example, for input 100, the output will be 100 ex-OR 101 = 001. Design a minimized circuit and design your solution using only 2 input NAND gates and inverters.
  1. Design a circuit that will take in a 3-bit number and produce a value of 1 if there is an even number of 1’s in the input and a 0 if there is an odd number of 1’s. You may use any design approach you wish.
  1. Show the implementation of the following Boolean expression in the PLA below.

FBCABC