This preview shows pages 1–2. 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: Assignment 3: Machine Organization, Crytography and Information Reliability ANSWER KEY CSci 1001, Spring 2010 Feb. 17, 2010 WHO GRADED WHICH PROBLEMS Problems 1 and 2: Faraz Mirzaei Problems 3 and 4: Tyler Smith Problems 5 and 6: Jonathon Lawson Problems 7 and 8: Phil Barry PROBLEM 1 (1a) Answers will vary. Any reasonable answer is fine. (1b) Answers will vary. Answers should have gotten full points if they (i) answer the question with enough detail, (ii) show an understanding of the technical features of the computer (e.g., no mixing up RAM and hard drive memory), (iii) tie the computers technical features into computing needs. PROBLEM 2 (2a) 2 12 = 4096 bytes (or 4KB). The approximate answer of 4000 bytes is also ok. (2b) If the opcode field has n bits, then there are at most 2 n possible instructions. The smallest n for which 2 n 117 is 7. (2c) . 25 (8 + 20) nsec + . 75 8 nsec = 13 nsec. (2d) Time it takes to print a page: 65 lines * 60 chars/line / (780 chars/sec) = 5 seconds....
View Full Document
This note was uploaded on 10/28/2010 for the course CSCI 1001 taught by Professor Staff during the Spring '08 term at Minnesota.
- Spring '08