My Report

Data Structure I Mock Test 7


Correct Answer: 2 points | Wrong: -1 point
Grades: A* (100% score) | A (80%-99%) | B (60%-80%) | C (40%-60%) | D (0%-40%)
advertisement
 10%

Question 1 of 10

1. What is computational geometry?

Question 1 of 10

Question 2 of 10

2. Efficiency of bin depends upon ___________

Question 2 of 10

Question 3 of 10

3. In what time can a 2-d tree be constructed?

Question 3 of 10

Question 4 of 10

4. Choose the correct properties of weak-heap.

Question 4 of 10

Question 5 of 10

5. Path Compression algorithm performs in which of the following operations?

Question 5 of 10

Question 6 of 10

6. What is the time complexity for deleting a key or integer in Van Emde Boas data structure?

Question 6 of 10

Question 7 of 10

7. What is the size of the given K-ary tree?
k-ary-tree-interview-questions-answers-q1

Question 7 of 10

Question 8 of 10

8. What is the size of the given ternary tree?
ternary-tree-interview-questions-answers-q3

Question 8 of 10

Question 9 of 10

9. In a two-dimensional search tree, the root is arbitrarily chosen to be?

Question 9 of 10

Question 10 of 10

10. State the complexity of algorithm given below.

	int function(vector<int> arr)
	int len=arr.length();
	if(len==0)
	return;
	temp=arr[len-1];
	arr.pop_back();
	return temp;

Question 10 of 10


 

Manish Bhojasia - Founder & CTO at Sanfoundry
Manish Bhojasia, a technology veteran with 20+ years @ Cisco & Wipro, is Founder and CTO at Sanfoundry. He lives in Bangalore, and focuses on development of Linux Kernel, SAN Technologies, Advanced C, Data Structures & Alogrithms. Stay connected with him at LinkedIn.

Subscribe to his free Masterclasses at Youtube & discussions at Telegram SanfoundryClasses.