help with java heappublic class MinHeap implements Heap { privateint size =0; // number of elements currently in the heap privateint[] elts; // heap array privateint max; // array declared size // ================================================ // constructors // ================================================ publicMinHeap(intumax) { // user defined heap size this.max = umax; this.elts =newint[umax]; } publicMinHeap( ) { // default heap size is 100 this.max =100; this.elts =newint[100]; } //================================================== // methods we need to grade //================================================== publicint[] getArray() { // do not change this method return this.elts; } //========================================================= // public methods -- Implement these for the assignment. // Note that we want a Min Heap... so the operations // getFront and delFront and insert have to compare // for min being at the root //========================================================= publicvoidinsert(intp){ //Hint: remember to update size. Also, remember that we skip index 0 in the array. /*Your code here */ } 3public interface Heap {45void insert(int p);6.// Insert adds the element p to the heap.7//8// In this heap the element is an int and IS the priority.//10// We do not know at this abstract level if this will be// a min-heap or a max-heap (or even something else like// a fibonacci heap) and those details will be added in// the class that implements this heap interface.11121314// Duplicate values are allowed.15//// Error: The insert should fail if the heap is "full"// meaning the array is maxed out and there is no room1617// in the array for another element.In this case18// simply return, and do nothing.192021//Min-heap example:// Suppose we have the following min-heap:// 3, 5, 4, 12, 6, 922232425// After inserting 2, the min-heap now looks as follows:26// 2, 5, 3, 12, 6, 9, 42728void delFront();29// Remove the "next" item from the heap, however "next"30// is defined... in this assignment our implementing class

Hey there, I am writing the required solution of the above stated question.Please do find the…

help with java heap public class MinHeap implements Heap { privateint size =0; // number of elements currently in the heap privateint[] elts; // heap array privateint max; // array declared size // ================================================ // constructors // ================================================ publicMinHeap(intumax) { // user defined heap size this.max = umax; this.elts =newint[umax]; } publicMinHeap( ) { // default heap size is 100 this.max =100; this.elts =newint[100]; } //================================================== // methods we need to grade //================================================== publicint[] getArray() { // do not change this method return this.elts; } //========================================================= // public methods -- Implement these for the assignment. // Note that we want a Min Heap... so the operations // getFront and delFront and insert have to compare // for min being at the root //========================================================= publicvoidinsert(intp){ //Hint: remember to update size. Also, remember that we skip index 0 in the array. /Your code here /

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Similar questions

explain this codes : class Heap{ int [] heapArray; int maxSize, heapSize; public Heap(int max) { maxSize=max; heapSize=0; heapArray = new int[maxSize]; } public boolean insert(int ele) { if((heapSize+1) == maxSize) return false; heapArray[++heapSize]=ele; int pos = heapSize; while(pos != 1 && ele < heapArray[pos/2]) { heapArray[pos] = heapArray[pos/2]; pos = pos/2; } heapArray[pos] = ele; return true; } public void displayHeap() { System.out.println("The contents of heap are: "); for(int i = 1;i <= heapSize;i++) System.out.print(heapArray[i]+" "); }}public class HeapTest { public static void main(String args[]){ Heap h=new Heap(7); h.insert(7); h.insert(8);h.insert(2);h.insert(4);h.insert(12);h.insert(5);h.displayHeap();}}
4) Priority Queue Application Homework • Unanswered Situation: The order in which patients at a certain emergency room are seen by the doctor is based on arrival time minus 10 minutes for each major wound, minus 5 minutes for each minor wound, and plus 3 minutes for each time the patient annoys the nurse. You can assume a maximum wait time of 2 days. If a priority queue is used in the software at the nurses' station, would you use a minimum heap or a maximum heap to implement the priority queue? (Thought-provoker: Do you think if you annoyed the nurse enough, s/he would smack you around enough for you to move to the head of the line?)
#include<bits/stdc++.h>using namespace std;#define MAX 1000 //Maximum size of stack class Stack{ int top;// to store top of stack public: int elements[MAX]; //Integer array to store elements Stack(){ //class constructor for initialization top=-1; } bool push(int x) { if(top>=(MAX-1)) //Condition for top when stack because full { cout<<"Stack is full\n"; return false; } else { ++top; //Increasing top value elements[top]=x; //storing it to element in to stack return true; }}int pop(){ if(top<0)// Condition for top when stack is empty { cout<<"stack is empty\n"; return INT_MIN; } else { int x=elements[top--];//poping out the element for stack by decreasing to element return x; }}int display(){if(top<0)//Condition for top when stack is empty { cout<<"Stack is…

Recommended textbooks for you

Computer Networking: A Top-Down Approach (7th Edi…

Computer Engineering

ISBN:

9780133594140

Author:

James Kurose, Keith Ross

Publisher:

PEARSON

Computer Organization and Design MIPS Edition, Fi…

Computer Engineering

ISBN:

9780124077263

Author:

David A. Patterson, John L. Hennessy

Publisher:

Elsevier Science

Network+ Guide to Networks (MindTap Course List)

Computer Engineering

ISBN:

9781337569330

Author:

Jill West, Tamara Dean, Jean Andrews

Publisher:

Cengage Learning

Computer Networking: A Top-Down Approach (7th Edi…

Computer Engineering

ISBN:

9780133594140

Author:

James Kurose, Keith Ross

Publisher:

PEARSON

Computer Organization and Design MIPS Edition, Fi…

Computer Engineering

ISBN:

9780124077263

Author:

David A. Patterson, John L. Hennessy

Publisher:

Elsevier Science

Network+ Guide to Networks (MindTap Course List)

Computer Engineering

ISBN:

9781337569330

Author:

Jill West, Tamara Dean, Jean Andrews

Publisher:

Cengage Learning

Concepts of Database Management

Computer Engineering

ISBN:

9781337093422

Author:

Joy L. Starks, Philip J. Pratt, Mary Z. Last

Publisher:

Cengage Learning

Prelude to Programming

Computer Engineering

ISBN:

9780133750423

Author:

VENIT, Stewart

Publisher:

Pearson Education

Sc Business Data Communications and Networking, T…

Computer Engineering

ISBN:

9781119368830

Author:

FITZGERALD

Publisher:

WILEY

SEE MORE TEXTBOOKS

public class MinHeap implements Heap {

	privateint size =0; // number of elements currently in the heap
	privateint[] elts; // heap array
	privateint max; // array declared size

	// ================================================
	// constructors
	// ================================================

	publicMinHeap(intumax) { // user defined heap size
	this.max = umax;
	this.elts =newint[umax];
	}
	publicMinHeap( ) { // default heap size is 100
	this.max =100;
	this.elts =newint[100];
	}

	//==================================================
	// methods we need to grade
	//==================================================

	publicint[] getArray() { // do not change this method
	return this.elts;
	}

	//=========================================================
	// public methods -- Implement these for the assignment.
	// Note that we want a Min Heap... so the operations
	// getFront and delFront and insert have to compare
	// for min being at the root
	//=========================================================


	publicvoidinsert(intp){
	//Hint: remember to update size. Also, remember that we skip index 0 in the array.
	/Your code here /

	}