SDP10 Final - Part II

Frage 1 von 31

1

Given the declaration int A[10][20]; in C, the following assembly code implements A[i][j] = 1; (assuming A, i, and j are all global variables).

Wähle eins der folgenden:

WAHR
FALSCH

Erklärung

Frage 2 von 31

1

The code (a && b) || (!a && !b) implements -

Wähle eine der folgenden:

Adder
Equality
MUX
Set membership

Erklärung

Frage 3 von 31

1

What is the difference between logical and bitwise operators. (for example && and &)

Wähle eine der folgenden:

The logical and operator ‘&&’ expects its operands to be boolean expressions (either 1 or 0) and returns a boolean value.
The bitwise and operator ‘&’ works on Integral (short, int, unsigned, char, bool, unsigned char, long) values and return Integral value.

If an integral value is used as an operand for ‘&&’ which is supposed to work on boolean values, following rule is used in C.
…..A zero is considered as false and non-zero is considered as true.
For example in the following program x and y are considered as 1.

The ‘&&’ operator doesn’t evaluate second operand if first operand becomes false. Similarly ‘||’ doesn’t evaluate second operand when first operand becomes true. The bitwise ‘&’ and ‘|’ operators always evaluate their operands.
&& (logical and operator) - The left and right operands are boolean expressions. If both the operands are non-zero, then the condition becomes true.
>
& (bitwise and operator) - The left and right operands are integral types. Binary AND Operator copies a bit to the result if it exists in both operands.
это открытый вопрос, выше два примера как можно ответить (этот вариант отмечен как правильный)

Erklärung

Frage 4 von 31

1

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?

Wähle eine der folgenden:

None of the above
3
0x25
0x23

Erklärung

Frage 5 von 31

1

Choose the correct compilation of rax = (rbx ? rcx : rdx)?

Wähle eine der folgenden:

Erklärung

Frage 6 von 31

1

This is an example of?

Wähle eine der folgenden:

Serial processing
Linear processing
Parallel processing
none of the above

Erklärung

Frage 7 von 31

1

This is an example of?

Wähle eine der folgenden:

Serial processing
Linear processing
Parallel processing
none of the above

Erklärung

Frage 8 von 31

1

Object files are:

Wähle eine der folgenden:

не вариантов
не правильный вариант

Erklärung

Frage 9 von 31

1

Thread (as with OpenMP) Which of the following is true?

Wähle eine der folgenden:

нет вариантов
не правильный ответ

Erklärung

Frage 10 von 31

1

______construct encloses code, forming a parallel region.

Wähle eine der folgenden:

parallel
не правильный вариант

Erklärung

Frage 11 von 31

1

____ is the default schedule type. Upon entering the loop, each thread independently decides which chunk of the loop they will process

Wähle eine der folgenden:

static
не правильный вариант

Erklärung

Frage 12 von 31

1

OpenMP assigns one iteration to each thread. When the thread finishes, it will be assigned the next iteration that hasn’t been executed yet.

Wähle eine der folgenden:

This program can be greatly improved with a dynamic schedule.
не правильный вариант

Erklärung

Frage 13 von 31

1

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

Wähle eine der folgenden:

barrier
не правильный вариант

Erklärung

Frage 14 von 31

1

What is the value of the following C expression? x = 0xBC and y = 0x35 (x & !y)

Wähle eine der folgenden:

0x0000
0x0001
0xFFF
0x1200

Erklärung

Frage 15 von 31

1

We say that pipelining generally increases throughput. That statement means (select all that are part of the definition of “increases throughput”):

Wähle eine der folgenden:

A entire programs take more time to complete
B entire programs take less time to complete
C each instruction takes less time to complete
D each instruction takes more time to complete

Erklärung

Frage 16 von 31

1

Consider the following code. Which of the following memory errors does it have? Select all that apply.

Wähle eine oder mehr der folgenden:

confusing pointer and value sizes
reading uninitialized memory
off-by-one memory access error
dereferencing a value as if it were a pointer
returning references to nonexistent values

Erklärung

Frage 17 von 31

1

What kind of locality does the following code benefit from? Assume that n and m are very large numbers.

Wähle eine der folgenden:

spatial locality
temporal locality
both of the above
none of the above

Erklärung

Frage 18 von 31

1

Given that a and b are each either 0 or 1, which one of the following is not always true?

Wähle eine der folgenden:

(a ∧ b) == ((a - b) & 1)
(a ∧ b) == (a != b)
(a ∧ b) == ((a + b) >> 1)
(a ∧ b) == (a ? !b : b)

Erklärung

Frage 19 von 31

1

What is a “caller-save” register?

Wähle eine der folgenden:

A special register that saves who called the procedure
A program register that the called procedure may not modify
A program register that the called procedure may modify
none of the above

Erklärung

Frage 20 von 31

1

A fully-associative cache is like a

Wähle eine der folgenden:

direct-mapped cache with only one set
direct-mapped cache with only one line per set
set-associative cache with only one line per set
set-associative cache with only one set

Erklärung

Frage 21 von 31

1

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

Wähle eine der folgenden:

Block the accesses by nesting three or four for loops instead of just two
Change int** to int*
Change the for-j loop to count up from 0, not down from m-1
Put the for-i loop inside of the for-j loop instead of the other way around

Erklärung

Frage 22 von 31

1

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

Wähle eine der folgenden:

Change int** to int*
Put the for-i loop inside of the for-j loop instead of the other way around
Change the for-j loop to count up from 0, not down from m-1
Block the accesses by nesting three or four for loops instead of just two

Erklärung

Frage 23 von 31

1

In C, assuming that an int takes 4 bytes, if array a is declared as follows and a has the value 0x10000, what is the value of the expression a + 2? int a[12];

Wähle eine der folgenden:

0x10002
0x10008
0x10004
8 plus the contents of location 0x10000

Erklärung

Frage 24 von 31

1

Given unsigned int variables a and b, if a + b == a ^ b is true, then which of the following must also be true?

Wähle eine der folgenden:

a + b == a * b
a + b == a | b
a + b == a - b
a + b == a & b

Erklärung

Frage 25 von 31

1

The bias of any IEEE-style floating point number is 2e−1 − 1, where e is the number of exponent bits. Suppose 010010 is a six-bit IEEE-style floating point number that represents the decimal value 2.5. How many exponent bits does the number have?

Wähle eine der folgenden:

1
5
4
3
2

Erklärung

Frage 26 von 31

1

Consider a six-bit IEEE-style floating-point number with 1 sign, 2 exponent, and 3 fraction bits. Assume the bias is 1. Answers are written in binary. What is the largest denormalized value?

Wähle eine der folgenden:

0.0111
0.01111
0.111
1111

Erklärung

Frage 27 von 31

1

Consider a six-bit IEEE-style floating-point number with 1 sign, 2 exponent, and 3 fraction bits. Assume the bias is 1. Answers are written in binary. How many of the 26 bit patters in this format are NaNs?

Wähle eine der folgenden:

1
5, 6, or 7
8
between 9 and 15
32

Erklärung

Frage 28 von 31

1

Consider a six-bit IEEE-style floating-point number with 1 sign, 2 exponent, and 3 fraction bits. Assume the bias is 1. Answers are written in binary.EEE
What is the smallest non-negative normalized value?

Wähle eine der folgenden:

1
0.1
0.0001
0

Erklärung

Frage 29 von 31

1

Consider a 5-bit IEEE-style floating point number with 3 exponent bits (bias 3). Which of the following can be expressed in this format? Options are written in binary

Wähle eine der folgenden:

1.01
−0.0001
11000
−111
None of the above can be represented in this format
None of the above because you can’t have a 5-bit IEEE-style floating point number with 3 exponent bits

Erklärung

Frage 30 von 31

1

Y86 does not have an instruction for jumping to an address stored in a register location; instead the conceptual action jmp %eax can be implemented by

Wähle eine der folgenden:

rmmovl %eax, $1234 ; jmp $1234
pushl %eax ; ret
rrmovl %eax, %PC
All of the above work
None of the above work

Erklärung

Frage 31 von 31

1

Given int variables a and b, which of the following implements if (!a) b == 0;?

Wähle eine der folgenden:

b &= !!a;
b &= !-a;
b &= !a;
b &= a;
b &= -a;
b &= -!a;
none of the above

	Erstellt von Csse 1502 vor mehr als 6 Jahre

SDP10 Quiz am SDP10 Final - Part II, erstellt von Csse 1502 am 13/05/2018.

SDP10 Final - Part II

Frage 1 von 31

Given the declaration int A[10][20]; in C, the following assembly code implements A[i][j] = 1; (assuming A, i, and j are all global variables).

Wähle eins der folgenden:

Erklärung

Frage 2 von 31

The code (a && b) || (!a && !b) implements -

Wähle eine der folgenden:

Erklärung

Frage 3 von 31

What is the difference between logical and bitwise operators. (for example && and &)

Wähle eine der folgenden:

Erklärung

Frage 4 von 31

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?

Wähle eine der folgenden:

Erklärung

Frage 5 von 31

Choose the correct compilation of rax = (rbx ? rcx : rdx)?

Wähle eine der folgenden:

Erklärung

Frage 6 von 31

This is an example of?

Wähle eine der folgenden:

Erklärung

Frage 7 von 31

This is an example of?

Wähle eine der folgenden:

Erklärung

Frage 8 von 31

Object files are:

Wähle eine der folgenden:

Erklärung

Frage 9 von 31

Thread (as with OpenMP) Which of the following is true?

Wähle eine der folgenden:

Erklärung

Frage 10 von 31

______construct encloses code, forming a parallel region.

Wähle eine der folgenden:

Erklärung

Frage 11 von 31

____ is the default schedule type. Upon entering the loop, each thread independently decides which chunk of the loop they will process

Wähle eine der folgenden:

Erklärung

Frage 12 von 31

OpenMP assigns one iteration to each thread. When the thread finishes, it will be assigned the next iteration that hasn’t been executed yet.

Wähle eine der folgenden:

Erklärung

Frage 13 von 31

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

Wähle eine der folgenden:

Erklärung

Frage 14 von 31

What is the value of the following C expression? x = 0xBC and y = 0x35 (x & !y)

Wähle eine der folgenden:

Erklärung

Frage 15 von 31

We say that pipelining generally increases throughput. That statement means (select all that are part of the definition of “increases throughput”):

Wähle eine der folgenden:

Erklärung

Frage 16 von 31

Consider the following code. Which of the following memory errors does it have? Select all that apply.

Wähle eine oder mehr der folgenden:

Erklärung

Frage 17 von 31

What kind of locality does the following code benefit from? Assume that n and m are very large numbers.

Wähle eine der folgenden:

Erklärung

Frage 18 von 31

Given that a and b are each either 0 or 1, which one of the following is not always true?

Wähle eine der folgenden:

Erklärung

Frage 19 von 31

What is a “caller-save” register?

Wähle eine der folgenden:

Erklärung

Frage 20 von 31

A fully-associative cache is like a

Consider a six-bit IEEE-style floating-point number with 1 sign, 2 exponent, and 3 fraction bits. Assume the bias is 1. Answers are written in binary.EEE
What is the smallest non-negative normalized value?