01In memory, how are array elements stored?
02What is the time complexity of inserting an element at the front of an array?
03What is a 'dynamic array'?
04What is the address formula for array element A[i] with base address B and element size S?
05In C++, if you access index 10 of an array of size 5, what happens?
06What is the space complexity of a 2D array of size M x N?
07What is 'Row-Major' order?
08Why are arrays cache-friendly?
09What is the complexity of deleting the last element in an array?
10If a dynamic array doubles its size when full, what is the amortized cost of insertion?