Computer Organization Exam: CSCI 2150, East Tennessee State University, Exams of Computer Architecture and Organization

Download Computer Organization Exam: CSCI 2150, East Tennessee State University 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 (Tarnoff) – Computer Organization TEST 1 for Spring Semester, 2005 Read this before starting! • The total possible score for this test is 100 points. • This test is closed book and closed notes • You may NOT use a calculator. Leave all numeric answers in the form of a formula. • You may use one sheet of scrap paper that you must turn in with your test. • All answers must have a box drawn around them. This is to aid the grader (who might not be me!) Failure to do so might result in no credit for answer. Example: • 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. • Statement regarding academic misconduct from Section 5.7 of the East Tennessee State University Faculty Handbook, June 1, 2001: "Academic misconduct will be subject to disciplinary action. Any act of dishonesty in academic work constitutes academic misconduct. This includes plagiarism, the changing of 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' of the course, reprimand, probation, suspension, and expulsion. For a second academic offense the penalty is permanent expulsion." Basic Rules of Boolean Algebra: DeMorgan's Theorem: 1. A + 0 = A 7. A ⋅ A = A 2. A + 1 = 1 8. A ⋅ A = 0 3. A ⋅ 0 = 0 9. A = A 4. A ⋅ 1 = A 10. A + AB = A 5. A + A = A 11. A + AB = A + B 6. A + A = 1 12. (A + B)(A + C) = A + BC ____ _ _ _______ _ _ (AB) = (A + B) (A + B) = (A•B) Short-ish Answer (2 points each unless otherwise noted) 1. Calculate the period of a periodic pulse train with a frequency of 2 Gigahertz (2×109 Hertz). Be sure to include your units! 2. The AND operation in boolean algebra is analogous to what mathematical algebraic operation? a.) addition b.) multiplicative inverse c.) negation d.) multiplication e.) subtracting 1 f.) division 3. True or False: A signal with a 50% duty cycle has the same pulse width (duration of a logic one during a single cycle) regardless of the signal’s frequency. 4. How many combinations of 1's and 0's can a 6-bit number (i.e., 6 binary variables) have? a.) 26–1 b.) 26 – 1 c.) 26+1 d.) 26 e.) 26–1 – 1 f.) None of the above 5. For each of the following binary representations, give the decimal expression for the smallest/lowest value that can be represented using 9 bits. (2 points each) a.) unsigned binary: b.) 2's complement: c.) signed magnitude: 6. What is the minimum number of bits needed to represent 13210 in signed magnitude representation? a.) 6 b.) 7 c.) 8 d.) 9 e.) 10 f.) None of the above 7. True or False: The number 0010010001100010100011 is a valid BCD number. 8. True or False: The 8-bit value 101101102 represents the same value in both signed magnitude and 2's complement form. 9. Write the complete truth table for a 2-input NOR gate. The following two questions are based on the 8-bit binary addition shown below. 10. True or False: If the addition above is considered 8-bit 2’s complement, an overflow has occurred. 11. True or False: If the addition above is considered 8-bit unsigned, an overflow has occurred. A B X 01100011 +00110110 10011001