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