Which asymptotic notation bounds a function from both above and below, representing a tight bound?
Big $\Theta (Θ) notation provides a asymptotically tight bound$ on a function, bounding it from both above (Big O) and below (Big $\Omega$) for large inputs.
What is the worst-case time complexity of accessing an element in a 1D array by its index?
Arrays provide random access via index calculation Address = Base + index * element_size, which takes constant time O(1).
In a Row-Major ordered 2D array A[M][N] with base address B and element size W, what is the formula for the address of element A[i][j] (assuming 0-based indexing)?
In Row-Major order, row i is preceded by i full rows of N elements each. Thus, offset = i * N + j, and Address = Base + W * (i * N + j).
Which data structure operates strictly on the Last-In, First-Out (LIFO) principle?
A Stack is a linear data structure that follows the LIFO (Last-In, First-Out) principle, where insertions and deletions happen only at one end called the top.
Which condition indicates an Overflow condition in a fixed-size Stack implemented using an array of size N with top initialized to -1?
When top index reaches N - 1 in a zero-indexed array of capacity N, the stack is full, and any subsequent push attempt results in a Stack Overflow.