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. Stored Program Concept
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
Instructions and data are stored in memory as numbers
Using fixed or variable length encoding.
Algorithm - programming language - compiler - instruction set architecture

2. What is secondary memory?
The combination of performance (measured primarily in therms of compute performance and graphics performance) and the price of a system.
Add memory - additional processors to handle more tasks in a given 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.
Non - volatile memory used to store programs and data between executions.

3. What are the industry standard benchmarks to measure performance (e.g. - with different vendor chips)?
Add memory - additional processors to handle more tasks in a given time.
When it is possible to occasionally miss the time constraint on an event - as long as not too many are missed.
The performance enhancement possible with a given improvement is limited by the amount that the improvement feature is used.
1- response time 2- throughput - response time and throughput are directly proportional or only interrelated - Interrelated only.

4. What is the $pc register used for?
Input - output - memory - datapath - control
Points to the next instruction to be executed.
Points to the address of an instruction that caused an exception
There does not exist the case of negative zero. - Can perform a- b as a+ (- b) without adjustments inside the CPU.

5. What is main/primary memory?
Storage that retains data even in the absence of a power source.
Memory used to hold program while they are executing.
DRAM - RAM - Cache 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.

6. An example of non - volatile memory
Points to the address of an instruction that caused an exception
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.
Magnetic disk - flash memory are examples of this type of memory.
DRAM - RAM - Cache are examples of this type of memory.

7. What is the $epc register used for?
When it is possible to occasionally miss the time constraint on an event - as long as not too many are missed.
Points to the address of an instruction that caused an exception
Memory used to hold program while they are executing.
Input - output - memory - datapath - control

8. What is thread- level parallelism?
There does not exist the case of negative zero. - Can perform a- b as a+ (- b) without adjustments inside the CPU.
Magnetic disk - flash memory are examples of this type of memory.
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.
Instructions/unit time (e.g. - instructions/sec) - equal to 1/execution time

9. What is soft real- time?
Memory used to hold program while they are executing.
When it is possible to occasionally miss the time constraint on an event - as long as not too many are missed.
Computer speeds double every 18-24 months
Points to the address of an instruction that caused an exception

10. Moore's Law
Algorithm - programming language - compiler - instruction set architecture
When a segment of the application has an absolute maximum execution time.
Computer speeds double every 18-24 months
Magnetic disk - flash memory are examples of this type of memory.

11. What is a real- time performance requirement?
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 specifics of a computer - including the detailed logic design and the packaging technology of the computer
When a segment of the application has an absolute maximum execution time.
The performance enhancement possible with a given improvement is limited by the amount that the improvement feature is used.

12. What is included in the term organization?

13. Amdahl's Law
Magnetic disk - flash memory are examples of this type of memory.
Input - output - memory - datapath - control
(1) pipelining (2) multiple instruction issue
The performance enhancement possible with a given improvement is limited by the amount that the improvement feature is used.

14. How can you encode an ISA?
Using fixed or variable length encoding.
Algorithm - programming language - compiler - instruction set architecture
Points to the next instruction to be executed.
The most expensive computers - costing tens of millions of dollars. They emphasize floating- point performance.

15. What is response time?
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.)
Desktop computer / laptop computer - server - super computer - embedded computer - mobile computing
Instructions and data are stored in memory as numbers
The most expensive computers - costing tens of millions of dollars. They emphasize floating- point performance.

16. What are two examples of instruction - level parallelism?
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)
(1) pipelining (2) multiple instruction issue
Using fixed or variable length encoding.
Magnetic disk - flash memory are examples of this type of memory.

17. What does hardware refer to?
Magnetic disk - flash memory are examples of this type of memory.
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 specifics of a computer - including the detailed logic design and the packaging technology of the computer
When it is possible to occasionally miss the time constraint on an event - as long as not too many are missed.

18. What is data- level parallelism?
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.
DRAM - RAM - Cache 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.)
Also called ILP. This is the potential overlap among instructions. There are two approaches: (1) hardware - and (2) software.

19. What is an Instruction Set Architecture (ISA)?
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)
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.
(1) pipelining (2) multiple instruction issue
Storage that retains data even in the absence of a power source.

20. An example of something typically associated with RISC architecture that is not typical in CISC architecture.
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)
DRAM - RAM - Cache are examples of this type of memory.
Storage that retains data even in the absence of a power source.
Storage that retains data only if it is receiving power

21. One reason why two's compliment is used as opposed to signed magnitude or one's compliment?
Points to the current top of the stack
There does not exist the case of negative zero. - Can perform a- b as a+ (- b) without adjustments inside the CPU.
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.)
Using fixed or variable length encoding.

22. An example of volatile memory
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
DRAM - RAM - Cache are examples of this type of memory.
When it is possible to occasionally miss the time constraint on an event - as long as not too many are missed.
Points to the current top of the stack

23. What are the base units of GHz?
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.)
Desktop computer / laptop computer - server - super computer - embedded computer - mobile computing
10^9 cycles per sec
(1) pipelining (2) multiple instruction issue

24. What are the hardware/software components affecting program performance?
Add memory - additional processors to handle more tasks in a given time.
Algorithm - programming language - compiler - instruction set architecture
Input - output - memory - datapath - control
(1) pipelining (2) multiple instruction issue

25. What are the classes of computing applications (five)?
Memory used to hold program while they are executing.
Instructions/unit time (e.g. - instructions/sec) - equal to 1/execution time
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)
Desktop computer / laptop computer - server - super computer - embedded computer - mobile computing

26. What is a supercomputer?
The most expensive computers - costing tens of millions of dollars. They emphasize floating- point performance.
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)
Memory used to hold program while they are executing.
Desktop computer / laptop computer - server - super computer - embedded computer - mobile computing

27. How is CPU performance measured?
Instructions/unit time (e.g. - instructions/sec) - equal to 1/execution time
Also called ILP. This is the potential overlap among instructions. There are two approaches: (1) hardware - and (2) software.
The performance enhancement possible with a given improvement is limited by the amount that the improvement feature is used.
Procedure call. Copies PC to $ra - # push $t0 - Subu $sp - $sp - 4 - sw $t0 - ($sp) - # pop $t0 - Lw $t0 - ($sp) - addu $sp - $sp - 4

28. What is the $sp register used for?
Instructions/unit time (e.g. - instructions/sec) - equal to 1/execution time
Desktop computer / laptop computer - server - super computer - embedded computer - mobile computing
The specifics of a computer - including the detailed logic design and the packaging technology of the computer
Points to the current top of the stack

29. An example of an improvement that would impact throughput (but not response time).
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.
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 combination of performance (measured primarily in therms of compute performance and graphics performance) and the price of a system.

30. What does jal <proc> do?
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
Also called ILP. This is the potential overlap among instructions. There are two approaches: (1) hardware - and (2) software.
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

31. What is non - volatile memory?
10^9 cycles per sec
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.
Storage that retains data even in the absence of a power source.
The combination of performance (measured primarily in therms of compute performance and graphics performance) and the price of a system.

32. What is volatile memory?
Instructions/unit time (e.g. - instructions/sec) - equal to 1/execution time
Also called ILP. This is the potential overlap among instructions. There are two approaches: (1) hardware - and (2) software.
The most expensive computers - costing tens of millions of dollars. They emphasize floating- point performance.
Storage that retains data only if it is receiving power

33. What is price performance?
Using fixed or variable length encoding.
Non - volatile memory used to store programs and data between executions.
Storage that retains data only if it is receiving power
The combination of performance (measured primarily in therms of compute performance and graphics performance) and the price of a system.

34. What are embedded computers?
Instructions/unit time (e.g. - instructions/sec) - equal to 1/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
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.

35. An example of an improvement that would impact response time (but not throughput).
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.)
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 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.

36. What is throughput?
The number of tasks completed per unit of time.
The performance enhancement possible with a given improvement is limited by the amount that the improvement feature is used.
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.

37. What is instruction - level parallelism?
Also called ILP. This is the potential overlap among instructions. There are two approaches: (1) hardware - and (2) software.
Points to the current top of the stack
The number of tasks completed per unit of time.
Desktop computer / laptop computer - server - super computer - embedded computer - mobile computing

38. What are the five classic components of a computer?
Points to the address of an instruction that caused an exception
Input - output - memory - datapath - control
The most expensive computers - costing tens of millions of dollars. They emphasize floating- point performance.
Points to the current top of the stack