What is the output of the following program: struct A { A() { std::cout << "A"; } template A(Args&&... args) { std::cout << "B"; } A(const A&) { std::cout << "C"; } }; int main() { A a; A b = a; }

std::deque<int> queue; queue.push_back(1); int& ref = queue.back(); queue.push_back(2); Where does ref point to?

What would the following program print? class Printer{ public: Printer(std::string name) {std::cout << name;} }; class Container{ public: Container() : b('b'), a('a') {} Printer a; Printer b; }; int main(){ Container c; return 0; }

Assuming a 32-bit compiler on an x86 platform, what would the result of sizeof(A) typically be? struct A { char B; int* C; short D; };

Below code fails to compile. class A { public: int GetValue() const { vv = 1; return vv; } private: int vv; }; Which of the following choices results in fixing this compilation error?

According to the IEEE standard, which will always evaluate to true if the value of 'var' is NaN?

The percent sign is the ____ operator.

You can use either a(n) ___ variable or a bool variable to store the value of a logical expression.

Pseudocode uses the end-structure statement ____ to clearly show where the structure ends.

If a recursive function does not contain a base case, it ________.

You must have a(n) ________ for every variable you include in a program.