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

2. What is main/primary memory?
10^9 cycles per sec
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.
Memory used to hold program while they are executing.

3. What is secondary memory?
The most expensive computers - costing tens of millions of dollars. They emphasize floating- point performance.
When a segment of the application has an absolute maximum execution time.
Non - volatile memory used to store programs and data between executions.
Instructions/unit time (e.g. - instructions/sec) - equal to 1/execution time

4. Stored Program Concept
Points to the address of an instruction that caused an exception
DRAM - RAM - Cache are examples of this type of memory.
Instructions and data are stored in memory as numbers
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.

5. What are the hardware/software components affecting program performance?
Desktop computer / laptop computer - server - super computer - embedded computer - mobile computing
Input - output - memory - datapath - control
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)
Algorithm - programming language - compiler - instruction set architecture

6. 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.
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.
A faster processor to complete task sooner - a better algorithm to complete the program/task sooner.
Points to the current top of the stack

7. What does jal <proc> do?
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.
(1) pipelining (2) multiple instruction issue
Non - volatile memory used to store programs and data between executions.

8. An example of non - volatile memory
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.
Points to the address of an instruction that caused an exception
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.

9. An example of something typically associated with RISC architecture that is not typical in CISC architecture.
Computers that are lodged in other devices where their presence is not immediately obvious.
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.
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. What is response time?
10^9 cycles per sec
The combination of performance (measured primarily in therms of compute performance and graphics performance) and the price of a system.
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.)
A faster processor to complete task sooner - a better algorithm to complete the program/task sooner.

11. 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.
Using fixed or variable length encoding.
Computers that are lodged in other devices where their presence is not immediately obvious.
DRAM - RAM - Cache are examples of this type of memory.

12. What are the base units of GHz?
10^9 cycles per sec
A faster processor to complete task sooner - a better algorithm to complete the program/task sooner.
DRAM - RAM - Cache are examples of this type of memory.
When a segment of the application has an absolute maximum execution time.

13. 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.
Input - output - memory - datapath - control
Computers that are lodged in other devices where their presence is not immediately obvious.
Procedure call. Copies PC to $ra - # push $t0 - Subu $sp - $sp - 4 - sw $t0 - ($sp) - # pop $t0 - Lw $t0 - ($sp) - addu $sp - $sp - 4

14. What is throughput?
There does not exist the case of negative zero. - Can perform a- b as a+ (- b) without adjustments inside the CPU.
When it is possible to occasionally miss the time constraint on an event - as long as not too many are missed.
Computers that are lodged in other devices where their presence is not immediately obvious.
The number of tasks completed per unit of time.

15. An example of an improvement that would impact throughput (but not response time).
Points to the next instruction to be executed.
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.
Add memory - additional processors to handle more tasks in a given time.

16. One reason why two's compliment is used as opposed to signed magnitude or one's compliment?
The specifics of a computer - including the detailed logic design and the packaging technology of the computer
There does not exist the case of negative zero. - Can perform a- b as a+ (- b) without adjustments inside the CPU.
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)
Non - volatile memory used to store programs and data between executions.

17. What are the industry standard benchmarks to measure performance (e.g. - with different vendor chips)?
When it is possible to occasionally miss the time constraint on an event - as long as not too many are missed.
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.
Storage that retains data even in the absence of a power source.

18. What is a real- time performance requirement?
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.
The number of tasks completed per unit of time.
When a segment of the application has an absolute maximum execution time.

19. Amdahl's Law
The performance enhancement possible with a given improvement is limited by the amount that the improvement feature is used.
Input - output - memory - datapath - control
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.

20. What is volatile memory?
10^9 cycles per sec
Storage that retains data only if it is receiving power
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

21. What is the $sp register used for?
Add memory - additional processors to handle more tasks in a given time.
Non - volatile memory used to store programs and data between executions.
Points to the next instruction to be executed.
Points to the current top of the stack

22. Moore's Law
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 and data are stored in memory as numbers
Computer speeds double every 18-24 months
Add memory - additional processors to handle more tasks in a given time.

23. What is non - volatile memory?
Memory used to hold program while they are executing.
Desktop computer / laptop computer - server - super computer - embedded computer - mobile computing
Storage that retains data even in the absence of a power source.
Points to the address of an instruction that caused an exception

24. An example of volatile memory
DRAM - RAM - Cache are examples of this type of memory.
Algorithm - programming language - compiler - instruction set architecture
The specifics of a computer - including the detailed logic design and the packaging technology of the computer
Desktop computer / laptop computer - server - super computer - embedded computer - mobile computing

25. What is soft real- time?
Magnetic disk - flash memory are examples of this type of memory.
10^9 cycles per sec
Desktop computer / laptop computer - server - super computer - embedded computer - mobile computing
When it is possible to occasionally miss the time constraint on an event - as long as not too many are missed.

26. What are the classes of computing applications (five)?
Desktop computer / laptop computer - server - super computer - embedded computer - mobile computing
Computer speeds double every 18-24 months
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 ILP. This is the potential overlap among instructions. There are two approaches: (1) hardware - and (2) software.

27. What is a supercomputer?
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 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.
The most expensive computers - costing tens of millions of dollars. They emphasize floating- point performance.

28. How is CPU performance measured?
Magnetic disk - flash memory are examples of this type of memory.
The specifics of a computer - including the detailed logic design and the packaging technology of the computer
Instructions/unit time (e.g. - instructions/sec) - equal to 1/execution time
Storage that retains data even in the absence of a power source.

29. How can you encode an ISA?
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.
Using fixed or variable length encoding.
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)

30. What is an Instruction Set Architecture (ISA)?
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.)
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.

31. What are the five classic components of a computer?
The specifics of a computer - including the detailed logic design and the packaging technology of the computer
Input - output - memory - datapath - control
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.

32. What is the $epc register used for?
Instructions/unit time (e.g. - instructions/sec) - equal to 1/execution time
Computer speeds double every 18-24 months
Points to the address of an instruction that caused an exception
DRAM - RAM - Cache are examples of this type of memory.

33. What is instruction - level parallelism?
The number of tasks completed per unit of time.
(1) pipelining (2) multiple instruction issue
Magnetic disk - flash memory 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.

34. What are embedded computers?
Algorithm - programming language - compiler - instruction set architecture
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.
Computers that are lodged in other devices where their presence is not immediately obvious.

35. What is included in the term organization?

Warning: Invalid argument supplied for foreach() in /var/www/html/basicversity.com/show_quiz.php on line 183

36. What are two examples of instruction - level parallelism?
Computer speeds double every 18-24 months
Storage that retains data even in the absence of a power source.
(1) pipelining (2) multiple instruction issue
Memory used to hold program while they are executing.

37. What is the $pc register used for?
Desktop computer / laptop computer - server - super computer - embedded computer - mobile computing
Computers that are lodged in other devices where their presence is not immediately obvious.
There does not exist the case of negative zero. - Can perform a- b as a+ (- b) without adjustments inside the CPU.
Points to the next instruction to be executed.

38. What does hardware refer to?
Points to the next instruction to be executed.
The specifics of a computer - including the detailed logic design and the packaging technology of the computer
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.
A faster processor to complete task sooner - a better algorithm to complete the program/task sooner.