This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: 1 University of California at Berkeley College of Engineering Department of Electrical Engineering and Computer Science EECS 150 R.H.Katz Spring 2001 SECOND MIDTERM EXAMINATION Thursday, 22 March 2001 INSTRUCTIONS – READ THEM NOW! All work is to be done on these pages. Partial credit is given only if we can evaluate your approach: indicate your assumptions and write as neatly as possible. Points are assigned to problems based on our estimates of how long they should take – 1 point equals 1 minute. PACE YOURSELF ACCORDINGLY: it is better to get partial credit on all of the problems than to complete a handful of them. This is a closed book examination. You will not need a calculator or other information appliance. You may use a single 8.5” by 11” piece of paper (both sides) with prepared notes. Write your name and student ID Number at the top of each examination page. Please refrain from discussion the examination after you have taken it. A small number of students are taking a late examination due to special circumstances. It is a sad fact of life that cheating sometimes happens. It will not be tolerated. By signing below, you assert that all of the work included herein is your own, and that you understand the harsh penalties that will be imposed should cheating be detected – a 0 on the examination, and a letter of reprimand to your life: _________________________________ SID:__________________________ (Signature) _________________________________ (Name – Please Print!) QUESTION POINTS ASSIGNED POINTS OBTAINED 1 5 2 5 3 15 4 15 5 20 6 20 TOTAL 80 2 Student Name:____________________________ SID:___________________ Question 1 . True/False (5 Points) Circle T for true and F for false below(0.5 points each): (i) A flip-flop can enter a metastable state if its inputs change too close to the triggering clock edge. T F (ii) A synchronizer is a specialized circuit structure that guarantees that metastability will never occur. T F (iii) A Moore Machine usually has fewer states than a Mealy Machine with the same input/output behavior....
View Full Document
This note was uploaded on 05/17/2009 for the course CS 150 taught by Professor Staff during the Spring '08 term at Berkeley.
- Spring '08
- Computer Science