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 the $epc register used for?
Points to the address of an instruction that caused an exception
Points to the current top of the stack
The most expensive computers - costing tens of millions of dollars. They emphasize floating- point performance.
DRAM - RAM - Cache are examples of this type of memory.

2. What does hardware refer to?
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
The specifics of a computer - including the detailed logic design and the packaging technology of the computer
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

3. What is soft real- time?
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.
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)

4. One reason why two's compliment is used as opposed to signed magnitude or one's compliment?
1- response time 2- throughput - response time and throughput are directly proportional or only interrelated - Interrelated only.
Points to the next instruction to be executed.
There does not exist the case of negative zero. - Can perform a- b as a+ (- b) without adjustments inside the CPU.
Instructions and data are stored in memory as numbers

5. What is main/primary memory?
Non - volatile memory used to store programs and data between executions.
Memory used to hold program while they are executing.
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.
Desktop computer / laptop computer - server - super computer - embedded computer - mobile computing

6. What is secondary memory?
Magnetic disk - flash memory are examples of this type of memory.
Non - volatile memory used to store programs and data between executions.
10^9 cycles per sec
The number of tasks completed per unit of time.

7. What is the $pc register used for?
Algorithm - programming language - compiler - instruction set architecture
Points to the next instruction to be executed.
Desktop computer / laptop computer - server - super computer - embedded computer - mobile computing
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)

8. What are the five classic components of a computer?
Memory used to hold program while they are executing.
Input - output - memory - datapath - control
Procedure call. Copies PC to $ra - # push $t0 - Subu $sp - $sp - 4 - sw $t0 - ($sp) - # pop $t0 - Lw $t0 - ($sp) - addu $sp - $sp - 4
Computer speeds double every 18-24 months

9. What is instruction - level parallelism?
Points to the current top of the stack
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.
When it is possible to occasionally miss the time constraint on an event - as long as not too many are missed.

10. What are the base units of GHz?
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.
Memory used to hold program while they are executing.
10^9 cycles per sec
Desktop computer / laptop computer - server - super computer - embedded computer - mobile computing

11. What is the $sp register used for?
Memory used to hold program while they are executing.
Instructions and data are stored in memory as numbers
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

12. 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

13. What is non - volatile memory?
The most expensive computers - costing tens of millions of dollars. They emphasize floating- point performance.
Input - output - memory - datapath - control
There does not exist the case of negative zero. - Can perform a- b as a+ (- b) without adjustments inside the CPU.
Storage that retains data even in the absence of a power source.

14. What are two examples of instruction - level parallelism?
Instructions and data are stored in memory as numbers
Storage that retains data only if it is receiving power
Algorithm - programming language - compiler - instruction set architecture
(1) pipelining (2) multiple instruction issue

15. An example of something typically associated with RISC architecture that is not typical in CISC architecture.
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.
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)
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 combination of performance (measured primarily in therms of compute performance and graphics performance) and the price of a system.

16. What is a real- time performance requirement?
When a segment of the application has an absolute maximum execution time.
Points to the address of an instruction that caused an exception
Computer speeds double every 18-24 months
Also called ILP. This is the potential overlap among instructions. There are two approaches: (1) hardware - and (2) software.

17. What is price performance?
When it is possible to occasionally miss the time constraint on an event - as long as not too many are missed.
Also called ILP. This is the potential overlap among instructions. There are two approaches: (1) hardware - and (2) software.
The combination of performance (measured primarily in therms of compute performance and graphics performance) and the price of a system.
10^9 cycles per sec

18. What are the industry standard benchmarks to measure performance (e.g. - with different vendor chips)?
Points to the address of an instruction that caused an exception
1- response time 2- throughput - response time and throughput are directly proportional or only interrelated - Interrelated only.
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)
Computer speeds double every 18-24 months

19. 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.
A faster processor to complete task sooner - a better algorithm to complete the program/task sooner.
Also called ILP. This is the potential overlap among instructions. There are two approaches: (1) hardware - and (2) software.
Storage that retains data only if it is receiving power

20. An example of volatile memory
(1) pipelining (2) multiple instruction issue
DRAM - RAM - Cache are examples of this type of memory.
Points to the current top of the stack
Instructions and data are stored in memory as numbers

21. An example of non - volatile memory
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.
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

22. What are the hardware/software components affecting program performance?
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.
Algorithm - programming language - compiler - instruction set architecture
Instructions and data are stored in memory as numbers
Computers that are lodged in other devices where their presence is not immediately obvious.

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

24. What is response time?
There does not exist the case of negative zero. - Can perform a- b as a+ (- b) without adjustments inside the CPU.
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 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 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. Stored Program Concept
There does not exist the case of negative zero. - Can perform a- b as a+ (- b) without adjustments inside the CPU.
Instructions and data are stored in memory as numbers
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
When it is possible to occasionally miss the time constraint on an event - as long as not too many are missed.

26. What does jal <proc> do?
Computer speeds double every 18-24 months
Memory used to hold program while they are executing.
Magnetic disk - flash memory are examples of this type of 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

27. What is throughput?
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.
The number of tasks completed per unit of time.
1- response time 2- throughput - response time and throughput are directly proportional or only interrelated - Interrelated only.

28. What is thread- level parallelism?
Add memory - additional processors to handle more tasks in a given 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
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.
Memory used to hold program while they are executing.

29. How can you encode an ISA?
Magnetic disk - flash memory are examples of this type of memory.
Using fixed or variable length encoding.
Storage that retains data only if it is receiving power
Computers that are lodged in other devices where their presence is not immediately obvious.

30. What is volatile memory?
Storage that retains data only if it is receiving power
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
Input - output - memory - datapath - control

31. 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.
Algorithm - programming language - compiler - instruction set architecture
Storage that retains data only if it is receiving power
The most expensive computers - costing tens of millions of dollars. They emphasize floating- point performance.

32. What are embedded computers?
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.
A faster processor to complete task sooner - a better algorithm to complete the program/task sooner.
The specifics of a computer - including the detailed logic design and the packaging technology of the computer

33. Amdahl's Law
Storage that retains data even in the absence of a power source.
The performance enhancement possible with a given improvement is limited by the amount that the improvement feature is used.
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

34. How is CPU performance measured?
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.
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.
Computers that are lodged in other devices where their presence is not immediately obvious.

35. What is an Instruction Set Architecture (ISA)?
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.
Algorithm - programming language - compiler - instruction set architecture
Computers that are lodged in other devices where their presence is not immediately obvious.

36. What is a supercomputer?
The most expensive computers - costing tens of millions of dollars. They emphasize floating- point performance.
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.
When a segment of the application has an absolute maximum execution time.

37. An example of an improvement that would impact throughput (but not response time).
10^9 cycles per sec
Add memory - additional processors to handle more tasks in a given time.
The combination of performance (measured primarily in therms of compute performance and graphics performance) and the price of a system.
Computers that are lodged in other devices where their presence is not immediately obvious.

38. Moore's Law
Magnetic disk - flash memory are examples of this type of memory.
Computer speeds double every 18-24 months
Procedure call. Copies PC to $ra - # push $t0 - Subu $sp - $sp - 4 - sw $t0 - ($sp) - # pop $t0 - Lw $t0 - ($sp) - addu $sp - $sp - 4
When it is possible to occasionally miss the time constraint on an event - as long as not too many are missed.