Diagnostic Quiz

Problems

1. Define a 2-D Array

If we define a 2-D array on the stack. It will use a contiguous section of memory to store. For example

double x[4][9];

The OS will allocate a contiguous section memory to store the 36 double in this 2-D array.

18. About Deriving the time complexity of a recursion

This question is worth trying before the final

This is not that hard. Same as how you derive $T(n)=2T(n/2)+1$.