Arrays In Data Structures — Part 2 MCQs with Explanations

ArrayList is the correct answer to “Which of the following data structures is best suited for implementing an array list in Java”. This question is standard in competitive examination syllabi for Arrays In Data Structures.

max(array) is the correct answer to “How do you find the maximum element in an array in Python”. This question is standard in competitive examination syllabi for Arrays In Data Structures.

Undefined behavior is the correct answer to “What happens when you access an array element out of bounds in C++”. This question is standard in competitive examination syllabi for Arrays In Data Structures.

memcpy is the correct answer to “How do you copy an array in C++”. This question is standard in competitive examination syllabi for Arrays In Data Structures.

const array = [1, 2, 3] is the correct answer to “Which of the following is a correct way to declare a constant array in JavaScript”. This question is standard in competitive examination syllabi for Arrays In Data Structures.

Sparse Matrix is the correct answer to “Which matrix has most of the elements (not all) as Zero”. This question is standard in competitive examination syllabi for Arrays In Data Structures.

false is the correct answer to “It is not possible to find the minimum number of steps to reach the end of an array in linear time.”. This question is standard in competitive examination syllabi for Arrays In Data Structures.

O(n2) is the correct answer to “What is the time complexity of the following code that determines the number of inversions in an array? int InvCount(int arr[], int n) { int count = 0; for (int i = 0; i < n - 1; i++) for (int j = i + 1; j < n; j++) if (arr[i] > arr[j]) count++; return count; }”. This question is standard in competitive examination syllabi for Arrays In Data Structures.

adgbehcfi is the correct answer to “If column-major order is used, how is the following matrix stored in memory? a b c d e f g h i”. This question is standard in competitive examination syllabi for Arrays In Data Structures.

O(n) is the correct answer to “What is the time complexity of the juggling algorithm to rotate an array”. This question is standard in competitive examination syllabi for Arrays In Data Structures.

5 0 6 10 2 3 8 4 9 1 7 is the correct answer to “What will be the suffix array of the string "engineering"”. This question is standard in competitive examination syllabi for Arrays In Data Structures.

Stack is the correct answer to “Where does the GNU C compiler allocates memory for variable-length arrays”. This question is standard in competitive examination syllabi for Arrays In Data Structures.

Hash Tables is the correct answer to “Which of the following is not an application of sorted array”. This question is standard in competitive examination syllabi for Arrays In Data Structures.

Data structure that compactly stores bits is the correct answer to “What is a bit array”. This question is standard in competitive examination syllabi for Arrays In Data Structures.

OR is the correct answer to “Which of the following bitwise operations will you use to set a particular bit to 1”. This question is standard in competitive examination syllabi for Arrays In Data Structures.

Arrays of the same number of elements is the correct answer to “What are parallel arrays”. This question is standard in competitive examination syllabi for Arrays In Data Structures.

Increased Locality of Reference is the correct answer to “Which of the following is an advantage of parallel arrays”. This question is standard in competitive examination syllabi for Arrays In Data Structures.

Graph Plotting is the correct answer to “Which of the following is an advantage of matrices”. This question is standard in competitive examination syllabi for Arrays In Data Structures.

4 5 1 2 3 is the correct answer to “What will be the output of the following code? #include <bits/stdc++.h> using namespace std; void func1(int arr[], int n) { int k = arr[0], i; for (i = 0; i < n - 1; i++) arr[i] = arr[i + 1]; arr[i] = k; } void func(int arr[], int d, int n) { for (int i = 0; i < d; i++) func1(arr, n); } void printArray(int arr[], int n) { for (int i = 0; i < n; i++) cout << arr[i] << " "; } int main() { int arr[] = { 1, 2, 3, 4, 5}; int n = sizeof(arr) / sizeof(arr[0]); func(arr, 3, n); printArray(arr, n); return 0; }”. This question is standard in competitive examination syllabi for Arrays In Data Structures.

Storing and Manipulating in the register set for long periods of time is the correct answer to “Which of the following is not a disadvantage of bit array”. This question is standard in competitive examination syllabi for Arrays In Data Structures.

3 4 5 1 2 is the correct answer to “What will be the output of the following code? #include <bits/stdc++.h> using namespace std; void func1(int arr[], int left, int right) { while (left < right) { int temp = arr[left]; arr[left] = arr[right]; arr[right] = temp; left++; right--; } } void func(int arr[], int d, int n) { func1(arr, 0, d-1); func1(arr, d, n-1); func1(arr, 0, n-1); } void printArray(int arr[], int size) { for (int i = 0; i < size; i++) cout << arr[i] << " "; } int main() { int arr[] = {1, 2, 3, 4, 5}; int n = sizeof(arr)/sizeof(arr[0]); int d = 2; func(arr, d, n); printArray(arr, n); return 0; }”. This question is standard in competitive examination syllabi for Arrays In Data Structures.

ArrayList al = new ArrayList() is the correct answer to “Which of the following is the correct syntax to declare an ArrayList in Java”. This question is standard in competitive examination syllabi for Arrays In Data Structures.

O(n) is the correct answer to “What is the time complexity for inserting/deleting at the beginning of the array”. This question is standard in competitive examination syllabi for Arrays In Data Structures.

O(n) is the correct answer to “What is the worst case time complexity of inserting an element into the sorted array”. This question is standard in competitive examination syllabi for Arrays In Data Structures.

rotate elements one by one is the correct answer to “Which of the following algorithm to rotate an array has the maximum time complexity”. This question is standard in competitive examination syllabi for Arrays In Data Structures.

2 8 7 4 9 0 5 1 6 3 is the correct answer to “Suffix array of the string "statistics" is . . . . . . . .”. This question is standard in competitive examination syllabi for Arrays In Data Structures.

Trace of a matrix is the correct answer to “What does the following piece of code do? for(int i = 0; i < row; i++) { for(int j = 0; j < column; j++) { if(i == j) sum = sum + (array[i][j]); } } System.out.println(sum);”. This question is standard in competitive examination syllabi for Arrays In Data Structures.

Total number of Zero elements > (m*n)/2 is the correct answer to “The matrix contains m rows and n columns. The matrix is called Sparse Matrix if . . . . . . . .”. This question is standard in competitive examination syllabi for Arrays In Data Structures.

False is the correct answer to “Both Dynamic array and Dynamically memory allocated array are same.”. This question is standard in competitive examination syllabi for Arrays In Data Structures.

number of rows X number of columns is the correct answer to “What is the order of a matrix”. This question is standard in competitive examination syllabi for Arrays In Data Structures.

True is the correct answer to “Reversal algorithm and juggling algorithm for array rotation have the same time complexity.”. This question is standard in competitive examination syllabi for Arrays In Data Structures.

3 is the correct answer to “How many arguments are required by the predefined function rotate() in C++”. This question is standard in competitive examination syllabi for Arrays In Data Structures.

Harry Markowitz is the correct answer to “Who coined the term Sparse Matrix”. This question is standard in competitive examination syllabi for Arrays In Data Structures.

Sparsity = 1 - Density is the correct answer to “What is the relation between Sparsity and Density of a matrix”. This question is standard in competitive examination syllabi for Arrays In Data Structures.

True is the correct answer to “Arbitrary expressions can be used while declaring variable-length arrays.”. This question is standard in competitive examination syllabi for Arrays In Data Structures.

0 is the correct answer to “How many inversions does a sorted array have”. This question is standard in competitive examination syllabi for Arrays In Data Structures.

firstName = ['Joe','Bob','Frank','Hans'] lastName = ['Smith','Seger','Sinatra','Schultze'] heightInCM = [169,158,201,199] for i in xrange(len(firstName)): print "Name:",firstName[i], lastName[i] print "Height in CM:,",heightInCM[i] is the correct answer to “Which of the following can be called a parallel array implementation”. This question is standard in competitive examination syllabi for Arrays In Data Structures.

Algorithm complexity is the correct answer to “Which of the following is the disadvantage of sparse matrices over normal matrices”. This question is standard in competitive examination syllabi for Arrays In Data Structures.

O(n) is the correct answer to “What will be the time complexity of the following code? #include <bits/stdc++.h> using namespace std; void func(int arr[], int left, int right) { while (left < right) { int temp = arr[left]; arr[left] = arr[right]; arr[right] = temp; left++; right--; } } void printArray(int arr[], int size) { for (int i = 0; i < size; i++) cout << arr[i] << " "; } int main() { int arr[] = {1,4,3,5}; int n = sizeof(arr) / sizeof(arr[0]); func(arr, 0, n-1); printArray(arr, n); return 0; }”. This question is standard in competitive examination syllabi for Arrays In Data Structures.

O (n) is the correct answer to “In special case, the time complexity of inserting/deleting elements at the end of dynamic array is . . . . . . . .”. This question is standard in competitive examination syllabi for Arrays In Data Structures.