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 throughput?
Procedure call. Copies PC to $ra - # push $t0 - Subu $sp - $sp - 4 - sw $t0 - ($sp) - # pop $t0 - Lw $t0 - ($sp) - addu $sp - $sp - 4
There does not exist the case of negative zero. - Can perform a- b as a+ (- b) without adjustments inside the CPU.
Algorithm - programming language - compiler - instruction set architecture
The number of tasks completed per unit of time.

2. What are the five classic components of a computer?
Non - volatile memory used to store programs and data between executions.
Points to the address of an instruction that caused an exception
(1) pipelining (2) multiple instruction issue
Input - output - memory - datapath - control

3. 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)
Instructions and data are stored in memory as numbers
Also called ILP. This is the potential overlap among instructions. There are two approaches: (1) hardware - and (2) software.
10^9 cycles per sec

4. What are two examples of instruction - level parallelism?
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.
(1) pipelining (2) multiple instruction issue
Using fixed or variable length encoding.

5. What is main/primary memory?
Computer speeds double every 18-24 months
Add memory - additional processors to handle more tasks in a given time.
Points to the current top of the stack
Memory used to hold program while they are executing.

6. An example of volatile memory
Points to the current top of the stack
10^9 cycles per sec
Points to the address of an instruction that caused an exception
DRAM - RAM - Cache are examples of this type of memory.

7. One reason why two's compliment is used as opposed to signed magnitude or one's compliment?
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.
Instructions/unit time (e.g. - instructions/sec) - equal to 1/execution time
There does not exist the case of negative zero. - Can perform a- b as a+ (- b) without adjustments inside the CPU.

8. Moore's Law
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.
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

9. What is an Instruction Set Architecture (ISA)?
Magnetic disk - flash memory are examples of this type of memory.
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 it is possible to occasionally miss the time constraint on an event - as long as not too many are missed.
Using fixed or variable length encoding.

10. An example of an improvement that would impact throughput (but not response time).
Magnetic disk - flash memory are examples of this type of memory.
1- response time 2- throughput - response time and throughput are directly proportional or only interrelated - Interrelated only.
(1) pipelining (2) multiple instruction issue
Add memory - additional processors to handle more tasks in a given time.

11. What is data- level parallelism?
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
Computer speeds double every 18-24 months
Memory used to hold program while they are executing.
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.

12. An example of non - volatile memory
The combination of performance (measured primarily in therms of compute performance and graphics performance) and the price of a system.
Magnetic disk - flash memory are examples of this type of memory.
Memory used to hold program while they are executing.
There does not exist the case of negative zero. - Can perform a- b as a+ (- b) without adjustments inside the CPU.

13. What is the $sp register used for?
Computer speeds double every 18-24 months
The performance enhancement possible with a given improvement is limited by the amount that the improvement feature is used.
Points to the current top of the stack
Points to the next instruction to be executed.

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

15. Stored Program Concept
Instructions/unit time (e.g. - instructions/sec) - equal to 1/execution time
Algorithm - programming language - compiler - instruction set architecture
10^9 cycles per sec
Instructions and data are stored in memory as numbers

16. What is thread- level parallelism?
Points to the next instruction to be executed.
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
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.

17. What is a supercomputer?
When a segment of the application has an absolute maximum execution time.
Input - output - memory - datapath - control
The most expensive computers - costing tens of millions of dollars. They emphasize floating- point performance.
There does not exist the case of negative zero. - Can perform a- b as a+ (- b) without adjustments inside the CPU.

18. What is non - volatile memory?
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.
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

19. What is response time?
A faster processor to complete task sooner - a better algorithm to complete the program/task sooner.
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.
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.)

20. Amdahl's Law
Input - output - memory - datapath - control
Computer speeds double every 18-24 months
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.

21. What is secondary memory?
Non - volatile memory used to store programs and data between executions.
Storage that retains data only if it is receiving power
Points to the next instruction to be executed.
Desktop computer / laptop computer - server - super computer - embedded computer - mobile computing

22. What is the $pc register used for?
Points to the next instruction to be executed.
A faster processor to complete task sooner - a better algorithm to complete the program/task sooner.
Storage that retains data even in the absence of a power source.
Non - volatile memory used to store programs and data between executions.

23. What is the $epc register used for?
Algorithm - programming language - compiler - instruction set architecture
A faster processor to complete task sooner - a better algorithm to complete the program/task sooner.
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

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

25. What is price performance?
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.
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)

26. What are the hardware/software components affecting program performance?
Algorithm - programming language - compiler - instruction set architecture
Input - output - memory - datapath - control
DRAM - RAM - Cache are examples of this type of memory.
The most expensive computers - costing tens of millions of dollars. They emphasize floating- point performance.

27. What are the classes of computing applications (five)?
Using fixed or variable length encoding.
Algorithm - programming language - compiler - instruction set architecture
Desktop computer / laptop computer - server - super computer - embedded computer - mobile computing
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.)

28. What is soft real- time?
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.)
DRAM - RAM - Cache are examples of this type of memory.
Computers that are lodged in other devices where their presence is not immediately obvious.

29. What is instruction - level parallelism?
Instructions and data are stored in memory as numbers
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.
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.

30. What is volatile memory?
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 only if it is receiving power
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

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

32. 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.
The specifics of a computer - including the detailed logic design and the packaging technology of the computer
Points to the next instruction to be executed.
Algorithm - programming language - compiler - instruction set architecture

33. What are the industry standard benchmarks to measure performance (e.g. - with different vendor chips)?
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.
1- response time 2- throughput - response time and throughput are directly proportional or only interrelated - Interrelated only.
Memory used to hold program while they are executing.

34. An example of an improvement that would impact response time (but not throughput).
Computers that are lodged in other devices where their presence is not immediately obvious.
A faster processor to complete task sooner - a better algorithm to complete the program/task sooner.
1- response time 2- throughput - response time and throughput are directly proportional or only interrelated - Interrelated only.
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.)

35. What does jal <proc> do?
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.)
Procedure call. Copies PC to $ra - # push $t0 - Subu $sp - $sp - 4 - sw $t0 - ($sp) - # pop $t0 - Lw $t0 - ($sp) - addu $sp - $sp - 4
A faster processor to complete task sooner - a better algorithm to complete the program/task sooner.

36. What are the base units of GHz?
10^9 cycles per sec
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.)
The most expensive computers - costing tens of millions of dollars. They emphasize floating- point performance.

37. How is CPU performance measured?
Desktop computer / laptop computer - server - super computer - embedded computer - mobile computing
Points to the address of an instruction that caused an exception
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)

38. How can you encode an ISA?
Desktop computer / laptop computer - server - super computer - embedded computer - mobile computing
Storage that retains data only if it is receiving power
Using fixed or variable length encoding.
Storage that retains data even in the absence of a power source.