The following Java program returns compile time error. Identify all the errors and correct them.1 import java.io. HashMap;3 public class FindError{4public HashMap ();public static long calculate(int n) {if (n == 0) return 1;1011long result = ;12for (int 1 0; 1< n; 1++)result += calculate(i) . calculate(n -i- 1);13141516return result;171819public static calculateMem(int n) {20if(cache.containskey (n))return cache.get(n);21222324if (n == 6) return 1;2526long result = 0;27for (int 1 = 0; 1 < n; 1++)result += calculateMem (i) * calculateMem (n - i - 1);28293031cache. add(n, result);3233return result;34353637public static void main(String args[]){3839for (int n = 18; n <=28; n++) {40int startTime = System.currentTimeNillis();System.out.print("\noutput forn =" +n +": " + calculate(n));System.out.println(" Execution time (normal): ". (System.currentTimeMillis() - startTime) +" ms");41424344startTime - System.currentTimeMillis();System.out.print ("Output for n =" +n +": " + calculateMem (n));System.out.println(" Execution time (memoized): ". (System.currentTimeMillis() - startTime) " ms");454647484950 }Do not write the entire program. You are not allowed to add or remove any line from the given program to produce the expectedoutput. Your task is to mention the line numbers which are incorrect and then write the required changes in those lines to get thefollowing output:Output for n =18: 477638700 Execution time (normal): 675 msOutput for n =18: 477638700 Execution time (memoized): 0 msOutput for n =19: 176726319O Execution time (normal): 1958 msOutput for n =19: 176726319O Execution time (memoized): 0 msOutput for n =20: 6564120420 Execution time (normal): 6101 msOutput for n =20: 6564120420 Execution time (memoized): 0 msNote that the execution time might differ depending on the machine where we are executing the program.

Answered: The following Java program returns…

Engineering

Computer Science

The following Java program returns compile time error. Identify all the errors and correct them

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

3. Write a Java program to implement a method which prints the Fibonacci series up to nth term. The value of n will be taken from the user in the main() method.Fibonacci series starts with 0 and 1, and the sum of previous two numbers is the next number of the series. For instance, 0, 1, 1 (0 + 1), 2 (1 + 1), 3 (1 + 2), and so on.Sample output [assuming the number of term (n) is 8]:The Fibonacci series: 0 1 1 2 3 5 8 13
Write a java recursive method called printNumPattern() to output the following number pattern. Given a positive integer as input (Ex: 12), subtract another positive integer (Ex: 3) continually until 0 or a negative value is reached, and then continually add the second integer until the first integer is again reached. Ex. If the input is: 12 3 the output is: 12 9 6 3 0 3 6 9 12
Write a recursive method in java that sums all values between s and n inclusive /* assume s is less than or equal to n to start */ public static int sum(int s, int n) { }
Java please, Write a program that reads a list of words. Then, the program outputs those words and their frequencies. The input begins with an integer indicating the number of words that follow. Assume that the list will always contain less than 20 words. Ex: If the input is: 5 hey hi Mark hi mark the output is: hey 1 hi 2 Mark 1 hi 2 mark 1 Hint: Use two arrays, one for the strings, another for the frequencies. Your program must define and call a method:public static int getFrequencyOfWord(String[] wordsList, int listSize, String currWord) Note: This is a lab from a previous chapter that now requires the use of a method.
Modify the given programs by adding two methods in HashTableClass: Show Full code with output Find and return the item with the maximum key; Find and return average of the keys in the hash table. import java.util.*;public class hashTableClass { public int tableSize; Node[] T; public hashTableClass() { System.out.println("Give the hash table size"); tableSize = Integer.parseInt(new Scanner(System.in).nextLine()); T = new Node[tableSize]; for (int i = 0; i < tableSize; i++) T[i] = null; } public int hashFunction(int Key) { return Key % tableSize; } public Node Search(int Key) { int h = hashFunction(Key); Node current = T[h]; while (current != null && current.item != Key) current = current.link; return current; } public void Insert(int newItem) { int h = hashFunction(newItem); Node current = T[h]; Node newNode = new Node(newItem);…
Write a Java code that prints the Fibonacci series of a given number n which is the length of the series. Fibonacci series is: 0 ,1, 1, 2, 3 , 5 , 8 , 13 ,.....,..... Let n >=2, Every term of the Fibonacci series is the sum of the two previous terms. Note: Fibonacci (0) =0, and Fibonacci(1)=1 you can solve it in two different ways: • Iteratively, or • Recursively. in your code let the user ente n as input
1. Enter G = (V, E)Results: MIS I of G3. I ← ∅4. V ← V5. while V equals6. Give each vertex v V a random integer r(v).7. parallel V for all v8. if r(v) is the lowest value among all peers.9. I ← I ∪ {v}10. V ← V \ {v ∪ N(v)}With a high degree of probability, this method ends in O(log n)rounds [3]. Lines 7–10 of the method can be executed in parallel, which will speed things up.Make the specified method in Python?
How do I write a java program to count the number of times each finger presses one of the keys using hashSet? When playing music on an Eb Alto Saxophone, the fingers press some keys more than others. For simplicity assume that the music is composed of only 1414 different notes. They are: C D E F G A B in one octave and C D E F G A B in a higher octave. We use c,d,e,f,g,a,b,C,D,E,F,G,A,B to represent them. The fingers typically used for each note are: c: finger 22-44, 77-1010 d: finger 22-44, 77-99 e: finger 22-44, 77, 88 f: finger 22-44, 77 g: finger 22-44 a: finger 22, 33 b: finger 22 C: finger 33 D: finger 11-44, 77-99 E: finger 11-44, 77, 88 F: finger 11-44, 77 G: finger 11-44 A: finger 11-33 B: finger 11-22 (Note that every finger is controlling a specific key, different fingers are controlling different keys.) A finger presses a key if it is needed in a note, and if that same finger is not used in the note previously played. Naturally, every key…
We were given the following code to solve a Pentomino puzzle, several methods might need to be added or editted to solve the problem. The program should take in an input of 3 4 5 6 for 3x20 4x15 5x12 6x10 grids. Then output the number of correct solutions for them (respectively its 2, 368, 1010, and 2339) import java.util.ArrayList;import java.util.LinkedList;import java.util.List; public class DLX { class DataNode { DataNode L, R, U, D; ColumnNode C; public DataNode() { L = R = U = D = this; } public DataNode(ColumnNode c) { this(); C = c; } DataNode linkDown(DataNode node) { node.D = this.D; node.D.U = node; node.U = this; this.D = node; return node; } DataNode linkRight(DataNode node) { node.R = this.R; node.R.L = node; node.L = this; this.R = node; return node;…
I need help with my Optimizing the intermediate code to improve the efficiency of the generated machine code. I need to improve the effixiency of the generated machine code import java.util.*; public class SimpleCalculator { private final String input; private int position; private boolean hasDivByZero = false; private Map<String, String> symbolTable; private List<String> instructions; public SimpleCalculator(String input) { this.input = input; this.position = 0; this.symbolTable = new HashMap<>(); this.instructions = new ArrayList<>(); } public static void main(String[] args) { SimpleCalculator calculator = new SimpleCalculator("3 + 5 * (2 - 1)"); calculator.parseExpression(); if (calculator.hasDivByZero) { System.out.println("Error: division by zero"); } else { System.out.println("Result: " + calculator.instructions); } } public void parseExpression() { String t1 = parseTerm(); while (true) { String op = null; if (consume('+')) { op = "+"; } else if…
Write in Java - Make sure the -3 is in the output Write a recursive method called printNumPattern() to output the following number pattern. Given a positive integer as input (Ex: 12), subtract another positive integer (Ex: 3) continually until a negative value is reached, and then continually add the second integer until the first integer is again reached. For this lab, do not end output with a newline.
JAVA In order to compute a power of two, you can take the next-lower power and double it. For example, if you want to compute 2^11 and you know that 2^10=1024, then 2^11=2×1024=2048. Write a recursive method public static int pow2(int n) where n is the exponent, that is based on this observation. If the exponent is negative, return -1. import java.util.Scanner; public class PowerTwo{ public static int pow2(int n) { /* code goes here */ } public static void main(String[] args) { Scanner in = new Scanner(System.in); while (in.hasNextInt()) { int exponent = in.nextInt(); System.out.println(pow2(exponent)); } }}