Consider the PriorityQueue class in the answer box below, complete the percolate_down (self, index) method. The method takes an integer as a parameter. This method should keep comparing the element at the parameter index and swapping it with its smallest child if the heap property is violated. Note: • submit the entire class definition. Keep a copy of your solution to this task because you will be extending it step by step in subsequent tasks. • You can assume that the parameter index is within the valid range. • The elements are NOT in heap order property in this question for testing purpose. For example: Test Result print (pq2) [0, 2, 7, 26, 25, 19, 17, 1, 90, 3, 36] pq2.percolate_down (5) [0, 2, 7, 26, 25, 19, 17, 1, 90, 3, 36] print (pq2) [0, 2, 7, 26, 3, 19, 17, 1, 90, 25, 36] pq2.percolate_down (4) [0, 2, 7, 1, 3, 19, 17, 26, 90, 25, 36] print (pq2) [0, 2, 3, 1, 7, 19, 17, 26, 90, 25, 36] pq2.percolate_down (3) [0, 1, 3, 2, 7, 19, 17, 26, 90, 25, 36] print (pq2) pq2.percolate_down (2) print (pq2) pq2.percolate_down (1) print (pq2)

Consider the PriorityQueue class in the answer box below, complete the percolate_down (self, index) method. The method takes an integer as a parameter. This method should keep comparing the element at the parameter index and swapping it with its smallest child if the heap property is violated. Note: • submit the entire class definition. Keep a copy of your solution to this task because you will be extending it step by step in subsequent tasks. • You can assume that the parameter index is within the valid range. • The elements are NOT in heap order property in this question for testing purpose. For example: Test Result print (pq2) [0, 2, 7, 26, 25, 19, 17, 1, 90, 3, 36] pq2.percolate_down (5) [0, 2, 7, 26, 25, 19, 17, 1, 90, 3, 36] print (pq2) [0, 2, 7, 26, 3, 19, 17, 1, 90, 25, 36] pq2.percolate_down (4) [0, 2, 7, 1, 3, 19, 17, 26, 90, 25, 36] print (pq2) [0, 2, 3, 1, 7, 19, 17, 26, 90, 25, 36] pq2.percolate_down (3) [0, 1, 3, 2, 7, 19, 17, 26, 90, 25, 36] print (pq2) pq2.percolate_down (2) print (pq2) pq2.percolate_down (1) print (pq2)

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter18: Stacks And Queues

Section: Chapter Questions

Problem 16PE: The implementation of a queue in an array, as given in this chapter, uses the variable count to...

See similar textbooks

Similar questions

you will create a simple heap data structure with several methods includingmaxHeapify and buildMaxHeap. To get started, import the starter file (Heap.java) into the heappackage you create in a new Java Project. Please do not change any of the method signatures inthe Heap class. Implement the methods described below. You are free to test your code however youprefer. Remember that arrays are indexed starting at 0 in Java. This will change the math in thepseudocode.public int parent(int i)This method should return the index of the parent of the ith element of the data array. If the ithelement is the root, then the method should return -1.public int left(int i)This method should return the index of the left child of the ith element of the data array. If the ithelement is a leaf, then the index will potentially be greater than the size of the data array. That’sfine.public int right(int i)This method should return the index of the right child of the ith element of the data array. If the…
This question is in the course of Data Structures. Please choose C programming language for the code, and DO NOT include comments or extraneous information that a student typically would not need for a correct answer.I need the answer ASAP.Thank you so much in advance.
Please answer the question in the screenshot. The language used is Java.
Please help Java
Part 2: Sorting the WorkOrders via dates Another error that will still be showing is that there is not Comparable/compareTo() method setup on the WorkOrder class file. That is something you need to fix and code. Implement the use of the Comparable interface and add the compareTo() method to the WorkOrder class. The compareTo() method will take a little work here. We are going to compare via the date of the work order. The dates of the WorkOrder are saved in a MM-DD-YYYY format. There is a dash '-' in between each part of the date. You will need to split both the current object's date and the date sent through the compareTo() parameters. You will have three things to compare against. You first need to check the year. If the years are the same value then you need to go another step to check the months, otherwise you compare them with less than or greater than and return the corresponding value. If you have to check the months it would be the same for years. If the months are the same you…
A for construct is used to build a loop that processes a list of elements in programming. To do this, it continues to operate forever as long as there are objects to process. Is this assertion truthful or false? Explain your response.
The implementation of a queue in an array, as given in this chapter, uses the variable count to determine whether the queue is empty or full. You can also use the variable count to return the number of elements in the queue. On the other hand, class linkedQueueType does not use such a variable to keep track of the number of elements in the queue. Redefine the class linkedQueueType by adding the variable count to keep track of the number of elements in the queue. Modify the definitions of the functions addQueue and deleteQueue as necessary. Add the function queueCount to return the number of elements in the queue. Also, write a program to test various operations of the class you defined.
Add methods to the STUDENT class that compare two STUDENT objects. One method should test for equality. The other methods should support the other possible comparisons. In each case, the method returns the result of the comparison of the two students' names. Place several STUDENT objects into a list and shuffle it. Then run the SORT method with this list and display all of the students' information.
Use NetBeans Note for all the above User-Defined Classes: • Provide appropriate validation code so the right values get populated in the instance variables. For example, the payrate should not be negative. Write a Java application (Client) program with a static method called generateEmployees( ) that returns a random list of 10 different types of Employee objects. You would use an ArrayList to store the employee objects that will be returned. Use a for loop to populate randomly different types of employee objects with some random data. You could possibly think of a range of values like 1 – 4. If random value is 1, create a HourlyEmployee object with some randomly generated data, if 2, a SalariedEmployee object with some random data and so on. I would leave it to your ingenuity to generate and populate these different Employee objects with other data like name etc. As these objects are generated, add them to your data structure (array or ArrayList that you are using). Finally, the…
Komo loriab. Jva
Help so onnum
In this java assignment, we will need to use arraylists so we can store data for an employee. If the user wants to enter data for more than one employee, it should print like this: Employee ListId Name ----------------------- 1. First Name 2. Bob Smith If the user only enters one employee, it should print out a paystub for that employee that would look like this (with overtime coming into play as well, paying an extra 50% beyond 40 hours): ------------------------------- Id - 1 Name - First M. Last Address - 1234 Main St, City, St, Zip Phone - 1234567890 Email - sample@gmail.com Hours worked - 45 Hourly Rate - $10 Regular Pay, 40 hours at $10/hr - $400 Overtime Pay, 5 hours at $15/hr - $75 Gross Total - $475 ------------------------------ Federal tax (20%) - $95 State Tax (5%) - $23.75 Fica Tax (3%) - $14.25 ------------------------------ Net Check - $342 The program should have one class per .java file all calling to a main.java file using getters and setters. Here are the…