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. What is volatile memory?
Points to the current top of the stack
Storage that retains data only if it is receiving power
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.
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

2. How is CPU performance measured?
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.
The most expensive computers - costing tens of millions of dollars. They emphasize floating- point performance.
There does not exist the case of negative zero. - Can perform a- b as a+ (- b) without adjustments inside the CPU.

3. An example of an improvement that would impact response time (but not throughput).
(1) pipelining (2) multiple instruction issue
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.)
The specifics of a computer - including the detailed logic design and the packaging technology of the computer

4. How can you encode an ISA?
Using fixed or variable length encoding.
The number of tasks completed per unit of time.
Points to the next instruction to be executed.
Memory used to hold program while they are executing.

5. What is price performance?
The combination of performance (measured primarily in therms of compute performance and graphics performance) and the price of a system.
The most expensive computers - costing tens of millions of dollars. They emphasize floating- point performance.
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.
Non - volatile memory used to store programs and data between executions.

6. What is a real- time performance requirement?
Desktop computer / laptop computer - server - super computer - embedded computer - mobile computing
Points to the next instruction to be executed.
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.
When a segment of the application has an absolute maximum execution time.

7. What are the hardware/software components affecting program performance?
Algorithm - programming language - compiler - instruction set architecture
1- response time 2- throughput - response time and throughput are directly proportional or only interrelated - Interrelated only.
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

8. An example of something typically associated with RISC architecture that is not typical in CISC architecture.
Points to the current top of the stack
Also called ILP. This is the potential overlap among instructions. There are two approaches: (1) hardware - and (2) software.
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)
Storage that retains data only if it is receiving power

9. What is secondary memory?
Points to the next instruction to be executed.
The number of tasks completed per unit of time.
Points to the address of an instruction that caused an exception
Non - volatile memory used to store programs and data between executions.

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

11. 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.)
Magnetic disk - flash memory are examples of this type of memory.
10^9 cycles per sec
The performance enhancement possible with a given improvement is limited by the amount that the improvement feature is used.

12. What is main/primary memory?
Memory used to hold program while they are executing.
The number of tasks completed per unit of time.
Non - volatile memory used to store programs and data between executions.
10^9 cycles per sec

13. What is instruction - level parallelism?
1- response time 2- throughput - response time and throughput are directly proportional or only interrelated - Interrelated only.
Also called ILP. This is the potential overlap among instructions. There are two approaches: (1) hardware - and (2) software.
When it is possible to occasionally miss the time constraint on an event - as long as not too many are missed.
Algorithm - programming language - compiler - instruction set architecture

14. What is throughput?
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.
Storage that retains data only if it is receiving power
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.

15. What are the classes of computing applications (five)?
Storage that retains data even in the absence of a power source.
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
The specifics of a computer - including the detailed logic design and the packaging technology of the computer

16. An example of non - volatile memory
A faster processor to complete task sooner - a better algorithm to complete the program/task sooner.
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
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.)

17. What are the industry standard benchmarks to measure performance (e.g. - with different vendor chips)?
Non - volatile memory used to store programs and data between executions.
1- response time 2- throughput - response time and throughput are directly proportional or only interrelated - Interrelated only.
Instructions and data are stored in memory as numbers
Magnetic disk - flash memory are examples of this type of memory.

18. What are two examples of instruction - level parallelism?
When a segment of the application has an absolute maximum execution time.
Input - output - memory - datapath - control
Using fixed or variable length encoding.
(1) pipelining (2) multiple instruction issue

19. What is the $sp register used for?
(1) pipelining (2) multiple instruction issue
Points to the current top of the stack
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.)

20. Moore's Law
Non - volatile memory used to store programs and data between executions.
Points to the current top of the stack
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.

21. Stored Program Concept
The number of tasks completed per unit of time.
10^9 cycles per sec
Instructions and data are stored in memory as numbers
Storage that retains data even in the absence of a power source.

22. What is data- level parallelism?
Computer speeds double every 18-24 months
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.
Also called ILP. This is the potential overlap among instructions. There are two approaches: (1) hardware - and (2) software.
The number of tasks completed per unit of time.

23. What does hardware refer to?
Desktop computer / laptop computer - server - super computer - embedded computer - mobile computing
The most expensive computers - costing tens of millions of dollars. They emphasize floating- point performance.
1- response time 2- throughput - response time and throughput are directly proportional or only interrelated - Interrelated only.
The specifics of a computer - including the detailed logic design and the packaging technology of the computer

24. What is non - volatile 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
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.
Storage that retains data even in the absence of a power source.

25. An example of volatile memory
Algorithm - programming language - compiler - instruction set architecture
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.)
DRAM - RAM - Cache are examples of this type of memory.
Computers that are lodged in other devices where their presence is not immediately obvious.

26. What is the $epc register used for?
There does not exist the case of negative zero. - Can perform a- b as a+ (- b) without adjustments inside the CPU.
Points to the address of an instruction that caused an exception
Non - volatile memory used to store programs and data between executions.
Storage that retains data even in the absence of a power source.

27. What is included in the term organization?

28. What is an Instruction Set Architecture (ISA)?
The number of tasks completed per unit of time.
DRAM - RAM - Cache are examples of this type of memory.
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.
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.

29. What are embedded computers?
DRAM - RAM - Cache are examples of this type of memory.
Computers that are lodged in other devices where their presence is not immediately obvious.
Magnetic disk - flash memory are examples of this type of memory.
Points to the current top of the stack

30. An example of an improvement that would impact throughput (but not response time).
Storage that retains data even in the absence of a power source.
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.
Add memory - additional processors to handle more tasks in a given time.

31. What is a supercomputer?
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)
When it is possible to occasionally miss the time constraint on an event - as long as not too many are missed.
The most expensive computers - costing tens of millions of dollars. They emphasize floating- point performance.
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.

32. What is soft real- time?
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
Computers that are lodged in other devices where their presence is not immediately obvious.
10^9 cycles per sec

33. One reason why two's compliment is used as opposed to signed magnitude or one's compliment?
Using fixed or variable length encoding.
There does not exist the case of negative zero. - Can perform a- b as a+ (- b) without adjustments inside the CPU.
The combination of performance (measured primarily in therms of compute performance and graphics performance) and the price of a system.
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.

34. What is the $pc register used for?
Storage that retains data only if it is receiving power
Points to the next instruction to be executed.
Points to the address of an instruction that caused an exception
DRAM - RAM - Cache are examples of this type of memory.

35. What are the base units of GHz?
Memory used to hold program while they are executing.
Points to the next instruction to be executed.
10^9 cycles per sec
(1) pipelining (2) multiple instruction issue

36. Amdahl's Law
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.
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.)

37. What is thread- level parallelism?
Also called ILP. This is the potential overlap among instructions. There are two approaches: (1) hardware - and (2) software.
Instructions and data are stored in memory as numbers
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.
Input - output - memory - datapath - control

38. What are the five classic components of a computer?
Input - output - memory - datapath - control
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.
Points to the next instruction to be executed.
Computers that are lodged in other devices where their presence is not immediately obvious.