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