Download Exam 2 for Computer Organization | CSCI 2150 and more Exams Computer Architecture and Organization in PDF only on Docsity! Points missed: _____ Student's Name: _________________________________ Total score: _____ /100 points East Tennessee State University -- Department of Computer and Information Sciences CSCI 2150 – Computer Organization TEST 2 for Spring Semester, 2002 Instructor: David Tarnoff Section 001 Read this before starting! • The total possible score for this test is 100 points. • This test is closed book and closed notes • All answers must be placed in blanks provided. Failure to do so will result in no credit for answer. • 1 point will be deducted per answer for missing or incorrect units when required. No assumptions will be made for hexadecimal versus decimal, so you should always include the base in your answer. • If you perform work on the back of a page in this test, indicate that you have done so in case the need arises for partial credit to be determined. • Calculators are not allowed. Use the tables below for any conversions you may need. Leaving numeric equations is fine too. Binary Hex Binary Hex Power of 2 Equals 0000 0 1000 8 23 8 0001 1 1001 9 24 16 0010 2 1010 A 25 32 0011 3 1011 B 26 64 0100 4 1100 C 27 128 0101 5 1101 D 28 256 0110 6 1110 E 29 512 0111 7 1111 F 210 1K “Fine print” Academic Misconduct: ETSU Policy No. 3.13, October 1, 1979: "All students in attendance at East Tennessee State University are expected to be honorable." "Academic misconduct will be subject to disciplinary action. Any act of dishonesty in academic work constitutes academic misconduct. This includes plagiarism, the changing or falsifying of any academic documents or materials, cheating, and the giving or receiving of unauthorized aid in tests, examinations, or other assigned school work. Penalties for academic misconduct will vary with the seriousness of the offense and may include, but are not limited to: a grade of "F" on the work in question, a grade of "F" for the course, reprimand, probation, suspension, and expulsion. For a second academic offense, the penalty is permanent expulsion." 1. Fill out the truth table to the right for all possible combinations of inputs for the circuit below. (5 points) 2. In a truth table, the symbol ↑ indicates that the input is: (3 points) a.) a logic 0 c.) changing from a 1 to a 0 e.) this is an output symbol, not an input b.) a logic 1 d.) changing from a 0 to a 1 f.) a "don't care" 3. Show the D flip-flop output waveform Q based on the inputs D and CLK indicated in the figure below. Assume the flip-flop captures on the rising edge. (6 points) 4. Create the next state truth table and the output truth table for the state diagram below. Use the variable names S1 and S0 to represent the most significant and least significant bits respectively of the binary number identifying the state. Assume the states have been numbered A=0, B=1, C=2, and D=3. (8 points) S R Q Q D Q CLK D CLK Q S R Q Q P=0 P=0 P=1 P=0 00 0 10 0 P=1 11 0 P=1 P=0 01 1 P=1
