HomeEngineeringComputer ScienceData StructureHeaps
Heaps MCQs

		        
				 chevron_left Back  Page 1/4  chevron_right Next				
1. In a Heap tree
Values in a node is greater than every value in left sub tree and smaller than right sub tree
Values in a node is greater than every value in children of it
Both of above conditions applies
None of above conditions applies

										report_problem Report 
										bookmark Save  chat Discuss 
filter_dramaExplanation
Answer is : B

							  None.
							  
Report QuestionQuestion:  In a Heap tree
Given Answer:  B
Suggestion for Correct Answer:  
								
									A
								
									B
								
									C
								
									D
								  
						  Report
						
2. In a min heap
minimum values are stored.
child nodes have less value than parent nodes.
parent nodes have less value than child nodes.
maximum value is contained by the root node.

										report_problem Report 
										bookmark Save  chat Discuss 
filter_dramaExplanation
Answer is : C

							  None.
							  
Report QuestionQuestion:  In a min heap
Given Answer:  C
Suggestion for Correct Answer:  
								
									A
								
									B
								
									C
								
									D
								  
						  Report
						
3. In a Heap tree
Values in a node is greater than every value in left sub tree and smaller than right sub tree
Values in a node is greater than every value in children of it
Both of above conditions applies
None of above conditions applies

										report_problem Report 
										bookmark Save  chat Discuss 
filter_dramaExplanation
Answer is : B

							  None.
							  
Report QuestionQuestion:  In a Heap tree
Given Answer:  B
Suggestion for Correct Answer:  
								
									A
								
									B
								
									C
								
									D
								  
						  Report
						
4. Heap is an example of ................
complete binary tree
spanning tree
sparse tree
binary search tree

										report_problem Report 
										bookmark Save  chat Discuss 
filter_dramaExplanation
Answer is : A

							  None.
							  
Report QuestionQuestion:  Heap is an example of ................
Given Answer:  A
Suggestion for Correct Answer:  
								
									A
								
									B
								
									C
								
									D
								  
						  Report
						
5. The running time for creating a heap of size n is .............
O(n)
O(log n)
O(n log n)
O(n^2)

										report_problem Report 
										bookmark Save  chat Discuss 
filter_dramaExplanation
Answer is : C

							  None.
							  
Report QuestionQuestion:  The running time for creating a heap of size n is .............
Given Answer:  C
Suggestion for Correct Answer:  
								
									A
								
									B
								
									C
								
									D
								  
						  Report
						
6. In a min-heap:
parent nodes have values greater than or equal to their Children
parent nodes have values less than or equal to their Children
both statements are true
both statements are wrong

										report_problem Report 
										bookmark Save  chat Discuss 
filter_dramaExplanation
Answer is : A

							  None.
							  
Report QuestionQuestion:  In a min-heap:
Given Answer:  A
Suggestion for Correct Answer:  
								
									A
								
									B
								
									C
								
									D
								  
						  Report
						
7. If we implement heap as min-heap , deleting root node (value 1)from the heap. What would be the value of root node after second iteration if leaf node (value 100) is chosen to replace the root at start.
2
100
17
3

										report_problem Report 
										bookmark Save  chat Discuss 
filter_dramaExplanation
Answer is : A

							  None.
							  
Report QuestionQuestion:  If we implement heap as min-heap , deleting root node (value 1)from the heap. What would be the value of root node after second iteration if leaf node (value 100) is chosen to replace the root at start.
Given Answer:  A
Suggestion for Correct Answer:  
								
									A
								
									B
								
									C
								
									D
								  
						  Report
						
8. If we implement heap as maximum heap , adding a new node of value 15 to the left most node of right subtree . What value will be at leaf nodes of the right subtree of the heap.
15 and 1
25 and 1
3 and 1
2 and 3

										report_problem Report 
										bookmark Save  chat Discuss 
filter_dramaExplanation
Answer is : A

							  None.
							  
Report QuestionQuestion:  If we implement heap as maximum heap , adding a new node of value 15 to the left most node of right subtree . What value will be at leaf nodes of the right subtree of the heap.
Given Answer:  A
Suggestion for Correct Answer:  
								
									A
								
									B
								
									C
								
									D
								  
						  Report
						
9. Why is heap implemented using array representations than tree(linked list) representations though both tree representations and heaps have same complexities?

for binary heap

-insert: O(log n)

-delete min: O(log n)

for a tree

-insert: O(log n)

-delete: O(log n)

Then why go with array representation when both are having same values ?
arrays can store trees which are complete and heaps are by it
lists representation takes more memory hence memory efficiency is less and go with arrays
array have better caching
all of the mentioned

										report_problem Report 
										bookmark Save  chat Discuss 
filter_dramaExplanation
Answer is : D

							  None.
							  
Report QuestionQuestion:  Why is heap implemented using array representations than tree(linked list) representations though both tree representations and heaps have same complexities?for binary heap-insert: O(log n)-delete min: O(log n)for a tree-insert: O(log n)-delete: O(log n)Then why go with array representation when both are having same values ?
Given Answer:  D
Suggestion for Correct Answer:  
								
									A
								
									B
								
									C
								
									D
								  
						  Report
						
10. In a max-heap, element with the greatest key is always in the which node?
Leaf node
First node of left sub tree
root node
First node of right sub tree

										report_problem Report 
										bookmark Save  chat Discuss 
filter_dramaExplanation
Answer is : C

							  None.
							  
Report QuestionQuestion:  In a max-heap, element with the greatest key is always in the which node?
Given Answer:  C
Suggestion for Correct Answer:  
								
									A
								
									B
								
									C
								
									D
								  
						  Report
						
		 chevron_left Back  Page 1/4  chevron_right Next		

                  leaderboardLeaderboard
                
            Rahul Kumar
                             191 Points
                          
VIKRAM JEET
                             54 Points
                          
GEETHIKA CHOWDARY
                             53 Points
                          
sunita saini
                             52 Points
                          
Zain
                             49 Points