Array Data Structure Test

1. Under what condition the number of inversions in an array are maximum?

when the array is sorted

depends on the given array

when the array is reverse sorted

when the array is half sorted

2. How many inversions are there in the array arr = {1,5,4,2,3}?

3. What is the time complexity of the code that uses self balancing BST for determining the number of inversions in an array?

O(log n)

O(n)

O(n log n)

O(n²)

4. Under what condition the number of inversions in an array are minimum?

when the array is reverse sorted

depends on the given array

when the array is half sorted

when the array is sorted

5. The time complexity of the code that determines the number of inversions in an array using merge sort is lesser than that of the code that uses loops for the same purpose.

true

false

6. How many inversions does a sorted array have?

cannot be determined

7. What does the number of inversions in an array indicate?

mean value of the elements of array

measure of how close or far the array is from being sorted

median value of the elements of array

the distribution of values in the array

8. 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; 
}

O(log n)

O(n)

O(n²)

O(n log n)

9. What is the space complexity of the code that uses merge sort for determining the number of inversions in an array?

O(log n)

O(1)

O(n log n)

O(n)

10. What is the condition for two elements arr[i] and arr[j] to form an inversion?

arr[i]<arr[j]

i < j

arr[i] > arr[j] and i < j

arr[i] < arr[j] and i < j