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 are the five classic components of a computer?
Storage that retains data only if it is receiving power
The specifics of a computer - including the detailed logic design and the packaging technology of the computer
Input - output - memory - datapath - control
Add memory - additional processors to handle more tasks in a given time.

2. What are two examples of instruction - level parallelism?
There does not exist the case of negative zero. - Can perform a- b as a+ (- b) without adjustments inside the CPU.
The performance enhancement possible with a given improvement is limited by the amount that the improvement feature is used.
(1) pipelining (2) multiple instruction issue
Desktop computer / laptop computer - server - super computer - embedded computer - mobile computing

3. What does jal <proc> do?
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)
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.

4. How can you encode an ISA?
The specifics of a computer - including the detailed logic design and the packaging technology of the computer
Storage that retains data even in the absence of a power source.
Using fixed or variable length encoding.
Memory used to hold program while they are executing.

5. 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 next instruction to be executed.
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.)

6. What is the $epc register used for?
Points to the address of an instruction that caused an exception
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
Desktop computer / laptop computer - server - super computer - embedded computer - mobile computing
(1) pipelining (2) multiple instruction issue

7. What are the classes of computing applications (five)?
Storage that retains data only if it is receiving power
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.
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.

8. 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
Computers that are lodged in other devices where their presence is not immediately obvious.
Algorithm - programming language - compiler - instruction set architecture
The number of tasks completed per unit of time.

9. 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.)
The number of tasks completed per unit of time.
10^9 cycles per sec
Storage that retains data only if it is receiving power

10. What is thread- level parallelism?
Desktop computer / laptop computer - server - super computer - embedded computer - mobile computing
When a segment of the application has an absolute maximum 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.
Points to the next instruction to be executed.

11. What is a real- time performance requirement?
Points to the current top of the stack
DRAM - RAM - Cache are examples of this type of memory.
When a segment of the application has an absolute maximum execution time.
Instructions/unit time (e.g. - instructions/sec) - equal to 1/execution time

12. Moore's Law
Storage that retains data even in the absence of a power source.
Procedure call. Copies PC to $ra - # push $t0 - Subu $sp - $sp - 4 - sw $t0 - ($sp) - # pop $t0 - Lw $t0 - ($sp) - addu $sp - $sp - 4
Input - output - memory - datapath - control
Computer speeds double every 18-24 months

13. What is secondary memory?
Procedure call. Copies PC to $ra - # push $t0 - Subu $sp - $sp - 4 - sw $t0 - ($sp) - # pop $t0 - Lw $t0 - ($sp) - addu $sp - $sp - 4
Non - volatile memory used to store programs and data between executions.
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 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.)

14. 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.
Using fixed or variable length encoding.
DRAM - RAM - Cache are examples of this type of memory.
Add memory - additional processors to handle more tasks in a given time.

15. An example of an improvement that would impact response time (but not throughput).
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.
A faster processor to complete task sooner - a better algorithm to complete the program/task sooner.
Add memory - additional processors to handle more tasks in a given time.

16. What is a supercomputer?
The most expensive computers - costing tens of millions of dollars. They emphasize floating- point 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
Algorithm - programming language - compiler - instruction set architecture
Points to the next instruction to be executed.

17. What is main/primary memory?
Memory used to hold program while they are executing.
Instructions/unit time (e.g. - instructions/sec) - equal to 1/execution time
The specifics of a computer - including the detailed logic design and the packaging technology of the computer
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.

18. What is included in the term organization?

19. One reason why two's compliment is used as opposed to signed magnitude or one's compliment?
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.
The specifics of a computer - including the detailed logic design and the packaging technology of the computer
10^9 cycles per sec
There does not exist the case of negative zero. - Can perform a- b as a+ (- b) without adjustments inside the CPU.

20. What are embedded computers?
The specifics of a computer - including the detailed logic design and the packaging technology of the computer
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.
Algorithm - programming language - compiler - instruction set architecture
Computers that are lodged in other devices where their presence is not immediately obvious.

21. What is volatile memory?
Storage that retains data only if it is receiving power
1- response time 2- throughput - response time and throughput are directly proportional or only interrelated - Interrelated only.
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.

22. What is response time?
Storage that retains data even in the absence of a power source.
Computers that are lodged in other devices where their presence is not immediately obvious.
Add memory - additional processors to handle more tasks in a given 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.)

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

24. What are the industry standard benchmarks to measure performance (e.g. - with different vendor chips)?
1- response time 2- throughput - response time and throughput are directly proportional or only interrelated - Interrelated only.
(1) pipelining (2) multiple instruction issue
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.

25. What is price 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)
The combination of performance (measured primarily in therms of compute performance and graphics performance) and the price of a system.
Points to the address of an instruction that caused an exception
The most expensive computers - costing tens of millions of dollars. They emphasize floating- point performance.

26. What is throughput?
DRAM - RAM - Cache are examples of this type of memory.
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 number of tasks completed per unit of time.
When a segment of the application has an absolute maximum execution time.

27. Stored Program Concept
Storage that retains data even in the absence of a power source.
Storage that retains data only if it is receiving power
Instructions and data are stored in memory as numbers
10^9 cycles per sec

28. What is data- level parallelism?
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 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 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.
When it is possible to occasionally miss the time constraint on an event - as long as not too many are missed.

29. An example of volatile memory
Procedure call. Copies PC to $ra - # push $t0 - Subu $sp - $sp - 4 - sw $t0 - ($sp) - # pop $t0 - Lw $t0 - ($sp) - addu $sp - $sp - 4
Input - output - memory - datapath - control
DRAM - RAM - Cache are examples of this type of memory.
Storage that retains data even in the absence of a power source.

30. 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.
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.
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. What is non - volatile 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.)
Points to the address of an instruction that caused an exception
Storage that retains data even in the absence of a power source.
When it is possible to occasionally miss the time constraint on an event - as long as not too many are missed.

32. How is CPU performance measured?
A faster processor to complete task sooner - a better algorithm to complete the program/task sooner.
Instructions/unit time (e.g. - instructions/sec) - equal to 1/execution time
Using fixed or variable length encoding.
(1) pipelining (2) multiple instruction issue

33. An example of something typically associated with RISC architecture that is not typical in CISC architecture.
DRAM - RAM - Cache are examples of this type of memory.
Non - volatile memory used to store programs and data between executions.
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 most expensive computers - costing tens of millions of dollars. They emphasize floating- point performance.

34. What is the $pc register used for?
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.
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.
Add memory - additional processors to handle more tasks in a given time.

35. What is the $sp register used for?
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 current top of the 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 an Instruction Set Architecture (ISA)?
10^9 cycles per sec
The performance enhancement possible with a given improvement is limited by the amount that the improvement feature is used.
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.

37. What is soft real- time?
The number of tasks completed per unit of time.
Algorithm - programming language - compiler - instruction set architecture
When it is possible to occasionally miss the time constraint on an event - as long as not too many are missed.
There does not exist the case of negative zero. - Can perform a- b as a+ (- b) without adjustments inside the CPU.

38. What does hardware refer to?
Procedure call. Copies PC to $ra - # push $t0 - Subu $sp - $sp - 4 - sw $t0 - ($sp) - # pop $t0 - Lw $t0 - ($sp) - addu $sp - $sp - 4
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 specifics of a computer - including the detailed logic design and the packaging technology of the computer
The number of tasks completed per unit of time.