This preview shows pages 1–3. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: Department of Electrical and Computer Engineering The Johns Hopkins University 520.137 Introduction to Electrical and Computer Engineering Fall 2008 Examination II 1. There are 4 problems. You have 60 minutes . 2. Closed book. Closed notes. One 8 . 5 11 cheat sheet allowed. 3. Read the questions carefully. Make sure that you answer EVERY question posed. 4. Express your final answer in the most compact and simplified form. 5. Justify all of your answers. 6. State all of your assumptions if necessary. 7. Show your work clearly, neatly, and precisely. 8. Make sure that your name appears on the exam booklet. I In mathematics, a prime number or a prime is a natural number (larger than one) that can be divided without a remainder only by one and itself. Prime numbers play a critical role in many public-key cryptography algorithms. Let us explore the design of a simple Prime Checker combinational logic circuit that can identify any prime out of all 4-bit non-negative integers (in other words, recognize all primes...
View Full Document
This note was uploaded on 02/02/2010 for the course ENGINEERIN 520.101 taught by Professor Tracdtran during the Winter '06 term at Johns Hopkins.
- Winter '06