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 secondary memory?
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
There does not exist the case of negative zero. - Can perform a- b as a+ (- b) without adjustments inside the CPU.
Non - volatile memory used to store programs and data between executions.

2. What are the base units of GHz?
Using fixed or variable length encoding.
Memory used to hold program while they are executing.
DRAM - RAM - Cache are examples of this type of memory.
10^9 cycles per sec

3. What is instruction - level parallelism?
Magnetic disk - flash memory are examples of this type of memory.
DRAM - RAM - Cache are examples of this type of memory.
Also called ILP. This is the potential overlap among instructions. There are two approaches: (1) hardware - and (2) software.
When a segment of the application has an absolute maximum execution time.

4. What is price performance?
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.
The combination of performance (measured primarily in therms of compute performance and graphics performance) and the price of a system.
Magnetic disk - flash memory are examples of this type of memory.

5. Amdahl's Law
The performance enhancement possible with a given improvement is limited by the amount that the improvement feature is used.
Magnetic disk - flash memory are examples of this type of memory.
Computer speeds double every 18-24 months
DRAM - RAM - Cache are examples of this type of memory.

6. What are embedded computers?
Computers that are lodged in other devices where their presence is not immediately obvious.
The performance enhancement possible with a given improvement is limited by the amount that the improvement feature is used.
Algorithm - programming language - compiler - instruction set architecture
Storage that retains data only if it is receiving power

7. What is non - volatile memory?
DRAM - RAM - Cache are examples of this type of memory.
Points to the next instruction to be executed.
Instructions/unit time (e.g. - instructions/sec) - equal to 1/execution time
Storage that retains data even in the absence of a power source.

8. What is the $epc register used for?
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)
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
A faster processor to complete task sooner - a better algorithm to complete the program/task sooner.

9. What does hardware refer to?
Input - output - memory - datapath - control
Also called ILP. This is the potential overlap among instructions. There are two approaches: (1) hardware - and (2) software.
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

10. What is included in the term organization?

11. What is a real- time performance requirement?
DRAM - RAM - Cache are examples of this type of memory.
Storage that retains data even in the absence of a power source.
When a segment of the application has an absolute maximum execution time.
The most expensive computers - costing tens of millions of dollars. They emphasize floating- point performance.

12. What are the classes of computing applications (five)?
Desktop computer / laptop computer - server - super computer - embedded computer - mobile computing
1- response time 2- throughput - response time and throughput are directly proportional or only interrelated - Interrelated only.
Points to the current top of the stack
(1) pipelining (2) multiple instruction issue

13. What is an Instruction Set Architecture (ISA)?
DRAM - RAM - Cache are examples of this type of memory.
Input - output - memory - datapath - control
Non - volatile memory used to store programs and data between executions.
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.

14. What are the hardware/software components affecting program performance?
Desktop computer / laptop computer - server - super computer - embedded computer - mobile computing
DRAM - RAM - Cache are examples of this type of memory.
The number of tasks completed per unit of time.
Algorithm - programming language - compiler - instruction set architecture

15. One reason why two's compliment is used as opposed to signed magnitude or one's compliment?
The combination of performance (measured primarily in therms of compute performance and graphics performance) and the price of a system.
There does not exist the case of negative zero. - Can perform a- b as a+ (- b) without adjustments inside the CPU.
Input - output - memory - datapath - control
10^9 cycles per sec

16. What is volatile memory?
When a segment of the application has an absolute maximum execution time.
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
A faster processor to complete task sooner - a better algorithm to complete the program/task sooner.
Storage that retains data only if it is receiving power

17. An example of non - volatile memory
Points to the current top of the stack
Magnetic disk - flash memory are examples of this type of memory.
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)

18. Stored Program Concept
Points to the next instruction to be executed.
DRAM - RAM - Cache are examples of this type of memory.
Instructions and data are stored in memory as numbers
Input - output - memory - datapath - control

19. An example of an improvement that would impact throughput (but not response time).
Desktop computer / laptop computer - server - super computer - embedded computer - mobile computing
DRAM - RAM - Cache are examples of this type of memory.
Add memory - additional processors to handle more tasks in a given time.
Instructions and data are stored in memory as numbers

20. Moore's Law
Computer speeds double every 18-24 months
When it is possible to occasionally miss the time constraint on an event - as long as not too many are missed.
Using fixed or variable length encoding.
Points to the address of an instruction that caused an exception

21. What are the five classic components of a computer?
Points to the current top of the stack
Procedure call. Copies PC to $ra - # push $t0 - Subu $sp - $sp - 4 - sw $t0 - ($sp) - # pop $t0 - Lw $t0 - ($sp) - addu $sp - $sp - 4
10^9 cycles per sec
Input - output - memory - datapath - control

22. What is throughput?
The number of tasks completed per unit of time.
Points to the address of an instruction that caused an exception
Storage that retains data even in the absence of a power source.
1- response time 2- throughput - response time and throughput are directly proportional or only interrelated - Interrelated only.

23. An example of an improvement that would impact response time (but not throughput).
Storage that retains data only if it is receiving power
A faster processor to complete task sooner - a better algorithm to complete the program/task sooner.
Memory used to hold program while they are executing.
When a segment of the application has an absolute maximum execution time.

24. What is response time?
Input - output - memory - datapath - control
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.)
10^9 cycles per sec
The number of tasks completed per unit of time.

25. What is the $sp register used for?
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 number of tasks completed per unit of time.
DRAM - RAM - Cache are examples of this type of memory.
Points to the current top of the stack

26. How can you encode an ISA?
Using fixed or variable length encoding.
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.
There does not exist the case of negative zero. - Can perform a- b as a+ (- b) without adjustments inside the CPU.

27. What does jal <proc> do?
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.
Procedure call. Copies PC to $ra - # push $t0 - Subu $sp - $sp - 4 - sw $t0 - ($sp) - # pop $t0 - Lw $t0 - ($sp) - addu $sp - $sp - 4
The performance enhancement possible with a given improvement is limited by the amount that the improvement feature is used.

28. What is soft real- time?
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.
10^9 cycles per sec
When it is possible to occasionally miss the time constraint on an event - as long as not too many are missed.

29. What are the industry standard benchmarks to measure performance (e.g. - with different vendor chips)?
The combination of performance (measured primarily in therms of compute performance and graphics performance) and the price of a system.
1- response time 2- throughput - response time and throughput are directly proportional or only interrelated - Interrelated only.
A faster processor to complete task sooner - a better algorithm to complete the program/task sooner.
Non - volatile memory used to store programs and data between executions.

30. An example of something typically associated with RISC architecture that is not typical in CISC architecture.
When a segment of the application has an absolute maximum 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)
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.

31. What is the $pc register used for?
The performance enhancement possible with a given improvement is limited by the amount that the improvement feature is used.
Points to the next instruction to be executed.
DRAM - RAM - Cache are examples of this type of 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

32. What is thread- level parallelism?
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.
Magnetic disk - flash memory are examples of this type of memory.
Using fixed or variable length encoding.

33. What are two examples of instruction - level parallelism?
The number of tasks completed per unit of time.
(1) pipelining (2) multiple instruction issue
Add memory - additional processors to handle more tasks in a given time.
DRAM - RAM - Cache are examples of this type of memory.

34. 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 specifics of a computer - including the detailed logic design and the packaging technology of the computer
10^9 cycles per sec

35. An example of volatile memory
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.
Instructions/unit time (e.g. - instructions/sec) - equal to 1/execution 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.

36. What is a supercomputer?
(1) pipelining (2) multiple instruction issue
The specifics of a computer - including the detailed logic design and the packaging technology of the computer
1- response time 2- throughput - response time and throughput are directly proportional or only interrelated - Interrelated only.
The most expensive computers - costing tens of millions of dollars. They emphasize floating- point performance.

37. What is main/primary 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
Computers that are lodged in other devices where their presence is not immediately obvious.
Memory used to hold program while they are executing.

38. 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.
When a segment of the application has an absolute maximum execution time.
Computers that are lodged in other devices where their presence is not immediately obvious.
The number of tasks completed per unit of time.