# 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 ```c 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$$. --- # Agent Instructions This documentation is published with GitBook. GitBook is the documentation platform designed so that both humans and AI agents can read, navigate, and reason over technical content effectively. Learn more at gitbook.com. ## Querying This Documentation If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question. Perform an HTTP GET request on the current page URL with the `ask` query parameter: ``` GET https://wenbo-notes.gitbook.io/cs1010-notes/lec-tut-lab-exes/lecture/lec-08-multi-d-array-efficiency/diagnostic-quiz.md?ask= ``` The question should be specific, self-contained, and written in natural language. The response will contain a direct answer to the question and relevant excerpts and sources from the documentation. Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.