import java.text.SimpleDateFormat; import java.util.Calendar; import.pdf
•
0 likes•3 views
import java.text.SimpleDateFormat; import java.util.Calendar; import java.util.GregorianCalendar; import java.util.Scanner; class Main { private static Scanner input; public static void main(String args[]) { SimpleDateFormat sdf = new SimpleDateFormat(\"yyyy MMM dd HH:mm:ss\"); System.out.println(\"when to begin taking the medication (Year,month,day of month,hour, minute\"); input = new Scanner(System.in); String begin = input.nextLine(); String[] parts = begin.split(\",\"); Calendar calendar = new GregorianCalendar(Integer.parseInt(parts[0]),Integer.parseInt(parts[1])- 1,Integer.parseInt(parts[2]),Integer.parseInt(parts[3]),Integer.parseInt(parts[4]),00); System.out.println(sdf.format(calendar.getTime())); System.out.println(\"when to end\"); String end = input.nextLine(); String[] parts2 = end.split(\",\"); Calendar calendar2 = new GregorianCalendar(Integer.parseInt(parts2[0]),Integer.parseInt(parts2[1])- 1,Integer.parseInt(parts2[2]),Integer.parseInt(parts2[3]),Integer.parseInt(parts2[4]),00); System.out.println(sdf.format(calendar2.getTime())); System.out.println(\"proper dosage\"); String dosage = input.nextLine(); System.out.println(\"frequency (hours between medication)\"); int frequence = input.nextInt(); calendar.add(Calendar.HOUR_OF_DAY,+ frequence); System.out.println(\"The second scheduled medication is: \" + sdf.format(calendar.getTime())); } } Solution import java.text.SimpleDateFormat; import java.util.Calendar; import java.util.GregorianCalendar; import java.util.Scanner; class Main { private static Scanner input; public static void main(String args[]) { SimpleDateFormat sdf = new SimpleDateFormat(\"yyyy MMM dd HH:mm:ss\"); System.out.println(\"when to begin taking the medication (Year,month,day of month,hour, minute\"); input = new Scanner(System.in); String begin = input.nextLine(); String[] parts = begin.split(\",\"); Calendar calendar = new GregorianCalendar(Integer.parseInt(parts[0]),Integer.parseInt(parts[1])- 1,Integer.parseInt(parts[2]),Integer.parseInt(parts[3]),Integer.parseInt(parts[4]),00); System.out.println(sdf.format(calendar.getTime())); System.out.println(\"when to end\"); String end = input.nextLine(); String[] parts2 = end.split(\",\"); Calendar calendar2 = new GregorianCalendar(Integer.parseInt(parts2[0]),Integer.parseInt(parts2[1])- 1,Integer.parseInt(parts2[2]),Integer.parseInt(parts2[3]),Integer.parseInt(parts2[4]),00); System.out.println(sdf.format(calendar2.getTime())); System.out.println(\"proper dosage\"); String dosage = input.nextLine(); System.out.println(\"frequency (hours between medication)\"); int frequence = input.nextInt(); calendar.add(Calendar.HOUR_OF_DAY,+ frequence); System.out.println(\"The second scheduled medication is: \" + sdf.format(calendar.getTime())); } }.
Report
Share
Report
Share
Download to read offline
![import java.text.SimpleDateFormat; import java.util.Calendar; import
java.util.GregorianCalendar; import java.util.Scanner; class Main { private static Scanner
input; public static void main(String args[]) { SimpleDateFormat sdf = new
SimpleDateFormat("yyyy MMM dd HH:mm:ss"); System.out.println("when to begin
taking the medication (Year,month,day of month,hour, minute"); input = new
Scanner(System.in); String begin = input.nextLine(); String[] parts = begin.split(",");
Calendar calendar = new
GregorianCalendar(Integer.parseInt(parts[0]),Integer.parseInt(parts[1])-
1,Integer.parseInt(parts[2]),Integer.parseInt(parts[3]),Integer.parseInt(parts[4]),00);
System.out.println(sdf.format(calendar.getTime())); System.out.println("when to end");
String end = input.nextLine(); String[] parts2 = end.split(","); Calendar calendar2 =
new GregorianCalendar(Integer.parseInt(parts2[0]),Integer.parseInt(parts2[1])-
1,Integer.parseInt(parts2[2]),Integer.parseInt(parts2[3]),Integer.parseInt(parts2[4]),00);
System.out.println(sdf.format(calendar2.getTime())); System.out.println("proper
dosage"); String dosage = input.nextLine(); System.out.println("frequency (hours
between medication)"); int frequence = input.nextInt();
calendar.add(Calendar.HOUR_OF_DAY,+ frequence); System.out.println("The second
scheduled medication is: " + sdf.format(calendar.getTime())); } }
Solution
import java.text.SimpleDateFormat; import java.util.Calendar; import
java.util.GregorianCalendar; import java.util.Scanner; class Main { private static Scanner
input; public static void main(String args[]) { SimpleDateFormat sdf = new
SimpleDateFormat("yyyy MMM dd HH:mm:ss"); System.out.println("when to begin
taking the medication (Year,month,day of month,hour, minute"); input = new
Scanner(System.in); String begin = input.nextLine(); String[] parts = begin.split(",");
Calendar calendar = new
GregorianCalendar(Integer.parseInt(parts[0]),Integer.parseInt(parts[1])-
1,Integer.parseInt(parts[2]),Integer.parseInt(parts[3]),Integer.parseInt(parts[4]),00);
System.out.println(sdf.format(calendar.getTime())); System.out.println("when to end");
String end = input.nextLine(); String[] parts2 = end.split(","); Calendar calendar2 =
new GregorianCalendar(Integer.parseInt(parts2[0]),Integer.parseInt(parts2[1])-
1,Integer.parseInt(parts2[2]),Integer.parseInt(parts2[3]),Integer.parseInt(parts2[4]),00);
System.out.println(sdf.format(calendar2.getTime())); System.out.println("proper
dosage"); String dosage = input.nextLine(); System.out.println("frequency (hours
between medication)"); int frequence = input.nextInt();](https://image.slidesharecdn.com/importjava-230409021904-ec41cac1/85/import-java-text-SimpleDateFormat-import-java-util-Calendar-import-pdf-1-320.jpg)
Recommended
Factors.javaimport java.io.; import java.util.Scanner; class .pdf
Factors.java
import java.io.*;
import java.util.Scanner;
class Factors
{
public static void main(String args[])
{
int a,i;
Scanner in = new Scanner(System.in);
System.out.println(\"Enter an integer\");
a = in.nextInt();
System.out.println(\"You entered integer \"+a);
System.out.print(\"\ \");
System.out.print(\"The factors are : \");
for(i=1;i<=a/2;i++)
{
if(a%i==0)
System.out.print(i+\",\");
}
System.out.print(a);
}
}
Output:
Enter an integer
44
You entered integer 44
The factors are : 1,2,4,11,22,44
Solution
Factors.java
import java.io.*;
import java.util.Scanner;
class Factors
{
public static void main(String args[])
{
int a,i;
Scanner in = new Scanner(System.in);
System.out.println(\"Enter an integer\");
a = in.nextInt();
System.out.println(\"You entered integer \"+a);
System.out.print(\"\ \");
System.out.print(\"The factors are : \");
for(i=1;i<=a/2;i++)
{
if(a%i==0)
System.out.print(i+\",\");
}
System.out.print(a);
}
}
Output:
Enter an integer
44
You entered integer 44
The factors are : 1,2,4,11,22,44.
MagicSquareTest.java import java.util.Scanner;public class Mag.pdf
MagicSquareTest.java
import java.util.Scanner;
public class MagicSquareTest {
/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner scan = new Scanner(System.in);
System.out.println(\"Enter Number of rows:\");
int rows = scan.nextInt();
System.out.println(\"Enter Nummber of columns:\");
int cols = scan.nextInt();
int a[][] = new int[rows][cols];
System.out.println(\"Enter matrix elements;\");
for(int i=0; i
Solution
MagicSquareTest.java
import java.util.Scanner;
public class MagicSquareTest {
/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner scan = new Scanner(System.in);
System.out.println(\"Enter Number of rows:\");
int rows = scan.nextInt();
System.out.println(\"Enter Nummber of columns:\");
int cols = scan.nextInt();
int a[][] = new int[rows][cols];
System.out.println(\"Enter matrix elements;\");
for(int i=0; i.
Java programs
The document contains code snippets in Java for getting different types of information. This includes code to get the hostname, month from a date, IP address, memory size and usage, and more. The code uses various Java classes and methods like InetAddress, DateFormat, Runtime etc. to retrieve the desired information and print/return the output.
WAP to add two given matrices in Java
The document contains code to add two matrices of given size. It takes the number of rows and columns as input to create two matrices of that size. It then takes elements of both matrices as input and stores them. It iterates through both matrices to add the elements and stores the result in a third sum matrix. Finally, it prints the sum matrix.
Oot practical
The document contains 10 Java programs to solve common mathematical and logical problems:
1) A program to calculate the factorial of a number.
2) A program to add two matrices.
3) A program to calculate the sum of two numbers.
4) A program to reverse a number.
5) A program to check if a number is an Armstrong number.
6) A program to find the largest of three numbers.
7) A program to output the current date and time.
8) A program to check if a string is a palindrome.
9) A program to print prime numbers up to a given limit.
10) A program to swap two numbers.
JAVA Question : Programming Assignment
Looking for Java assignment assistance? Discover Coding Assignment Help, your ultimate destination for expert guidance! 🌟 Our skilled Java programmers are here to provide tailored solutions that will help you conquer any coding task. Follow us on Pinterest for valuable resources, tips, and inspiration to enhance your Java skills and achieve academic success!
Visit : https://www.codingassignmenthelp.com/
WINSEM2020-21_STS3105_SS_VL2020210500169_Reference_Material_I_17-Feb-2021_L8-...
The document contains 5 programming questions and their solutions in Java. Each question is about a different programming concept: 1) Adding matrices, 2) Finding the transpose of a matrix, 3) Multiplying matrices, 4) Printing words starting with vowels. For each question, it provides the problem statement, sample input/output, and the Java code solution.
Write the program in MIPS that declares an array of positive integer.pdf
Write the program in MIPS that declares an array of positive integers. The size of the array is not
fixed. The final element of the array should have the value of 0xF, which is not used in
calculations, and should be used to calculate the size of the array. The program can prompt the
user for an integer input. Compare the input with the array. Display the index of the input in the
array if found. If the number does not match any element in the array, insert the number in the
array in sorted order. The program is terminated when input a negative integer. Print the new
array with appropriate message on the screen. For example assume an array as follows:
(array: .word 4, 5, 23, 5, 8, 3, 15, 67, 8, 9, 0xF)
Sorted array: 3, 4, 5, 5, 8, 8, 9, 15, 23, 67
Enter a number to search: 20
Number not found. Added to array.
Sorted array: 3, 4, 5, 5, 8, 8, 9, 15, 20, 23, 67
Enter a number to search: 5
Number at index 2
Solution
import java.util.Scanner;
public category Ascending _Order
for (int i = 0; i < n; i++)
temporary worker = a[i];
a[i] = a[j];
a[j] = temp;
}
}
}
System.out.print(\"Ascending Order:\");
for (int i = 0; i < n - 1; i++)
import java.util.Scanner;
public category Ascending _Order
for (int i = 0; i < n; i++)
temporary worker = a[i];
a[i] = a[j];
a[j] = temp;
}
}
}
System.out.print(\"Ascending Order:\");
for (int i = 0; i < n - 1; i++)
import java.util.Scanner;
public category Ascending _Order
for (int i = 0; i < n; i++)
temporary worker = a[i];
a[i] = a[j];
a[j] = temp;
}
}
}
System.out.print(\"Ascending Order:\");
for (int i = 0; i < n - 1; i++)
import java.util.Scanner;
public category Ascending _Order
for (int i = 0; i < n; i++)
temporary worker = a[i];
a[i] = a[j];
a[j] = temp;
}
}
}
System.out.print(\"Ascending Order:\");
for (int i = 0; i < n - 1; i++)
import java.util.Scanner;
public category Ascending _Order
for (int i = 0; i < n; i++)
temporary worker = a[i];
a[i] = a[j];
a[j] = temp;
}
}
}
System.out.print(\"Ascending Order:\");
for (int i = 0; i < n - 1; i++)
import java.util.Scanner;
public category Ascending _Order
for (int i = 0; i < n; i++)
temporary worker = a[i];
a[i] = a[j];
a[j] = temp;
}
}
}
System.out.print(\"Ascending Order:\");
for (int i = 0; i < n - 1; i++)
import java.util.Scanner;
public category Ascending _Order
for (int i = 0; i < n; i++)
temporary worker = a[i];
a[i] = a[j];
a[j] = temp;
}
}
}
System.out.print(\"Ascending Order:\");
for (int i = 0; i < n - 1; i++)
import java.util.Scanner;
public category Ascending _Order
for (int i = 0; i < n; i++)
temporary worker = a[i];
a[i] = a[j];
a[j] = temp;
}
}
}
System.out.print(\"Ascending Order:\");
for (int i = 0; i < n - 1; i++)
import java.util.Scanner;
public category Ascending _Order
for (int i = 0; i < n; i++)
temporary worker = a[i];
a[i] = a[j];
a[j] = temp;
}
}
}
System.out.print(\"Ascending Order:\");
for (int i = 0; i < n - 1; i++)
import java.util.Scanner;
public category Ascending _Order
for (int i = 0; i < n; i++)
temporary worker = a[i];
a[i] = a[j];
a.
Recommended
Factors.javaimport java.io.; import java.util.Scanner; class .pdf
Factors.java
import java.io.*;
import java.util.Scanner;
class Factors
{
public static void main(String args[])
{
int a,i;
Scanner in = new Scanner(System.in);
System.out.println(\"Enter an integer\");
a = in.nextInt();
System.out.println(\"You entered integer \"+a);
System.out.print(\"\ \");
System.out.print(\"The factors are : \");
for(i=1;i<=a/2;i++)
{
if(a%i==0)
System.out.print(i+\",\");
}
System.out.print(a);
}
}
Output:
Enter an integer
44
You entered integer 44
The factors are : 1,2,4,11,22,44
Solution
Factors.java
import java.io.*;
import java.util.Scanner;
class Factors
{
public static void main(String args[])
{
int a,i;
Scanner in = new Scanner(System.in);
System.out.println(\"Enter an integer\");
a = in.nextInt();
System.out.println(\"You entered integer \"+a);
System.out.print(\"\ \");
System.out.print(\"The factors are : \");
for(i=1;i<=a/2;i++)
{
if(a%i==0)
System.out.print(i+\",\");
}
System.out.print(a);
}
}
Output:
Enter an integer
44
You entered integer 44
The factors are : 1,2,4,11,22,44.
MagicSquareTest.java import java.util.Scanner;public class Mag.pdf
MagicSquareTest.java
import java.util.Scanner;
public class MagicSquareTest {
/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner scan = new Scanner(System.in);
System.out.println(\"Enter Number of rows:\");
int rows = scan.nextInt();
System.out.println(\"Enter Nummber of columns:\");
int cols = scan.nextInt();
int a[][] = new int[rows][cols];
System.out.println(\"Enter matrix elements;\");
for(int i=0; i
Solution
MagicSquareTest.java
import java.util.Scanner;
public class MagicSquareTest {
/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner scan = new Scanner(System.in);
System.out.println(\"Enter Number of rows:\");
int rows = scan.nextInt();
System.out.println(\"Enter Nummber of columns:\");
int cols = scan.nextInt();
int a[][] = new int[rows][cols];
System.out.println(\"Enter matrix elements;\");
for(int i=0; i.
Java programs
The document contains code snippets in Java for getting different types of information. This includes code to get the hostname, month from a date, IP address, memory size and usage, and more. The code uses various Java classes and methods like InetAddress, DateFormat, Runtime etc. to retrieve the desired information and print/return the output.
WAP to add two given matrices in Java
The document contains code to add two matrices of given size. It takes the number of rows and columns as input to create two matrices of that size. It then takes elements of both matrices as input and stores them. It iterates through both matrices to add the elements and stores the result in a third sum matrix. Finally, it prints the sum matrix.
Oot practical
The document contains 10 Java programs to solve common mathematical and logical problems:
1) A program to calculate the factorial of a number.
2) A program to add two matrices.
3) A program to calculate the sum of two numbers.
4) A program to reverse a number.
5) A program to check if a number is an Armstrong number.
6) A program to find the largest of three numbers.
7) A program to output the current date and time.
8) A program to check if a string is a palindrome.
9) A program to print prime numbers up to a given limit.
10) A program to swap two numbers.
JAVA Question : Programming Assignment
Looking for Java assignment assistance? Discover Coding Assignment Help, your ultimate destination for expert guidance! 🌟 Our skilled Java programmers are here to provide tailored solutions that will help you conquer any coding task. Follow us on Pinterest for valuable resources, tips, and inspiration to enhance your Java skills and achieve academic success!
Visit : https://www.codingassignmenthelp.com/
WINSEM2020-21_STS3105_SS_VL2020210500169_Reference_Material_I_17-Feb-2021_L8-...
The document contains 5 programming questions and their solutions in Java. Each question is about a different programming concept: 1) Adding matrices, 2) Finding the transpose of a matrix, 3) Multiplying matrices, 4) Printing words starting with vowels. For each question, it provides the problem statement, sample input/output, and the Java code solution.
Write the program in MIPS that declares an array of positive integer.pdf
Write the program in MIPS that declares an array of positive integers. The size of the array is not
fixed. The final element of the array should have the value of 0xF, which is not used in
calculations, and should be used to calculate the size of the array. The program can prompt the
user for an integer input. Compare the input with the array. Display the index of the input in the
array if found. If the number does not match any element in the array, insert the number in the
array in sorted order. The program is terminated when input a negative integer. Print the new
array with appropriate message on the screen. For example assume an array as follows:
(array: .word 4, 5, 23, 5, 8, 3, 15, 67, 8, 9, 0xF)
Sorted array: 3, 4, 5, 5, 8, 8, 9, 15, 23, 67
Enter a number to search: 20
Number not found. Added to array.
Sorted array: 3, 4, 5, 5, 8, 8, 9, 15, 20, 23, 67
Enter a number to search: 5
Number at index 2
Solution
import java.util.Scanner;
public category Ascending _Order
for (int i = 0; i < n; i++)
temporary worker = a[i];
a[i] = a[j];
a[j] = temp;
}
}
}
System.out.print(\"Ascending Order:\");
for (int i = 0; i < n - 1; i++)
import java.util.Scanner;
public category Ascending _Order
for (int i = 0; i < n; i++)
temporary worker = a[i];
a[i] = a[j];
a[j] = temp;
}
}
}
System.out.print(\"Ascending Order:\");
for (int i = 0; i < n - 1; i++)
import java.util.Scanner;
public category Ascending _Order
for (int i = 0; i < n; i++)
temporary worker = a[i];
a[i] = a[j];
a[j] = temp;
}
}
}
System.out.print(\"Ascending Order:\");
for (int i = 0; i < n - 1; i++)
import java.util.Scanner;
public category Ascending _Order
for (int i = 0; i < n; i++)
temporary worker = a[i];
a[i] = a[j];
a[j] = temp;
}
}
}
System.out.print(\"Ascending Order:\");
for (int i = 0; i < n - 1; i++)
import java.util.Scanner;
public category Ascending _Order
for (int i = 0; i < n; i++)
temporary worker = a[i];
a[i] = a[j];
a[j] = temp;
}
}
}
System.out.print(\"Ascending Order:\");
for (int i = 0; i < n - 1; i++)
import java.util.Scanner;
public category Ascending _Order
for (int i = 0; i < n; i++)
temporary worker = a[i];
a[i] = a[j];
a[j] = temp;
}
}
}
System.out.print(\"Ascending Order:\");
for (int i = 0; i < n - 1; i++)
import java.util.Scanner;
public category Ascending _Order
for (int i = 0; i < n; i++)
temporary worker = a[i];
a[i] = a[j];
a[j] = temp;
}
}
}
System.out.print(\"Ascending Order:\");
for (int i = 0; i < n - 1; i++)
import java.util.Scanner;
public category Ascending _Order
for (int i = 0; i < n; i++)
temporary worker = a[i];
a[i] = a[j];
a[j] = temp;
}
}
}
System.out.print(\"Ascending Order:\");
for (int i = 0; i < n - 1; i++)
import java.util.Scanner;
public category Ascending _Order
for (int i = 0; i < n; i++)
temporary worker = a[i];
a[i] = a[j];
a[j] = temp;
}
}
}
System.out.print(\"Ascending Order:\");
for (int i = 0; i < n - 1; i++)
import java.util.Scanner;
public category Ascending _Order
for (int i = 0; i < n; i++)
temporary worker = a[i];
a[i] = a[j];
a.
please help finish sorting methods- import java-util-Arrays- import ja.pdf
please help finish sorting methods:
import java.util.Arrays;
import java.io.PrintWriter;
import java.io.File;
import java.util.Scanner;
public class SortTimes
{
/* convert nanos to seconds */
static final double ONE_BILLION = 1_000_000_000.;
/* sizes of input range should range up to 512k elements */
static int[] sizes = new int[32];
public static void main(String[] args) throws Exception
{
int sIdx = 0;
long startTime;
long endTime;
double time;
int size = 128*1024/sizes.length;
/* let's make size smaller, comment out this next line and see what happens */
size = 16*1024/sizes.length;
for( int i=0; i<sizes.length; i++ ) {
sizes[i] = (i+1)*size;
}
Scanner inp = new Scanner(System.in);
System.out.print("What is your last name? ");
String lastName = inp.next();
PrintWriter pw = new PrintWriter(new File(lastName + "_sortTimes.csv"));
pw.println( "Size, BubbleSort, MergeSort, QuickSort, JavaSort, BubbleSort (Sorted Array),
MergeSort (Sorted Array), QuickSort (Sorted Array), JavaSort (Sorted Array)" );
while( sIdx < sizes.length )
{
int[] A = new int[sizes[sIdx]];
int[] B = new int[sizes[sIdx]];
int[] C = new int[sizes[sIdx]];
int[] D = new int[sizes[sIdx]];
int[] E = new int[sizes[sIdx]];
for( int i=0; i<A.length; i++ )
{
A[i] = (int)(Math.random()*sizes[sIdx]*2);
B[i] = A[i];
C[i] = A[i];
D[i] = A[i];
E[i] = 1000; // Array E is used for testing algo on array that is already sorted.
}
System.out.println();
System.out.println("--------------------------------------------------");
System.out.println("Initial Values: ");
printArray(A);
pw.print(A.length + ", ");
System.out.println( "Starting bubble sort ---------------- Size = " + B.length);
startTime = System.nanoTime();
bubbleSort(A);
endTime = System.nanoTime();
time = (endTime - startTime) / ONE_BILLION;
System.out.println( "Bubble sort finished - time = " + time + " seconds" );
pw.print(time + ", ");
printArray(A);
System.out.println();
System.out.println( "Starting merge sort ---------------- Size = " + C.length);
startTime = System.nanoTime();
mergeSort(B);
endTime = System.nanoTime();
time = (endTime - startTime) / ONE_BILLION;
System.out.println( "Merge sort finished - time = " + time + " seconds.");
pw.print(time + ", ");
printArray(B);
System.out.println();
System.out.println( "Starting quick sort ---------------- Size = " + D.length);
startTime = System.nanoTime();
quickSort(C);
endTime = System.nanoTime();
time = (endTime - startTime) / ONE_BILLION;
System.out.println( "quickSort finished - time = " + time + " seconds." );
pw.print(time + ", ");
printArray(C);
System.out.println();
System.out.println( "Starting java's Array sort ---------------- Size = " + D.length);
startTime = System.nanoTime();
javaSort(D);
endTime = System.nanoTime();
time = (endTime - startTime) / ONE_BILLION;
System.out.println( "Java's Array sort finished - time = " + time + " seconds." );
pw.print(time + ", ");
printArray(D);
System.out.println();
System.out.println( "Starting bubble sort on sorted array -------.
DS LAB RECORD.docx
The document contains Java code examples for implementing various data structures and algorithms using arrays. It includes programs for linear search, binary search, stack, queue, and converting an infix expression to postfix notation. For linear search, both recursive and non-recursive functions are provided. Similarly, for binary search and converting infix to postfix, both recursive and non-recursive approaches are demonstrated. The programs have main methods that accept user input and demonstrate the functionality of each implementation through sample outputs.
import java-util-Arrays- import java-io-PrintWriter- import java-io-Fi.pdf
import java.util.Arrays;
import java.io.PrintWriter;
import java.io.File;
import java.util.Scanner;
public class SortTimes
{
/* convert nanos to seconds */
static final double ONE_BILLION = 1_000_000_000.;
/* sizes of input range should range up to 512k elements */
static int[] sizes = new int[32];
public static void main(String[] args) throws Exception
{
int sIdx = 0;
long startTime;
long endTime;
double time;
int size = 128*1024/sizes.length;
/* let's make size smaller, comment out this next line and see what happens */
size = 16*1024/sizes.length;
for( int i=0; i<sizes.length; i++ ) {
sizes[i] = (i+1)*size;
}
Scanner inp = new Scanner(System.in);
System.out.print("What is your last name? ");
String lastName = inp.next();
PrintWriter pw = new PrintWriter(new File(lastName + "_sortTimes.csv"));
pw.println( "Size, BubbleSort, MergeSort, QuickSort, JavaSort, BubbleSort (Sorted Array),
MergeSort (Sorted Array), QuickSort (Sorted Array), JavaSort (Sorted Array)" );
while( sIdx < sizes.length )
{
int[] A = new int[sizes[sIdx]];
int[] B = new int[sizes[sIdx]];
int[] C = new int[sizes[sIdx]];
int[] D = new int[sizes[sIdx]];
int[] E = new int[sizes[sIdx]];
for( int i=0; i<A.length; i++ )
{
A[i] = (int)(Math.random()*sizes[sIdx]*2);
B[i] = A[i];
C[i] = A[i];
D[i] = A[i];
E[i] = 1000; // Array E is used for testing algo on array that is already sorted.
}
System.out.println();
System.out.println("--------------------------------------------------");
System.out.println("Initial Values: ");
printArray(A);
pw.print(A.length + ", ");
System.out.println( "Starting bubble sort ---------------- Size = " + B.length);
startTime = System.nanoTime();
bubbleSort(A);
endTime = System.nanoTime();
time = (endTime - startTime) / ONE_BILLION;
System.out.println( "Bubble sort finished - time = " + time + " seconds" );
pw.print(time + ", ");
printArray(A);
System.out.println();
System.out.println( "Starting merge sort ---------------- Size = " + C.length);
startTime = System.nanoTime();
mergeSort(B);
endTime = System.nanoTime();
time = (endTime - startTime) / ONE_BILLION;
System.out.println( "Merge sort finished - time = " + time + " seconds.");
pw.print(time + ", ");
printArray(B);
System.out.println();
System.out.println( "Starting quick sort ---------------- Size = " + D.length);
startTime = System.nanoTime();
quickSort(C);
endTime = System.nanoTime();
time = (endTime - startTime) / ONE_BILLION;
System.out.println( "quickSort finished - time = " + time + " seconds." );
pw.print(time + ", ");
printArray(C);
System.out.println();
System.out.println( "Starting java's Array sort ---------------- Size = " + D.length);
startTime = System.nanoTime();
javaSort(D);
endTime = System.nanoTime();
time = (endTime - startTime) / ONE_BILLION;
System.out.println( "Java's Array sort finished - time = " + time + " seconds." );
pw.print(time + ", ");
printArray(D);
System.out.println();
System.out.println( "Starting bubble sort on sorted array ---------------- Size = " + B.length);
star.
WINSEM2020-21_STS3105_SS_VL2020210500169_Reference_Material_I_15-Feb-2021_L6-...
The document contains sample code snippets for 7 questions related to arrays in Java. For each question, it provides the problem statement, sample input, sample output, and the Java code to solve the problem. The problems include searching for an element in an array, finding the number of occurrences of an element, finding the largest element, finding pairs with a given sum, rotating an array, finding the unique element, and checking if an array is a palindrome. It also includes 2 multiple choice questions to predict the output of code snippets.
Hi,I have updated your code. It is working fine now. Highllighted .pdf
Hi,
I have updated your code. It is working fine now. Highllighted all code changes below.
Shapes.java
import java.util.Scanner;
public class Shapes
{
private int radius;
public Shapes(int radius){
this.radius = radius;
}
public void setradius( int radius )
{
}
public int getradius()
{
return radius;
}
public void report()
{
System.out.printf( \"Circle perimeter, area / Sphere volume:\");
System.out.println();
System.out.printf( \" perimeter : \" + 2. * Math.PI * getradius());
System.out.println();
System.out.printf( \" area : \" + Math.PI * getradius() * 1.);
System.out.println();
System.out.printf( \" volume : \" + (4 * Math.PI * Math.pow(getradius(),3)/3));
System.out.println();
System.out.printf( \"Square perimeter, area:\");
System.out.println();
System.out.printf( \" perimeter : \" + 2 *Math.E * 1.);
System.out.println();
System.out.printf( \" area : \" + Math.E * 1.* 1);
System.out.println();
}
public static void main( String[] args )
{
//System.out.printf( \"Radius (as integer) of bounding sphere?\ %s!\ \", getradius() );
Scanner input = new Scanner( System.in );
System.out.println(\"Enter the radius:\");
int radius = input.nextInt();
Shapes s = new Shapes(radius);
s.report();
}
}
Output:
import java.util.Scanner;
public class Shapes
{
private int radius;
public Shapes(int radius){
this.radius = radius;
}
public void setradius( int radius )
{
}
public int getradius()
{
return radius;
}
public void report()
{
System.out.printf( \"Circle perimeter, area / Sphere volume:\");
System.out.println();
System.out.printf( \" perimeter : \" + 2. * Math.PI * getradius());
System.out.println();
System.out.printf( \" area : \" + Math.PI * getradius() * 1.);
System.out.println();
System.out.printf( \" volume : \" + (4 * Math.PI * Math.pow(getradius(),3)/3));
System.out.println();
System.out.printf( \"Square perimeter, area:\");
System.out.println();
System.out.printf( \" perimeter : \" + 2 *Math.E * 1.);
System.out.println();
System.out.printf( \" area : \" + Math.E * 1.* 1);
System.out.println();
}
public static void main( String[] args )
{
//System.out.printf( \"Radius (as integer) of bounding sphere?\ %s!\ \", getradius() );
Scanner input = new Scanner( System.in );
System.out.println(\"Enter the radius:\");
int radius = input.nextInt();
Shapes s = new Shapes(radius);
s.report();
}
}
Solution
Hi,
I have updated your code. It is working fine now. Highllighted all code changes below.
Shapes.java
import java.util.Scanner;
public class Shapes
{
private int radius;
public Shapes(int radius){
this.radius = radius;
}
public void setradius( int radius )
{
}
public int getradius()
{
return radius;
}
public void report()
{
System.out.printf( \"Circle perimeter, area / Sphere volume:\");
System.out.println();
System.out.printf( \" perimeter : \" + 2. * Math.PI * getradius());
System.out.println();
System.out.printf( \" area : \" + Math.PI * getradius() * 1.);
System.out.println();
System.out.printf( \" volume : \" + (4 * Math.PI * Math.pow(getradius(),3)/3).
Computer java programs
The document contains the solutions to 64 programming problems in Java. It provides the code to write programs that can:
1) Display patterns like right angle triangles and pyramids with numbers.
2) Check if a number is negative, zero or positive.
3) Sort arrays and insert or find elements in arrays.
4) Perform operations like calculating averages and separating even/odd numbers in arrays.
3) Find pair sums and rotate/add matrices.
SumNumbers.java import java.util.Scanner;public class SumNumbe.pdf
SumNumbers.java
import java.util.Scanner;
public class SumNumbers {
/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner scan = new Scanner(System.in);
int sum = 0;
while(true){
System.out.println(\"Enter integer:\");
int n = scan.nextInt();
if(n == -1){
break;
}
sum = sum + n;
}
System.out.println(\"The sum is \"+sum);
}
}
Output:
Enter integer:
1
Enter integer:
2
Enter integer:
3
Enter integer:
4
Enter integer:
5
Enter integer:
6
Enter integer:
7
Enter integer:
8
Enter integer:
9
Enter integer:
-1
The sum is 45
Solution
SumNumbers.java
import java.util.Scanner;
public class SumNumbers {
/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner scan = new Scanner(System.in);
int sum = 0;
while(true){
System.out.println(\"Enter integer:\");
int n = scan.nextInt();
if(n == -1){
break;
}
sum = sum + n;
}
System.out.println(\"The sum is \"+sum);
}
}
Output:
Enter integer:
1
Enter integer:
2
Enter integer:
3
Enter integer:
4
Enter integer:
5
Enter integer:
6
Enter integer:
7
Enter integer:
8
Enter integer:
9
Enter integer:
-1
The sum is 45.
Write a Java ProgramSolutionAnswer- Code- import java-io--- import jav.docx
This Java program allows a user to input employee data including name, type of employee (hourly or salaried), hourly rate, hours worked, and regular pay. It then calculates the income for hourly employees based on hours worked and overtime pay, and calculates income for salaried employees based on regular pay and hourly rate. The program outputs the employee name and calculated income.
Java Programs
This document contains code for an Employee class with methods to get employee details from the user, calculate salary based on hours, days, and leave, and print the employee information and salary. It also contains a Salary class to set and get hours, days, leave for salary calculation, and methods to calculate hourly, daily, and permanent salary amounts. Finally, it contains a MyDictionary class with methods to count characters, words, vowels in a file, search for a word, open and close files.
JSR 310. New Date API in Java 8
The document discusses Java 8's new date and time API (JSR 310). It provides examples of using the new classes like LocalDate, LocalTime, LocalDateTime and Instant that model dates, times and timestamps without time zones. It also covers formatting and parsing dates and times, working with time zones using ZoneId and ZonedDateTime, durations using Duration, and periods of time using Period. The document compares the new API to the legacy Date and Calendar classes and notes improvements like immutability and removal of bugs in the previous implementation.
Code javascript
This Java code defines a class called Soal07 that contains a main method for managing a student mark list. The main method uses Scanner objects to accept user input. It displays a menu with options to input student data, view all data, edit data, or exit. Based on the user's selection, it will either prompt the user to enter information for multiple students, display an existing student's data, or allow editing of an existing student's data by re-prompting for input. All student data, including name, ID, and mark, is stored in arrays.
Advanced Java[Extra Concepts, Not Difficult].docx
This is part 2 of my Java Learning Journey. This contains Hashing, ArrayList, LinkedList, Date and Time Classes, Calendar Class and more.
New Java Date/Time API
The document discusses Java 8's date and time API. It introduces the LocalDate, LocalTime, and LocalDateTime classes for working with dates, times, and datetimes respectively without time zones. It also covers the DateTimeFormatter class for formatting and parsing date/time strings using predefined or custom formats. Methods are presented for creating, querying, and manipulating temporal objects, as well as formatting and parsing dates and times.
JAVA.Q4 Create a Time class. This class will represent a point in.pdf
JAVA.
Q4: Create a Time class. This class will represent a point in time, such as a departure time. It
should contain 2 constructors, 2 instance variables (hour and minute), and 10 methods (see
below). All methods but toString should be in terms of the 24 hour format. [30 points]
default constructor: Creates a Time object for 12:00AM.
overloaded constructor: Creates a Time object at a specific hour and minute.
getHour(): Returns an integer representing the hour of the Time object.
getMinute(): Returns an integer representing the minute of the Time object.
addHours(...): Updates the object by moving it forward a number of hours.
addMinute(...): Updates the object by moving it forward a number of minutes. (Hint: Be careful
that you don\'t allow minutes to be more than 59.)
addTime(...): Updates the object by moving it forward by the hour and minute from another
Time object.
getCopy(...): Returns a new Time object that has the same hour and minute of the existing Time
object.
isEarlierThan(...): Returns true if this Time object is earlier than another Time object.
isSameTime(...): Returns true if this Time object is the same as another Time object.
isLaterThan(...): Returns true if this Time object is later than another Time object.
toString(): Returns a string representing the Time object. Uses 12 hour AM/PM format and pads
minutes to be two digits. See the sample output for an example.
Q5: Create a Flight class that uses the Plane and Time class. This class will represent a flight
between two airports, using a specific Plane, and departing at a specific Time. It should contain a
constructor, 7 instance variables (plane, flight number, cost, departure, duration, source,
destination), and 9 methods (see below). [25 points]
overloaded constructor: Creates a Flight object that is setup up with a Plane, a flight number, a
cost, a departure Time, a duration time, a source Airport, and a destination Airport.
getPlane(): Returns the Plane that operates this flight.
getNumber(): Returns the flight number.
getCost(): Returns the flight cost.
getDestination(): Returns the destination Airport.
getDeparture(): Returns the departure Time.
getArrival(): Returns a Time object with the arrival time (computed from the departure time and
duration).
getSource(): Returns a Airport object for the departure location.
toOverviewString(): Returns a String representing an overview of the flight. Use NumberFormat
to display the price. See the sample output for an example.
toDetailedString(): Returns a String representing the flight\'s detail information. See the sample
output for an example.
Included below is an overall UML diagram that describes the three classes you will be
constructing. It provides a useful summary of all of the methods you are expected to implement,
and their corresponding types and visibility. Notice that one private method is listed here
(formatDigits in Time) that isn\'t mentioned above. This is a method that was in our solution, you
may not need.
What's New in C++ 11/14?
It's not your mother's C++ anymore. Manual memory management, tedious loops, difficult-to-use STL algorithms -- are all a thing of the past now. The new C++ 11 standard contains a huge number of improvements to the C++ core language and standard library, and can help C++ developers be more productive.
In this session we will discuss the major features of C++ 11, including lambda functions, type inference for local variables, range-based for loops, smart pointers, and more. We will see how to use these features effectively to modernize your existing C++ programs and how to develop in the modern C++ style.
Yes it is minus 1 (-1). Oxygen is normally -2, bu.pdf
Yes it is minus 1 (-1). Oxygen is normally -2, but once it attaches to an H, it
becomes -1. Hope this confirms it!
Solution
Yes it is minus 1 (-1). Oxygen is normally -2, but once it attaches to an H, it
becomes -1. Hope this confirms it!.
very easy Water formula — H 2 O .pdf
Water is made up of two hydrogen atoms and one oxygen atom. Its chemical formula is H2O. Water is a simple yet essential compound to life on Earth.
TLC or Thin Layer Chromatography is performed on.pdf
TLC or Thin Layer Chromatography: is performed on a sheet of glass, plastic, or
aluminum foil, coated with a layer of either silica gel, aluminium oxide, or cellulose. The layer
of adsorbent material is the stationary phase and the solution added to the plate is the mobile
phase. The mobile phase is drawn up the plate via capillary action. and the separation is achieved
because the analytes ascend the TLC plate at different rates. The various components form spots
on the plate which can be viewed if the samples have a visible color or fluorescent compound are
added to the solution so it is visible under UV light. The spots are then used to calculate retention
factor values. GC. In GC the mobile phase is a carrier gas such as helium or nitrogen. The
stationary phase is a microscopic layer of liquid or polymer on an inert solid support typically
fused silica tubing (the column). The various species are have different affinities for the
stationary phase and will travel through the column at different rates and elute at a different time.
The separated species are can then be analyzed with a multitude different detectors including
flame ionization detector, thermal conductivity detector, and many others. The detector which
provides the most valuable information is a mass spectrometer... this setup is known as GC-MS.
I hope this helps! Please remember to rate!
Solution
TLC or Thin Layer Chromatography: is performed on a sheet of glass, plastic, or
aluminum foil, coated with a layer of either silica gel, aluminium oxide, or cellulose. The layer
of adsorbent material is the stationary phase and the solution added to the plate is the mobile
phase. The mobile phase is drawn up the plate via capillary action. and the separation is achieved
because the analytes ascend the TLC plate at different rates. The various components form spots
on the plate which can be viewed if the samples have a visible color or fluorescent compound are
added to the solution so it is visible under UV light. The spots are then used to calculate retention
factor values. GC. In GC the mobile phase is a carrier gas such as helium or nitrogen. The
stationary phase is a microscopic layer of liquid or polymer on an inert solid support typically
fused silica tubing (the column). The various species are have different affinities for the
stationary phase and will travel through the column at different rates and elute at a different time.
The separated species are can then be analyzed with a multitude different detectors including
flame ionization detector, thermal conductivity detector, and many others. The detector which
provides the most valuable information is a mass spectrometer... this setup is known as GC-MS.
I hope this helps! Please remember to rate!.
The name of the compound is 2-Ethoxyethanol .pdf
The compound is named 2-Ethoxyethanol. 2-Ethoxyethanol is the name of the compound described in the document. The document provides the name of the compound as 2-Ethoxyethanol.
THANKS Solution THANKS .pdf
This very short document consists of only two words: "THANKS" and "Solution". It does not provide enough contextual information to generate a meaningful multi-sentence summary.
Potassium (K) ion has an electron configuration i.pdf
Potassium (K) ion has an electron configuration identical to the inert gas Argon The
iodine ion has an electron configuration identical to the inert gas Xenon.
Solution
Potassium (K) ion has an electron configuration identical to the inert gas Argon The
iodine ion has an electron configuration identical to the inert gas Xenon..
More Related Content
Similar to import java.text.SimpleDateFormat; import java.util.Calendar; import.pdf
please help finish sorting methods- import java-util-Arrays- import ja.pdf
please help finish sorting methods:
import java.util.Arrays;
import java.io.PrintWriter;
import java.io.File;
import java.util.Scanner;
public class SortTimes
{
/* convert nanos to seconds */
static final double ONE_BILLION = 1_000_000_000.;
/* sizes of input range should range up to 512k elements */
static int[] sizes = new int[32];
public static void main(String[] args) throws Exception
{
int sIdx = 0;
long startTime;
long endTime;
double time;
int size = 128*1024/sizes.length;
/* let's make size smaller, comment out this next line and see what happens */
size = 16*1024/sizes.length;
for( int i=0; i<sizes.length; i++ ) {
sizes[i] = (i+1)*size;
}
Scanner inp = new Scanner(System.in);
System.out.print("What is your last name? ");
String lastName = inp.next();
PrintWriter pw = new PrintWriter(new File(lastName + "_sortTimes.csv"));
pw.println( "Size, BubbleSort, MergeSort, QuickSort, JavaSort, BubbleSort (Sorted Array),
MergeSort (Sorted Array), QuickSort (Sorted Array), JavaSort (Sorted Array)" );
while( sIdx < sizes.length )
{
int[] A = new int[sizes[sIdx]];
int[] B = new int[sizes[sIdx]];
int[] C = new int[sizes[sIdx]];
int[] D = new int[sizes[sIdx]];
int[] E = new int[sizes[sIdx]];
for( int i=0; i<A.length; i++ )
{
A[i] = (int)(Math.random()*sizes[sIdx]*2);
B[i] = A[i];
C[i] = A[i];
D[i] = A[i];
E[i] = 1000; // Array E is used for testing algo on array that is already sorted.
}
System.out.println();
System.out.println("--------------------------------------------------");
System.out.println("Initial Values: ");
printArray(A);
pw.print(A.length + ", ");
System.out.println( "Starting bubble sort ---------------- Size = " + B.length);
startTime = System.nanoTime();
bubbleSort(A);
endTime = System.nanoTime();
time = (endTime - startTime) / ONE_BILLION;
System.out.println( "Bubble sort finished - time = " + time + " seconds" );
pw.print(time + ", ");
printArray(A);
System.out.println();
System.out.println( "Starting merge sort ---------------- Size = " + C.length);
startTime = System.nanoTime();
mergeSort(B);
endTime = System.nanoTime();
time = (endTime - startTime) / ONE_BILLION;
System.out.println( "Merge sort finished - time = " + time + " seconds.");
pw.print(time + ", ");
printArray(B);
System.out.println();
System.out.println( "Starting quick sort ---------------- Size = " + D.length);
startTime = System.nanoTime();
quickSort(C);
endTime = System.nanoTime();
time = (endTime - startTime) / ONE_BILLION;
System.out.println( "quickSort finished - time = " + time + " seconds." );
pw.print(time + ", ");
printArray(C);
System.out.println();
System.out.println( "Starting java's Array sort ---------------- Size = " + D.length);
startTime = System.nanoTime();
javaSort(D);
endTime = System.nanoTime();
time = (endTime - startTime) / ONE_BILLION;
System.out.println( "Java's Array sort finished - time = " + time + " seconds." );
pw.print(time + ", ");
printArray(D);
System.out.println();
System.out.println( "Starting bubble sort on sorted array -------.
DS LAB RECORD.docx
The document contains Java code examples for implementing various data structures and algorithms using arrays. It includes programs for linear search, binary search, stack, queue, and converting an infix expression to postfix notation. For linear search, both recursive and non-recursive functions are provided. Similarly, for binary search and converting infix to postfix, both recursive and non-recursive approaches are demonstrated. The programs have main methods that accept user input and demonstrate the functionality of each implementation through sample outputs.
import java-util-Arrays- import java-io-PrintWriter- import java-io-Fi.pdf
import java.util.Arrays;
import java.io.PrintWriter;
import java.io.File;
import java.util.Scanner;
public class SortTimes
{
/* convert nanos to seconds */
static final double ONE_BILLION = 1_000_000_000.;
/* sizes of input range should range up to 512k elements */
static int[] sizes = new int[32];
public static void main(String[] args) throws Exception
{
int sIdx = 0;
long startTime;
long endTime;
double time;
int size = 128*1024/sizes.length;
/* let's make size smaller, comment out this next line and see what happens */
size = 16*1024/sizes.length;
for( int i=0; i<sizes.length; i++ ) {
sizes[i] = (i+1)*size;
}
Scanner inp = new Scanner(System.in);
System.out.print("What is your last name? ");
String lastName = inp.next();
PrintWriter pw = new PrintWriter(new File(lastName + "_sortTimes.csv"));
pw.println( "Size, BubbleSort, MergeSort, QuickSort, JavaSort, BubbleSort (Sorted Array),
MergeSort (Sorted Array), QuickSort (Sorted Array), JavaSort (Sorted Array)" );
while( sIdx < sizes.length )
{
int[] A = new int[sizes[sIdx]];
int[] B = new int[sizes[sIdx]];
int[] C = new int[sizes[sIdx]];
int[] D = new int[sizes[sIdx]];
int[] E = new int[sizes[sIdx]];
for( int i=0; i<A.length; i++ )
{
A[i] = (int)(Math.random()*sizes[sIdx]*2);
B[i] = A[i];
C[i] = A[i];
D[i] = A[i];
E[i] = 1000; // Array E is used for testing algo on array that is already sorted.
}
System.out.println();
System.out.println("--------------------------------------------------");
System.out.println("Initial Values: ");
printArray(A);
pw.print(A.length + ", ");
System.out.println( "Starting bubble sort ---------------- Size = " + B.length);
startTime = System.nanoTime();
bubbleSort(A);
endTime = System.nanoTime();
time = (endTime - startTime) / ONE_BILLION;
System.out.println( "Bubble sort finished - time = " + time + " seconds" );
pw.print(time + ", ");
printArray(A);
System.out.println();
System.out.println( "Starting merge sort ---------------- Size = " + C.length);
startTime = System.nanoTime();
mergeSort(B);
endTime = System.nanoTime();
time = (endTime - startTime) / ONE_BILLION;
System.out.println( "Merge sort finished - time = " + time + " seconds.");
pw.print(time + ", ");
printArray(B);
System.out.println();
System.out.println( "Starting quick sort ---------------- Size = " + D.length);
startTime = System.nanoTime();
quickSort(C);
endTime = System.nanoTime();
time = (endTime - startTime) / ONE_BILLION;
System.out.println( "quickSort finished - time = " + time + " seconds." );
pw.print(time + ", ");
printArray(C);
System.out.println();
System.out.println( "Starting java's Array sort ---------------- Size = " + D.length);
startTime = System.nanoTime();
javaSort(D);
endTime = System.nanoTime();
time = (endTime - startTime) / ONE_BILLION;
System.out.println( "Java's Array sort finished - time = " + time + " seconds." );
pw.print(time + ", ");
printArray(D);
System.out.println();
System.out.println( "Starting bubble sort on sorted array ---------------- Size = " + B.length);
star.
WINSEM2020-21_STS3105_SS_VL2020210500169_Reference_Material_I_15-Feb-2021_L6-...
The document contains sample code snippets for 7 questions related to arrays in Java. For each question, it provides the problem statement, sample input, sample output, and the Java code to solve the problem. The problems include searching for an element in an array, finding the number of occurrences of an element, finding the largest element, finding pairs with a given sum, rotating an array, finding the unique element, and checking if an array is a palindrome. It also includes 2 multiple choice questions to predict the output of code snippets.
Hi,I have updated your code. It is working fine now. Highllighted .pdf
Hi,
I have updated your code. It is working fine now. Highllighted all code changes below.
Shapes.java
import java.util.Scanner;
public class Shapes
{
private int radius;
public Shapes(int radius){
this.radius = radius;
}
public void setradius( int radius )
{
}
public int getradius()
{
return radius;
}
public void report()
{
System.out.printf( \"Circle perimeter, area / Sphere volume:\");
System.out.println();
System.out.printf( \" perimeter : \" + 2. * Math.PI * getradius());
System.out.println();
System.out.printf( \" area : \" + Math.PI * getradius() * 1.);
System.out.println();
System.out.printf( \" volume : \" + (4 * Math.PI * Math.pow(getradius(),3)/3));
System.out.println();
System.out.printf( \"Square perimeter, area:\");
System.out.println();
System.out.printf( \" perimeter : \" + 2 *Math.E * 1.);
System.out.println();
System.out.printf( \" area : \" + Math.E * 1.* 1);
System.out.println();
}
public static void main( String[] args )
{
//System.out.printf( \"Radius (as integer) of bounding sphere?\ %s!\ \", getradius() );
Scanner input = new Scanner( System.in );
System.out.println(\"Enter the radius:\");
int radius = input.nextInt();
Shapes s = new Shapes(radius);
s.report();
}
}
Output:
import java.util.Scanner;
public class Shapes
{
private int radius;
public Shapes(int radius){
this.radius = radius;
}
public void setradius( int radius )
{
}
public int getradius()
{
return radius;
}
public void report()
{
System.out.printf( \"Circle perimeter, area / Sphere volume:\");
System.out.println();
System.out.printf( \" perimeter : \" + 2. * Math.PI * getradius());
System.out.println();
System.out.printf( \" area : \" + Math.PI * getradius() * 1.);
System.out.println();
System.out.printf( \" volume : \" + (4 * Math.PI * Math.pow(getradius(),3)/3));
System.out.println();
System.out.printf( \"Square perimeter, area:\");
System.out.println();
System.out.printf( \" perimeter : \" + 2 *Math.E * 1.);
System.out.println();
System.out.printf( \" area : \" + Math.E * 1.* 1);
System.out.println();
}
public static void main( String[] args )
{
//System.out.printf( \"Radius (as integer) of bounding sphere?\ %s!\ \", getradius() );
Scanner input = new Scanner( System.in );
System.out.println(\"Enter the radius:\");
int radius = input.nextInt();
Shapes s = new Shapes(radius);
s.report();
}
}
Solution
Hi,
I have updated your code. It is working fine now. Highllighted all code changes below.
Shapes.java
import java.util.Scanner;
public class Shapes
{
private int radius;
public Shapes(int radius){
this.radius = radius;
}
public void setradius( int radius )
{
}
public int getradius()
{
return radius;
}
public void report()
{
System.out.printf( \"Circle perimeter, area / Sphere volume:\");
System.out.println();
System.out.printf( \" perimeter : \" + 2. * Math.PI * getradius());
System.out.println();
System.out.printf( \" area : \" + Math.PI * getradius() * 1.);
System.out.println();
System.out.printf( \" volume : \" + (4 * Math.PI * Math.pow(getradius(),3)/3).
Computer java programs
The document contains the solutions to 64 programming problems in Java. It provides the code to write programs that can:
1) Display patterns like right angle triangles and pyramids with numbers.
2) Check if a number is negative, zero or positive.
3) Sort arrays and insert or find elements in arrays.
4) Perform operations like calculating averages and separating even/odd numbers in arrays.
3) Find pair sums and rotate/add matrices.
SumNumbers.java import java.util.Scanner;public class SumNumbe.pdf
SumNumbers.java
import java.util.Scanner;
public class SumNumbers {
/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner scan = new Scanner(System.in);
int sum = 0;
while(true){
System.out.println(\"Enter integer:\");
int n = scan.nextInt();
if(n == -1){
break;
}
sum = sum + n;
}
System.out.println(\"The sum is \"+sum);
}
}
Output:
Enter integer:
1
Enter integer:
2
Enter integer:
3
Enter integer:
4
Enter integer:
5
Enter integer:
6
Enter integer:
7
Enter integer:
8
Enter integer:
9
Enter integer:
-1
The sum is 45
Solution
SumNumbers.java
import java.util.Scanner;
public class SumNumbers {
/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner scan = new Scanner(System.in);
int sum = 0;
while(true){
System.out.println(\"Enter integer:\");
int n = scan.nextInt();
if(n == -1){
break;
}
sum = sum + n;
}
System.out.println(\"The sum is \"+sum);
}
}
Output:
Enter integer:
1
Enter integer:
2
Enter integer:
3
Enter integer:
4
Enter integer:
5
Enter integer:
6
Enter integer:
7
Enter integer:
8
Enter integer:
9
Enter integer:
-1
The sum is 45.
Write a Java ProgramSolutionAnswer- Code- import java-io--- import jav.docx
This Java program allows a user to input employee data including name, type of employee (hourly or salaried), hourly rate, hours worked, and regular pay. It then calculates the income for hourly employees based on hours worked and overtime pay, and calculates income for salaried employees based on regular pay and hourly rate. The program outputs the employee name and calculated income.
Java Programs
This document contains code for an Employee class with methods to get employee details from the user, calculate salary based on hours, days, and leave, and print the employee information and salary. It also contains a Salary class to set and get hours, days, leave for salary calculation, and methods to calculate hourly, daily, and permanent salary amounts. Finally, it contains a MyDictionary class with methods to count characters, words, vowels in a file, search for a word, open and close files.
JSR 310. New Date API in Java 8
The document discusses Java 8's new date and time API (JSR 310). It provides examples of using the new classes like LocalDate, LocalTime, LocalDateTime and Instant that model dates, times and timestamps without time zones. It also covers formatting and parsing dates and times, working with time zones using ZoneId and ZonedDateTime, durations using Duration, and periods of time using Period. The document compares the new API to the legacy Date and Calendar classes and notes improvements like immutability and removal of bugs in the previous implementation.
Code javascript
This Java code defines a class called Soal07 that contains a main method for managing a student mark list. The main method uses Scanner objects to accept user input. It displays a menu with options to input student data, view all data, edit data, or exit. Based on the user's selection, it will either prompt the user to enter information for multiple students, display an existing student's data, or allow editing of an existing student's data by re-prompting for input. All student data, including name, ID, and mark, is stored in arrays.
Advanced Java[Extra Concepts, Not Difficult].docx
This is part 2 of my Java Learning Journey. This contains Hashing, ArrayList, LinkedList, Date and Time Classes, Calendar Class and more.
New Java Date/Time API
The document discusses Java 8's date and time API. It introduces the LocalDate, LocalTime, and LocalDateTime classes for working with dates, times, and datetimes respectively without time zones. It also covers the DateTimeFormatter class for formatting and parsing date/time strings using predefined or custom formats. Methods are presented for creating, querying, and manipulating temporal objects, as well as formatting and parsing dates and times.
JAVA.Q4 Create a Time class. This class will represent a point in.pdf
JAVA.
Q4: Create a Time class. This class will represent a point in time, such as a departure time. It
should contain 2 constructors, 2 instance variables (hour and minute), and 10 methods (see
below). All methods but toString should be in terms of the 24 hour format. [30 points]
default constructor: Creates a Time object for 12:00AM.
overloaded constructor: Creates a Time object at a specific hour and minute.
getHour(): Returns an integer representing the hour of the Time object.
getMinute(): Returns an integer representing the minute of the Time object.
addHours(...): Updates the object by moving it forward a number of hours.
addMinute(...): Updates the object by moving it forward a number of minutes. (Hint: Be careful
that you don\'t allow minutes to be more than 59.)
addTime(...): Updates the object by moving it forward by the hour and minute from another
Time object.
getCopy(...): Returns a new Time object that has the same hour and minute of the existing Time
object.
isEarlierThan(...): Returns true if this Time object is earlier than another Time object.
isSameTime(...): Returns true if this Time object is the same as another Time object.
isLaterThan(...): Returns true if this Time object is later than another Time object.
toString(): Returns a string representing the Time object. Uses 12 hour AM/PM format and pads
minutes to be two digits. See the sample output for an example.
Q5: Create a Flight class that uses the Plane and Time class. This class will represent a flight
between two airports, using a specific Plane, and departing at a specific Time. It should contain a
constructor, 7 instance variables (plane, flight number, cost, departure, duration, source,
destination), and 9 methods (see below). [25 points]
overloaded constructor: Creates a Flight object that is setup up with a Plane, a flight number, a
cost, a departure Time, a duration time, a source Airport, and a destination Airport.
getPlane(): Returns the Plane that operates this flight.
getNumber(): Returns the flight number.
getCost(): Returns the flight cost.
getDestination(): Returns the destination Airport.
getDeparture(): Returns the departure Time.
getArrival(): Returns a Time object with the arrival time (computed from the departure time and
duration).
getSource(): Returns a Airport object for the departure location.
toOverviewString(): Returns a String representing an overview of the flight. Use NumberFormat
to display the price. See the sample output for an example.
toDetailedString(): Returns a String representing the flight\'s detail information. See the sample
output for an example.
Included below is an overall UML diagram that describes the three classes you will be
constructing. It provides a useful summary of all of the methods you are expected to implement,
and their corresponding types and visibility. Notice that one private method is listed here
(formatDigits in Time) that isn\'t mentioned above. This is a method that was in our solution, you
may not need.
What's New in C++ 11/14?
It's not your mother's C++ anymore. Manual memory management, tedious loops, difficult-to-use STL algorithms -- are all a thing of the past now. The new C++ 11 standard contains a huge number of improvements to the C++ core language and standard library, and can help C++ developers be more productive.
In this session we will discuss the major features of C++ 11, including lambda functions, type inference for local variables, range-based for loops, smart pointers, and more. We will see how to use these features effectively to modernize your existing C++ programs and how to develop in the modern C++ style.
Similar to import java.text.SimpleDateFormat; import java.util.Calendar; import.pdf (15)
please help finish sorting methods- import java-util-Arrays- import ja.pdf
please help finish sorting methods- import java-util-Arrays- import ja.pdf
import java-util-Arrays- import java-io-PrintWriter- import java-io-Fi.pdf
import java-util-Arrays- import java-io-PrintWriter- import java-io-Fi.pdf
WINSEM2020-21_STS3105_SS_VL2020210500169_Reference_Material_I_15-Feb-2021_L6-...
WINSEM2020-21_STS3105_SS_VL2020210500169_Reference_Material_I_15-Feb-2021_L6-...
Hi,I have updated your code. It is working fine now. Highllighted .pdf
Hi,I have updated your code. It is working fine now. Highllighted .pdf
SumNumbers.java import java.util.Scanner;public class SumNumbe.pdf
SumNumbers.java import java.util.Scanner;public class SumNumbe.pdf
Write a Java ProgramSolutionAnswer- Code- import java-io--- import jav.docx
Write a Java ProgramSolutionAnswer- Code- import java-io--- import jav.docx
JAVA.Q4 Create a Time class. This class will represent a point in.pdf
JAVA.Q4 Create a Time class. This class will represent a point in.pdf
More from premkhatri99
Yes it is minus 1 (-1). Oxygen is normally -2, bu.pdf
Yes it is minus 1 (-1). Oxygen is normally -2, but once it attaches to an H, it
becomes -1. Hope this confirms it!
Solution
Yes it is minus 1 (-1). Oxygen is normally -2, but once it attaches to an H, it
becomes -1. Hope this confirms it!.
very easy Water formula — H 2 O .pdf
Water is made up of two hydrogen atoms and one oxygen atom. Its chemical formula is H2O. Water is a simple yet essential compound to life on Earth.
TLC or Thin Layer Chromatography is performed on.pdf
TLC or Thin Layer Chromatography: is performed on a sheet of glass, plastic, or
aluminum foil, coated with a layer of either silica gel, aluminium oxide, or cellulose. The layer
of adsorbent material is the stationary phase and the solution added to the plate is the mobile
phase. The mobile phase is drawn up the plate via capillary action. and the separation is achieved
because the analytes ascend the TLC plate at different rates. The various components form spots
on the plate which can be viewed if the samples have a visible color or fluorescent compound are
added to the solution so it is visible under UV light. The spots are then used to calculate retention
factor values. GC. In GC the mobile phase is a carrier gas such as helium or nitrogen. The
stationary phase is a microscopic layer of liquid or polymer on an inert solid support typically
fused silica tubing (the column). The various species are have different affinities for the
stationary phase and will travel through the column at different rates and elute at a different time.
The separated species are can then be analyzed with a multitude different detectors including
flame ionization detector, thermal conductivity detector, and many others. The detector which
provides the most valuable information is a mass spectrometer... this setup is known as GC-MS.
I hope this helps! Please remember to rate!
Solution
TLC or Thin Layer Chromatography: is performed on a sheet of glass, plastic, or
aluminum foil, coated with a layer of either silica gel, aluminium oxide, or cellulose. The layer
of adsorbent material is the stationary phase and the solution added to the plate is the mobile
phase. The mobile phase is drawn up the plate via capillary action. and the separation is achieved
because the analytes ascend the TLC plate at different rates. The various components form spots
on the plate which can be viewed if the samples have a visible color or fluorescent compound are
added to the solution so it is visible under UV light. The spots are then used to calculate retention
factor values. GC. In GC the mobile phase is a carrier gas such as helium or nitrogen. The
stationary phase is a microscopic layer of liquid or polymer on an inert solid support typically
fused silica tubing (the column). The various species are have different affinities for the
stationary phase and will travel through the column at different rates and elute at a different time.
The separated species are can then be analyzed with a multitude different detectors including
flame ionization detector, thermal conductivity detector, and many others. The detector which
provides the most valuable information is a mass spectrometer... this setup is known as GC-MS.
I hope this helps! Please remember to rate!.
The name of the compound is 2-Ethoxyethanol .pdf
The compound is named 2-Ethoxyethanol. 2-Ethoxyethanol is the name of the compound described in the document. The document provides the name of the compound as 2-Ethoxyethanol.
THANKS Solution THANKS .pdf
This very short document consists of only two words: "THANKS" and "Solution". It does not provide enough contextual information to generate a meaningful multi-sentence summary.
Potassium (K) ion has an electron configuration i.pdf
Potassium (K) ion has an electron configuration identical to the inert gas Argon The
iodine ion has an electron configuration identical to the inert gas Xenon.
Solution
Potassium (K) ion has an electron configuration identical to the inert gas Argon The
iodine ion has an electron configuration identical to the inert gas Xenon..
oxidation-reduction reactions (redox reactions) a.pdf
oxidation-reduction reactions (redox reactions) are reactions in which electrons are
lost by an atom or ion in one reactant and gained by an atom or ion in another reactant. Although
electrons are gained and lost in these reactions, the balanced equation for a redox reaction does
not show the electrons that are being transferred. In order to tell whether a redox reaction has
occurred or not, we need a way to keep track of electrons. The best way to do so is by assigning
oxidation numbers to the atoms or ions involved in a chemical reaction. Oxidation numbers are
hypothetical numbers assigned to an individual atom or ion present in a substance using a set of
rules. Oxidation numbers (or oxidation states as they are also called) can be positive, negative, or
zero. It is VERY IMPORTANT to remember that oxidation numbers are always reported for one
individual atom or ion and not for groups of atoms or ions. The following rules are used to
assign oxidation numbers. Chem 1115 students will have these rules available on exams. Chem
1215 students must memorize these rules. Chem 1115 Chem 1215 Tutorial List Oxidation
Number Rules The oxidation number for an atom in its elemental form is always zero. A
substance is elemental if both of the following are true: only one kind of atom is present charge =
0 Examples: S8: The oxidation number of S = 0 Fe: The oxidation number of Fe = 0 The
oxidation number of a monoatomic ion = charge of the monatomic ion. Examples: Oxidation
number of S2- is -2. Oxidation number of Al3+ is +3. The oxidation number of all Group 1A
metals = +1 (unless elemental). The oxidation number of all Group 2A metals = +2 (unless
elemental). Hydrogen (H) has two possible oxidation numbers: +1 when bonded to a nonmetal -1
when bonded to a metal Oxygen (O) has two possilbe oxidation numbers: -1 in peroxides (O22-
)....pretty uncommon -2 in all other compounds...most common The oxidation number of
fluorine (F) is always -1. The sum of the oxidation numbers of all atoms (or ions) in a neutral
compound = 0. The sum of the oxidation numbers of all atoms in a polyatomic ion = charge on
the polyatomic ion. When assigning oxidation numbers to the elements in a substance, take a
systematic approach. Ask yourself the following questions: Is the substance elemental? Is the
substance ionic? If the substance is ionic, are there any monoatomic ions present? Which
elements have specific rules? Which element(s) do(es) not have rules? Use rule 8 or 9 from
above to calculate these. Example: Determine the oxidation number of each element in Na2SO4.
Is the substance elemental? No, there are three elements present. Is the substance ionic? Yes,
because metal + non-metal = ionic. If the substance is ionic, are there any monoatomic ions
present? Yes, the sodium ion (Na+) is monoatomic. Therefore, the oxidation number of Na is +1.
Which elements have specific rules? Oxygen has a rule (-2 in most compounds). Oxidation
number of O = -2. Which element(s) do(es) not.
NO reaction between these two salts, thus no equa.pdf
This one sentence document states that there was no reaction observed between two unspecified salts, and therefore no chemical equations can be written to describe a reaction that did not occur.
Helium is a little lighter then a sum of two prot.pdf
Helium is a little lighter then a sum of two protons and neutrons, the difference in
mass gets converted to energy and partially we observe it as the Sun
Solution
Helium is a little lighter then a sum of two protons and neutrons, the difference in
mass gets converted to energy and partially we observe it as the Sun.
It is F tset.The between-group degrees of freedom is 3-1=2.pdf
It is F tset.
The between-group degrees of freedom is 3-1=2
The within-group degrees of freedom is 3*(5-1) = 12
Solution
It is F tset.
The between-group degrees of freedom is 3-1=2
The within-group degrees of freedom is 3*(5-1) = 12.
there is no reaction between Cu(NO3)2 and water.Solutionth.pdf
there is no reaction between Cu(NO3)2 and water.
Solution
there is no reaction between Cu(NO3)2 and water..
There are 7 in total ( 3 up and 4 right )Differnet paths possi.pdf
There are 7 in total ( 3 up and 4 right )
Differnet paths possible = 7! / (3! * 4!) = 35
Solution
There are 7 in total ( 3 up and 4 right )
Differnet paths possible = 7! / (3! * 4!) = 35.
The length of a is independent of the shaft length L. Because it is .pdf
The length of a is independent of the shaft length L. Because it is mentioned that shaft is
symmetric about centre the body is in equilibrium
Solution
The length of a is independent of the shaft length L. Because it is mentioned that shaft is
symmetric about centre the body is in equilibrium.
The answer is E all of the aboveSolutionThe answer is E all of.pdf
The solution to the question is choice E, which encompasses all possible options. To solve this problem, the answer that includes every option listed is the correct one. In just three words, the document states that the full selection of all options presented collectively contains the right solution.
Suppose there is a parasite P which feeds on a species of insect.pdf
Suppose there is a parasite \"P\" which feeds on a species of insects \"S\".
Suppose there is an amino acid \"A\" which is a part of growth and development of a species
\"S\". Now, this amino acid is changed to A*. As a result of change, species \"S\" will be
changed to \"S* \".
Now, \"P\" will feed on species \"S\" but will not be able to feed on species S*. So, slowly in the
process of evolution, species “S” will be eliminated completely due to rigorous exploitation by
the parasite \"P\"; and “S*” will co-evolve. So, we can say that a new species S* will be
originated at an increased rate.
After some time, “P” will not get anything to eat. So, it will either be eliminated, or will start
feeding on some other food source \"F\". This time “F” will coevolve to become F*. With
elimination of old species new species formation will be favored at an increased rate.
Solution
Suppose there is a parasite \"P\" which feeds on a species of insects \"S\".
Suppose there is an amino acid \"A\" which is a part of growth and development of a species
\"S\". Now, this amino acid is changed to A*. As a result of change, species \"S\" will be
changed to \"S* \".
Now, \"P\" will feed on species \"S\" but will not be able to feed on species S*. So, slowly in the
process of evolution, species “S” will be eliminated completely due to rigorous exploitation by
the parasite \"P\"; and “S*” will co-evolve. So, we can say that a new species S* will be
originated at an increased rate.
After some time, “P” will not get anything to eat. So, it will either be eliminated, or will start
feeding on some other food source \"F\". This time “F” will coevolve to become F*. With
elimination of old species new species formation will be favored at an increased rate..
Run the following code to get the deisred resultfunction .pdf
Run the following code to get the deisred result:
function [ x ] = observations_random_variable( N, idnumber)
dispval1 = (\'Last Name, First Name\');
disp(dispval1);
dispval2 = [\'ID : \', num2str(idnumber)];
disp(dispval2);
for(i=1:N)
temp = rand; %Temporary variable
if(temp < 0.1565)
x(i) = -1.0;
elseif(temp < 0.1565+0.1426)
x(i) = 0.0;
elseif(temp < 0.1565+0.1426+0.1301)
x(i) = 1.0;
elseif(temp < 0.1565+0.1426+0.1301+0.1160)
x(i) = 2.0;
elseif(temp < 0.1565+0.1426+0.1301+0.1160+0.1041)
x(i) = 3.0;
elseif(temp < 0.1565+0.1426+0.1301+0.1160+0.1041+0.0909)
x(i) = 4.0;
elseif(temp < 0.1565+0.1426+0.1301+0.1160+0.1041+0.0909+0.0779)
x(i) = 5.0;
elseif(temp < 0.1565+0.1426+0.1301+0.1160+0.1041+0.0909+0.0779+0.0649)
x(i) = 6.0;
elseif(temp < 0.1565+0.1426+0.1301+0.1160+0.1041+0.0909+0.0779+0.0649+0.0518)
x(i) = 7.0;
elseif(temp <
0.1565+0.1426+0.1301+0.1160+0.1041+0.0909+0.0779+0.0649+0.0518+0.0390)
x(i) = 8.0;
elseif(temp <
0.1565+0.1426+0.1301+0.1160+0.1041+0.0909+0.0779+0.0649+0.0518+0.0390+0.0260)
x(i) = 9.0;
end
end
base = [-1,0,1,2,3,4,5,6,7,8,9];
[pmf base] = hist(x,base);
pmf = pmf / sum(pmf);
size_base = size(base,2)
for(i=1:size_base)
dispval = [\'x = \',num2str(base(i)),\' PMF = \',num2str(pmf(i))];
disp(dispval);
end
mu = mean(x)
sigma = std(x)
variance = sigma^2
bar(base,pmf);
Solution
Run the following code to get the deisred result:
function [ x ] = observations_random_variable( N, idnumber)
dispval1 = (\'Last Name, First Name\');
disp(dispval1);
dispval2 = [\'ID : \', num2str(idnumber)];
disp(dispval2);
for(i=1:N)
temp = rand; %Temporary variable
if(temp < 0.1565)
x(i) = -1.0;
elseif(temp < 0.1565+0.1426)
x(i) = 0.0;
elseif(temp < 0.1565+0.1426+0.1301)
x(i) = 1.0;
elseif(temp < 0.1565+0.1426+0.1301+0.1160)
x(i) = 2.0;
elseif(temp < 0.1565+0.1426+0.1301+0.1160+0.1041)
x(i) = 3.0;
elseif(temp < 0.1565+0.1426+0.1301+0.1160+0.1041+0.0909)
x(i) = 4.0;
elseif(temp < 0.1565+0.1426+0.1301+0.1160+0.1041+0.0909+0.0779)
x(i) = 5.0;
elseif(temp < 0.1565+0.1426+0.1301+0.1160+0.1041+0.0909+0.0779+0.0649)
x(i) = 6.0;
elseif(temp < 0.1565+0.1426+0.1301+0.1160+0.1041+0.0909+0.0779+0.0649+0.0518)
x(i) = 7.0;
elseif(temp <
0.1565+0.1426+0.1301+0.1160+0.1041+0.0909+0.0779+0.0649+0.0518+0.0390)
x(i) = 8.0;
elseif(temp <
0.1565+0.1426+0.1301+0.1160+0.1041+0.0909+0.0779+0.0649+0.0518+0.0390+0.0260)
x(i) = 9.0;
end
end
base = [-1,0,1,2,3,4,5,6,7,8,9];
[pmf base] = hist(x,base);
pmf = pmf / sum(pmf);
size_base = size(base,2)
for(i=1:size_base)
dispval = [\'x = \',num2str(base(i)),\' PMF = \',num2str(pmf(i))];
disp(dispval);
end
mu = mean(x)
sigma = std(x)
variance = sigma^2
bar(base,pmf);.
only the ketone at the left top changes to acid (cooH)Solution.pdf
only the ketone at the left top changes to acid (cooH)
Solution
only the ketone at the left top changes to acid (cooH).
Please find my solution.Please let me know in case of any issue..pdf
Please find my solution.
Please let me know in case of any issue.
########## Invoice.java ###############
public class Invoice {
// instance variables
private String name;
private int itemNumber;
private int quantity;
private double price;
private double totalCost;
// setters
public void setName(String name) {
this.name = name;
}
public void setQuantity(int quantity) {
this.quantity = quantity;
}
public void setPrice(double price) {
this.price = price;
}
public void setItemNumber(int itemNumber){
this.itemNumber = itemNumber;
}
//display method
public void displayLine(){
totalCost = price*quantity;
System.out.println(\"Name: \"+name);
System.out.println(\"Item Number: \"+itemNumber);
System.out.println(\"Quantity: \"+quantity);
System.out.println(\"Price: \"+price);
System.out.println(\"Total Cost: \"+totalCost);
}
}
################ TestInvoice.java ###################
import java.util.Scanner;
public class TestInvoice {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
// creating three methods
Invoice i1 = new Invoice();
Invoice i2 = new Invoice();
Invoice i3 = new Invoice();
// input for first invoice
System.out.print(\"Enter name of invoice1: \");
i1.setName(sc.next());
System.out.print(\"Enter item number: \");
i1.setItemNumber(sc.nextInt());
System.out.print(\"Enter quantity: \");
i1.setQuantity(sc.nextInt());
System.out.print(\"Enter price: \");
i1.setPrice(sc.nextDouble());
System.out.println();
// input for second invoice
System.out.print(\"Enter name of invoice2: \");
i2.setName(sc.next());
System.out.print(\"Enter item number: \");
i2.setItemNumber(sc.nextInt());
System.out.print(\"Enter quantity: \");
i2.setQuantity(sc.nextInt());
System.out.print(\"Enter price: \");
i2.setPrice(sc.nextDouble());
System.out.println();
// input for third invoice
System.out.print(\"Enter name of invoice3: \");
i3.setName(sc.next());
System.out.print(\"Enter item number: \");
i3.setItemNumber(sc.nextInt());
System.out.print(\"Enter quantity: \");
i3.setQuantity(sc.nextInt());
System.out.print(\"Enter price: \");
i3.setPrice(sc.nextDouble());
System.out.println();
sc.close();
// displaying three invoice information
i1.displayLine();
System.out.println();
i2.displayLine();
System.out.println();
i3.displayLine();
System.out.println();
}
}
/*
Sample Output:
Enter name of invoice1: Invoice1
Enter item number: 123
Enter quantity: 21
Enter price: 34.56
Enter name of invoice2: Invoice2
Enter item number: 124
Enter quantity: 25
Enter price: 43.5
Enter name of invoice3: Invoice3
Enter item number: 125
Enter quantity: 27
Enter price: 65
Name: Invoice1
Item Number: 123
Quantity: 21
Price: 34.56
Total Cost: 725.76
Name: Invoice2
Item Number: 124
Quantity: 25
Price: 43.5
Total Cost: 1087.5
Name: Invoice3
Item Number: 125
Quantity: 27
Price: 65.0
Total Cost: 1755.0
*/
Solution
Please find my solution.
Please let me know in case of any issue.
########## Invoice.java ###############
public class Invoice {
// instance variables
private Str.
More from premkhatri99 (20)
Yes it is minus 1 (-1). Oxygen is normally -2, bu.pdf
Yes it is minus 1 (-1). Oxygen is normally -2, bu.pdf
TLC or Thin Layer Chromatography is performed on.pdf
TLC or Thin Layer Chromatography is performed on.pdf
Potassium (K) ion has an electron configuration i.pdf
Potassium (K) ion has an electron configuration i.pdf
oxidation-reduction reactions (redox reactions) a.pdf
oxidation-reduction reactions (redox reactions) a.pdf
NO reaction between these two salts, thus no equa.pdf
NO reaction between these two salts, thus no equa.pdf
Helium is a little lighter then a sum of two prot.pdf
Helium is a little lighter then a sum of two prot.pdf
It is F tset.The between-group degrees of freedom is 3-1=2.pdf
It is F tset.The between-group degrees of freedom is 3-1=2.pdf
there is no reaction between Cu(NO3)2 and water.Solutionth.pdf
there is no reaction between Cu(NO3)2 and water.Solutionth.pdf
There are 7 in total ( 3 up and 4 right )Differnet paths possi.pdf
There are 7 in total ( 3 up and 4 right )Differnet paths possi.pdf
The length of a is independent of the shaft length L. Because it is .pdf
The length of a is independent of the shaft length L. Because it is .pdf
The answer is E all of the aboveSolutionThe answer is E all of.pdf
The answer is E all of the aboveSolutionThe answer is E all of.pdf
Suppose there is a parasite P which feeds on a species of insect.pdf
Suppose there is a parasite P which feeds on a species of insect.pdf
Run the following code to get the deisred resultfunction .pdf
Run the following code to get the deisred resultfunction .pdf
only the ketone at the left top changes to acid (cooH)Solution.pdf
only the ketone at the left top changes to acid (cooH)Solution.pdf
Please find my solution.Please let me know in case of any issue..pdf
Please find my solution.Please let me know in case of any issue..pdf
Recently uploaded
DRUGS AND ITS classification slide share
Any substance (other than food) that is used to prevent, diagnose, treat, or relieve symptoms of a
disease or abnormal condition
How to Fix the Import Error in the Odoo 17
An import error occurs when a program fails to import a module or library, disrupting its execution. In languages like Python, this issue arises when the specified module cannot be found or accessed, hindering the program's functionality. Resolving import errors is crucial for maintaining smooth software operation and uninterrupted development processes.
ANATOMY AND BIOMECHANICS OF HIP JOINT.pdf
it describes the bony anatomy including the femoral head , acetabulum, labrum . also discusses the capsule , ligaments . muscle that act on the hip joint and the range of motion are outlined. factors affecting hip joint stability and weight transmission through the joint are summarized.
বাংলাদেশ অর্থনৈতিক সমীক্ষা (Economic Review) ২০২৪ UJS App.pdf
বাংলাদেশের অর্থনৈতিক সমীক্ষা ২০২৪ [Bangladesh Economic Review 2024 Bangla.pdf] কম্পিউটার , ট্যাব ও স্মার্ট ফোন ভার্সন সহ সম্পূর্ণ বাংলা ই-বুক বা pdf বই " সুচিপত্র ...বুকমার্ক মেনু 🔖 ও হাইপার লিংক মেনু 📝👆 যুক্ত ..
আমাদের সবার জন্য খুব খুব গুরুত্বপূর্ণ একটি বই ..বিসিএস, ব্যাংক, ইউনিভার্সিটি ভর্তি ও যে কোন প্রতিযোগিতা মূলক পরীক্ষার জন্য এর খুব ইম্পরট্যান্ট একটি বিষয় ...তাছাড়া বাংলাদেশের সাম্প্রতিক যে কোন ডাটা বা তথ্য এই বইতে পাবেন ...
তাই একজন নাগরিক হিসাবে এই তথ্য গুলো আপনার জানা প্রয়োজন ...।
বিসিএস ও ব্যাংক এর লিখিত পরীক্ষা ...+এছাড়া মাধ্যমিক ও উচ্চমাধ্যমিকের স্টুডেন্টদের জন্য অনেক কাজে আসবে ...
What is Digital Literacy? A guest blog from Andy McLaughlin, University of Ab...
What is Digital Literacy? A guest blog from Andy McLaughlin, University of Aberdeen
How to Add Chatter in the odoo 17 ERP Module
In Odoo, the chatter is like a chat tool that helps you work together on records. You can leave notes and track things, making it easier to talk with your team and partners. Inside chatter, all communication history, activity, and changes will be displayed.
Azure Interview Questions and Answers PDF By ScholarHat
Azure Interview Questions and Answers PDF By ScholarHat
Chapter 4 - Islamic Financial Institutions in Malaysia.pptx
Chapter 4 - Islamic Financial Institutions in Malaysia.pptxMohd Adib Abd Muin, Senior Lecturer at Universiti Utara Malaysia
This slide is special for master students (MIBS & MIFB) in UUM. Also useful for readers who are interested in the topic of contemporary Islamic banking.
Walmart Business+ and Spark Good for Nonprofits.pdf
"Learn about all the ways Walmart supports nonprofit organizations.
You will hear from Liz Willett, the Head of Nonprofits, and hear about what Walmart is doing to help nonprofits, including Walmart Business and Spark Good. Walmart Business+ is a new offer for nonprofits that offers discounts and also streamlines nonprofits order and expense tracking, saving time and money.
The webinar may also give some examples on how nonprofits can best leverage Walmart Business+.
The event will cover the following::
Walmart Business + (https://business.walmart.com/plus) is a new shopping experience for nonprofits, schools, and local business customers that connects an exclusive online shopping experience to stores. Benefits include free delivery and shipping, a 'Spend Analytics” feature, special discounts, deals and tax-exempt shopping.
Special TechSoup offer for a free 180 days membership, and up to $150 in discounts on eligible orders.
Spark Good (walmart.com/sparkgood) is a charitable platform that enables nonprofits to receive donations directly from customers and associates.
Answers about how you can do more with Walmart!"
South African Journal of Science: Writing with integrity workshop (2024)
South African Journal of Science: Writing with integrity workshop (2024)Academy of Science of South Africa
A workshop hosted by the South African Journal of Science aimed at postgraduate students and early career researchers with little or no experience in writing and publishing journal articles.LAND USE LAND COVER AND NDVI OF MIRZAPUR DISTRICT, UP
This Dissertation explores the particular circumstances of Mirzapur, a region located in the
core of India. Mirzapur, with its varied terrains and abundant biodiversity, offers an optimal
environment for investigating the changes in vegetation cover dynamics. Our study utilizes
advanced technologies such as GIS (Geographic Information Systems) and Remote sensing to
analyze the transformations that have taken place over the course of a decade.
The complex relationship between human activities and the environment has been the focus
of extensive research and worry. As the global community grapples with swift urbanization,
population expansion, and economic progress, the effects on natural ecosystems are becoming
more evident. A crucial element of this impact is the alteration of vegetation cover, which plays a
significant role in maintaining the ecological equilibrium of our planet.Land serves as the foundation for all human activities and provides the necessary materials for
these activities. As the most crucial natural resource, its utilization by humans results in different
'Land uses,' which are determined by both human activities and the physical characteristics of the
land.
The utilization of land is impacted by human needs and environmental factors. In countries
like India, rapid population growth and the emphasis on extensive resource exploitation can lead
to significant land degradation, adversely affecting the region's land cover.
Therefore, human intervention has significantly influenced land use patterns over many
centuries, evolving its structure over time and space. In the present era, these changes have
accelerated due to factors such as agriculture and urbanization. Information regarding land use and
cover is essential for various planning and management tasks related to the Earth's surface,
providing crucial environmental data for scientific, resource management, policy purposes, and
diverse human activities.
Accurate understanding of land use and cover is imperative for the development planning
of any area. Consequently, a wide range of professionals, including earth system scientists, land
and water managers, and urban planners, are interested in obtaining data on land use and cover
changes, conversion trends, and other related patterns. The spatial dimensions of land use and
cover support policymakers and scientists in making well-informed decisions, as alterations in
these patterns indicate shifts in economic and social conditions. Monitoring such changes with the
help of Advanced technologies like Remote Sensing and Geographic Information Systems is
crucial for coordinated efforts across different administrative levels. Advanced technologies like
Remote Sensing and Geographic Information Systems
9
Changes in vegetation cover refer to variations in the distribution, composition, and overall
structure of plant communities across different temporal and spatial scales. These changes can
occur natural.
How to Build a Module in Odoo 17 Using the Scaffold Method
Odoo provides an option for creating a module by using a single line command. By using this command the user can make a whole structure of a module. It is very easy for a beginner to make a module. There is no need to make each file manually. This slide will show how to create a module using the scaffold method.
Recently uploaded (20)
Film vocab for eal 3 students: Australia the movie
Film vocab for eal 3 students: Australia the movie
বাংলাদেশ অর্থনৈতিক সমীক্ষা (Economic Review) ২০২৪ UJS App.pdf
বাংলাদেশ অর্থনৈতিক সমীক্ষা (Economic Review) ২০২৪ UJS App.pdf
What is Digital Literacy? A guest blog from Andy McLaughlin, University of Ab...
What is Digital Literacy? A guest blog from Andy McLaughlin, University of Ab...
Pride Month Slides 2024 David Douglas School District
Pride Month Slides 2024 David Douglas School District
Digital Artefact 1 - Tiny Home Environmental Design
Digital Artefact 1 - Tiny Home Environmental Design
Azure Interview Questions and Answers PDF By ScholarHat
Azure Interview Questions and Answers PDF By ScholarHat
Chapter 4 - Islamic Financial Institutions in Malaysia.pptx
Chapter 4 - Islamic Financial Institutions in Malaysia.pptx
Walmart Business+ and Spark Good for Nonprofits.pdf
Walmart Business+ and Spark Good for Nonprofits.pdf
South African Journal of Science: Writing with integrity workshop (2024)
South African Journal of Science: Writing with integrity workshop (2024)
LAND USE LAND COVER AND NDVI OF MIRZAPUR DISTRICT, UP
LAND USE LAND COVER AND NDVI OF MIRZAPUR DISTRICT, UP
How to Build a Module in Odoo 17 Using the Scaffold Method
How to Build a Module in Odoo 17 Using the Scaffold Method
import java.text.SimpleDateFormat; import java.util.Calendar; import.pdf
- 1. import java.text.SimpleDateFormat; import java.util.Calendar; import java.util.GregorianCalendar; import java.util.Scanner; class Main { private static Scanner input; public static void main(String args[]) { SimpleDateFormat sdf = new SimpleDateFormat("yyyy MMM dd HH:mm:ss"); System.out.println("when to begin taking the medication (Year,month,day of month,hour, minute"); input = new Scanner(System.in); String begin = input.nextLine(); String[] parts = begin.split(","); Calendar calendar = new GregorianCalendar(Integer.parseInt(parts[0]),Integer.parseInt(parts[1])- 1,Integer.parseInt(parts[2]),Integer.parseInt(parts[3]),Integer.parseInt(parts[4]),00); System.out.println(sdf.format(calendar.getTime())); System.out.println("when to end"); String end = input.nextLine(); String[] parts2 = end.split(","); Calendar calendar2 = new GregorianCalendar(Integer.parseInt(parts2[0]),Integer.parseInt(parts2[1])- 1,Integer.parseInt(parts2[2]),Integer.parseInt(parts2[3]),Integer.parseInt(parts2[4]),00); System.out.println(sdf.format(calendar2.getTime())); System.out.println("proper dosage"); String dosage = input.nextLine(); System.out.println("frequency (hours between medication)"); int frequence = input.nextInt(); calendar.add(Calendar.HOUR_OF_DAY,+ frequence); System.out.println("The second scheduled medication is: " + sdf.format(calendar.getTime())); } } Solution import java.text.SimpleDateFormat; import java.util.Calendar; import java.util.GregorianCalendar; import java.util.Scanner; class Main { private static Scanner input; public static void main(String args[]) { SimpleDateFormat sdf = new SimpleDateFormat("yyyy MMM dd HH:mm:ss"); System.out.println("when to begin taking the medication (Year,month,day of month,hour, minute"); input = new Scanner(System.in); String begin = input.nextLine(); String[] parts = begin.split(","); Calendar calendar = new GregorianCalendar(Integer.parseInt(parts[0]),Integer.parseInt(parts[1])- 1,Integer.parseInt(parts[2]),Integer.parseInt(parts[3]),Integer.parseInt(parts[4]),00); System.out.println(sdf.format(calendar.getTime())); System.out.println("when to end"); String end = input.nextLine(); String[] parts2 = end.split(","); Calendar calendar2 = new GregorianCalendar(Integer.parseInt(parts2[0]),Integer.parseInt(parts2[1])- 1,Integer.parseInt(parts2[2]),Integer.parseInt(parts2[3]),Integer.parseInt(parts2[4]),00); System.out.println(sdf.format(calendar2.getTime())); System.out.println("proper dosage"); String dosage = input.nextLine(); System.out.println("frequency (hours between medication)"); int frequence = input.nextInt();
- 2. calendar.add(Calendar.HOUR_OF_DAY,+ frequence); System.out.println("The second scheduled medication is: " + sdf.format(calendar.getTime())); } }