SDP10 Final - Part I

Please wait - loading…

Question 1 of 200

In given two C modules which rule will Unix linker use to resolve multiple symbol definition?

Select one of the following:

Multiple strong symbols are not allowed
None of these
Given multiple weak symbols, chose any of the weak symbols
Given a strong symbol and multiple weak symbols, choose the strong symbol.

Explanation

Question 2 of 200

Suppose we attempt to compile and link the following two C modules. Linker will generate an error?

Select one of the following:

true
false

Explanation

Question 3 of 200

Suppose we attempt to compile and link the following two C modules. Linker will generate an error?

Select one of the following:

true
false

Explanation

Question 4 of 200

A branch instruction

Select one of the following:

Sets the program counter to one of two possible values
Increases the program counter by a fixed amount
Sets the program counter to one of many possible values
Unconditionally sets the program counter to its operand

Explanation

Question 5 of 200

In binary, the number 1/3 is 0.01010101 . . .. In the following, assume that x is an int and y is a short. (short)((0x5555 * (int)y)>>16) and y/3 could differ even when neither computation overflows

Select one of the following:

True
False

Explanation

Question 6 of 200

A callee-saved register should be saved before it is written to in a procedure

Select one of the following:

True
False

Explanation

Question 7 of 200

In binary, the number 1/3 is 0.01010101 . . .. In the following, assume that x is an int and y is a short. For each x there exists some integer w (which may be different for different xs) such that abs(x/3 - q) < 10, where q = (((0x55555555>>w)*x)>>(32-w)).

Select one of the following:

false
true

Explanation

Question 8 of 200

In the FDEMW ﬁve-stage pipeline we analyzed in class, if we want to stall memory how many pipeline registers should be given the "stall" signal?

Select one of the following:

Explanation

Question 9 of 200

A CPU register file is a small storage device that

Select one of the following:

Consists of a collection of word size registers
Houses a critical variable for the duration of the execution of a program
Records the results of periodic CPU diagnostics
Is automatically loaded when CPU instruction refers to a word of normal memory

Explanation

Question 10 of 200

In the FDEMW five-stage pipeline we analyzed in class, if we want to stall decode how many pipeline registers should be given the “normal operation” signal?

Select one of the following:

Explanation

Question 11 of 200

Using a base address [Eb] %edx= 0x1000, and index register [Ei] %ecx=0x02, compute the effective address for:

Select one of the following:

0x1064
0x1032
0x1016
0x1010

Explanation

Question 12 of 200

A memory leak is caused by a

Select one of the following:

Failure to free allocated memory
Function that allocates a large amount of memory from the heap
None of these
Bug in the memory allocator that fails to free memory

Explanation

Question 13 of 200

In the two's complement number representation, a negative number with more leading ones is larger (i.e. less negative) than a negative number with fewer leading ones.

Select one of the following:

true
false

Explanation

Question 14 of 200

When shifting a two’s complement number to the left, an overflow can only occur if the number is negative, since positive numbers have a zero in the leftmost bit

Select one of the following:

false
true

Explanation

Question 15 of 200

A program cannot accidentally use another program's memory space and "crash" a computer that uses (see the img)

1- virtual memory address

2- program relocation

3- separate instruction and data caches

Select one of the following:

1 only
1 and 2
2
1,2,3

Explanation

Question 16 of 200

In x86 assembly, the eax register can be used to hold integers but not addresses.

Select one of the following:

false
true

Explanation

Question 17 of 200

A program written directly in machine language (binary) would run faster than the same program written in assembly code and then assembled.

Select one of the following:

False
True

Explanation

Question 18 of 200

Initially byte i of memory is i + 0x20 (mod 256), %eax contains the number 3, and %ebx contains the number 5. What is in %ebx after running x86 movl (%eax), %ebx?

Select one of the following:

none of the above
3
0x25
0x23

Explanation

Question 19 of 200

Adding local variables is usually used to reduce what source of inefficiency?

Select one of the following:

unnecessary memory references
condition checking overhead
data dependencies
poor branch prediction

Explanation

Question 20 of 200

Asserting a word line and asserting (to "high" voltage) a bit line writes a 1 to a DRAM cell)

Select one of the following:

False
True

Explanation

Question 21 of 200

Inline substitution (also called inlining) is usually used to reduce what source of inefficiency?

Select one of the following:

procedure call overhead
poor branch prediction
poor cache locality
unnecessary memory references

Explanation

Question 22 of 200

Using a base address [Eb] %edx=0x1000, and index register [Ei] %ecx=0x03, compute the effective address for:

Select one of the following:

0x1032
0x1014
0x1064
0x1016

Explanation

Question 23 of 200

Jump in the following Y86-64 program. How many times does the addq instruction execute?

Select one of the following:

Explanation

Question 24 of 200

Jump tables, such as are used for switch statements, require that the new PC be determined by a memory read. Suppose we added an assembly instruction memjump accepting a single memory address as its parameter, like memjump (%eax). In the five-stage example pipeline (F D E M W), for how many cycles will we need to bubble and/or stall stage F after executing a memjump?

Select one of the following:

Explanation

Question 25 of 200

Let f32 be the number of distinct numbers that can be represented in 4-byte IEEE-style ﬂoating point and u32 be the number of distinct numbers that can be represented as unsigned 4-byte integers. Which of the following is true?

Select one of the following:

f32 < u32−1
f32 > u32 +1
f32 = u32
f32 = u32+1

Explanation

Question 26 of 200

Let s8 be the number of distinct numbers that can be represented as signed (two's complement) 1-byte integers and u8 be the number of distinct numbers that can be represented as unsigned 1-byte integers. Which of the following is true?

Select one of the following:

s8 = u8
s8 > u8+1
s8 = u8 - 1
s8 < u8-1

Explanation

Question 27 of 200

Assume a set-associative and a direct-mapped cache both have the same address size, same data capacity, and same number of index bits. This means

Select one of the following:

II and III
.

Explanation

Question 28 of 200

Assume x is the most positive signed integer. What is x + 1?

Select one of the following:

none of the above
+∞
-1
-x

Explanation

Question 29 of 200

Logical address is calculated by: segment.base + eff_addr

Select one of the following:

Selector: eff_addr
Segment base + lin_addr
Selector: offset
Segment base + eff_addr

Explanation

Question 30 of 200

Assuming the standard IEEE-style bias, what is the smallest number of bits a float point number could have and represent the number −29/4 exactly?

Select one of the following:

Explanation

Question 31 of 200

Buses are typically designed to transfer fixed-sized chunks of bytes known as

Select one of the following:

words
frames
records
pages

Explanation

Question 32 of 200

Capacity misses are typically discussed in connection with?

Select one of the following:

fully-associative cache
direct-mapped caches
set-associative caches
all of the above

Explanation

Question 33 of 200

Check the following (listed in alphabetical order) in order of importance when optimizing code that operates on very large arrays: B = Body of loop optimization (function inlining, efficient math), C = Cache locality, O = big-O of algorithm used

Select one of the following:

Explanation

Question 34 of 200

Compare the size of int and int*

Select one of the following:

each one of the above depends on the compute
int has fewer bits
int* has fewer bits
they have the same number of bit

Explanation

Question 35 of 200

Loop blocking is usually used to reduce what source of inefficiency?

Select one of the following:

poor cache locality
data dependencies
poor branch prediction
procedure call overhead

Explanation

Question 36 of 200

Loop unrolling is usually used to remove what source of inefficiency?

Select one of the following:

poor cache locality
data dependencies
poor branch prediction
procedure call overhead

Explanation

Question 37 of 200

Programs with good , tend to access a referenced memory location multiple times in the near future.

Select one of the following:

Temporal locality
Spatial locality
Repetitive locality
Associative locality

Explanation

Question 38 of 200

Putting \#include "foo.h" in your C file is the equivalent of typing the contents of foo.h into your file

Select one of the following:

true
false

Explanation

Question 39 of 200

Consider the following code fragment

Select one of the following:

The value of &y is closer to the value of &x than to the value &a
The value of *y is closer to the value of *x than to the value *a
The value of *a and *b are closer to each other than the values of *x and *y
The value of &a and &b are closer to each other than the values of &x and &y

Explanation

Question 40 of 200

Compared to dynamic RAM (SRAM), dynamic RAM (DRAM) is

Select one or more of the following:

a) DRAM is cheaper than SRAM
b) DRAM is faster than SRAM
c) DRAM is more likely to be used for main memory than for on-chip caches
d) SRAM is more likely to be used for main memory than for on-chip cache
a) DRAM uses more transistors per bit than SRAM
b) DRAM uses a capacitor to store a value
c) Typically a computer has more DRAM than SRA

Explanation

Question 41 of 200

Compiling C into x86 assembly comprises translating each C statement into a single assembly instruction.

Select one of the following:

False
True

Explanation

Question 42 of 200

Conﬂict misses are typically discussed in connection with?

Select one of the following:

direct-mapped caches
set-associative caches
fully-associative caches
all of the above

Explanation

Question 43 of 200

Rank the following in order of significance when writing code that deals with large arrays:
- Algorithmic efficiency (i.e., big-O),
- Computational efficiency (e.g., loop unrolling, inlining, etc),
- L cache Locality.

Select one of the following:

Explanation

Question 44 of 200

CPE (cycles per element, also called cycles per execution or cycles per instruction in other sources). If we have code with 20 CPE and run it on a problem where my algorithm executes on 100 elements; I should expect the runtime to be

Select one of the following:

50-220 cycles
0-50 cycles
220-1100 cycles
1100-2200 cycles

Explanation

Question 45 of 200

Reassociation of operators is usually used to reduce what source of inefficiency?

Select one of the following:

data dependencies
condition checking overhead
poor branch prediction
poor cache locality

Explanation

Question 46 of 200

Register %edx is one of the "callee-save" registers. This means that if procedure baz calls procedure xyxxy

Select one of the following:

baz may assume xyxxy did not change %edx
xyxxy may communicate with baz through register %edx
baz must assume xyxxy could have changed %edx
baz may communicate with xyxxy through register %edx

Explanation

Question 47 of 200

Register %esi is one of the "caller-save" registers. This means that if procedure baz calls procedure xyxxy

Select one of the following:

baz must assume xyxxy could have changed %esi
xyxxy may communicate with baz through register %esi
baz may assume xyxxy did not change %esi
baz may communicate with xyxxy through register %esi

Explanation

Question 48 of 200

Dirty bits are associated with (pick the best answer)

Select one of the following:

write-back caches
write-through caches
set-associative caches
direct-mapped caches

Explanation

Question 49 of 200

Edsger Dijkstra wrote "Go To Statement Considered Harmful" in 1968 in which he argued (translated into current language) that code that uses goto becomes needlessly hard to read and maintain compared to only using if and while. In assembly, we use the goto-like jump instructions extensively; the main reason for this is?

Select one of the following:

goto is only bad when mixed with higher-level constructs
Dijkstra was wrong
no one is reading assembly anyway
there is no other alternative in assembly

Explanation

Question 50 of 200

Every procedure in an x86 assembly program must be declared using .globl

Select one of the following:

False
True

Explanation

Question 51 of 200

Which of the following is a good reason (are good reasons) to equip the CPU with small amounts of fast memory?
I. To make the design of the compiler simpler
II. To make some CPU instructions smaller
III. To make some CPU instructions faster

Select one of the following:

III only
II and III only
I, II, and III
II only

Explanation

Question 52 of 200

Given 6-bit numbers where 010001 + 001010 = 010110, which of the following describes the number representation used?

Select one of the following:

floating-point with 2 exponent bits
floating-point with 3 exponent bits
integer
floating-point with 4 exponent bits

Explanation

Question 53 of 200

Given 6-bit numbers where 010101 + 000001 = 010110, which of the following describes the number representation used?

Select one of the following:

integer
floating-point with 3 exponent bits
floating-point with 1 exponent bits
floating-point with 2 exponent bits

Explanation

Question 54 of 200

Good software design includes writing procedures for code you might otherwise repeat in-line. Pulling code into procedures can help some branch predictors; how else can it improve your program’s performance and/or your compiler’s ability to optimize your code?

Select one of the following:

more opportunities for loop unrolling
less chance of compiler having to worry about aliasing and side effects
more opportunities for pipeline-level parallelism
better instruction cache hit rate

Explanation

Question 55 of 200

Return from function issues a bubble in pipeline.

Select one of the following:

true
false

Explanation

Question 56 of 200

Good software design includes writing procedures for code you might otherwise repeat in-line. Pulling code into procedures involves call/return overhead; how else can it hurt your program's performance and/or your compiler's ability to optimize your code?

Select one of the following:

more chance of compiler having to worry about aliasing and side effects
fewer opportunities for pipeline-level parallelism
worse instruction cache hit rate
fewer opportunities for loop unrolling

Explanation

Question 57 of 200

SRAM is "static" in the sense that if the power is turned off, SRAM will continue to store data (e.g. as in flash memory in MP3 players or USB thumb drives).

Select one of the following:

false
true

Explanation

Question 58 of 200

Suppose addresses A and B have different tags but the same index (for those caches that have tags and indexes, that is). Assume the cache is empty prior to the accesses listed in the questions. In the access pattern "read A, then read B, then read A, then read B" the second read of A will be a miss for?

Select one of the following:

a direct-mapped cache
a set-associative cache
a fully-associative cache
all of the above

Explanation

Question 59 of 200

How does knowing you have a pipelined processor change the code you write?

Select one of the following:

it suggests optimizations like multiple accumulators
it suggests optimizations like adding local variables
it suggests optimizations like loop unrolling
it suggests optimizations like loop reordering

Explanation

Question 60 of 200

Suppose addresses A and B have different tags but the same index (for those caches that have tags and indexes, that is). Assume the cache is empty prior to the accesses listed in the questions. In the access pattern "read A, then read B" the read of B will be a miss for

Select one of the following:

all of the above
a fully-associative cache
a direct-mapped cache
a set-associative cache

Explanation

Question 61 of 200

How is "-1" (decimal) represented in an 8-bit 2's complement binary format?

Select one of the following:

11111111
.

Explanation

Question 62 of 200

Suppose page table entries are 8 bytes long and virtual addresses are 32 bytes long. If each page table is to fit on a single page, what is the smallest pages can be if we have a 2-level page table hierarchy?

Select one of the following:

bigger than any of the above options
2 KB
512 B
smaller than any of the above options

Explanation

Question 63 of 200

How is 46 (decimal) represented in an 8-bit 2's complement binary format?

Select one of the following:

00101100
00101110
00011110
01000110

Explanation

Question 64 of 200

How is -10 (decimal) represented in an 8-bit 2's complement binary format?

Select one of the following:

11110110
10001010
11110101
11111010

Explanation

Question 65 of 200

Which of the following move operations is the following instruction an example of movl (%edx), (%eax)?

Select one of the following:

error, can’t move memory to memory
memory to immediate
register to memory
memory to register

Explanation

Question 66 of 200

In the access pattern “write A, then write B, then write A”, to minimize
writes to the higher-level cache we should pick which of the following?

Select one of the following:

a write-through fully-associative cache
a write-back fully-associative cache
a write-through direct-mapped cache
a write-back direct-mapped cache
two or more of the above are equivalently the best option

Explanation

Question 67 of 200

How many hex digits are needed to represent the decimal number 67?

Select one of the following:

Explanation

Question 68 of 200

How many ints fit inside x if x is declared as int *x = malloc(8); ? Word size is 4.

Select one of the following:

Explanation

Question 69 of 200

Which of the following move operations is the following instruction an example of movl (%edx), %eax?

Select one of the following:

error, can’t move memory to memory
memory to register
register to memory
memory to immediate

Explanation

Question 70 of 200

How many rules do Unix linkers use for dealing with multiply deﬁned symbol

Select one of the following:

Explanation

Question 71 of 200

Suppose an array of char (8-bit values) {0x12, 0x34, 0x56, 0x78} is stored at address 0x24 of a little-endian computer. What byte is stored at address 0x26?

Select one of the following:

0x56
0x00
0x65
A known value not listed here

Explanation

Question 72 of 200

If a computer has 8GB memory, a single 1MB cache, and 4KB of registers, the total amount of data it can store is?

Select one of the following:

more than 8GB but less than 8GB + 1MB
more than 8GB + 1MB but less than 8GB + 1MB + 1KB
more than 8GB + 1MB + 4KB
8GB + 1MB + 4KB

Explanation

Question 73 of 200

Suppose the 32-bit value 0x12345678 is stored at address 0x24 of a big-endian computer. What byte is stored at address 0x23?

Select one of the following:

0x65
0x34
0x43
A known value not listed here
An unknown value because the number does not overlap address
0x25

Explanation

Question 74 of 200

When the following code fragment is executed on a computer with 32-bit integers and a fully-associative cache with 16-byte cache lines, how many bytes of the array A[] will be fetched into the cache from main memory

Select one of the following:

At most 96
Exactly 17
Exactly 32
At most 80

Explanation

Question 75 of 200

If a wire carries a logical value of 0, its voltage level will be 0 Volts.

Select one of the following:

False
True

Explanation

Question 76 of 200

If we fail to find data in a cache because we have never accessed the data before, we call that a

Select one of the following:

cold miss
capacity miss
conflict miss
forced miss

Explanation

Question 77 of 200

If we fail to find data in a cache because we've read too much data since we last accessed that same data, we call that a

Select one of the following:

capacity miss
cold miss
conflict miss
forced miss

Explanation

Question 78 of 200

Suppose the 32-bit value 0x12345678 is stored at address 0x24 of a big-endian computer. What byte is stored at address 0x25?

Select one of the following:

0x56
A known value not listed here
0x65
0x43
An unknown value because the number does not overlap address
0x25
F 0x34

Explanation

Question 79 of 200

If we were running a non-pipelined processor (like SEQ) with a real memory system, which of the following optimization strategies would no longer provide a speed benefit?

Select one of the following:

using multiple accumulators
adding local variables
function call inlining
none of the above would provide a speed benefit

Explanation

Question 80 of 200

The .data section of an x86 assembly program is used to specify the parameters for each procedure.

Select one of the following:

false
true

Explanation

Question 81 of 200

In C, a pointer variable is used for storing an address

Select one of the following:

True
False

Explanation

Question 82 of 200

If x is the most negative signed integer, what is -x?

Select one of the following:

the most negative signed number
one
the most positive signed number
negative one

Explanation

Question 83 of 200

In a DRAM, all cells have to be periodically refreshed, not just the ones that have been read.

Select one of the following:

True
False

Explanation

Question 84 of 200

In a program with good ____________, if a memory location is referenced once, then the program is likely to access nearby memory locations in the near future

Select one of the following:

Spatial locality
Temporal locality
Repetitive locality
Associative locality

Explanation

Question 85 of 200

The ASCII code for the character 'B' is 0x42. What is the ASCII hex code for the character 'D'?

Select one of the following:

0x4B
0x5A
0x48
0x44

Explanation

Question 86 of 200

If we were running a non-pipelined processor (like SEQ) with a real memory system, which of the following optimization strategies would not longer provide a speed benefit?

Select one of the following:

none of the above would provide a speed benefit
adding local variables
using multiple accumulators
function call inlining

Explanation

Question 87 of 200

In C, local variables allocated inside functions are allocated:

Select one of the following:

On the stack
In static storage
In virtual memory
In the heap

Explanation

Question 88 of 200

In C, using default floating point settings, a special value of "infinity" is computed when

Select one of the following:

A floating-point computation results in an overflow
Program execution is halted
An erroneous value is computed and execution continues
An exception is raised

Explanation

Question 89 of 200

The ASCII code for the character 'B' is 0x42. What is the ASCII hex code for the character ‘E’?

Select one of the following:

0x45
0x48
0x56

Explanation

Question 90 of 200

In given two C modules which rule will Unix linker use to resolve multiple symbol definition?

Select one of the following:

Given a strong symbol and multiple weak symbols, choose the strong symbol.
Given multiple weak symbols, chose any of the weak symbols
Multiple strong symbols are not allowed.
None of these

Explanation

Question 91 of 200

The assembly instruction int x used to make system calls only accepts a 1-byte (256-value) argument x, but Linux uses it to support over 300 system calls. How does it do that?

Select one of the following:

SRAM would lose its data, DRAM would keep its data
SRAM would keep its data, DRAM would keep its data
SRAM would keep its data, DRAM would lose its data
SRAM would lose its data, DRAM would lose its data

Explanation

Question 92 of 200

The contents of how many program registers are modified by an assembly push operation?

Select one of the following:

1
2
3 or more
it depends on that argument of the push

Explanation

Question 93 of 200

The difference between the SAR (arithmetic shift right) and SHR (logical shift right) operations is that SAR puts a one into the leftmost bit after a shift and SHR puts a zero.

Select one of the following:

false
true

Explanation

Question 94 of 200

The EBP is a callee-saved register.

Select one of the following:

true
false

Explanation

Question 95 of 200

The EFLAGS register contains the zero flag and the sign flag?

Select one of the following:

true
false

Explanation

Question 96 of 200

What is the value of the following C expression? x=0x1234 and y=0x3 ((x >> y) << y)

Select one of the following:

0x1230
0x1234
0x0246
0x1200

Explanation

Question 97 of 200

The hardware is aware of the program stack

Select one of the following:

true
false

Explanation

Question 98 of 200

The instruction addq %rax, %rbx changes what?

Select one of the following:

The contents of the rbx register
The contents of memory at an address found in the rax register
The contents of memory at an address found in the rbx register
The contents of the rax register

Explanation

Question 99 of 200

What is the value of the following C expression? x=0x00 and y=0xA5 x && ~y

Select one of the following:

0xFF50
0x0000
0x0001
0x11A5

Explanation

Question 100 of 200

The instruction cmp eax,ebx (or cmp %ebx,%eax in AT&T syntax) computes the value of EAX - EBX.

Select one of the following:

true
false

Explanation

Question 101 of 200

_______ - program transformation that reduces the number of iterations for a loop by increasing the number of elements computed on each iteration

Select one of the following:

Loop unrolling
Memory aliasing
Side effect
Code motion

Explanation

Question 102 of 200

The valid bit is associated with

Select one of the following:

fully-associative caches
write-through caches
set-associative caches
direct-mapped caches

Explanation

Question 103 of 200

It is possible to explicitly specify the number of threads to be created in the team, using the _____ attribute:

Select one of the following:

pragma omp
parallel
private
Num_threads

Explanation

Question 104 of 200

CPU optimized for throughput

Select one of the following:

True
False

Explanation

Question 105 of 200

The working set of a program is formed by

Select one of the following:

The pages that the program is actively using
The libraries required by the program
The memory of the program that is currently in physical memory
All the files the program needs to execute

Explanation

Question 106 of 200

This problem occurs when a larger type is converted into a smaller type or with the signed-unsigned operations?

Select one of the following:

truncation
overflow

Explanation

Question 107 of 200

Using multiple accumulators is usually used to reduce what source of inefficiency?

Select one of the following:

unnecessary memory references
condition checking overhead
data dependencies
poor branch prediction

Explanation

Question 108 of 200

169. In C a single statement that performs the equivalent of y=x100; but without using the multiply operator ();

Select one of the following:

y = (x>>6)+(x<<5)+(x<<2)
y = (x<<6)+(x<<3)+(x>>2)
y = (x<<5)+(x<<5)+(x<<7)
y = (x<<6)+(x<<5)+(x<<2)

Explanation

Question 109 of 200

We can encode the C command a ? b : c, where all three variables are of type int,

Select one of the following:

((-!!a) & b) | ((-!a) & c)
((!!a) & b) | ((!a) & c)
Any of the above
(a & b) | ((!a) & c)

Explanation

Question 110 of 200

We say that pipelining generally increases latency. That statement means (select all that are part of the definition of "increases latency")

Select one of the following:

each instruction takes more time to complete
each instruction takes less time to complete
entire programs take more time to complete
entire programs take less time to complete

Explanation

Question 111 of 200

Two computers A and B with a cache in the CPU chip differ only in that A has an L2 cache and B does not. Which of the following are possible?

Select one of the following:

1 & 2 only
2 & 3 only
1 only
2

Explanation

Question 112 of 200

At which of the following times is a stack frame created?

Select one of the following:

II and III only
II only
III only
I and II only

Explanation

Question 113 of 200

The bitwise and operation (& in C) can be used to flip the bits of a word

Select one of the following:

true
false

Explanation

Question 114 of 200

Linking can be performed at

Select one of the following:

run time
compile time
all of the above
load time

Explanation

Question 115 of 200

Parallel processing mechanisms to achieve parallelism in uniprocessor system are:

Select one of the following:

All of the above
Multiple function units
Parallelism and pipelining within CPU
Multiprogramming and time sharing

Explanation

Question 116 of 200

This is an example of?

Select one of the following:

Hybrid system
shared memory UMA
Distributed memory architecture
Shared memory NUMA

Explanation

Question 117 of 200

This is an example of?

Select one of the following:

None
Loop unrolling
Loop fusion
Loop fission

Explanation

Question 118 of 200

This is an example of?

Select one of the following:

MIMD
MISD
SIMD
SISD

Explanation

Question 119 of 200

This is an example of?

Select one of the following:

MIMD
MISD
SIMD
SISD

Explanation

Question 120 of 200

This is an example of?

Select one of the following:

MIMD
MISD
SIMD
SISD

Explanation

Question 121 of 200

This is an example of?

Select one of the following:

MIMD
MISD
SIMD
SISD

Explanation

Question 122 of 200

The _______ directive causes threads encountering the barrier to wait until all the other threads in the same team have encountered the barrier.

Select one of the following:

single
barrier
nowait
private

Explanation

Question 123 of 200

How is 148 (decimal) represented in a 16-bit 2’s complement binary format?

Select one of the following:

0000 0000 1101 0111
0000 0000 0010 1001
1111 1111 0010 1000
1111 1111 0110 1100

Explanation

Question 124 of 200

In a Compare the runtime of y = x * 5 and y = (x<<2) + x, measured by the time it takes for the resulting value of y to be available somewhere in the pipeline.

Select one of the following:

y = x * 5 is faster
y = (x<<2) + 5 is faster
not given
they take the same number of cycles

Explanation

Question 125 of 200

What is the difference between 15 and $15?

Select one of the following:

15 is an address, $15 is a value
15 is a value, $15 is an address
15 is legal in assembly, $15 is not
$15 is legal in assembly, 15 is not

Explanation

Question 126 of 200

What is the result of the following assembly code instruction?

Select one of the following:

Fetch the data from register %ecx and store in register %eax
Fetch the data from the register %ecx and store in the memory address indicated by (%eax)
Fetch the data from the register %eax and store in register %ecx
Fetch the data from the memory address indicated by (%eax) and store in the register %ecx

Explanation

Question 127 of 200

What is the value of the following C expression? x=0xA0 and y=0x0F ~x||~y

Select one of the following:

0х0001
0х6000
0xFF50
0xFFFF

Explanation

Question 128 of 200

What value ends up in EAX afer the following code is executed?

Select one of the following:

48 (decimal) or 00110000 (binary) or 0x30 (hex)
50 (decimal) or 00110010 (binary) or 0x32 (hex)
46 (decimal) or 00101110 (binary) or 0x2E (hex)
52 (decimal) or 00110100 (binary) or 0x34 (hex)

Explanation

Question 129 of 200

When shifting a two's complement number to the left, an overflow can only occur if the number is negative, since positive numbers have a zero in the leftmost bit.

Select one of the following:

True
False

Explanation

Question 130 of 200

Which of the ﬁve phases determines how many bytes long an instruction is?

Select one of the following:

Fetch
Decode
Writeback
Execute

Explanation

Question 131 of 200

Which of the five phases determines what the next PC is?

Select one of the following:

Fetch
Memory
Execute
Decode

Explanation

Question 132 of 200

Which of the five phases determines the destination register for instructions that write to registers?

Select one of the following:

Decode
Writeback
Fetch
Execute

Explanation

Question 133 of 200

Which of the following computations may be performed by exactly one CPU instruction? (img)
a = 5;
a = b + c * 5;
for (i = 0; i < 10; i += a[i++]);

Select one of the following:

I, II, and III
II only
I and II only
I only

Explanation

Question 134 of 200

Which of the following is true?

Select one of the following:

A direct-mapped cache is a set-associative cache with set size 1
A direct-mapped cache is a fully-associative cache with only one set
A direct-mapped cache is a fully-associative cache with set size 1
A direct-mapped cache is a set-associative cache with only one set

Explanation

Question 135 of 200

Which of the following manages the transfer of data between the cache and main memory

Select one of the following:

Operating system
Compiler
Hardware
Registry

Explanation

Question 136 of 200

Which of the following manages the transfer of data between the CPU registers and the cache

Select one of the following:

Operating system
Compiler
Hardware
Registry

Explanation

Question 137 of 200

Which of the following registers is the lower order 16 bit register of register %ecx?

Select one of the following:

Explanation

Question 138 of 200

Which of the following statements about alignment within C struct's is true?

Select one of the following:

A constant offset associated with the member is added to the address
The struct consists of an array of pointers to the elements of the struct
The element name is looked up in a symbol table
A linear search is made from the base address of the struct

Explanation

Question 139 of 200

Which of the following statements about floating-point numbers in C is true?

Select one of the following:

II only
III only
I
I and II

Explanation

Question 140 of 200

Which one of the following IA32 registers is typically used for stack management?

Select one of the following:

%esp
%eax
%ebx
%edi

Explanation

Question 141 of 200

Which one of the following optimizations does not provide any speed benefit for a non-pipelined processor, such as SEQ?

Select one of the following:

Storing reused computed values in variables instead of recomputing them
Invocation inlining
Using more efficient algorithms
Reassociation

Explanation

Question 142 of 200

Which of the following levels of a typical memory hierarchy transfers data in chunks of smallest size?

Select one of the following:

Main memory < ---> disk
Cache < ---> main memory
They all transfer one byte at a time
CPU registers < ---> cache

Explanation

Question 143 of 200

In C, a pointer variable is used for storing an address

Select one of the following:

True
False

Explanation

Question 144 of 200

If we cut power for one millisecond, which of the following is true?

Select one of the following:

SRAM would keep its data, DRAM would lose its data
SRAM would lose its data, DRAM would keep its data
SRAM would lose its data, DRAM would lose its data
SRAM would keep its data, DRAM would keep its data

Explanation

Question 145 of 200

If we cut power for one minute, which of the following is true?

Select one of the following:

SRAM would lose its data, DRAM would lose its data
SRAM would lose its data, DRAM would keep its data
SRAM would keep its data, DRAM would keep its data
SRAM would keep its data, DRAM would lose its data

Explanation

Question 146 of 200

Select the most correct statement from the following as applied over the last two decades:

Select one of the following:

Processors get faster but memory does not
Processors and memory both get faster, but memory gets faster faster that processors do
Processors and memory both get faster, but processors get faster than memory does
Memory gets faster but processor does not

Explanation

Question 147 of 200

Which one of the following optimizations does not provide any speed benefit for a
non-pipelined processor, such as SEQ?

Select one of the following:

Using more efficient algorithms
Invocation inlining
Reassociation
Storing reused, computed values in variables instead of recomputing them

Explanation

Question 148 of 200

Consider the following code. Assume the compiler is performing no optimization. Which of the following strategies would improve the speed of this code the most in the case where it returns true?

Select one of the following:

Unroll the loop
Pull the (x % i)==0 into a function isDivisibleBy
Declare int sx = (int)sqrt(x) and change i < sqrt(x) to i < sx
Move the check for (x % 2) != 0 to before the loop

Explanation

Question 149 of 200

Consider the following code. This code would most likely benefit from which of the following optimization strategies

Select one of the following:

Using multiple accumulators
Improving cache locality
Loop unrolling
Adding local variables

Explanation

Question 150 of 200

What does the following C code print?

Select one of the following:

P = 103, c = 101
P = 104, c = 101
P = 105, c = 103
P = 104, c = 102

Explanation

Question 151 of 200

The bitwise and operation (& in C) can be used to flip the bits of a word

Select one of the following:

True
False

Explanation

Question 152 of 200

The bitwise xor operation (^ in C) can be used to flip the bits of a word

Select one of the following:

True
False

Explanation

Question 153 of 200

Consider a direct-mapped cache with 256 sets and 16 byte blocks. In this cache the address 0x12345 maps to the same set as which of the following addresses?

Select one of the following:

0x02345
0x22244
0x12040
0x12354

Explanation

Question 154 of 200

In C, on a 34-bit x86 machine, the expression (1 << 31) results in a negative integer

Select one of the following:

True
False

Explanation

Question 155 of 200

Consider the following code. Which of the following changes would make the largest positive impact on its cache locality?

Select one of the following:

Put the for-i loop inside of the for-j loop instead of the other way around
Store the result of (i*101)%n outside the inner loop
Block the accesses by nesting three or four for loops instead of just two
Change int** to int*

Explanation

Question 156 of 200

Consider the following code. Assume the compiler is performing no optimizations and that isPrime is the exact code presented in another question on this exam. Which of the following strategies would improve the speed of this code the most?

Select one of the following:

Inline the isPrime call
Add a second ans accumulator
Swap the order of the if statements
Change the nested if statements to a single if with a &&

Explanation

Question 157 of 200

Consider the following two versions of a C function: (Assume len is larger than 10)

Select one of the following:

sum1
None of them
sum2
Both of them

Explanation

Question 158 of 200

Which of the following is necessary true regarding the following code fragment?

Select one of the following:

It exhibits locality of reference but only when a == b
It exhibits locality of reference because the variables are allocated near each other
It exhibit no locality of reference
It exhibits locality of reference no matter where the variables are allocated

Explanation

Question 159 of 200

A & B is the bitwise version of A && B; A | B is the bitwise version of A || B; which of the following is the bitwise version of A == B?

Select one of the following:

~(a = b)
a = b
~ (a ^ b)
a ^ b

Explanation

Question 160 of 200

The unary & operator returns (in C language)

Select one of the following:

The logical “and” of two integer operands
The logical “or” of two integer operands
The value of a data object
The address of a data object

Explanation

Question 161 of 200

In C a single statement that performs the equivalent of y = x 100, but without using the multiply operator ()

Select one of the following:

y = (x<<6) + (x<<5) + (x<<2)
y = (x>>6) + (x<<5) + (x<<2)
y = (x<<6) + (x<<3) + (x>>2)
y = (x<<5) + (x<<5) + (x<<7)

Explanation

Question 162 of 200

Adding local variable is usually used to reduce what source inefficiency?

Select one of the following:

Condition checking overhead
Poor branch prediction
Unnecessary memory references
Data dependencies

Explanation

Question 163 of 200

If, in C, an array is declared by “int a[10];”, then accessing a[11] during execution will generate an error message.

Select one of the following:

True
False

Explanation

Question 164 of 200

In C, if x is an integer variable, the expression “x << 3” computes x * 8 but does not change the value of x.

Select one of the following:

True
False

Explanation

Question 165 of 200

Which of the following code snippets is fastest? Assume n is very large (more than ten thousand).

Select one of the following:

for(i=0;i<n;i+=1) for(j=0;j<n;j+=1) a[i][j] = b[j][i];
for(j=0;j<n;j+=1) for(i=0;i<n;i+=1) a[i][j] = b[j][i];
two or more of the above are equivalently the fastest

Explanation

Question 166 of 200

Which of the following code snippets is fastest? Assume n is very large (more than ten thousand).

Select one of the following:

a) for(k=0; k<n; k+=16) for(l=0; l<n; l+=16)
for(j=0;j<16;j+=1) for(i=0;i<16;i+=1)
a[i+l][j+k] = b[i+l][j+k];
for(i=0;i<n;i+=1) for(j=0;j<n;j+=1) a[i][j] = b[i][j];
for(j=0;j<n;j+=1) for(i=0;i<n;i+=1) a[i][j] = b[i][j];
two or more of the above are equivalently the fastest

Explanation

Question 167 of 200

In binary, the number 1/3 is 0.01010101 . . .. In the following, assume that x is an int and y is a short. (short)((0x5555 * (int)y)>>16) and y/3 could differ because of overflow

Select one of the following:

True
False

Explanation

Question 168 of 200

How is 148 (decimal) represented in a 16-bit 2’s complement binary format?

Select one of the following:

0000 0000 1101 0111
0000 0000 0010 1001
1111 1111 0010 1000
1111 1111 0110 1100

Explanation

Question 169 of 200

Which of the following code snippets is fastest? Assume n is very large (more than ten thousand).

Select one of the following:

for(j=0;j...
for(i=0;i...
two or more of the above are equivalently the fastest
for(k=0;k<n;k+=16) for(l=0;l<n;l+=16)...

Explanation

Question 170 of 200

In a Compare the runtime of y = x * 5 and y = (x<<2) + x, measured by the time it takes for the resulting value of y to be available somewhere in the pipeline.

Select one of the following:

y = x * 5 is faster
they take the same number of cycles
not given
y = (x<<2) + 5 is faster

Explanation

Question 171 of 200

The program counter contains:

Select one of the following:

The address of the CPU instruction that is about to be executed
The number of programs currently running
The number of CPU instructions a program has executed so far
The number of processes currently running

Explanation

Question 172 of 200

A memory leak is caused by a:

Select one of the following:

Bug in the memory allocator that fails to free memory
Failure to free allocated memory
None of these
Function that allocates a large amount of memory from the heap

Explanation

Question 173 of 200

Registers and cache memory are the same thing

Select one of the following:

False
True

Explanation

Question 174 of 200

In a computer in which both addresses and integers are 32 bits wide, how many bytes of memory will the compiler allocate for the following code fragment?

Select one of the following:

Explanation

Question 175 of 200

In C, local variables allocated inside functions are allocated:

Select one of the following:

On the stack
In the heap
In virtual memory
In static storage

Explanation

Question 176 of 200

What is the value of the following C expression? x=0xA0 and y=0x0F ~x || ~y

Select one of the following:

0x0000
0xFF50
0xFFFF
0x0001

Explanation

Question 177 of 200

What is an example of?

Select one of the following:

Loop unrolling
Loop fission
none
Loop fusion

Explanation

Question 178 of 200

How is 215 (decimal) represented in a 16-bit 2's complement binary format?

Select one of the following:

1111 1111 0010 1001
0000 0000 1101 0111
0000 0000 0010 1001
1111 1111 0010 1000

Explanation

Question 179 of 200

This code indicates that Work2 and Work3 must be run in _______ :

Select one of the following:

none
parallel
sequence
both

Explanation

Question 180 of 200

____ involve identifying a computation that is performed multiple times (e.g., within a loop), but such that the result of the computation will not change.

Select one of the following:

Code motion
Side effect
Loop unrolling
Memory aliasing

Explanation

Question 181 of 200

In C, for the expression (x | THE_MASK), where THE_MASK has at least one bit that is not zero, the result will be zero if all the bits of x are zero.

Select one of the following:

True
False

Explanation

Question 182 of 200

What is the value of the following C expression? x = 0x128 and y = 0x2 ~x << y (in hex)

Select one of the following:

0x000004A0
0x000FFB5C
0xFFFFFB5C
0x00FF04A0

Explanation

Question 183 of 200

In C, using default floating point settings, a special value of "infinity" is computed when:

Select one of the following:

A floating-point computation results in an overflow
Program execution is halted
An exception is raised
An erroneous value is computed and execution continues

Explanation

Question 184 of 200

GPU optimized for latency.

Select one of the following:

true
false

Explanation

Question 185 of 200

If you don’t explicitly specify the number of threads (OpenMP) how many thread will be executed?

Select one of the following:

1
Depends on the number of cores on computer
2
4

Explanation

Question 186 of 200

CPU optimized for latency

Select one of the following:

true
false

Explanation

Question 187 of 200

Program take as input a collection of relocatable object files and command-line arguments and generate as output a fully linked executable object file that can be loaded and run:

Select one of the following:

Static linker
Dynamic linker
Both
none

Explanation

Question 188 of 200

If we find the data we want in a cache, we call that a

Select one of the following:

Cache find
Cache hit
Cache miss
Cache success

Explanation

Question 189 of 200

The_construct forms a region that contains one or more structured blocks. Each block of a___ directive executed once by one of the threads (any one) in the team?

Select one of the following:

parallel
master
section
schedule

Explanation

Question 190 of 200

Pick a value for A and for B which will cause the two procedures below to return different results.

Select one of the following:

a=7; b=1;
a=1; b=2;
a=1; b=5;
a=1; b=1;

Explanation

Question 191 of 200

Pick a value for A and for B which will cause the two procedures below to return the same results.

Select one of the following:

ОДИНАКОВЫЕ ВОЗВРАЩАЮТ: (7,1) (1,5) (1,1)
нет других вариантов

Explanation

Question 192 of 200

A is the 4-bit value 0011 and B is the 4-bit value 0110. What is A^B?

Select one of the following:

0011
1110
0111
0101

Explanation

Question 193 of 200

Consider the following code. This code would most likely benefit from which of the following optimization strategies.

Select one of the following:

improving locality
loop unrolling
using multiple
adding local variables

Explanation

Question 194 of 200

Conflict misses are typically discussed in connection with?

Select one of the following:

all of the above
fully-associative caches
set-associative caches
direct-mapped caches

Explanation

Question 195 of 200

What is -5 as a six bit two’s complement number? Answer in binary

Select one of the following:

101111
111011
000001
011011

Explanation

Question 196 of 200

By default, OpenMp _____ assigns loop iterations to threads. When the parallel for block is entered, it assigns each thread the set of loop iterations it is to execute?

Select one of the following:

static
runtime
dynamic
auto

Explanation

Question 197 of 200

In general, which of the following is slowest?

Select one of the following:

moving from one register to another
doing division
accessing memory
comparing two numbers to decide where to jump

Explanation

Question 198 of 200

How is 28 (decimal) represented in an 8-bit 2’s complement binary format?

Select one of the following:

0001 1100
1110 0100
1100 1011
1110 0011

Explanation

Question 199 of 200

The ASCII code for the character ‘b’ is 98. How can the character ‘b’ be represented in binary using ASCII codes?

Select one of the following:

1011 1111
1010 1111
0110 0010
1000 0001

Explanation

Question 200 of 200

This code indicates that any of the tasks Work1, Work2 + Work3 and Work4 may run in _____________:

Select one of the following:

parallel
sequence
both
none

Explanation

Check answer

["https://cdn.goconqr.com/uploads/media/image/15414033/desktop_a7327f26-3cc7-4506-9293-daf5e8b8c383.png","https://cdn.goconqr.com/uploads/media/image/15414131/desktop_263adad7-dfb4-4eab-aa10-9ea27863f365.png","https://cdn.goconqr.com/uploads/media/image/15414200/desktop_07c0f4ed-31cb-4e86-b22a-4a51fa007bd0.png","https://cdn.goconqr.com/uploads/media/image/15414282/desktop_12d59e83-1e73-49a2-b838-804baad68569.png","https://cdn.goconqr.com/uploads/media/image/15414282/desktop_12d59e83-1e73-49a2-b838-804baad68569.png","https://cdn.goconqr.com/uploads/media/image/15414391/desktop_68802784-21e3-488b-b672-3cddf52e1d8d.png","https://cdn.goconqr.com/uploads/media/image/15414461/desktop_55675a52-bbac-4d8f-bec6-de91240003a4.png","https://cdn.goconqr.com/uploads/media/image/15414716/desktop_a584517c-a840-4286-af43-3986ce6f0a0e.png","https://cdn.goconqr.com/uploads/media/image/15415072/desktop_af790a72-d6b3-412d-853c-cd6908d33ea5.png","https://cdn.goconqr.com/uploads/media/image/15415191/desktop_9b4c1112-a5b0-41b2-a7dd-089196ea7eaa.png","https://cdn.goconqr.com/uploads/media/image/15415631/desktop_adf8bfa9-09f7-47ba-b041-4eebfa08d035.png","https://cdn.goconqr.com/uploads/media/image/15415697/desktop_0b722b34-d575-4dde-8088-03036d685f21.png","https://cdn.goconqr.com/uploads/media/image/15415781/desktop_24428394-a69b-4f12-a6e0-400daf9cae70.png","https://cdn.goconqr.com/uploads/media/image/15415819/desktop_972022df-bdd1-4f14-b2c1-579de4806455.png","https://cdn.goconqr.com/uploads/media/image/15415862/desktop_d0987ecb-6400-470c-b00a-ca3f21a18eff.png","https://cdn.goconqr.com/uploads/media/image/15415938/desktop_e4a79c94-ef6a-4cf9-ba33-6a10a6d60d06.png","https://cdn.goconqr.com/uploads/media/image/15415940/desktop_7c259ec4-3f63-4d4f-b36b-985fb6cbce8b.png","https://cdn.goconqr.com/uploads/media/image/15415935/desktop_39c52010-57db-4aa6-baa5-1c795146d971.png","https://cdn.goconqr.com/uploads/media/image/15419041/desktop_8245ab87-bfb9-4e1c-afdb-4a2acb28c680.png","https://cdn.goconqr.com/uploads/media/image/15419097/desktop_23165436-1077-4395-b223-bcf7c90b735a.png","https://cdn.goconqr.com/uploads/media/image/15419854/desktop_d470fe63-3851-449f-b7b4-9ec9bc5c3788.png","https://cdn.goconqr.com/uploads/media/image/15420159/desktop_2355379f-cf76-448d-af7a-9533fda1e4f5.png","https://cdn.goconqr.com/uploads/media/image/15420187/desktop_20b97e30-8b47-41dd-be30-83b4dea69a29.png","https://cdn.goconqr.com/uploads/media/image/15420221/desktop_968cc105-f40f-40da-a84a-c596c104fb9b.png","https://cdn.goconqr.com/uploads/media/image/15420311/desktop_d318e5ac-298c-4c45-bb0b-abf87ea99fc0.png","https://cdn.goconqr.com/uploads/media/image/15420349/desktop_2f0667ff-572d-422d-a49e-1b82fb562ca1.png","https://cdn.goconqr.com/uploads/media/image/15420381/desktop_b3d99a87-5fdf-42bb-8c59-3d51ed5492e9.png","https://cdn.goconqr.com/uploads/media/image/15420425/desktop_2da6df11-fb06-4aec-a8dc-b7d2f3a299e4.png","https://cdn.goconqr.com/uploads/media/image/15428456/desktop_8be59312-c865-4644-af04-6a62e1d191e5.png","https://cdn.goconqr.com/uploads/media/image/15428479/desktop_7f8bcfcc-e6c2-4b53-ac31-358bed5d5eb0.png","https://cdn.goconqr.com/uploads/media/image/15428500/desktop_809908df-3185-4c9b-896b-b6156efcd833.png","https://cdn.goconqr.com/uploads/media/image/15428531/desktop_3ed00849-3fa0-4314-832b-88020d605e65.png","https://cdn.goconqr.com/uploads/media/image/15428537/desktop_0813fb22-926a-4492-81b5-5a5547badc2e.png","https://cdn.goconqr.com/uploads/media/image/15428554/desktop_cb1f2195-fd3e-45c8-8d98-6df3bf29ee52.png","https://cdn.goconqr.com/uploads/media/image/15428590/desktop_22a68cdb-eb8a-4c7a-a79a-4d98957863ed.png","https://cdn.goconqr.com/uploads/media/image/15420575/desktop_68d784f4-715b-4536-8db6-d3e47272c211.png"]

	Created by Csse 1502 about 6 years ago

SDP10 Quiz on SDP10 Final - Part I, created by Csse 1502 on 12/05/2018.

SDP10 Final - Part I

Question 1 of 200

In given two C modules which rule will Unix linker use to resolve multiple symbol definition?

Select one of the following:

Explanation

Question 2 of 200

Suppose we attempt to compile and link the following two C modules. Linker will generate an error?

Select one of the following:

Explanation

Question 3 of 200

Suppose we attempt to compile and link the following two C modules. Linker will generate an error?

Select one of the following:

Explanation

Question 4 of 200

A branch instruction

Select one of the following:

Explanation

Question 5 of 200

In binary, the number 1/3 is 0.01010101 . . .. In the following, assume that x is an int and y is a short. (short)((0x5555 * (int)y)>>16) and y/3 could differ even when neither computation overflows

Select one of the following:

Explanation

Question 6 of 200

A callee-saved register should be saved before it is written to in a procedure

Select one of the following:

Explanation

Question 7 of 200

In binary, the number 1/3 is 0.01010101 . . .. In the following, assume that x is an int and y is a short. For each x there exists some integer w (which may be different for different xs) such that abs(x/3 - q) < 10, where q = (((0x55555555>>w)*x)>>(32-w)).

Select one of the following:

Explanation

Question 8 of 200

In the FDEMW ﬁve-stage pipeline we analyzed in class, if we want to stall memory how many pipeline registers should be given the "stall" signal?

Select one of the following:

Explanation

Question 9 of 200

A CPU register file is a small storage device that

Select one of the following:

Explanation

Question 10 of 200

In the FDEMW five-stage pipeline we analyzed in class, if we want to stall decode how many pipeline registers should be given the “normal operation” signal?

Select one of the following:

Explanation

Question 11 of 200

Using a base address [Eb] %edx= 0x1000, and index register [Ei] %ecx=0x02, compute the effective address for:

Select one of the following:

Explanation

Question 12 of 200

A memory leak is caused by a

Select one of the following:

Explanation

Question 13 of 200

In the two's complement number representation, a negative number with more leading ones is larger (i.e. less negative) than a negative number with fewer leading ones.

Select one of the following:

Explanation

Question 14 of 200

When shifting a two’s complement number to the left, an overflow can only occur if the number is negative, since positive numbers have a zero in the leftmost bit

Select one of the following:

Explanation

Question 15 of 200

A program cannot accidentally use another program's memory space and "crash" a computer that uses (see the img) 1- virtual memory address 2- program relocation 3- separate instruction and data caches

Select one of the following:

Explanation

Question 16 of 200

In x86 assembly, the eax register can be used to hold integers but not addresses.

Select one of the following:

Explanation

Question 17 of 200

A program written directly in machine language (binary) would run faster than the same program written in assembly code and then assembled.

Select one of the following:

Explanation

Question 18 of 200

Initially byte i of memory is i + 0x20 (mod 256), %eax contains the number 3, and %ebx contains the number 5. What is in %ebx after running x86 movl (%eax), %ebx?

Select one of the following:

Explanation

Question 19 of 200

Adding local variables is usually used to reduce what source of inefficiency?

Select one of the following:

Explanation

Question 20 of 200

Asserting a word line and asserting (to "high" voltage) a bit line writes a 1 to a DRAM cell)

A program cannot accidentally use another program's memory space and "crash" a computer that uses (see the img)

1- virtual memory address

2- program relocation

3- separate instruction and data caches

Programs with good , tend to access a referenced memory location multiple times in the near future.