Programming Languages Fundamentals

C compilers are designed to compile C code only. C++ includes additional features like classes, templates, and function overloading that C compilers do not understand. C++ code must be compiled with a C++ compiler that supports these language extensions.

The syntax for(;;) ; is a valid C/C++ statement. The empty conditions in the for loop default to true, and the trailing semicolon represents an empty loop body, causing the program to loop infinitely.

To understand what the code strcat(an_array, "This") does, we need to know that strcat() is a function in C language that concatenates (joins) two strings.

The function takes two arguments: the first argument is the destination array (where the concatenated string will be stored), and the second argument is the source string (which will be concatenated to the destination array).

In this case, the function call strcat(an_array, "This") concatenates the string "This" to the end of the string already stored in an_array. Therefore, the correct option is:

The Answer is: B. Adds "This" to the end of an_array

Tracing the recursion: fn(7) is odd so calls fn(6)+3. fn(6) is even so calls fn(3)+2. fn(3) is odd so calls fn(2)+3. fn(2) is even so calls fn(1)+2. fn(1) returns 1. Working back: fn(2)=1+2=3, fn(3)=3+3=6, fn(6)=6+2=8, fn(7)=8+3=11.

C++ has three access specifiers: public, private, and protected. 'Guarded' is not a valid keyword in C++. This tests knowledge of basic C++ access control keywords.

C++ uses colon syntax for inheritance: 'class DerivedClass : accessSpecifier BaseClass'. Options B and C show incorrect syntax ('inherit' keyword and '<-' notation are not valid in C++).

A max-heap is a binary tree where every parent node is greater than or equal to its children. By definition, the root node (top) contains the maximum element. Among 12, 23, 9, and 28, the value 28 is the largest and would be at the root.

The break statement can only be used inside loops (for, while, do-while) or switch statements. Using break inside an if statement that is not contained in a loop or switch is a compilation error. The code attempts to break from just an if block, which is invalid.

A stack is a Last-In, First-Out (LIFO) data structure. When you push 1, 3, and 5 onto the stack in that order, 5 is the last element added and therefore the first element to be popped out.

Hash tables provide average O(1) lookup time due to direct indexing through hash functions. Binary trees provide O(log n) lookup. Stacks provide O(1) but only for LIFO access, not general retrieval. Hash tables are fastest on average for general data retrieval.

C does not support classes or the 'class' keyword - these are C++ OOP features. Options B and C are valid C syntax (comments and char initialization). Option A uses C++ class syntax which is invalid in C.

Both 'int main()' and 'int main(int argc, char *argv[])' are valid declarations for main() in C and C++. The first is for programs without command-line arguments, the second for programs that need to process command-line arguments. Both are standard and correct.

22 divided by 5 is 4 with remainder 2. The modulo operator (%) returns this remainder, so 22 % 5 = 2.

Evaluating the expression: 1 && 0 is 0. !1 is 0. Thus, (1 && 0 || !1) simplifies to (0 || 0), which is 0 (False). Applying the logical NOT operator ! to 0 results in 1 (True).

Option A correctly uses the new operator to allocate a character array: char *a = new char[20]; allocates 20 chars and stores the pointer in a. Options B and C are wrong because they assign a pointer to a non-pointer char variable.

For 200,000 elements: Quicksort is O(n log n) ≈ 3.6M operations, Linear Search is O(n) = 200K operations, and Bubble Sort is O(n²) = 40B operations. Linear search is fastest, so you'd wait the least time for it.

A good hashCode implementation should combine significant fields using non-zero multipliers and handle null checks or existing field hashes appropriately. Option B combines the hash of the name string with the age field multiplied by a prime number, fulfilling standard contract requirements.

To sort the keys in the props HashMap, the user needs to know about the different data structures available in Java that can help to sort a collection of keys. The user also needs to know about the methods provided by the Java Collections framework that can be used to perform sorting on collections.

Option A: Arrays.sort(s); is incorrect. The Arrays.sort() method is used to sort arrays, not sets or maps. It will result in a compilation error.

Option B: s = new TreeSet(s); is correct. A TreeSet is a sorted set that orders its elements based on their natural ordering or based on a comparator provided at the time of creation. By creating a new TreeSet using the Set of keys from the props HashMap, the keys will be automatically sorted.

Option C: Collections.sort(s); is incorrect. The Collections.sort() method is used to sort lists, not sets or maps. It will result in a compilation error.

Option D: s = new SortedSet(s); is incorrect. SortedSet is an interface and cannot be instantiated. Moreover, the Set obtained from the props HashMap is already sorted.

Therefore, the correct answer is:

The Answer is: B. s = new TreeSet(s);

In the loop initialization, printf("a") executes and prints 'a'. Next, the condition printf("b") executes, prints 'b', and returns a non-zero value (true). The loop body then runs, executing break immediately. The loop terminates before the increment step, resulting in 'ab'.

The output depends on argument evaluation order in printf. Starting i=3, with unspecified evaluation order in C/C++, the output can vary. The claimed answer 443 occurs on specific implementations. Note: this is undefined behavior in C/C++ standards.