SDP10 Final - Part II

Question 1 of 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).

Select one of the following:

True
False

Explanation

Question 2 of 31

1

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

Select one of the following:

Adder
Equality
MUX
Set membership

Explanation

Question 3 of 31

1

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

Select one of the following:

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.
это открытый вопрос, выше два примера как можно ответить (этот вариант отмечен как правильный)

Explanation

Question 4 of 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?

Select one of the following:

None of the above
3
0x25
0x23

Explanation

Question 5 of 31

1

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

Select one of the following:

Explanation

Question 6 of 31

1

This is an example of?

Select one of the following:

Serial processing
Linear processing
Parallel processing
none of the above

Explanation

Question 7 of 31

1

This is an example of?

Select one of the following:

Serial processing
Linear processing
Parallel processing
none of the above

Explanation

Question 8 of 31

1

Object files are:

Select one of the following:

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

Explanation

Question 9 of 31

1

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

Select one of the following:

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

Explanation

Question 10 of 31

1

______construct encloses code, forming a parallel region.

Select one of the following:

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

Explanation

Question 11 of 31

1

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

Select one of the following:

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

Explanation

Question 12 of 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.

Select one of the following:

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

Explanation

Question 13 of 31

1

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:

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

Explanation

Question 14 of 31

1

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

Select one of the following:

0x0000
0x0001
0xFFF
0x1200

Explanation

Question 15 of 31

1

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

Select one of the following:

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

Explanation

Question 16 of 31

1

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

Select one or more of the following:

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

Explanation

Question 17 of 31

1

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

Select one of the following:

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

Explanation

Question 18 of 31

1

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

Select one of the following:

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

Explanation

Question 19 of 31

1

What is a “caller-save” register?

Select one of the following:

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

Explanation

Question 20 of 31

1

A fully-associative cache is like a

Select one of the following:

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

Explanation

Question 21 of 31

1

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

Select one of the following:

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

Explanation

Question 22 of 31

1

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

Select one of the following:

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

Explanation

Question 23 of 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];

Select one of the following:

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

Explanation

Question 24 of 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?

Select one of the following:

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

Explanation

Question 25 of 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?

Select one of the following:

1
5
4
3
2

Explanation

Question 26 of 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?

Select one of the following:

0.0111
0.01111
0.111
1111

Explanation

Question 27 of 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?

Select one of the following:

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

Explanation

Question 28 of 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?

Select one of the following:

1
0.1
0.0001
0

Explanation

Question 29 of 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

Select one of the following:

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

Explanation

Question 30 of 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

Select one of the following:

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

Explanation

Question 31 of 31

1

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

Select one of the following:

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

	Created by Csse 1502 about 6 years ago

SDP10 Quiz on SDP10 Final - Part II, created by Csse 1502 on 13/05/2018.

SDP10 Final - Part II

Question 1 of 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).

Select one of the following:

Explanation

Question 2 of 31

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

Select one of the following:

Explanation

Question 3 of 31

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

Select one of the following:

Explanation

Question 4 of 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?

Select one of the following:

Explanation

Question 5 of 31

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

Select one of the following:

Explanation

Question 6 of 31

This is an example of?

Select one of the following:

Explanation

Question 7 of 31

This is an example of?

Select one of the following:

Explanation

Question 8 of 31

Object files are:

Select one of the following:

Explanation

Question 9 of 31

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

Select one of the following:

Explanation

Question 10 of 31

______construct encloses code, forming a parallel region.

Select one of the following:

Explanation

Question 11 of 31

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

Select one of the following:

Explanation

Question 12 of 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.

Select one of the following:

Explanation

Question 13 of 31

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:

Explanation

Question 14 of 31

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

Select one of the following:

Explanation

Question 15 of 31

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

Select one of the following:

Explanation

Question 16 of 31

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

Select one or more of the following:

Explanation

Question 17 of 31

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

Select one of the following:

Explanation

Question 18 of 31

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

Select one of the following:

Explanation

Question 19 of 31

What is a “caller-save” register?

Select one of the following:

Explanation

Question 20 of 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?