Exploring Array Operations

What is the primary purpose of array traversal?

• To find the maximum value in an array.

• To sort the elements in an array.

• To delete elements from an array.

• To access and process each element in an array.

What is the main difference between static and dynamic arrays?

• Static arrays can be resized; dynamic arrays have a fixed size.

• Static arrays are more memory efficient than dynamic arrays.

• Dynamic arrays cannot store more elements than static arrays.

• Static arrays have a fixed size; dynamic arrays can resize.

What are the advantages of using dynamic arrays?

• Slower access times compared to linked lists

• Advantages of using dynamic arrays include flexibility in size, efficient memory usage, and faster access times.

• Static size limitations

• Increased complexity in memory management

Explain how multidimensional arrays are structured.

• Multidimensional arrays can only contain numeric values.

• Multidimensional arrays are structured as arrays containing other arrays, allowing for multiple levels of data organization.

• Multidimensional arrays are single-dimensional arrays with extra elements.

• Multidimensional arrays are structured as linked lists of arrays.

Provide an example of a use case for a two-dimensional array.

• A representation of a 3D object in space.

• A chessboard representation where each cell can hold a piece or be empty.

• A table of employee salaries with only one column.

• A one-dimensional list of student names.

What is the time complexity of accessing an element in a static array?

• O(1)

• O(log n)

• O(n)

• O(n^2)

What is linear search and how does it work?

• Linear search requires the list to be sorted for optimal performance.

• Linear search uses a binary tree structure to find values.

• Linear search is an algorithm that sequentially checks each element in a list to find a target value.

• Linear search sorts the list before searching for a target value.

Explain binary search and its requirements.

• Binary search requires a sorted array or list to function correctly.

• Binary search is only applicable to numerical data.

• Binary search requires a linked list to function.

• Binary search can be applied to any unsorted list.

How do you manage memory for dynamic arrays in programming?

• Allocate memory with stack allocation

• Use static arrays only

• Allocate memory with malloc/new, use free/delete to deallocate.

• Memory management is automatic

What is the purpose of resizing a dynamic array?

• To increase the speed of data retrieval.

• To reduce the size of the array permanently.

• To prevent memory leaks in static arrays.

• To accommodate more elements and optimize memory usage.