Test your basic knowledge |

Computer Architecture And Design

Instructions:

Answer 38 questions in 15 minutes.
If you are not ready to take this test, you can study here.
Match each statement with the correct term.
Don't refresh. All questions and answers are randomly picked and ordered every time you load a test.

This is a study tool. The 3 wrong answers for each question are randomly chosen from answers to other questions. So, you might find at times the answers obvious, but you will see it re-enforces your understanding as you take the test each time.

1. An example of an improvement that would impact throughput (but not response time).
Add memory - additional processors to handle more tasks in a given time.
DRAM - RAM - Cache are examples of this type of memory.
Magnetic disk - flash memory are examples of this type of memory.
Computer speeds double every 18-24 months

2. What are embedded computers?
Desktop computer / laptop computer - server - super computer - embedded computer - mobile computing
Computer speeds double every 18-24 months
1- response time 2- throughput - response time and throughput are directly proportional or only interrelated - Interrelated only.
Computers that are lodged in other devices where their presence is not immediately obvious.

3. What is the $epc register used for?
Computer speeds double every 18-24 months
When a segment of the application has an absolute maximum execution time.
1- response time 2- throughput - response time and throughput are directly proportional or only interrelated - Interrelated only.
Points to the address of an instruction that caused an exception

4. How is CPU performance measured?
Algorithm - programming language - compiler - instruction set architecture
Storage that retains data only if it is receiving power
Instructions/unit time (e.g. - instructions/sec) - equal to 1/execution time
Desktop computer / laptop computer - server - super computer - embedded computer - mobile computing

5. What is throughput?
The number of tasks completed per unit of time.
Also called TLP. A form of parallelization of computer code across multiple processors in parallel computing environments - which focuses on distributing execution processes (threads) across different parallel computing nodes.
An abstract interface between the hardware and the lowest level software that encompasses all the information necessary to write a machine language program that will run correctly - including instructions - registers - memory access - I/O - etc.
Points to the current top of the stack

6. An example of volatile memory
Also called ILP. This is the potential overlap among instructions. There are two approaches: (1) hardware - and (2) software.
DRAM - RAM - Cache are examples of this type of memory.
Computer speeds double every 18-24 months
Points to the next instruction to be executed.

7. What is instruction - level parallelism?
When a segment of the application has an absolute maximum execution time.
A faster processor to complete task sooner - a better algorithm to complete the program/task sooner.
Procedure call. Copies PC to $ra - # push $t0 - Subu $sp - $sp - 4 - sw $t0 - ($sp) - # pop $t0 - Lw $t0 - ($sp) - addu $sp - $sp - 4
Also called ILP. This is the potential overlap among instructions. There are two approaches: (1) hardware - and (2) software.

8. What is the $pc register used for?
1- response time 2- throughput - response time and throughput are directly proportional or only interrelated - Interrelated only.
Computer speeds double every 18-24 months
When a segment of the application has an absolute maximum execution time.
Points to the next instruction to be executed.

9. What are the classes of computing applications (five)?
Desktop computer / laptop computer - server - super computer - embedded computer - mobile computing
High- level aspects of a computer's design - such as the memory system - the memory interconnect - and the design of the internal processor or CPU (central processing unit
The most expensive computers - costing tens of millions of dollars. They emphasize floating- point performance.
Also called TLP. A form of parallelization of computer code across multiple processors in parallel computing environments - which focuses on distributing execution processes (threads) across different parallel computing nodes.

10. What is data- level parallelism?
Desktop computer / laptop computer - server - super computer - embedded computer - mobile computing
Also called DLP. A form of parallelization of computing across multiple processors in parallel computing environments - which focuses on distributing the data across different parallel computing nodes.
There does not exist the case of negative zero. - Can perform a- b as a+ (- b) without adjustments inside the CPU.
A faster processor to complete task sooner - a better algorithm to complete the program/task sooner.

11. What is response time?
DRAM - RAM - Cache are examples of this type of memory.
Points to the address of an instruction that caused an exception
Computers that are lodged in other devices where their presence is not immediately obvious.
The total time required for the computer to to complete a task. (Includes disk accesses - memory accesses - I/O activities - OS overhead - and CPU execution time.)

12. One reason why two's compliment is used as opposed to signed magnitude or one's compliment?
There does not exist the case of negative zero. - Can perform a- b as a+ (- b) without adjustments inside the CPU.
The most expensive computers - costing tens of millions of dollars. They emphasize floating- point performance.
Also called ILP. This is the potential overlap among instructions. There are two approaches: (1) hardware - and (2) software.
An abstract interface between the hardware and the lowest level software that encompasses all the information necessary to write a machine language program that will run correctly - including instructions - registers - memory access - I/O - etc.

13. What are the five classic components of a computer?
Input - output - memory - datapath - control
A faster processor to complete task sooner - a better algorithm to complete the program/task sooner.
The total time required for the computer to to complete a task. (Includes disk accesses - memory accesses - I/O activities - OS overhead - and CPU execution time.)
There does not exist the case of negative zero. - Can perform a- b as a+ (- b) without adjustments inside the CPU.

14. An example of an improvement that would impact response time (but not throughput).
The performance enhancement possible with a given improvement is limited by the amount that the improvement feature is used.
A faster processor to complete task sooner - a better algorithm to complete the program/task sooner.
Algorithm - programming language - compiler - instruction set architecture
When a segment of the application has an absolute maximum execution time.

15. What is thread- level parallelism?
Non - volatile memory used to store programs and data between executions.
The total time required for the computer to to complete a task. (Includes disk accesses - memory accesses - I/O activities - OS overhead - and CPU execution time.)
Instructions/unit time (e.g. - instructions/sec) - equal to 1/execution time
Also called TLP. A form of parallelization of computer code across multiple processors in parallel computing environments - which focuses on distributing execution processes (threads) across different parallel computing nodes.

16. What is volatile memory?
1- response time 2- throughput - response time and throughput are directly proportional or only interrelated - Interrelated only.
When it is possible to occasionally miss the time constraint on an event - as long as not too many are missed.
Storage that retains data only if it is receiving power
Points to the address of an instruction that caused an exception

17. What are two examples of instruction - level parallelism?
(1) pipelining (2) multiple instruction issue
High- level aspects of a computer's design - such as the memory system - the memory interconnect - and the design of the internal processor or CPU (central processing unit
Procedure call. Copies PC to $ra - # push $t0 - Subu $sp - $sp - 4 - sw $t0 - ($sp) - # pop $t0 - Lw $t0 - ($sp) - addu $sp - $sp - 4
Memory used to hold program while they are executing.

18. What are the industry standard benchmarks to measure performance (e.g. - with different vendor chips)?
The total time required for the computer to to complete a task. (Includes disk accesses - memory accesses - I/O activities - OS overhead - and CPU execution time.)
Magnetic disk - flash memory are examples of this type of memory.
1- response time 2- throughput - response time and throughput are directly proportional or only interrelated - Interrelated only.
The number of tasks completed per unit of time.

19. How can you encode an ISA?
When a segment of the application has an absolute maximum execution time.
Using fixed or variable length encoding.
The most expensive computers - costing tens of millions of dollars. They emphasize floating- point performance.
Instructions/unit time (e.g. - instructions/sec) - equal to 1/execution time

20. What is price performance?
The combination of performance (measured primarily in therms of compute performance and graphics performance) and the price of a system.
Using fixed or variable length encoding.
Also called DLP. A form of parallelization of computing across multiple processors in parallel computing environments - which focuses on distributing the data across different parallel computing nodes.
Procedure call. Copies PC to $ra - # push $t0 - Subu $sp - $sp - 4 - sw $t0 - ($sp) - # pop $t0 - Lw $t0 - ($sp) - addu $sp - $sp - 4

21. What is secondary memory?
The combination of performance (measured primarily in therms of compute performance and graphics performance) and the price of a system.
Non - volatile memory used to store programs and data between executions.
Procedure call. Copies PC to $ra - # push $t0 - Subu $sp - $sp - 4 - sw $t0 - ($sp) - # pop $t0 - Lw $t0 - ($sp) - addu $sp - $sp - 4
1- response time 2- throughput - response time and throughput are directly proportional or only interrelated - Interrelated only.

22. What is non - volatile memory?
The performance enhancement possible with a given improvement is limited by the amount that the improvement feature is used.
The combination of performance (measured primarily in therms of compute performance and graphics performance) and the price of a system.
Storage that retains data even in the absence of a power source.
The specifics of a computer - including the detailed logic design and the packaging technology of the computer

23. Moore's Law
Computer speeds double every 18-24 months
There does not exist the case of negative zero. - Can perform a- b as a+ (- b) without adjustments inside the CPU.
Add memory - additional processors to handle more tasks in a given time.
The most expensive computers - costing tens of millions of dollars. They emphasize floating- point performance.

24. What does jal <proc> do?
Points to the next instruction to be executed.
Procedure call. Copies PC to $ra - # push $t0 - Subu $sp - $sp - 4 - sw $t0 - ($sp) - # pop $t0 - Lw $t0 - ($sp) - addu $sp - $sp - 4
Also called DLP. A form of parallelization of computing across multiple processors in parallel computing environments - which focuses on distributing the data across different parallel computing nodes.
The most expensive computers - costing tens of millions of dollars. They emphasize floating- point performance.

25. What is a real- time performance requirement?
There does not exist the case of negative zero. - Can perform a- b as a+ (- b) without adjustments inside the CPU.
Using fixed or variable length encoding.
When a segment of the application has an absolute maximum execution time.
Procedure call. Copies PC to $ra - # push $t0 - Subu $sp - $sp - 4 - sw $t0 - ($sp) - # pop $t0 - Lw $t0 - ($sp) - addu $sp - $sp - 4

26. Amdahl's Law
Points to the address of an instruction that caused an exception
Magnetic disk - flash memory are examples of this type of memory.
The performance enhancement possible with a given improvement is limited by the amount that the improvement feature is used.
Storage that retains data even in the absence of a power source.

27. What is main/primary memory?
Points to the address of an instruction that caused an exception
Non - volatile memory used to store programs and data between executions.
Memory used to hold program while they are executing.
Storage that retains data only if it is receiving power

28. What are the hardware/software components affecting program performance?
High- level aspects of a computer's design - such as the memory system - the memory interconnect - and the design of the internal processor or CPU (central processing unit
The number of tasks completed per unit of time.
Points to the current top of the stack
Algorithm - programming language - compiler - instruction set architecture

29. An example of something typically associated with RISC architecture that is not typical in CISC architecture.
Points to the address of an instruction that caused an exception
The specifics of a computer - including the detailed logic design and the packaging technology of the computer
Dedicated argument registers to reduce stack usage during procedure calls - consistently sized opcodes - separate instructions for store and load - improved linkage (jal and jr save $ra without using stack)
Also called ILP. This is the potential overlap among instructions. There are two approaches: (1) hardware - and (2) software.

30. What is an Instruction Set Architecture (ISA)?
An abstract interface between the hardware and the lowest level software that encompasses all the information necessary to write a machine language program that will run correctly - including instructions - registers - memory access - I/O - etc.
There does not exist the case of negative zero. - Can perform a- b as a+ (- b) without adjustments inside the CPU.
Desktop computer / laptop computer - server - super computer - embedded computer - mobile computing
Also called DLP. A form of parallelization of computing across multiple processors in parallel computing environments - which focuses on distributing the data across different parallel computing nodes.

31. An example of non - volatile memory
Also called ILP. This is the potential overlap among instructions. There are two approaches: (1) hardware - and (2) software.
Magnetic disk - flash memory are examples of this type of memory.
The total time required for the computer to to complete a task. (Includes disk accesses - memory accesses - I/O activities - OS overhead - and CPU execution time.)
When it is possible to occasionally miss the time constraint on an event - as long as not too many are missed.

32. Stored Program Concept
The total time required for the computer to to complete a task. (Includes disk accesses - memory accesses - I/O activities - OS overhead - and CPU execution time.)
Instructions and data are stored in memory as numbers
Points to the current top of the stack
Instructions/unit time (e.g. - instructions/sec) - equal to 1/execution time

33. What does hardware refer to?
The specifics of a computer - including the detailed logic design and the packaging technology of the computer
Add memory - additional processors to handle more tasks in a given time.
Instructions and data are stored in memory as numbers
Non - volatile memory used to store programs and data between executions.

34. What is included in the term organization?

35. What is a supercomputer?
DRAM - RAM - Cache are examples of this type of memory.
The most expensive computers - costing tens of millions of dollars. They emphasize floating- point performance.
Instructions/unit time (e.g. - instructions/sec) - equal to 1/execution time
Computer speeds double every 18-24 months

36. What are the base units of GHz?
The number of tasks completed per unit of time.
10^9 cycles per sec
Using fixed or variable length encoding.
High- level aspects of a computer's design - such as the memory system - the memory interconnect - and the design of the internal processor or CPU (central processing unit

37. What is the $sp register used for?
A faster processor to complete task sooner - a better algorithm to complete the program/task sooner.
Points to the current top of the stack
Points to the address of an instruction that caused an exception
Procedure call. Copies PC to $ra - # push $t0 - Subu $sp - $sp - 4 - sw $t0 - ($sp) - # pop $t0 - Lw $t0 - ($sp) - addu $sp - $sp - 4

38. What is soft real- time?
Storage that retains data only if it is receiving power
Non - volatile memory used to store programs and data between executions.
A faster processor to complete task sooner - a better algorithm to complete the program/task sooner.
When it is possible to occasionally miss the time constraint on an event - as long as not too many are missed.