Programming and Data StructuresBinary Heaps (GATE (Graduate Aptitude Test in Engineering) Computer Science): Questions 1  4 of 4
Get 1 year subscription: Access detailed explanations (illustrated with images and videos) to 913 questions. Access all new questions we will add tracking exampattern and syllabus changes. View Sample Explanation or View Features.
Rs. 450.00 or
Question number: 1
» Programming and Data Structures » Binary Heaps
Question
Binary numbers need more places for counting because 
Choices
Choice (4)  Response  

a.  They are always big numbers 

b.  Binary base is small 

c.  Any no. of 0’s can be added in front of them 

d.  All a. , b. and c. are correct 

Question number: 2
» Programming and Data Structures » Binary Heaps
Question
What is the two’s complement of 1010?
Choices
Choice (4)  Response  

a.  10110 

b.  0101 

c.  1100 

d.  Question does not provide sufficient data or is vague 

Question number: 3
» Programming and Data Structures » Binary Heaps
Question
Heap allocation is required for languages
Choices
Choice (4)  Response  

a.  That use dynamic scope rules 

b.  That support recursion 

c.  That support dynamic data structures 

d.  None of the above 

Question number: 4
» Programming and Data Structures » Binary Heaps
Question
min heap
Choices
Choice (4)  Response  

a.  Priority heap 

b.  Max heap 

c.  heap 

d.  Question does not provide sufficient data or is vague 
