|
[求助]
求大佬辅导作业两个小时,有偿(600),题型如下
1. What is 2 to the power of 34? (1 mark)
2. What are the six levels of our computer architecture? Label the levels (1 mark) and the five interfaces between them (1 mark).
3. What is “translation”? Tell everything you know about it, and do not use the verb “translate” in your definition. (2 marks)
4. Consider a multilevel computer in which all the levels are different. Each level has instructions that are m times as powerful as those of the level below it; that is, one level r instruction can do the work of m level r − 1 instructions. If a level 1 program requires k seconds to run, how long would equivalent programs take at levels 2, 3, and 4, assuming n level r instructions are required to interpret a single r + 1 instruction? (2 marks)
5. Consider a computer with identical interpreters at levels 1, 2, 3, and 4. It takes an interpreter n instructions to fetch, examine, and execute one instruction. A level 1 instruction takes k nanoseconds to execute. How long does it take for an instruction at levels 2, 3, and 4? (2 marks)
6. Explain the big endian and little endian systems. (2 marks)
7. How long does it take to read a disk with 1000 cylinders, each containing five tracks of 2048 sectors? First, all the sectors of track 0 are to be read starting at sector 0, then all the sectors of track 1 starting at sector 0, and so on. The rotation time is 12 msec, and a seek takes 11 msec between adjacent cylinders and 20 msec for the worst case. Switching between tracks of a cylinder can be done instantaneously. (3 marks)
8. What is a pipeline? (1 mark)
9. Consider a pipeline with stage times of 1 microsecond, 4 microseconds, 400 nanoseconds, and 2 milliseconds. What is the latency (1 mark) and bandwidth (1 mark)?
10. Define “Hamming distance”. (1 mark)
11. For a code with Hamming distance 14, how many bit errors can be detected (1 mark) and corrected (1 mark)? Explain why MORE errors could not be detected or corrected (1 mark).
12. Create a Hamming codeword using even parity for the data word 10111111 (2 marks). Clearly identify your parity bits.
13. Is there an error in the following Hamming codeword, which was created using odd parity? If so, where? 1110001010 (2 marks).
14. What is the principal of spatial locality? (1 mark)
15. Consider a system that has three levels of cache and a main memory. Out of 90 CPU references to memory, 60 were hits in the first-level cache, 20 were hits in the second level, 6 were hits in the third level, and 4 went to main memory. If the respective access times are 4ns, 10ns, 40ns, and 120ns, what is the mean memory access time? (3 marks)
16. Clearly define what a “cylinder” is in a hard disk drive. (1 mark)
17. What are two technical differences between a hard disk drive and a solid state drive (1 mark)?
18. What is bus skew? (1 mark)
19. Draw an SR latch and explain exactly what is wrong with it. Clearly label every gate with text to identify which type of gate it is. (2 marks)
20. Draw the final elaborate D flip flop that we created in class. Clearly label every gate with text to identify which type of gate it is. (2 marks)
21. Clearly draw and explain how an edge trigger (a.k.a. pulse generator) works. (2 marks)
22. Draw a truth table and black-box multiplexer for a half adder. (3 marks) |
|