Free Practice Quiz Question List

02 Arrays and Dynamic Arrays Online Quiz Questions

Use this free practice quiz with 20 questions to review 02 Arrays and Dynamic Arrays, test your knowledge, and prepare for your next test or exam.

20 questions

True or false

1 point

True or false: In a zero-based array with length n, the largest valid index is n − 1.

A
True
B
False

Choose one

1 point

Why does reading an array element by a known index typically take $O(1)$ time?

A
It must examine every earlier element in the array.
B
It calculates the element address from the base address, index, and element width.
C
It shifts all later elements before reading the requested element.
D
It copies the entire array into a temporary array.

Choose one

1 point

An array contains [10, 20, 30, 40]. If 25 is inserted at index 2 while preserving the existing order, what is the resulting array?

A
[25, 10, 20, 30, 40]
B
[10, 25, 20, 30, 40]
C
[10, 20, 25, 30, 40]
D
[10, 20, 30, 25, 40]

Written response

1 point

A rectangular matrix has 3 columns. Using zero-based row-major storage, what flat-array index corresponds to row 1, column 2?

Fill in the blank

1 point

Complete the statement: A traversal that visits every element of an array of length $n$ takes time.

Choose all

1 point

Which two statements correctly describe a dynamic array? Select all that apply.

A
It maintains a logical size that can differ from capacity.
B
It can never reallocate its backing storage.
C
It can allocate a larger backing array when it becomes full.
D
It requires every element to be stored at a different memory address from all other elements.

True or false

1 point

True or false: A single append to a dynamic array can take $O(n)$ time if resizing and copying are required.

A
True
B
False

Written response

1 point

What is the amortized time complexity of appending to a dynamic array when its capacity grows geometrically? Give the complexity as $O(1)$ and include the word amortized.

Choose one

1 point

An array contains [10, 20, 30, 40]. If the element at index 1 is deleted and the gap is closed, what is the resulting array?

A
[10, 20, 40]
B
[10, 30, 40]
C
[20, 30, 40]
D
[10, 30, 20, 40]

Choose all

1 point

Which two workload characteristics support choosing an array-based structure, particularly a dynamic array? Select all that apply.

A
Fast access by position is important.
B
Appending is more common than inserting near the beginning or middle.
C
Frequent middle insertion must avoid shifting existing elements.
D
The number of elements is guaranteed to remain fixed, but indexed access is unnecessary.

Fill in the blank

1 point

Complete both statements about inserting into an array: To avoid overwriting values, the shift loop proceeds from . Inserting in the middle takes time in the worst case.

Open ended

1 point

Explain why appending to a dynamically growing array is $O(1)$ amortized even though an individual append can take $O(n)$ time. Include what happens when the backing array is full.

True or false

1 point

True or false: In a row-major flat representation with 3 columns, the element at zero-based row 1 and column 2 has flat index 5.

A
True
B
False

Choose one

1 point

Which situation most strongly favors a fixed-length array rather than a dynamic array?

A
A collection grows unpredictably and needs frequent appends.
B
The program stores exactly seven weekday values and the number of values will not change.
C
The program frequently inserts records near the beginning.
D
The program needs a collection whose size changes often.

Choose one

1 point

An array has length 5 and uses zero-based indexing. Which index contains its last element?

Choose one

1 point

An array starts at address $B=1000$ , each element occupies $w=4$ bytes, and you access index $i=3$ . What address does the formula $B+i\times w$ produce?

A
1008
B
1012
C
1016
D
1024

Choose one

1 point

Starting with [10, 20, 30, 40], which array results from inserting 25 at index 2 while preserving the order of the existing elements?

A
[25, 10, 20, 30, 40]
B
[10, 25, 20, 30, 40]
C
[10, 20, 25, 30, 40]
D
[10, 20, 30, 25, 40]

Choose one

1 point

A dynamic array is full when an append is requested. What is the worst-case time for that individual append?

A
It is always $O(1)$ .
B
It is always $O(\log n)$ .
C
It can be $O(n)$ when resizing is required.
D
It is always $O(n^2)$ .

Written response

1 point

A rectangular matrix has 5 rows and 6 columns. How many elements does a complete nested-loop traversal process?

Written response

1 point

An array contains $n$ elements, but the position of a target value is unknown. An algorithm checks the elements one at a time until it finds the target or reaches the end. What is the worst-case asymptotic time complexity of this search?