Which of the following is a valid array declaration in a common programming language (syntax may vary slightly)?
array numbers = [1, 2, 3, 4];
numbers = array(1, 2, 3, 4);
All of the above.
int numbers[] = {1, 2, 3, 4};
What is the time complexity of accessing an element in a 2D array with 'm' rows and 'n' columns?
O(1)
O(m * n)
O(m + n)
O(log m + log n)
Consider a 2D array storing characters to represent a word search grid. You want to check if a given word exists in the grid horizontally or vertically. Which algorithm would be suitable for this task?
Binary Search
Bubble Sort
Depth First Search (DFS)
Quick Sort
What is the time complexity of finding the length of an array in most programming languages?
O(n^2) - Quadratic Time
O(n) - Linear Time
O(1) - Constant Time
O(log n) - Logarithmic Time
If you have an array of size 5 and you try to add a 6th element to it, what is a likely outcome?
An error or exception will occur indicating an out-of-bounds access.
The array will automatically resize to accommodate the new element.
The behavior is undefined and can lead to unpredictable program crashes.
The new element will overwrite the value at the first index (index 0).
What is a key difference between a 1D array and a 2D array?
1D arrays represent linear sequences, 2D arrays represent tabular data.
1D arrays can only be accessed sequentially, 2D arrays allow random access.
1D arrays store numbers while 2D arrays store characters.
1D arrays are static in size, 2D arrays can change size dynamically.
Which code snippet correctly initializes a 2D array named 'grid' with 3 rows and 4 columns, all filled with zeros?
int grid[3][4] = {{0, 0, 0, 0}, {0, 0, 0, 0}, {0, 0, 0, 0}};
int grid[3][4]; for (int i = 0; i < 3; i++) for (int j = 0; j < 4; j++) grid[i][j] = 0;
int grid[3][4] = {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0};
int grid[3][4] = {0};
Which sorting algorithm works by repeatedly selecting the minimum element and placing it in its correct position?
Merge Sort
Selection Sort
Given an array of integers, how can you efficiently count the occurrences of a specific element?
Iterate through the array and increment a counter for each occurrence.
All of the above methods are equally efficient.
Use a hash map to store the frequency of each element.
Sort the array and use binary search.
Accessing an element outside the valid index range of an array leads to what kind of error?
ValueError
TypeError
SyntaxError
IndexError or OutOfBounds exception