Copy and Edit

CSA Last p2

Description

Quiz on CSA Last p2, created by Last Quickly on 30/03/2019.
Last Quickly
Quiz by Last Quickly, updated more than 1 year ago
Last Quickly
Created by Last Quickly about 5 years ago
195
7
0

Resource summary

Question 1

Question
Out-of-Order Control Complexity MIPS R10000 which element is not in Control Logic?
Answer
  • Integer Datapath
  • CLK
  • Free List
  • Address Queue

Question 2

Question
What is “VLIW”?
Answer
  • Very Long Instruction Word
  • Very Less Interpreter Word
  • Very Light Internal Word
  • Very Low Invalid Word

Question 3

Question
At VLIW by “performance and loop iteration” which time is longer?
Answer
  • Loop Unrolled
  • Software Pipelined

Question 4

Question
At VLIW by “performance and loop iteration” which time is shorter?
Answer
  • Software Pipelined
  • Loop Unrolled

Question 5

Question
At VLIW Speculative Execution, which of this solution is true about problem: Branches restrict compiler code motion?
Answer
  • Speculative operations that don’t cause exceptions
  • Hardware to check pointer hazards

Question 6

Question
At VLIW Speculative Execution, which of this solution is true about problem: Possible memory hazards limit code scheduling:
Answer
  • Hardware to check pointer hazards
  • Speculative operations that don’t cause exceptions

Question 7

Question
What is an ALAT? :
Answer
  • Advanced Load Address Table
  • Allocated Link Address Table
  • Allowing List Address Table
  • Addition Long Accessibility Table

Question 8

Question
At VLIW Multi-Way Branches, which of this solution is true about problem: Long instructions provide few opportunities for branches:
Answer
  • Allow one instruction to branch multiple directions
  • Speculative operations that don’t cause exceptions

Question 9

Question
What is a Compulsory?
Answer
  • first-reference to a block, occur even with infinite cache
  • cache is too small to hold all data needed by program, occur even under perfect replacement policy
  • misses that occur because of collisions due to less than full associativity

Question 10

Question
What is a Capacity?
Answer
  • cache is too small to hold all data needed by program, occur even under perfect replacement policy
  • first-reference to a block, occur even with infinite cache
  • misses that occur because of collisions due to less than full associativity

Question 11

Question
Convert this number systems: DEC (9578) to HEX?
Answer
  • 256A
  • 43B1
  • 7DE1
  • A31F

Question 12

Question
Convert this number systems: DEC (9845) to HEX?
Answer
  • 2675
  • 2798
  • 2945
  • 2811

Question 13

Question
Define a boolean algebra
Answer
  • process that applies binary logic to yield binary results
  • to determine whether an IP address exists on the local network or whether it must be routed outside the local network.
  • It sends out ICMP (Internet Control Message Protocol) messages to verify both the logical addresses & the Physical connection.
  • to determine whether an IP address exists on the global network or whether it must be routed outside the global network.

Question 14

Question
Where Virtual Machine was developed?
Answer
  • Lancaster University
  • Manchester University
  • MIT
  • Cambridge

Question 15

Question
What is the first commercial computer with virtual machine
Answer
  • B5000
  • B5550
  • B5500
  • C5000

Question 16

Question
When was the first commercial computer with virtual machine released?
Answer
  • 1961
  • 1962
  • 1963
  • 1964

Question 17

Question
Which of the following is false about VM and performance?
Answer
  • Better performance: we can use more memory than we have
  • Nothing; mapping to memory or disk is just as easy
  • Worse performance: reading from disk is slower than RAM
  • Good performance: reading from disk is slower than RAM

Question 18

Question
Which of the following is false about usability of Virtual Memory?
Answer
  • Not enough memory
  • Holes in the address space
  • Keeping program secure
  • Keeping program insecure

Question 19

Question
Define virtual address space
Answer
  • process refers to the logical (or virtual) view of how a process is stored in memory
  • used to translate the virtual addresses seen by the application into physical addresses
  • a segment of virtual memory that has been assigned a direct byte-for-byte correlation with some portion of a file or file-like resource.
  • none of the mentioned

Question 20

Question
Define a page tables
Answer
  • process refers to the logical (or virtual) view of how a process is stored in memory
  • used to translate the virtual addresses seen by the application into physical addresses
  • a segment of virtual memory that has been assigned a direct byte-for-byte correlation with some portion of a file or file-like resource.
  • none of the mentioned

Question 21

Question
Of the following, identify the memory usually written by the manufacturer.
Answer
  • RAM
  • DRAM
  • SRAM
  • ROM
  • Cache Memory

Question 22

Question
Multi-processor system that computer system have are also called
Answer
  • parallel; systems
  • tightly coupled system
  • loosely coupled system
  • both a and b

Question 23

Question
Which of the following statement is false?
Answer
  • Combinational circuits has memory
  • Sequential circuits has memory
  • Sequential circuits is a function of time
  • Combinational circuits does not require feedback paths
  • Sequential circuits require feedback paths.

Question 24

Question
The computer architecture having stored program is _____.
Answer
  • Harvard
  • Von-Neumann
  • Pascal
  • Ada
  • Cobol

Question 25

Question
The key technology used in IV generation computers is _______.
Answer
  • MSI
  • SSI
  • LSI &VLSI
  • Transistors
  • Vacuum Tubes

Question 26

Question
The digital circuit that generates the arithmetic sum of two binary numbers of any length is ________ .
Answer
  • Binary-Adder
  • Full-Adder
  • Half-Adder
  • Adder
  • OR-gate

Question 27

Question
Serial to parallel data conversion is done using
Answer
  • Accumulator
  • Shift Register
  • Counter
  • CPU
  • Control Unit

Question 28

Question
CACHE memory is implemented using ________.
Answer
  • Dynamic RAM
  • Static RAM
  • EA RAM
  • ED RAM
  • EP RAM

Question 29

Question
Stack is a _________list.
Answer
  • FIFO
  • LIFO
  • FILO
  • OFLI
  • LFIO.

Question 30

Question
Which one of the following is a memory whose duty is to store most frequently used data?
Answer
  • Main memory
  • Cache memory
  • ROM
  • Auxiliary memory
  • PROM.

Question 31

Question
How many bytes equals Petabyte (PB)?
Answer
  • Quadrillion
  • Million
  • Trillion
  • Billion
  • 1000

Question 32

Question
Examples of superscalar(static):
Answer
  • MIPS and ARM
  • Pentium 4, MIPS R12K, IBM, Power5
  • Itanium
  • TI C6x

Question 33

Question
Examples of superscalar(dynamic) :
Answer
  • None at the present
  • Pentium 4, MIPS R12K, IBM, Power5
  • MIPS and ARM
  • TI C6x

Question 34

Question
How many main levels of Cache Memory?
Answer
  • 3
  • 2
  • 6
  • 8

Question 35

Question
What is a “Synchronization” in OS Execution?
Answer
  • Execution in the OS that is neither idle nor in synchronization access
  • Execution in user code
  • Execution or waiting for synchronization variables

Question 36

Question
What is a “Kernel” in OS Execution?
Answer
  • Execution or waiting for synchronization variables
  • Execution in the OS that is neither idle nor in synchronization access
  • Execution in user code

Question 37

Question
Which one of the following is correct?
Answer
  • Sequential circuit is an interconnection of only logic gates
  • Sequential circuit is an interconnection of only flip flops
  • Combinational circuit is an interconnection of logic gates
  • Combinational circuit is an interconnection of flip flops
  • Part of a combinational circuit is a sequential circuit.

Question 38

Question
Identify the expansion for RISC.
Answer
  • Reduced Instruction Sign Computers
  • Reduced Instruction Set Computers
  • Reduced Instruction Set Carry
  • Reduced Invalid Set Computers
  • Reset Instruction Set Computers.

Question 39

Question
Buffering the actual target instructions allows us to perform an optimization which called:
Answer
  • branch folding
  • Branch prediction
  • Target instructions
  • Target address

Question 40

Question
Which is not the function of integrated instruction fetch unit:
Answer
  • Instruction memory commit
  • Integrated branch prediction
  • Instruction prefetch
  • Instruction memory access and buffering

Question 41

Question
What is the simple technique that predicts whether two stores or a load and a store refer to the same memory address:
Answer
  • Address aliasing prediction
  • Branch prediction
  • Integrated branch prediction
  • Dynamic branch prediction

Question 42

Question
RISC stands for
Answer
  • Reduced Instruction Set Computer
  • Recall Instruction Sell Communication
  • Rename Instruction Sequence Corporation
  • Red Instruction Small Computer

Question 43

Question
The ideal pipeline CPI is a measure of …
Answer
  • the maximum performance attainable by the implementation
  • the maximum performance attainable by the instruction
  • the minimum performance attainable by the implementation
  • the minimum performance attainable by the instruction

Question 44

Question
What is the Pipeline CPI ?
Answer
  • Ideal pipeline CPI + Structural stalls + Data hazard stalls + Control stalls
  • Ideal pipeline CPU + Data hazard stalls + Control stalls
  • Ideal pipeline CPU + Ideal pipeline CPI + Data hazard stalls + Control stalls
  • Structural stalls + Data hazard stalls + Control stalls

Question 45

Question
The simplest and most common way to increase the ILP is …?
Answer
  • to exploit parallelism among iterations of a loop
  • to exploit minimalism among iterations of a loop
  • to destroy iterations of a loop
  • to decrease the minimalism of risk

Question 46

Question
The simplest and most common way to increase the ILP is to exploit parallelism among iterations of a loop. How is often called?
Answer
  • loop-level parallelism
  • exploit-level parallelism
  • high-level minimalism
  • low-level minimalism

Question 47

Question
In parallelism have three different types of dependences, tagging him:
Answer
  • data dependences, name dependences and control dependences
  • data dependences, name dependences, and surname dependences
  • datagram dependences ,name dependences, and animal dependences
  • no correct answers

Question 48

Question
What is Name dependence?
Answer
  • name dependence occurs when two instructions use the same register or memory location
  • name dependence occurs when five or more instructions use the same register or memory location
  • name dependence occurs when instructions use the same name
  • All answers is correct

Question 49

Question
When occurs an output dependence?
Answer
  • When i and instruction j write the same register or memory location
  • when i and instruction j write the same name
  • when i and instruction j write the same address or memory location
  • All answers is correct

Question 50

Question
What is RAW (read after write)?
Answer
  • when j tries to read a source before i writes it, so j incorrectly gets the old value
  • when i tries to read a source before j writes it, so j correctly gets the old value
  • when j tries to write a source before i writes it
  • when a tries to write a source before b read it, so a incorrectly gets the old value

Question 51

Question
What is given is not a hazard?
Answer
  • RAR
  • WAR
  • WAW
  • RAW

Question 52

Question
A simple scheme for increasing the number of instructions relative to the branch and overhead instructions is…?
Answer
  • loop unrolling
  • RAR
  • loop-level
  • loop rolling

Question 53

Question
Effect that results from instruction scheduling in large code segments is called…?
Answer
  • register pressure
  • loop unrolling
  • loop-level
  • registration

Question 54

Question
The simplest dynamic branch-prediction scheme is a
Answer
  • branch-prediction buffer
  • branch buffer
  • All answers correct
  • registration

Question 55

Question
Branch predictors that use the behavior of other branches to make a prediction are called
Answer
  • correlating predictors or two-level predictors
  • branch-prediction buffer
  • branch table
  • three level loop

Question 56

Question
What is the compulsory in Three C’s model?
Answer
  • The very first access to a block cannot be in the cache, so the block must be brought into the cache. Compulsory misses are those that occur even if you had an infinite cache.
  • If the cache cannot contain all the blocks needed during execution of a program, capacity misses (in addition to compulsory misses) will occur because of blocks being discarded and later retrieved
  • The number of accesses that miss divided by the number of accesses.
  • None of them

Question 57

Question
What is capacity in Three C’s model?
Answer
  • If the cache cannot contain all the blocks needed during execution of a program, capacity misses (in addition to compulsory misses) will occur because of blocks being discarded and later retrieved
  • The very first access to a block cannot be in the cache, so the block must be brought into the cache. Compulsory misses are those that occur even if you had an infinite cache.
  • The number of accesses that miss divided by the number of accesses.
  • None of them

Question 58

Question
What is conflict in Three C’s model?
Answer
  • If the block placement strategy is not fully associative, conflict misses (in addition to compulsory and capacity misses) will occur because a block may be discarded and later retrieved if conflicting blocks map to its set
  • The very first access to a block cannot be in the cache, so the block must be brought into the cache. Compulsory misses are those that occur even if you had an infinite cache.
  • If the cache cannot contain all the blocks needed during execution of a program, capacity misses (in addition to compulsory misses) will occur because of blocks being discarded and later retrieved
  • None of them

Question 59

Question
Which of the following belongs to Cache Optimization?
Answer
  • Larger block size to reduce miss rate
  • Bigger caches to increase miss rat
  • Single level caches to reduce miss penalty
  • None of them

Question 60

Question
Choose the strategy of Sixth Cache Optimization
Answer
  • Critical word first
  • Critical restart
  • Sequential inter leaving
  • Merging Write Buffer to Reduce Miss Penalty

Question 61

Question
Choose the Seventh Cache Optimization
Answer
  • Merging Write Buffer to Reduce Miss Penalty
  • Critical word first
  • Nonblocking Caches to Increase Cache Bandwidth
  • Trace Caches to Reduce Hit Time

Question 62

Question
Choose the Tenth Cache Optimization
Answer
  • Compiler-Controlled Prefetching to Reduce Miss Penalty or Miss Rate
  • Merging Write Buffer to Reduce Miss Penalty
  • Hardware Prefetching of Instructions and Data to Reduce Miss Penalty or Miss Rate
  • None of them

Question 63

Question
What is the access time?
Answer
  • Time between when a read is requested and when the desired word arrives
  • The minimum time between requests to memory.
  • Describes the technology inside the memory chips and those innovative, internal organizations
  • None of them

Question 64

Question
What is the cycle time?
Answer
  • The minimum time between requests to memory.
  • Time between when a read is requested and when the desired word arrives
  • The maximum time between requests to memory.
  • None of them

Question 65

Question
What does DRAM stands for?
Answer
  • Dynamic Random Access memory
  • Dual Random Access memory
  • Dataram Random Access memory

Question 66

Question
What does DDR stands for?
Answer
  • Double data rate
  • Dual data rate
  • Double data reaction
  • None of them

Question 67

Question
What acts as the traffic cop controlling the flow of data and coordinating interactions among components in the system?
Answer
  • Microprocessor
  • Main memory
  • Storage device
  • Chipset

Question 68

Question
Instruction register stores_____________?
Answer
  • Data of the current instruction
  • Next Instruction which is to be executed
  • Address of the current instruction
  • Instruction which is currently executed

Question 69

Question
A Set of Physical Addresses is called ________________?
Answer
  • Pages
  • Address space
  • Disk space
  • Memory space

Question 70

Question
The ______________________ operation sets to 1 the bits in one register where there are corresponding?
Answer
  • Selective Clear
  • Mask
  • Selective Complement
  • Selective Set
Show full summary Hide full summary

Want to create your own Quizzes for free with GoConqr? Learn more.

Similar

Art Movements
Julia Lee
Concepts in Biology Final Exam
mlszala
GCSE Revision: Christianity
Andrea Leyden
Maths C4 Trig formulae (OCR MEI)
Zacchaeus Snape
Sociology- Family and Households Flashcards
Heloise Tudor
Practice For First Certificate Grammar I
Alice McClean
8 Motivational Quotes for Students
Andrea Leyden
AS level Maths Equations to Remember
Gurdev Manchanda
Macbeth Quotes/Themes
Michael LEwis
1PR101 2.test - Část 13.
Nikola Truong
NSI / PSCOD/ ASSD
Yuvraj Sunar
Browse Library