logo

Crowdly

Browser

Add to Chrome

IS52054A: ALGORITHMS 2 (2024-25)

Looking for IS52054A: ALGORITHMS 2 (2024-25) test answers and solutions? Browse our comprehensive collection of verified answers for IS52054A: ALGORITHMS 2 (2024-25) at learn.gold.ac.uk.

Get instant access to accurate answers and detailed explanations for your course questions. Our community-driven platform helps students succeed!

A max-heap is built in-place from the array [7,54,96,1,20,43,8,65].

What are the final contents of the newly-built heap?

0%
0%
0%
0%
View this question
A max-heap is built in-place from the array [26,88,57,65,76,40,94,77].

What are the final contents of the newly-built heap?

0%
0%
0%
0%
0%
View this question
An empty max-heap is initialized by inserting elements one at a time, in order, from the array [32,75,41,35,20,47,74,56].

What are the final contents of the newly-built heap?

0%
0%
0%
0%
0%
View this question
An empty max-heap is initialized by inserting elements one at a time, in order, from the array [28,80,7,54,69,42,34,12].

What are the final contents of the newly-built heap?

View this question
Performing heapsort on an implicit max-heap with elements takes additional space in
0%
0%
0%
0%
0%
View this question
Returning the minimum element from an implicit max-heap of elements takes time in
0%
0%
View this question
Performing heapsort on an implicit max-heap with elements takes time in
0%
0%
0%
View this question
In the implicit min-heap with contents

[4,9,6,17,26,8,16,19,69,32,93,55,50], what is the parent of 32?

View this question
In the implicit min-heap with contents

[4,9,6,17,26,8,16,19,69,32,93,55,50], what is the parent of 26?

View this question

The following numbers are inserted in a BST (in this order): 25 (0x2), 17 (0xF), 32 (0xA), 35 (0xC), 28 (0xB). 

What is the memory address of the left child of the node storing 32 after executing function Z  with the input parameters: the root of the above described tree and number 32?

function Z(root, x) 

   if (root==NULL) 

     return NULL 

   else 

         if (x < root->data) 

            root->left=Z(root->left,x) 

         else 

             if (x > root->data) 

                 root->right=Z(root->right,x) 

             else 

                 if (root->left== NULL and root->right==NULL) 

                     root=NULL 

                     return root 

                 else 

                     return root 

end function  

View this question

Want instant access to all verified answers on learn.gold.ac.uk?

Get Unlimited Answers To Exam Questions - Install Crowdly Extension Now!

Browser

Add to Chrome