With: struct foo { int a:3, b:4, :0; int c:4, d:5; int e:3; }; Determine if each statement is true or false: Concurrent modification of foo::a and foo::c is or might be a data race. Concurrent modification of foo::a and foo::b is or might be a data race. Concurrent modification of foo::c and foo::e is or might be a data race.

class A { int x; protected: int y; public: int z; }; class B: private A { public: using A::y; }; What is the privacy level of B::y?

If we have a class myClass , what can we say about the code: myClass::~myClass(){ delete this; this = NULL; }

Is the following well-formatted C++11 code? %:include int main (void) <% std::vector ivec <% 1, 2, 3 }; ??>

What can we say about: myClass::foo(){ delete this; } .. void func(){ myClass *a = new myClass(); a->foo(); }

In this class definition: class my_lock { std::atomic data; public: my_lock() : data{1} {} void unlock() { data = 1; } void lock(); } which could be used to complete the lock function, assuming the purpose of the above code is to create a mutex-like locking mechanism? Assume C++11.

Regardless of the algorithm being used, a search through an array is always performed ________.

A(n) ________ search uses a loop to sequentially step through an array.

A sorting algorithm can be used to arrange a set of ________ in ________ order.

A ________ file is like a stream of data that must be read from its beginning to its end.

________ functions are dynamically bound by the compiler.