SUBJECTS
|
BROWSE
|
CAREER CENTER
|
POPULAR
|
JOIN
|
LOGIN
Business Skills
|
Soft Skills
|
Basic Literacy
|
Certifications
About
|
Help
|
Privacy
|
Terms
|
Email
Search
Test your basic knowledge |
Computer Architecture And Design
Start Test
Study First
Subject
:
engineering
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. How can you encode an ISA?
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.
Input - output - memory - datapath - control
Using fixed or variable length encoding.
When a segment of the application has an absolute maximum execution time.
2. What is instruction - level parallelism?
Input - output - memory - datapath - control
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.
The most expensive computers - costing tens of millions of dollars. They emphasize floating- point performance.
3. What are the hardware/software components affecting program performance?
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
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
4. What is main/primary memory?
Memory used to hold program while they are executing.
Non - volatile memory used to store programs and data between executions.
Using fixed or variable length encoding.
DRAM - RAM - Cache are examples of this type of memory.
5. What are the five classic components of a computer?
Input - output - memory - datapath - control
Computers that are lodged in other devices where their presence is not immediately obvious.
The combination of performance (measured primarily in therms of compute performance and graphics performance) and the price of a system.
The most expensive computers - costing tens of millions of dollars. They emphasize floating- point performance.
6. What is price performance?
Algorithm - programming language - compiler - instruction set architecture
DRAM - RAM - Cache are examples of this type of memory.
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
7. What does jal <proc> do?
The specifics of a computer - including the detailed logic design and the packaging technology of the computer
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 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 performance enhancement possible with a given improvement is limited by the amount that the improvement feature is used.
8. What are embedded computers?
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.
Computers that are lodged in other devices where their presence is not immediately obvious.
1- response time 2- throughput - response time and throughput are directly proportional or only interrelated - Interrelated only.
9. 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.
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.
Computer speeds double every 18-24 months
10. What are the industry standard benchmarks to measure performance (e.g. - with different vendor chips)?
Computers that are lodged in other devices where their presence is not immediately obvious.
The specifics of a computer - including the detailed logic design and the packaging technology of the computer
(1) pipelining (2) multiple instruction issue
1- response time 2- throughput - response time and throughput are directly proportional or only interrelated - Interrelated only.
11. What is a supercomputer?
Computer speeds double every 18-24 months
Algorithm - programming language - compiler - instruction set architecture
The most expensive computers - costing tens of millions of dollars. They emphasize floating- point performance.
When it is possible to occasionally miss the time constraint on an event - as long as not too many are missed.
12. What is volatile 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.
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
Storage that retains data only if it is receiving power
13. How is CPU performance measured?
Instructions/unit time (e.g. - instructions/sec) - equal to 1/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.
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
1- response time 2- throughput - response time and throughput are directly proportional or only interrelated - Interrelated only.
14. What is data- level parallelism?
When a segment of the application has an absolute maximum execution time.
A faster processor to complete task sooner - a better algorithm to complete the program/task sooner.
Computer speeds double every 18-24 months
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. Stored Program Concept
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.
1- response time 2- throughput - response time and throughput are directly proportional or only interrelated - Interrelated only.
Instructions and data are stored in memory as numbers
Non - volatile memory used to store programs and data between executions.
16. What is the $epc register used for?
Using fixed or variable length encoding.
Storage that retains data even in the absence of a power source.
Points to the address of an instruction that caused an exception
DRAM - RAM - Cache are examples of this type of memory.
17. What is the $sp register used for?
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
Points to the current top of the stack
Points to the address of an instruction that caused an exception
18. 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.
When it is possible to occasionally miss the time constraint on an event - as long as not too many are missed.
Add memory - additional processors to handle more tasks in a given time.
Input - output - memory - datapath - control
19. What are the base units of GHz?
Points to the address of an instruction that caused an exception
10^9 cycles per sec
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.
20. What is thread- level parallelism?
1- response time 2- throughput - response time and throughput are directly proportional or only interrelated - Interrelated only.
Computers that are lodged in other devices where their presence is not immediately obvious.
Storage that retains data only if it is receiving power
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.
21. One reason why two's compliment is used as opposed to signed magnitude or one's compliment?
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.
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.
Input - output - memory - datapath - control
22. What is included in the term organization?
23. What does hardware refer to?
Points to the next instruction to be executed.
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.
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 specifics of a computer - including the detailed logic design and the packaging technology of the computer
24. What is throughput?
Computers that are lodged in other devices where their presence is not immediately obvious.
Input - output - memory - datapath - control
The number of tasks completed per unit of time.
When it is possible to occasionally miss the time constraint on an event - as long as not too many are missed.
25. What is a real- time performance requirement?
Instructions/unit time (e.g. - instructions/sec) - equal to 1/execution time
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.
There does not exist the case of negative zero. - Can perform a- b as a+ (- b) without adjustments inside the CPU.
26. What is secondary memory?
Using fixed or variable length encoding.
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.
Non - volatile memory used to store programs and data between executions.
27. An example of volatile 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.
DRAM - RAM - Cache are examples of this type of memory.
When a segment of the application has an absolute maximum execution time.
There does not exist the case of negative zero. - Can perform a- b as a+ (- b) without adjustments inside the CPU.
28. 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.
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 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.
29. An example of an improvement that would impact response time (but not throughput).
Instructions and data are stored in memory as numbers
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.
DRAM - RAM - Cache are examples of this type of memory.
30. Amdahl's Law
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)
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.
The performance enhancement possible with a given improvement is limited by the amount that the improvement feature is used.
31. 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.
Magnetic disk - flash memory are examples of this type of memory.
The combination of performance (measured primarily in therms of compute performance and graphics performance) and the price of a system.
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)
32. 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)
Non - volatile memory used to store programs and data between executions.
Storage that retains data even in the absence of a power source.
Input - output - memory - datapath - control
33. Moore's Law
Computer speeds double every 18-24 months
Add memory - additional processors to handle more tasks in a given 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.
10^9 cycles per sec
34. What is non - volatile memory?
Storage that retains data even in the absence of a power source.
When a segment of the application has an absolute maximum execution time.
Computer speeds double every 18-24 months
Points to the current top of the stack
35. What is the $pc register used for?
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.
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
36. What are two examples of instruction - level parallelism?
Using fixed or variable length encoding.
(1) pipelining (2) multiple instruction issue
When it is possible to occasionally miss the time constraint on an event - as long as not too many are missed.
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.
37. What is an Instruction Set Architecture (ISA)?
The combination of performance (measured primarily in therms of compute performance and graphics performance) and the price of a system.
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.
Add memory - additional processors to handle more tasks in a given time.
Storage that retains data even in the absence of a power source.
38. What are the classes of computing applications (five)?
Input - output - memory - datapath - control
Storage that retains data even in the absence of a power source.
The number of tasks completed per unit of time.
Desktop computer / laptop computer - server - super computer - embedded computer - mobile computing