Programming and Data Structures Test 2

Note that int arr[]; is declaration whereas int arr[] = new int[3]; is to instantiate an array.

Array indexing starts from 0.

ArrayIndexOutOfBoundsException is a run-time exception and the compilation is error-free.

Data:

number of distinct keys = n = 9

Formula:

Number of binary search trees = \(^{2n}C_n \over n+1\)

Calculation:

Number of binary search trees = \(^{18}C_9\over 10\) = 4862

Arrays store elements of the same data type and present in continuous memory locations.

Since there are 15 int elements and each int is of 4bytes, we get 15*4 = 60bytes.

Output is the frequency of each%attendance above 25.

int result [75] //  

To store frequencies of ages above 25. We can ignore ages below 25 so take an array of 75 numbers where a[0] corresponds to 26, a[1] corresponds to 27, …, a[74].

Hence An array of 75 integers is enough.

Elements in an array are accessed randomly. In Linked lists, elements are accessed sequentially.

This is the syntax to initialize an array in C.

Enqueue:

While 1st  stack is not empty, push everything from 1st to 2nd stack.

Push an element to 1st stack.

Push everything back to 1st stack.

Here time complexity will be O(n)

Dequeue:

while 1st stack is not empty then Pop an item from stack1 and return it

Here time complexity will be O(1)

Therefore option 1 and 3 are correct.

Initially S is empty,

∴ f(s) = 0

f(push(S, 2)) = 2

f(push(S, -3)) = max (2, 0) – 3 = -1

f(push (S, 2)) = max (-1, 0) + 2 = 2

f(push (S, -1)) = max (2, 0) – 1= 1

switch('2')

control will come to case '2'

since case '2': doesn't have break statement to will go to case '3'

In case '3': Java program, is printed

since case '3': doesn't have break statement to will go to case '4'

From case '4' to it will to case '5' break will execute and the switch will terminate.

Output: Java program,

The syntax to declare multidimensional array in java is either int[][] arr; or int arr[][];

Concept:
The breadth-first search algorithm uses a queue data structure while the depth-first search algorithm uses a stack data structure in its implementation.

The necessary condition to detect if a circular queue of capacity (n-1) is full is (rear+1) mod n = front 

The time complexity of converting a fully parenthesized infix expression to postfix expression is O(n), that is, traverse the equation

Conclusion:

Options1, 2 and 4 are correct

Trying to access an element beyond the limits of an array gives ArrayIndexOutOfBoundsException.

&&- Logical AND 
!- Logical NOT 
||- Logical OR 
|- Bitwise OR(used in bitwise manipulations)

In C, functions can return any type except arrays and functions. We can get around this limitation by returning pointer to array or pointer to function.

Short array s[5] will take 10 bytes as size of short is 2 bytes.

When we declare a union, memory allocated for the union is equal to memory needed for the largest member of it, and all members share this same memory space. Since u is a union, memory allocated to u will be max of float y(4 bytes) and long z(8 bytes). So, total size will be 18 bytes (10 + 8).

In C, prefix and postfix operators need l-value to perform operation and return r-value. The expression (++i)++ when executed increments the value of variable i(i is a l-value) and returns r-value. The compiler generates the error(l-value required) when it tries to post-incremeny the value of a r-value.

Take N = 32

Output will be same for 65 and 66 as well.

For N = 32 it will print '5'

For N = 65 it will print '5'

For N = 66 it will print '5'

Hence, the sum of smallest three values of N = 32 + 65 + 66 = 163

1. Variable Declaration and Initialization:

   c

   Copy code

   int x, y = 5, z = 5;

   • x, y, and z are declared as integers.
   • y and z are initialized to 5.

2. Assignment and Comparison:

   c

   Copy code

   x = y == z;

   • Here, y == z is a comparison operation (y equals z).
   • Since y and z both hold the value 5, y == z evaluates to true, which is represented as 1 in C.

3. Assignment Result:

   • The result of y == z (which is 1) is assigned to x.
   • Therefore, x now holds the value 1.

4. Printing the Result:

   c

   Copy code

   printf("%d", x);

   • This line prints the value of x.
   • x currently holds 1, so 1 is printed to the console.

5. Final Steps:

   c

   Copy code

   getchar(); return 0;

   • getchar() is used to wait for a character input (typically used to keep the console window open).
   • return 0; indicates successful completion of the main function.

Therefore, when you run this program, it will output:

Copy code

1

After the pre-processing of a C program, a .i file is generated which is passed to the compiler for compilation.

volatile is not a storage class specifier. volatile and const are type qualifiers.

4 2 5 ^ * 14 7 / - 7 5 * +

Push: 9, 2 and 5

Pop: 2 and 5

Perform operation: 2 ^ 5 = 32

Push: 32

Pop: 32 and 4

Perform operation: 4 × 32 = 128

Push: 128

Also push: 14 and 7

Pop: 7 and 14

Perform operation: 14 ÷ 7 = 2

Push: 2

Pop: 128 and 2

Perform operation: 128 - 2 = 126

Push: 126

Also push: 7 and 5

Pop: 5 and 7

Perform operation: 7 × 5 = 35

Push: 35

Pop: 35 and 126

Perform operation: 126 + 35 = 161

Push: 161

After evaluating: 161 is present onto the stack

In C, function parameters are always passed by value. Pass-by-reference is simulated in C by explicitly passing pointer values.