Fix the main file errors BinarySearchTree1.java x1 import java.util.*;2 public class BinarySearchTreel3 , {public Node root;private int max;private int count=0;private int sum=0;public BinarysearchTree1 () {479root = null;1011 vpublic Node getroot () {12return root;1314 vpublic Node Search(int KEY) {15Node x = root;while (x != null && x.item != KEY) {if (KEY < x.item) {x = x.Left;} else {x = x.Right;16 v17 v1819 y202122return x; // x.itemkey or x == null23==2425public Node SearchRec (Node root, int key)26 vif (root == nul1)return null;272829if ( root.item ==key )* LO Main.java xConsole Shellimport java.util.*;2 v public class Main{> javac -classpath .:/run_dir/junit-4.12.jar:target/dependency/* -d . BinarySearchTree1.java Main.javaMain.java:8: error: getHeight() has private access in BinarySearchTree1int height=myTree.getHeight();4public static void main(String [] args){BinarySearchTreel myTree = new BinarySearchTree1();Main.java:10: error: getlargestKey () has private access in BinarySearchTIee1myTree.Insert (1);int height=myTree.getHeight ();int largestkey=myTree.getLargestKey ();8.int largestkey=myTree.getLargestkey ();Main.java:12: error: cannot find symbolfloat avg=getAverage();1011float avg=getAverage ();symbol: method getAverage ()location: class Main1213143 errors15exit status 1

The access specifier for getHeight(), getLargestKey() and getAverage() methods is private that means…

Main.java x Console shell import java.util.*; > javac -classpath .:/run_dir/junit-4.12.jar:target/dependency/* -d . arySearchTree1.java Main.java Main.java:8: erIor: getHeight() has private access in BinarySearchTreef int height=myTree.getHeight(); 2 v public class Main{ public static void main(String [] args){ BinarySearchTree1 myTree = new BinarySearchTree1(); 4 Main.java:10: error: getlargestkey () has private access in BinarySearch ee1 myTree.Insert (1); int height=myTree.getHeight(); int largestkey=myTree.getLargestKey(); 8 int largestkey=myTree.getlargestkey (); Main.java:12: error: cannot find symbol float avg-getAverage(); 10 11 12 float avg=getAverage(); symbol: location: class Main method getAverage() 13 14 3 errors 15 exit status 1

Main.java x Console shell import java.util.; > javac -classpath .:/run_dir/junit-4.12.jar:target/dependency/ -d . arySearchTree1.java Main.java Main.java:8: erIor: getHeight() has private access in BinarySearchTreef int height=myTree.getHeight(); 2 v public class Main{ public static void main(String [] args){ BinarySearchTree1 myTree = new BinarySearchTree1(); 4 Main.java:10: error: getlargestkey () has private access in BinarySearch ee1 myTree.Insert (1); int height=myTree.getHeight(); int largestkey=myTree.getLargestKey(); 8 int largestkey=myTree.getlargestkey (); Main.java:12: error: cannot find symbol float avg-getAverage(); 10 11 12 float avg=getAverage(); symbol: location: class Main method getAverage() 13 14 3 errors 15 exit status 1

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

Write a JAVA program that will maintain a phone directory using a Linked-List. The program should be able to perform the following operations: Add persons details (first name, last name, phone number, city, address, sex and email) to the phone directory, where phone numbers in the directory have to be unique. (Note: each person record will store in one node in the linked-list and insert each person to the last) Delete any person details by a given phone number. Update telephone number by providing person first name. Display all details of persons from a phone directory. Search telephone number based on person first name. (Note: use sequential search to find all telephones for the given first name) Sort all persons in the phone directory ascending based on person first name. (Note: use bubble or selection sort to arrange the entire phone directory)
Write a C++ Program to implement a hash table with chaining that does the following: The hash table should have 9 buckets Insert 6 Insert 4 Delete 6 Insert 27 Insert 28 Delete 4 Insert 90 Display the final hash table.
NEED PSEUDOCODE FOR THIS CODING package disktower; import java.util.*; class MyComparator implements Comparator { public int compare(Object obj1,Object obj2) { Integer i1=(Integer)obj1; Integer i2=(Integer)obj2; return i2.compareTo(i1); } } public class DiskTower { public static void main(String[] args) { Scanner sc=new Scanner(System.in); int n=sc.nextInt(); int max=n; Queue<Integer> queue=new PriorityQueue<Integer>(new MyComparator()); int disks[]=new int[n]; for(int i=0;i<n;i++) { disks[i]=sc.nextInt(); queue.add(disks[i]); while(!queue.isEmpty() && queue.peek()==max) { System.out.print(queue.poll() + " "); max--; } System.out.println(); } } }
Create a new concrete class that implements MyMap using open addressing with linear probing. For simplicity, use f(key) = key % size as the hash function, where size is the hash-table size. Initially, the hash-table size is 4. The table size is doubled whenever the load factor exceeds the threshold (0.5). Test your new MyHashMap class using the code at https://liveexample.pearsoncmg.com/test/Exercise27_01.txt Class Name: Exercise27_01 If you get a logical or runtime error, please refer https://liveexample.pearsoncmg.com/faq.html MyHashMap.java located here https://liveexample.pearsoncmg.com/html/MyHashMap.html? MyMap.java located here https://liveexample.pearsoncmg.com/html/MyMap.html IMPORTANT Please do not take answers from Chegg or the rest of the internet, they are all wrong (I checked them). Please only provide a solution if you know the answer. I need to submit the code to Revel, I do not need the entire code, I need to submit the code enclosed between // BEGIN…
Use java.util.Map, java.util.Set and given class Parition.java, write a Java method that receives a positive integer and prints all of its partitions. For example, if the input is 5, it prints the following seven lines, each representing one partition of integer 5 Please can you help with the following activity? Use java. util.Map, java. util.Set and given class Parition.java: import java.util.*;public class Partition implements Comparable<Partition> { /*represents a partition for int sum. * Example: * if sum = 14, * frequency can be { * 1:1, 3:1, 5:2} * which means 14 = 5 + 5 + 3 + 1 * */ public int sum; public String rep = ""; public TreeMap<Integer,Integer> frequencies; Partition(){//default constructor, parition for sum = 1 frequencies = new TreeMap<>(); this.sum = 1; frequencies.put(1, 1); } Partition(int sum){ frequencies = new TreeMap<>(); this.sum = sum; } public String toString(){…
Complete and submit LinkedStack2.java with following: Inherit LinkedStack.java, implement StackInterface2.java Add String toString()method as specified in page 153, problem 28(a) Add int size()method as specified in page 153, problem 28(b) Add void popSome(int count)method as specified in page 153, problem 28(c) Add boolean swapStart()method as specified in page 153, problem 28(d) Add T poptop() method as specified in page 153, problem 28(e)
IN JAVA This triple-ended queue exercise can be found at https://open.kattis.com/problems/teque. The requirements for this program are compatible with those of the Kattis problem, so a solution should produce correct results when submitted on Kattis. The Triple-Ended QUEue supports four operations: push_back x: inserts the element x at the end of the TEQUE push_front x: inserts the element x at the front of the TEQUE push_middle x: inserts the element x so that the insertion index for x is (k + 1)/2 for a 0-based indexed TEQUE. get i: prints out the ith index element (0-based) of the TEQUE. The TEQUE will be implemented as a linked list. The usual implementation requirements apply along with a screenshot of the results from Kattis. Sample input 10 push_back 1 push_front 2 push_back 3 push_front 4 push_middle 5 push_back 6 get 3 push_middle 7 push_middle 8 get 5 Sample Output 1 1 Subject: Java Programming
Create a newconcrete class that implements MyMap using open addressing with quadratic probing.For simplicity, use f(key) = key % size as the hash function, where sizeis the hash-table size. Initially, the hash-table size is 6. The table size is doubledwhenever the load factor exceeds the threshold (0.5).
Computer Science ** In JAVA** What would a generic radix sorter look like that computed the same function on Strings as my EXAMPLE (below), that checks true, or throw an exception….? EXAMPLE: StringComparator.java import java.util.Comparator; public class StringComparator implements Comparator { @Override public int compare(String s1, String s2) { return s1.toLowerCase().compareTo(s2.toLowerCase()); } } HeapSort.java import java.util.ArrayList; import java.util.Comparator; public class HeapSort { public void sortingHeapTree(ArrayList arr, Comparator c) { int n = arr.size(); for (int i = n / 2 - 1; i >= 0; i--) HeapTreeConstruction(arr, n, i, c); for (int i = n - 1; i >= 0; i--) { T temp = arr.get(0); arr.set(0, arr.get(i)); arr.set(i, temp); HeapTreeConstruction(arr, i, 0, c); } } void HeapTreeConstruction(ArrayList arr, int n, int i, Comparator c) { int root = i; // Initialize largest as root int l = 2 * i + 1; // left = 2*i + 1 int r = 2 * i + 2; // right = 2*i + 2 if…
Java 8 decreased key search runtime of hashmap comparing to Java 7 hashmap key search by handling collisions with _____________ chaining after a threshold instead of linkedlist. A. Binary Search Tree B. Heap C. Stack D. Balanced Binary Search Tre The ____________ is the process to extend the capacity of the hash table when reaching the allowed maximum percentage occupancy. A. Extending B. Rehashing/Resizing C. Shrinking D. None of the Above
Java- What kind of initialization needs to be done for an open-address hash table? What about a chained hash table?
We wish to build a Hash Table, which is able to deal with collision by using linear and quadratic probing. Please write a public class HashLinQuad as follows: public class HashLinQuad { private int[] table; //hash table private int size; //current number of elements private int capacity //capacity of the hash table private HashLinQuad (int size){ table = new int[size]; } public int addLin (int obj) { … //add obj into table using linear probing } public int addQuad (int obj){ … //add obj into table using quadratic probing } … } 1. Implement the two methods addLin and addQuad that apply linear and quadratic probing, respectively. 2. Test your implemented methods addLin and addQuad . To this end, create the following two objects in class Main : HashLinQuad linHashTable = new HashLinQuad(1249); HashLinQuad quadHashTable = new HashLinQuad(1249); 3. Please insert the same 1000 random integer values (in the same order) into: a. the object `linHashTable` by using the method `addLin` and count…