Mastering Arrays in C Programming

What is the correct syntax for declaring an array in C?

• type arrayName[];

• type arrayName[arraySize];

• arrayName: type[arraySize];

• arrayName[type]

How do you initialize an array with specific values in C?

• int arr[] = {1, 2, 3};

• int arr[3] = new int[3]{1, 2, 3};

• int arr = {1, 2, 3};

• int arr[3] = {1; 2; 3};

What is the difference between a one-dimensional and a two-dimensional array?

• A one-dimensional array can hold multiple data types, while a two-dimensional array can only hold one type.

• A one-dimensional array is linear (1D), while a two-dimensional array is a grid (2D).

• A one-dimensional array is represented as a table, while a two-dimensional array is a single list.

• A one-dimensional array is always larger than a two-dimensional array.

How can you access the elements of a multidimensional array?

• Use multiple indices to access elements, e.g., array[rowIndex][columnIndex] for 2D arrays.

• Access elements using a single index, e.g., array[index] for 2D arrays.

• Use a loop to iterate through the array without indices.

• Access elements by their value instead of their indices.

What are the common techniques for traversing an array in C?

• Recursion

• Binary search

• For loop, while loop, pointer arithmetic

• Do-while loop

How do you dynamically allocate memory for an array in C?

• int *array = (int *)malloc(n * sizeof(int)); // where n is the number of elements

• int *array = (int *)calloc(n, sizeof(int)); // initializes to zero

• int *array = new int[n]; // C++ syntax

• int array[n]; // static allocation

What is the purpose of the 'malloc' function in dynamic arrays?

• The purpose of 'malloc' is to resize existing arrays.

• The purpose of 'malloc' is to free memory used by dynamic arrays.

• The purpose of 'malloc' is to initialize static arrays.

• The purpose of 'malloc' is to allocate memory for dynamic arrays.

Explain how to sort an array using the bubble sort algorithm.

• To sort an array using bubble sort, iterate through the array, compare each pair of adjacent elements, and swap them if they are in the wrong order. Repeat this process until no swaps are needed.

• Merge the array with another sorted array.

• Use a quick sort algorithm instead of bubble sort.

• Sort the array by reversing its order.

What is the time complexity of the quicksort algorithm?

• O(n) for all cases

• O(log n) worst case

• O(n log n) average and best case; O(n^2) worst case.

• O(n^3) average case

How can you find the length of an array in C?

• Count the number of elements manually.

• Use sizeof(arr) / sizeof(arr[0]) to find the length of an array.

• Use sizeof(arr) to find the length of an array.

• Use arr.length to find the length of an array.