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 does hardware refer to?
Points to the next instruction to be executed.
Magnetic disk - flash memory are examples of this type of memory.
Memory used to hold program while they are executing.
The specifics of a computer - including the detailed logic design and the packaging technology of the computer

2. 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.
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
Instructions and data are stored in memory as numbers

3. What are the hardware/software components affecting program performance?
When a segment of the application has an absolute maximum execution time.
The combination of performance (measured primarily in therms of compute performance and graphics performance) and the price of a system.
Algorithm - programming language - compiler - instruction set architecture
Add memory - additional processors to handle more tasks in a given time.

4. What is the $epc register used for?
(1) pipelining (2) multiple instruction issue
Add memory - additional processors to handle more tasks in a given time.
Points to the address of an instruction that caused an exception
10^9 cycles per sec

5. How can you encode an ISA?
Non - volatile memory used to store programs and data between executions.
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.
10^9 cycles per sec
Using fixed or variable length encoding.

6. What is main/primary memory?
Memory used to hold program while they are executing.
The performance enhancement possible with a given improvement is limited by the amount that the improvement feature is used.
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.

7. 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.
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.)
Using fixed or variable length encoding.
The most expensive computers - costing tens of millions of dollars. They emphasize floating- point performance.

8. Moore's Law
(1) pipelining (2) multiple instruction issue
Input - output - memory - datapath - control
Computer speeds double every 18-24 months
Points to the next instruction to be executed.

9. An example of non - volatile 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
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.
Algorithm - programming language - compiler - instruction set architecture

10. An example of an improvement that would impact response time (but not throughput).
Computer speeds double every 18-24 months
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.
A faster processor to complete task sooner - a better algorithm to complete the program/task sooner.

11. What is data- level parallelism?
Computer speeds double every 18-24 months
Storage that retains data only if it is receiving power
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.
Instructions and data are stored in memory as numbers

12. What are the classes of computing applications (five)?
Input - output - memory - datapath - control
Desktop computer / laptop computer - server - super computer - embedded computer - mobile computing
The performance enhancement possible with a given improvement is limited by the amount that the improvement feature is used.
Computers that are lodged in other devices where their presence is not immediately obvious.

13. One reason why two's compliment is used as opposed to signed magnitude or one's compliment?
Non - volatile memory used to store programs and data between executions.
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.)
There does not exist the case of negative zero. - Can perform a- b as a+ (- b) without adjustments inside the CPU.
10^9 cycles per sec

14. An example of an improvement that would impact throughput (but not response time).
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.
Add memory - additional processors to handle more tasks in a given time.
Computers that are lodged in other devices where their presence is not immediately obvious.

15. What is price performance?
Using fixed or variable length encoding.
The combination of performance (measured primarily in therms of compute performance and graphics performance) and the price of a system.
Add memory - additional processors to handle more tasks in a given time.
(1) pipelining (2) multiple instruction issue

16. What is a real- time performance requirement?
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.
Computers that are lodged in other devices where their presence is not immediately obvious.
When a segment of the application has an absolute maximum execution time.

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

18. What is the $sp register used for?
Points to the current top of the stack
Input - output - memory - datapath - control
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.

19. Amdahl's Law
Input - output - memory - datapath - control
The performance enhancement possible with a given improvement is limited by the amount that the improvement feature is used.
When it is possible to occasionally miss the time constraint on an event - as long as not too many are missed.
Points to the next instruction to be executed.

20. 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
Points to the next instruction to be executed.
Non - volatile memory used to store programs and data between executions.
Using fixed or variable length encoding.

21. 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.
When a segment of the application has an absolute maximum execution time.
Points to the current top of the stack

22. What is response time?
A faster processor to complete task sooner - a better algorithm to complete the program/task sooner.
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.)
The most expensive computers - costing tens of millions of dollars. They emphasize floating- point performance.

23. What is secondary memory?
Non - volatile memory used to store programs and data between executions.
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.
The performance enhancement possible with a given improvement is limited by the amount that the improvement feature is used.

24. Stored Program Concept
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.
Input - output - memory - datapath - control
Points to the next instruction to be executed.

25. An example of something typically associated with RISC architecture that is not typical in CISC architecture.
Instructions/unit time (e.g. - instructions/sec) - equal to 1/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)
DRAM - RAM - Cache are examples of this type of memory.
1- response time 2- throughput - response time and throughput are directly proportional or only interrelated - Interrelated only.

26. An example of volatile memory
The combination of performance (measured primarily in therms of compute performance and graphics performance) and the price of a system.
DRAM - RAM - Cache are examples of this type of memory.
Non - volatile memory used to store programs and data between executions.
Computers that are lodged in other devices where their presence is not immediately obvious.

27. What is instruction - level parallelism?
Storage that retains data only if it is receiving power
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.
When it is possible to occasionally miss the time constraint on an event - as long as not too many are missed.

28. What is throughput?
The number of tasks completed per unit of time.
The performance enhancement possible with a given improvement is limited by the amount that the improvement feature is used.
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.

29. What are embedded computers?
Points to the address of an instruction that caused an exception
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.
Magnetic disk - flash memory are examples of this type of memory.

30. What is soft real- time?
Memory used to hold program while they are executing.
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.
When it is possible to occasionally miss the time constraint on an event - as long as not too many are missed.

31. What is a supercomputer?
Points to the next instruction to be executed.
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.
When it is possible to occasionally miss the time constraint on an event - as long as not too many are missed.

32. What are two examples of instruction - level parallelism?
(1) pipelining (2) multiple instruction issue
The performance enhancement possible with a given improvement is limited by the amount that the improvement feature is used.
Also called ILP. This is the potential overlap among instructions. There are two approaches: (1) hardware - and (2) software.
Add memory - additional processors to handle more tasks in a given time.

33. What is volatile memory?
The specifics of a computer - including the detailed logic design and the packaging technology of the computer
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.
Using fixed or variable length encoding.

34. What is non - volatile memory?
Points to the next instruction to be executed.
Storage that retains data even in the absence of a power source.
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
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.

35. How is CPU performance measured?
When it is possible to occasionally miss the time constraint on an event - as long as not too many are missed.
Instructions/unit time (e.g. - instructions/sec) - equal to 1/execution time
Computers that are lodged in other devices where their presence is not immediately obvious.
Input - output - memory - datapath - control

36. What are the five classic components of a computer?
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.
Desktop computer / laptop computer - server - super computer - embedded computer - mobile computing

37. What are the base units of GHz?
When a segment of the application has an absolute maximum execution time.
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)
Instructions/unit time (e.g. - instructions/sec) - equal to 1/execution time

38. 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.
Instructions/unit time (e.g. - instructions/sec) - equal to 1/execution time
Points to the address of an instruction that caused an exception