I need help solving this in JAVA. The code is split between the two photos Add two more statements to main() to test inputs 3 and-1. Use print statements similar to the existing one (don't use assert).373020 2041158.qx3zqy71 import java.util.Scanner;3 public class UnitTesting {// Method returns origNum cubedpublic static int cubeNum(int origNum) {return origNum * origNum}4AllpaorigNum;78.public static void main (String args) {10System.out.println("Testing started");System.out.println("2, expecting 8, got:11+ cubeNum(2));%D121314* Your solution goes here*/15 373020.2041158.qx3zqy7// Method returns origNum cubedpublic static int cubeNum(int origNum) {return origNum * origNum * origNum;}46.89.public static void main (String args) {1011System.out.println("Testing started");System.out.println("2, expecting 8, got: " + cubeNum(2));12%3D1314* Your solution goes here*/1516System.out.println("Testing completed");}1718 }

Java test case code to test the input 3 and -1

Add two more statements to main() to test inputs 3 and-1. Use print statements similar to the existing one (don't use assert). 373020 2041158.q3zay7 1 import java.util.Scanner; 2. 3 public class UnitTesting { // Method returns origNum cubed public static int cubeNum(int origNum) { 6. return origNum * origNum * origNum; 7. } 8. public static void main (String args) { 6. 10 System.out.println("Testing started"); System.out.println("2, expecting 8, got: 11 12 + cubeNum(2)); 13 14 V* Your solution goes here 15

Add two more statements to main() to test inputs 3 and-1. Use print statements similar to the existing one (don't use assert). 373020 2041158.q3zay7 1 import java.util.Scanner; 2. 3 public class UnitTesting { // Method returns origNum cubed public static int cubeNum(int origNum) { 6. return origNum * origNum * origNum; 7. } 8. public static void main (String args) { 6. 10 System.out.println("Testing started"); System.out.println("2, expecting 8, got: 11 12 + cubeNum(2)); 13 14 V* Your solution goes here 15

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

You are working as a software developer on NASA's Mars Explorer robotic rover project. You need to implement some code to compute the surface area of the 3D, tube-shaped part shown below: a cylinder of radius r and height h (in units centimeters) with a hollowed-out center also in the shape of a cylinder with radius n and height h (also in cm). Both the outside and the inside of the tube will need to be coated in a thin layer of gold, which is why we need to know its surface area. Write code that will compute and print the total surface area of the shape. n esc r Examples: Inputs r = 10, n = 8.5, h = 22.5 r = 9.25, n = 6.8, h r = 4.15, n = 3.9, h = 11.7 = 12.16 X h Output Value 2789.7342763877364 1473.347264273195 604.4267185874082 2 3 80 F3 000 DO F4 ✓0 F5 完成时间:18:42 PNEUE MacBook Air F6 F7 DII F8 tv 8 F9 F10 F
However, the statements are in the wrong order, and there are some bugs in this program. Rearrange thestatements and also find and remove the bugs so that the program can run properly. SHOW THE CODES IN ANY JAVA APPLICATION LIKE JCRATOR AND ECLIPSE. OUTPUT SHOULD SATIESFIED THE PROBLEM. SHOW THE IMAGE OF THE CODES PERFORMING IT
Which one is greater 0.0 or double minimum value in java. Also verify your answer.
How to print all permutations of a String in Java.. Write code.
I'm developing a card game that requires one deck of 52 cards using Java. The 52 card has 4 suits from top to bottom: diamonds (d), clubs (c), hearts (h), and spades (s). Each card has a point. From the code I've given, I want the program to perform the same but using comparator/comparable instead of hashmaps. The rest of the instructions are in the images just for reference purposes. import java.util.HashMap; import java.io.*; public class CardPointsList { static HashMap<String,Integer> Code = new HashMap<>(); static HashMap<Character,Integer> Order = new HashMap<>(); static String[][] hand= {{ "c5","s6","sK","dK","dA"},{"s7","s4","dJ","sA","h5"},{"sQ","d3","c9","hK","d5"}}; static int[] scores={0,0,0}; public static void sortHand() { String temp; for (int h=0;h<3;h++) {for (int i=0;i<5;i++) { for (int j=i+1;j<5;j++) { if (hand[h][j].charAt(0) < hand[h][i].charAt(0)) {temp =…
Please answer: 2,3,4,5,6,7,8,10
JAVA Draw a pokemon character using lines and shapes. Apply colors.
Write a code in JavaScript to calculate the area of a sphere with output.
Use Java Draw two identical Cars at two different locations. You will do this by using relative positioning instead of absolute positioning, that is, you must position the components of your Car relative to a base location 1. Say you wanted to put the Car at the position (100, 100). What would the code look like in Java? 2. How can we abstract the code you wrote for question one such that we can plug in any (x, y) coordinate and create your Car relative to that position? 3. Would it be advantageous for us to create methods to draw each of the individual components of the Car and then write another method that calls each of these methods in succession? Why or why not? 4. Write out a chunk of your method (about 5 lines of the body plus the header), and diagram these parts For the implementation, you will write a method to draw your Car based on coordinates passed to it. To help you, keep the following in mind:1. There are four variables given in P2Start.java: (x1, y1) is the location of…
In python. Include docstring. Please follow requirements as listed below. Thanks. You are given a puzzle consisting of a row of squares that contain nonnegative integers, with a zero in the rightmost square. Keep in mind that it's possible for other squares to contain a zero. You have a token that starts on the leftmost square. On each turn, the token can shift left or right a number of squares exactly equal to the value in its current square, but is not allowed to move off either end. For example, if the row of squares contains these values: [2, 4, 5, 3, 1, 3, 1, 4, 0], then on the first turn the only legal move is to shift right two squares, because the starting square contains a 2, and the token can't move off the left end. The goal is to get the token to the rightmost square (that contains zero). This row has a solution (more than one), but not all rows do. If we start with the row [1, 3, 2, 1, 3, 4, 0], then there is no way for the token to reach the rightmost square. Write a…
Asking for a string of letters is an easy Java problem. Assigning a numerical code to each letter of the alphabet is done as follows: Print out the reverse numeric code for each letter in the input. Ask whether the procedure has to be repeated, and if so, go back to step 1. It's time to shut it down In addition to your primary strategy, come up with at least two more approaches to creating a solution to this issue.
Write the program in JavaScript.