Data Structure I Mock Test 7

10%

Question 1 of 10

1. Which nodes are the siblings of Node D of given ternary tree?

Question 1 of 10

Question 2 of 10

2. What is the worst case time complexity of query operation(n is the no. of candidates)?

O(1)

O(n)

O(n log n)

O(log n)

Question 2 of 10

Question 3 of 10

3. Who is descendant of Node C?

Question 3 of 10

Question 4 of 10

4. What is the complexity of given function of insertion.

	insert(int n)
	{
		if(buffer_size()< maxi_biffer_size())
		buffer_aar[ind]==n;
		else
		move_to_heap(buffer,buffer+maxi_buffer_size())
	}

O(n)

O(logn)

O (n*logn)

amortized O(1)

Question 4 of 10

Question 5 of 10

5. Can child node be always called Leaf node in the ternary tree?

True

False

Question 5 of 10

Question 6 of 10

6. Is parent node of Node 4 and root node of the given K-ary tree same?

False

True

Question 6 of 10

Question 7 of 10

7. Efficiency of bin depends upon ___________

location of query and candidates

location and size of query and candidates

size of query and candidates

depends on the input

Question 7 of 10

Question 8 of 10

8. What is the use of the bin data structure?

to have efficient insertion

to have efficient deletion

to have efficient region query

to have efficient traversal

Question 8 of 10

Question 9 of 10

9. Several kinds of queries are possible on a k-d called as?

neighbour queries

range queries

search queries

partial queries

Question 9 of 10

Question 10 of 10

10. What is the time complexity for storing the maximum number of elements in Van Emde Boas tree if M is the maximum number of elements?

O (M)

O (M!)

O (1)

O (log M)

Question 10 of 10