Q.No.3a) Which array out of A, B and C represents a01 28 9 10 11binary heap? Only one answer is right.A. 1 12 23 10 15 38|45| 15 18 20 213 4 $ 67 8 9 1011b) Write the heap out as a binary tree.c) Add last 2 digit of your arid no. to the heap,B- 18 27 10 45 83 91 31 12 52 512457 8 9 10 11making sure to restore the heap invariant.C: 1 13 20 21 65 54 67 41 30 83 52How does the array look now?

The binary heap is a sorting method in which it is either a minimum heap or a maximum heap. In the…

a) Which array out of A, B and C represents a 01 23 45 6 7 8 9 10 11 binary heap? Only one answer is right. A. 1 12 23 10 15 38|45 15 18 20 21 2. 4 6. 7. 8 9 10 11 b) Write the heap out as a binary tree. B. 18 27 10 45 83 91 31 12 52 51 0 1 2 3 4 s 6789 10 11 c) Add last 2 digit of your arid no. to the heap, making sure to restore the heap invariant. c. 1 13 20 21 65 54 67 41 30 83 52 How does the array look now?

a) Which array out of A, B and C represents a 01 23 45 6 7 8 9 10 11 binary heap? Only one answer is right. A. 1 12 23 10 15 38|45 15 18 20 21 2. 4 6. 7. 8 9 10 11 b) Write the heap out as a binary tree. B. 18 27 10 45 83 91 31 12 52 51 0 1 2 3 4 s 6789 10 11 c) Add last 2 digit of your arid no. to the heap, making sure to restore the heap invariant. c. 1 13 20 21 65 54 67 41 30 83 52 How does the array look now?

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

4. A feature of binary search tree is that duplicate values are discarded when insertions are made into the tree. This is referred to as duplicate elimination. Write a program that produces 20 random numbers between 1 and 20. The program should store all nonduplicate values in an array. Use the smallest possible array to accomplish this task.
id:202010501
Write the full Java code for NaturalMergeSorter.java
24. Add the following new method in the BST class. /** Returns the number of nodes in this binary tree */ public int getNumberofNodes () Requirements: a. Don't use return size; b.write a recursive method that returns the number of nodes starting from www the root.
9. Sort. I need as soon as possible
Solve the following questions: 1. Write a program to get the first and last element for the linked list. The Elements are (100,200,300,400,500). 2. Write a Program to sort the given list of elements using bubble sort. The Elements are ( 57, 45, 36, 6 ,23, 11, 90)
data МАТH data ENGL null next next top top data MATH next null The above is a stack of textbooks. The top is a node to record the address of the top element of a stack. 2. Which of the following statement push the ENGL textbook to the top? top.next = new Node("ENGL", top); a. b. top = new Node("ENGL", top) Describe the reason of your choice. Your answer is (a or b) Will the push action take time in 0(1) or 0(n)? Next Page O Type here to search
print the even numbers followed by ödd oh Ex4) Given the file pointerlmofQueue.java then write a main method: to - add some elements into the queue, - reverse the queue contents, (Hint use an array) - print the queue contents.
USING C LANGUAGE IN NETBEANS : Write a program menu that creates and manages Fibonacci heaps. The program must implement the following operations: creation, insertion, find min, extract min, decrease key, and deletion. **NOTE: The program should present a menu where user may choose from implemented options.
Choose the array below which correctly represents the backing store for the following min heap. 55 26 25 57 62 (67 96 63 O [0,14,26,25,96,67,63,55,57,62] O [0,14,26,96,67,25,63,55,57,62] O [96,26,67,14,63,25,0,null,57,null,55,62]] O [0,14,55,26,25,57,62,96,67,63]
Write a program that maintains a personal phone book in C. The program allows to:▪ Add and Delete entries from the phone book,▪ Search the phone book for a specific entry by last name or by phone number, and▪ Print out the entire entries in the phone book.The data in the phone book is maintained by storing in memory with the use of a singly linked list, withone list node per entry. Each node contains members for storing a person’s family name, first name, address,and the phone number. Use strings to store this information. The linked list must be kept in increasingalphabetical order, sorted by family name. There are no duplicate entries with the same family nameallowed in the phone book. This program should be menu driven, with the user being offered a choice of the following commandsdescribed below:▪ Insert a new entry into the phone book.The program should prompt the user for a new family name and first name, an address and a phonenumber. This information should be placed in a new…
14) Imagine a circular linked list of integers that are sorted into ascending order, as Figure 5-33a illustrates. The external reference list references the last node, which contains the largest integer. Write a method that revises the list so that its data elements are sorted into descending order, as Figure 5-33b illustrates. Do not allocate new nodes. (a) (b) 2 回 list FIGURE 5-33 4 Two circular linked lists [ 6 子 8 6 00 日 2 8 日照仓 list