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?
The number of tasks completed per unit of time.
Algorithm - programming language - compiler - instruction set architecture
Memory used to hold program while they are executing.
Non - volatile memory used to store programs and data between executions.

2. What is data- level parallelism?
Points to the current top of the stack
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.
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.

3. What is main/primary memory?
Memory used to hold program while they are executing.
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
When a segment of the application has an absolute maximum execution time.

4. What is throughput?
Magnetic disk - flash memory are examples of this type of memory.
Input - output - memory - datapath - control
The number of tasks completed per unit of time.
Non - volatile memory used to store programs and data between executions.

5. An example of an improvement that would impact throughput (but not response time).
The most expensive computers - costing tens of millions of dollars. They emphasize floating- point performance.
Add memory - additional processors to handle more tasks in a given time.
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

6. 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.
There does not exist the case of negative zero. - Can perform a- b as a+ (- b) without adjustments inside the CPU.
Points to the address of an instruction that caused an exception
Magnetic disk - flash memory are examples of this type of memory.

7. What is the $sp register used for?
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)
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.

8. Stored Program Concept
Instructions and data are stored in memory as numbers
Algorithm - programming language - compiler - instruction set architecture
Input - output - memory - datapath - control
DRAM - RAM - Cache are examples of this type of memory.

9. What does jal <proc> do?
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.
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 specifics of a computer - including the detailed logic design and the packaging technology of the computer

10. What is the $pc register used for?
Add memory - additional processors to handle more tasks in a given time.
Input - output - memory - datapath - control
Points to the next instruction to be executed.
Points to the address of an instruction that caused an exception

11. What is price performance?
The combination of performance (measured primarily in therms of compute performance and graphics performance) and the price of a system.
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)
10^9 cycles per sec

12. What is soft real- 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.
When it is possible to occasionally miss the time constraint on an event - as long as not too many are missed.
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

13. What is an Instruction Set Architecture (ISA)?
The performance enhancement possible with a given improvement is limited by the amount that the improvement feature is used.
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
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.

14. What are two examples of instruction - level parallelism?
Instructions and data are stored in memory as numbers
(1) pipelining (2) multiple instruction issue
The most expensive computers - costing tens of millions of dollars. They emphasize floating- point performance.
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.

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

16. How can you encode an ISA?
When a segment of the application has an absolute maximum execution time.
Storage that retains data even in the absence of a power source.
Algorithm - programming language - compiler - instruction set architecture
Using fixed or variable length encoding.

17. An example of volatile memory
Points to the next instruction to be executed.
Add memory - additional processors to handle more tasks in a given time.
DRAM - RAM - Cache are examples of this type of memory.
A faster processor to complete task sooner - a better algorithm to complete the program/task sooner.

18. What are the classes of computing applications (five)?
When a segment of the application has an absolute maximum execution time.
1- response time 2- throughput - response time and throughput are directly proportional or only interrelated - Interrelated only.
There does not exist the case of negative zero. - Can perform a- b as a+ (- b) without adjustments inside the CPU.
Desktop computer / laptop computer - server - super computer - embedded computer - mobile computing

19. An example of something typically associated with RISC architecture that is not typical in CISC architecture.
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)
A faster processor to complete task sooner - a better algorithm to complete the program/task sooner.
When a segment of the application has an absolute maximum execution time.
Storage that retains data even in the absence of a power source.

20. 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.
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.
Algorithm - programming language - compiler - instruction set architecture

21. What is a supercomputer?
Algorithm - programming language - compiler - instruction set architecture
Computer speeds double every 18-24 months
Input - output - memory - datapath - control
The most expensive computers - costing tens of millions of dollars. They emphasize floating- point performance.

22. What are the base units of GHz?
Using fixed or variable length encoding.
1- response time 2- throughput - response time and throughput are directly proportional or only interrelated - Interrelated only.
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)

23. What are the five classic components of a 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.
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.)
Instructions/unit time (e.g. - instructions/sec) - equal to 1/execution time
Input - output - memory - datapath - control

24. What does hardware refer to?
Input - output - memory - datapath - control
When it is possible to occasionally miss the time constraint on an event - as long as not too many are missed.
DRAM - RAM - Cache are examples of this type of memory.
The specifics of a computer - including the detailed logic design and the packaging technology of the computer

25. What is the $epc register used for?
Points to the address of an instruction that caused an exception
Instructions/unit time (e.g. - instructions/sec) - equal to 1/execution time
Non - volatile memory used to store programs and data between executions.
The performance enhancement possible with a given improvement is limited by the amount that the improvement feature is used.

26. 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.
There does not exist the case of negative zero. - Can perform a- b as a+ (- b) without adjustments inside the CPU.
Computer speeds double every 18-24 months
Points to the current top of the stack

27. Amdahl's Law
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.)
When a segment of the application has an absolute maximum execution time.
The performance enhancement possible with a given improvement is limited by the amount that the improvement feature is used.
Computer speeds double every 18-24 months

28. What is non - volatile memory?
Using fixed or variable length encoding.
Also called ILP. This is the potential overlap among instructions. There are two approaches: (1) hardware - and (2) software.
Storage that retains data even in the absence of a power source.
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.)

29. What are the industry standard benchmarks to measure performance (e.g. - with different vendor chips)?
Instructions/unit time (e.g. - instructions/sec) - equal to 1/execution time
1- response time 2- throughput - response time and throughput are directly proportional or only interrelated - Interrelated only.
10^9 cycles per sec
A faster processor to complete task sooner - a better algorithm to complete the program/task sooner.

30. An example of an improvement that would impact response time (but not throughput).
A faster processor to complete task sooner - a better algorithm to complete the program/task sooner.
10^9 cycles per sec
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.)
Computers that are lodged in other devices where their presence is not immediately obvious.

31. 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.
The most expensive computers - costing tens of millions of dollars. They emphasize floating- point performance.
Points to the current top of the stack
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.

32. What are the hardware/software components affecting program 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)
Algorithm - programming language - compiler - instruction set architecture
The number of tasks completed per unit of time.
(1) pipelining (2) multiple instruction issue

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

34. What is volatile memory?
Also called ILP. This is the potential overlap among instructions. There are two approaches: (1) hardware - and (2) software.
Input - output - memory - datapath - control
When a segment of the application has an absolute maximum execution time.
Storage that retains data only if it is receiving power

35. What is instruction - level parallelism?
The combination of performance (measured primarily in therms of compute performance and graphics performance) and the price of a system.
Also called ILP. This is the potential overlap among instructions. There are two approaches: (1) hardware - and (2) software.
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
Storage that retains data only if it is receiving power

36. Moore's Law
Input - output - memory - datapath - control
10^9 cycles per sec
Computer speeds double every 18-24 months
Add memory - additional processors to handle more tasks in a given time.

37. What is a real- time performance requirement?
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 a segment of the application has an absolute maximum execution time.
Input - output - memory - datapath - control
Points to the address of an instruction that caused an exception

38. How is CPU performance measured?
Instructions/unit time (e.g. - instructions/sec) - equal to 1/execution time
10^9 cycles per sec
Points to the current top of the stack
When it is possible to occasionally miss the time constraint on an event - as long as not too many are missed.