Data Structure II Mock Test 10

1. Which of the following is an alternative name of the quickselect algorithm?

2. The letters of a word are separated by a space of how many durations?

3. An Extended hamming code is also called as __________

4. When the topological sort of a graph is unique?

5. In Morse Code, each dot or dash within a character is followed by a period of signal absence. What is the name of that signal?

6. Problems that cannot be solved by any algorithm are called?

7. How many stages of procedure does a non-deterministic algorithm consist of?

8. Morse Code is named after which scientist?

9. What will be the auxiliary space complexity of the following code?

#include <bits/stdc++.h> 
using namespace std; 
void convert(int arr[], int n) 
{ 	
	int temp[n]; 
	memcpy(temp, arr, n*sizeof(int)); 
	sort(temp, temp + n); 	
        unordered_map<int, int> map; 	
	int sort_index = 0; 
	for (int i = 0; i < n; i++) 
		map[temp[i]] = sort_index++; 	
	for (int i = 0; i < n; i++) 
		arr[i] = map[arr[i]]; 
} 
void printArr(int arr[], int n) 
{ 
	for (int i=0; i<n; i++) 
		cout << arr[i] << " "; 
} 
int main() 
{ 
	int arr[] = {10, 20, 15, 12, 11, 50}; 
	int n = sizeof(arr)/sizeof(arr[0]); 
	convert(arr , n); 	
	printArr(arr, n); 
	return 0; 
} 

10. Recursive solution of subset sum problem is faster than dynamic problem solution in terms of time complexity.