please help finish sorting methods- import java-util-Arrays- import ja.pdf
•
0 likes•2 views
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 -------.
Report
Share
Report
Share
Download to read offline
![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;
}](https://image.slidesharecdn.com/pleasehelpfinishsortingmethods-importjava-util-arrays-importja-230311081027-9cf03642/85/please-help-finish-sorting-methods-import-java-util-Arrays-import-ja-pdf-1-320.jpg)
![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: ");](data:image/gif;base64,R0lGODlhAQABAIAAAAAAAP///yH5BAEAAAAALAAAAAABAAEAAAIBRAA7)
Recommended
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.
I have already done the first 2 parts(factorial and fibonacci) also .pdf
I have already done the first 2 parts(factorial and fibonacci) also finding the time elapsed, need to
do the last 2 parts (palindromes and binary search) also finding the time elapsed on each version
(need to add code for that).
Assignments:
1) Write the recursive and nonrecursive version of
a. Int factorial(int n), (use nFactorial as the name for non-recursive version) (where n >= 0)
b. Int fibonacci(int n), (and nFibonacci as the name for non-recursive version)
c. boolean isPalindrome(String s, int low, int high), (and nIsPalindrome for the non-recursive
version)
d. int binarySearch(int[] v, int key, int low, int high), (and nBinarySearch for the non recursive
version)
2) Develop testing schemes as following:
a. For a and b: use at least 20 different values of n (from small to sufficiently large) and the time
function to find the time spent for different values of n.
b. For c, set up a string array of size 20 and initialize them with at least 10 palindromes. (already
made an array in the method)
c. For d, do the following: (need to make a new method for both versions and all the calls for
both )
i. Fill an integer array of 1000 multiples of 3 from 0 to 2997 (i.e., 0, 3, 6, 9,…,2997) and have
them properly sorted.
ii. Test your function and see if it works.
iii. Set up a test array with 20 random integers between 0 and 3000 to test the program.
Main method code:
public class factorials {
public static void main (String args[])
{
System.out.println(\"Recursive Fibonacci Method: \ \");
System.out.println(\" N\\t\\t\" + \"Fibonacci Sequence\\t\\t\" + \"Time Elapsed\");
for(int n = 0; n < 25; n++)
{
long startTime = System.nanoTime();
fibonacci(n);
long stopTime = System.nanoTime();
long elapsedTime = stopTime - startTime;
System.out.println( \" \" + n + \"\\t\\t\\t \" + fibonacci(n) + \"\\t\\t\\t \" + elapsedTime);
//System.out.println(/*\"Start Time: \" + startTime + \"\ Stop Time: \" + stopTime + */
//\"\ Elapsed Time: \" + elapsedTime);
}
System.out.println(\"\ \");
System.out.println(\"Iterative Fibonacci Method: \ \");
System.out.println(\" N\\t\\t\" + \"Fibonacci Sequence\\t\\t\" + \"Time Elapsed\");
for ( int n = 0; n < 25; n++)
{
long startTime = System.nanoTime();
nfactorial(n);
long stopTime = System.nanoTime();
long elapsedTime = stopTime - startTime;
System.out.println( \" \" + n + \"\\t\\t\\t \" + nfibonacci(n) + \"\\t\\t\\t \" + elapsedTime);
//System.out.println(/*\"Start Time: \" + startTime + \"\ Stop Time: \" + stopTime + */
// \"\ Elapsed Time: \" + elapsedTime);
}
System.out.println(\"\ \ \ \");
System.out.println(\"Recursive Factorial Method: \ \");
System.out.println(\" N\\t\\t\" + \"\\t Factorial\\t\\t\" + \"\\tTime Elapsed\");
for ( int n = 0; n < 25; n++)
{
long startTime = System.nanoTime();
nfactorial(n);
long stopTime = System.nanoTime();
long elapsedTime = stopTime - startTime;
System.out.println( \" \" + n + \"\\t\\t\\t \\t\" + factorial(n) + \"\\t\\t\\t\\t\\t\" +
elapsedTime);
//System.out.println(/*\"Start Time: .
Write a program that obtains the execution time of selection sort, bu.pdf
Write a java program called Question39 that does the following: Gets input for temperature
Utilizing a branching statement: If temperature is 76-100, call method outputHot passing the
temperature input as an argument. If temperature is 0-39, call method outputCold passing the
temperature input as an argument. If temperature is 40 to 75, call method outputJustRight
passing the temperature input as an argument. If temperature is outside these ranges, output
“Temperature outside range” to the screen. Be precise, import modules, include comments,
prologue, etc. as needed.
Solution
Question39.java
import java.util.Scanner;
public class Question39 {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
System.out.println(\"Enter temperature: \");
int temp = scan.nextInt();
if(temp >=76 && temp <=100){
outputHot(temp);
}
else if(temp >=0 && temp <=39){
outputCold(temp);
}
else if(temp >=40 && temp <=75){
outputJustRight(temp);
}
else{
System.out.println(\"Temperature outside range\");
}
}
public static void outputHot(int temp){
System.out.println(\"Temperature \"+temp+\" Hot \");
}
public static void outputCold(int temp){
System.out.println(\"Temperature \"+temp+\" Cold \");
}
public static void outputJustRight(int temp){
System.out.println(\"Temperature \"+temp+\" Just Right \");
}
}
Output:
Enter temperature:
45
Temperature 45 Just Right.
Problem1 java codeimport java.util.Scanner; Java code to pr.pdf
// Problem1 java code
import java.util.Scanner;
// Java code to print all possible strings of letter L and R
class Problem1 {
static void print(char set[], int length) {
int setLength = set.length;
printRecursion(set, \"\", setLength, length);
}
static void printRecursion(char set[], String prefixset, int setLength, int length) {
// Base case: length is 0
if (length == 0) {
System.out.println(prefixset);
return;
}
for (int i = 0; i < setLength; ++i) {
String newPrefixset = prefixset + set[i];
printRecursion(set, newPrefixset, setLength, length - 1);
}
}
public static void main(String[] args) {
Scanner scan=new Scanner(System.in);
System.out.println(\"Enter length: \");
int length = scan.nextInt();
char set[] = {\'L\', \'R\'};
print(set, length);
}
}
/*
output:
Enter length:
3
LLL
LLR
LRL
LRR
RLL
RLR
RRL
RRR
*/
// Problem2 java code
import java.util.Scanner;
// Java code to print all possible strings of letter L and R
class Problem2 {
static void print(char set[], int length) {
int setLength = set.length;
printRecursion(set, \"\", setLength, length);
}
static void printRecursion(char set[], String prefixset, int setLength, int length) {
// Base case: length is 0
if (length == 0) {
System.out.print(prefixset + \" \");
return;
}
for (int i = 0; i < setLength; ++i) {
String newPrefixset = prefixset + set[i];
printRecursion(set, newPrefixset, setLength, length - 1);
}
}
public static void main(String[] args) {
Scanner scan=new Scanner(System.in);
System.out.println(\"Enter length: \");
int length = scan.nextInt();
char set[] = {\'1\', \'3\', \'5\', \'7\', \'9\'};
print(set, length);
System.out.println();
}
}
/*
output:
Enter length:
3
111 113 115 117 119 131 133 135 137 139 151 153 155
157 159 171 173 175 177 179 191 193 195 197 199 311
313 315 317 319 331 333 335 337 339 351 353 355 357
359 371 373 375 377 379 391 393 395 397 399 511 513
515 517 519 531 533 535 537 539 551 553 555 557 559
571 573 575 577 579 591 593 595 597 599 711 713 715
717 719 731 733 735 737 739 751 753 755 757 759 771
773 775 777 779 791 793 795 797 799 911 913 915 917
919 931 933 935 937 939 951 953 955 957 959 971 973
975 977 979 991 993 995 997 999
*/
// Problem3 java code
import java.util.Scanner;
// Java code to multiply 2 numbers
class Problem3 {
public static int multiply(int a, int b)
{
int temp = b;
for (int i = 1; i < a; i++ ) {
b = b + temp;
}
return b;
}
public static void main(String[] args) {
Scanner scan=new Scanner(System.in);
System.out.println(\"Enter a: \");
int a = scan.nextInt();
System.out.println(\"Enter b: \");
int b = scan.nextInt();
System.out.println(a + \"X\" + b + \" = \" + multiply(a,b));
}
}
/*
output:
Enter a:
7
Enter b:
6
7X6 = 42
*/
// Problem4 java code
import java.util.Scanner;
// Java code to find gcd 2 numbers
class Problem4 {
public static int gcd(int a, int b)
{
if (b!=0)
return gcd(b, a%b);
else
return a;
}
public static void main(String[] args) {
Scanner scan=new Scanner(System.in);
System.out.println(\"Enter a: \");
int a = scan.ne.
Add an interactive command line to your C++ application
How to add an interactive shell (remote, too) to a C++ application by using my open-source C++14 library:
https://github.com/daniele77/cli
In the slide deck you can learn how to use it, how does it work, and find some thoughts about C++ design and patterns used by the library.
My code is below How do I write this code without usin.pdf
My code is below...... How do I write this code without using arrays? I also need to write it without
using the while (true) or using a break statement. I need to use a prime read and a sentinel value
to control the repetition.
import java.text.DecimalFormat;
import java.util.Scanner;
public class AuthorPay2 {
public static void main(String[] args) {
//Declaring variables
double largestAmount = 0.0, avgAmt = 0.0, totAmount = 0.0;
int totNoOfPayments = 0;
//Creating an integer array
int[] countPayLevels = new int[3];
//DecimalFormat class is used to format the output
DecimalFormat df = new DecimalFormat(".00");
/*
*Creating an Scanner class object which is used to get the inputs
*entered by the user
*/
Scanner sc = new Scanner(System.in);
while (true) {
//Getting the input entered by the user
System.out.print("Enter the length of the story: ");
int length = sc.nextInt();
if (length != -1) {
System.out.print("Enter the level of the author: ");
char level = sc.next().charAt(0);
double amount = calculateAmount(length, level);
if (largestAmount < amount) {
largestAmount = amount;
}
totAmount += amount;
totNoOfPayments++;
if (level == 'A' || length == 'a') {
countPayLevels[0]++;
} else if (level == 'B' || length == 'b') {
countPayLevels[1]++;
} else if (level == 'C' || length == 'c') {
countPayLevels[2]++;
}
System.out.println("Length of the story: " + length + " Amount to be paid; $" + df.format(amount));
} else {
avgAmt = totAmount / totNoOfPayments;
System.out.println("nTotal no of payments: " + totNoOfPayments);
System.out.println("No of Payments made at level 'A': " + countPayLevels[0]);
System.out.println("No of Payments made at level 'B': " + countPayLevels[1]);
System.out.println("No of Payments made at level 'C': " + countPayLevels[2]);
System.out.printf("The average amount paid for a story: %.2fn", avgAmt);
System.out.printf("The largest amount paid for a story: %.2fn", largestAmount);
break;
}
}
}
private static double calculateAmount(int length, char level) {
double amount = 0.0;
if (length < 7500) {
amount = 0.08 * length;
} else if (length >= 7500 && length < 8000) {
amount = 600;
} else if (length >= 8000 && length < 17500) {
amount = 0.075 * length;
} else if (length >= 17500 && length <= 190000) {
amount = 1313;
} else if (length > 19000) {
amount = 0.07 * length;
}
if (level == 'A' || length == 'a') {
amount = 1.75 * amount;
} else if (level == 'B' || length == 'b') {
amount = 1.25 * amount;
}
return amount;
}
}.
Hands on Session on Python
This is the collection of slides when conducting a Python Workshop held at Dayananda Sagar College of Engineering.
Recommended
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.
I have already done the first 2 parts(factorial and fibonacci) also .pdf
I have already done the first 2 parts(factorial and fibonacci) also finding the time elapsed, need to
do the last 2 parts (palindromes and binary search) also finding the time elapsed on each version
(need to add code for that).
Assignments:
1) Write the recursive and nonrecursive version of
a. Int factorial(int n), (use nFactorial as the name for non-recursive version) (where n >= 0)
b. Int fibonacci(int n), (and nFibonacci as the name for non-recursive version)
c. boolean isPalindrome(String s, int low, int high), (and nIsPalindrome for the non-recursive
version)
d. int binarySearch(int[] v, int key, int low, int high), (and nBinarySearch for the non recursive
version)
2) Develop testing schemes as following:
a. For a and b: use at least 20 different values of n (from small to sufficiently large) and the time
function to find the time spent for different values of n.
b. For c, set up a string array of size 20 and initialize them with at least 10 palindromes. (already
made an array in the method)
c. For d, do the following: (need to make a new method for both versions and all the calls for
both )
i. Fill an integer array of 1000 multiples of 3 from 0 to 2997 (i.e., 0, 3, 6, 9,…,2997) and have
them properly sorted.
ii. Test your function and see if it works.
iii. Set up a test array with 20 random integers between 0 and 3000 to test the program.
Main method code:
public class factorials {
public static void main (String args[])
{
System.out.println(\"Recursive Fibonacci Method: \ \");
System.out.println(\" N\\t\\t\" + \"Fibonacci Sequence\\t\\t\" + \"Time Elapsed\");
for(int n = 0; n < 25; n++)
{
long startTime = System.nanoTime();
fibonacci(n);
long stopTime = System.nanoTime();
long elapsedTime = stopTime - startTime;
System.out.println( \" \" + n + \"\\t\\t\\t \" + fibonacci(n) + \"\\t\\t\\t \" + elapsedTime);
//System.out.println(/*\"Start Time: \" + startTime + \"\ Stop Time: \" + stopTime + */
//\"\ Elapsed Time: \" + elapsedTime);
}
System.out.println(\"\ \");
System.out.println(\"Iterative Fibonacci Method: \ \");
System.out.println(\" N\\t\\t\" + \"Fibonacci Sequence\\t\\t\" + \"Time Elapsed\");
for ( int n = 0; n < 25; n++)
{
long startTime = System.nanoTime();
nfactorial(n);
long stopTime = System.nanoTime();
long elapsedTime = stopTime - startTime;
System.out.println( \" \" + n + \"\\t\\t\\t \" + nfibonacci(n) + \"\\t\\t\\t \" + elapsedTime);
//System.out.println(/*\"Start Time: \" + startTime + \"\ Stop Time: \" + stopTime + */
// \"\ Elapsed Time: \" + elapsedTime);
}
System.out.println(\"\ \ \ \");
System.out.println(\"Recursive Factorial Method: \ \");
System.out.println(\" N\\t\\t\" + \"\\t Factorial\\t\\t\" + \"\\tTime Elapsed\");
for ( int n = 0; n < 25; n++)
{
long startTime = System.nanoTime();
nfactorial(n);
long stopTime = System.nanoTime();
long elapsedTime = stopTime - startTime;
System.out.println( \" \" + n + \"\\t\\t\\t \\t\" + factorial(n) + \"\\t\\t\\t\\t\\t\" +
elapsedTime);
//System.out.println(/*\"Start Time: .
Write a program that obtains the execution time of selection sort, bu.pdf
Write a java program called Question39 that does the following: Gets input for temperature
Utilizing a branching statement: If temperature is 76-100, call method outputHot passing the
temperature input as an argument. If temperature is 0-39, call method outputCold passing the
temperature input as an argument. If temperature is 40 to 75, call method outputJustRight
passing the temperature input as an argument. If temperature is outside these ranges, output
“Temperature outside range” to the screen. Be precise, import modules, include comments,
prologue, etc. as needed.
Solution
Question39.java
import java.util.Scanner;
public class Question39 {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
System.out.println(\"Enter temperature: \");
int temp = scan.nextInt();
if(temp >=76 && temp <=100){
outputHot(temp);
}
else if(temp >=0 && temp <=39){
outputCold(temp);
}
else if(temp >=40 && temp <=75){
outputJustRight(temp);
}
else{
System.out.println(\"Temperature outside range\");
}
}
public static void outputHot(int temp){
System.out.println(\"Temperature \"+temp+\" Hot \");
}
public static void outputCold(int temp){
System.out.println(\"Temperature \"+temp+\" Cold \");
}
public static void outputJustRight(int temp){
System.out.println(\"Temperature \"+temp+\" Just Right \");
}
}
Output:
Enter temperature:
45
Temperature 45 Just Right.
Problem1 java codeimport java.util.Scanner; Java code to pr.pdf
// Problem1 java code
import java.util.Scanner;
// Java code to print all possible strings of letter L and R
class Problem1 {
static void print(char set[], int length) {
int setLength = set.length;
printRecursion(set, \"\", setLength, length);
}
static void printRecursion(char set[], String prefixset, int setLength, int length) {
// Base case: length is 0
if (length == 0) {
System.out.println(prefixset);
return;
}
for (int i = 0; i < setLength; ++i) {
String newPrefixset = prefixset + set[i];
printRecursion(set, newPrefixset, setLength, length - 1);
}
}
public static void main(String[] args) {
Scanner scan=new Scanner(System.in);
System.out.println(\"Enter length: \");
int length = scan.nextInt();
char set[] = {\'L\', \'R\'};
print(set, length);
}
}
/*
output:
Enter length:
3
LLL
LLR
LRL
LRR
RLL
RLR
RRL
RRR
*/
// Problem2 java code
import java.util.Scanner;
// Java code to print all possible strings of letter L and R
class Problem2 {
static void print(char set[], int length) {
int setLength = set.length;
printRecursion(set, \"\", setLength, length);
}
static void printRecursion(char set[], String prefixset, int setLength, int length) {
// Base case: length is 0
if (length == 0) {
System.out.print(prefixset + \" \");
return;
}
for (int i = 0; i < setLength; ++i) {
String newPrefixset = prefixset + set[i];
printRecursion(set, newPrefixset, setLength, length - 1);
}
}
public static void main(String[] args) {
Scanner scan=new Scanner(System.in);
System.out.println(\"Enter length: \");
int length = scan.nextInt();
char set[] = {\'1\', \'3\', \'5\', \'7\', \'9\'};
print(set, length);
System.out.println();
}
}
/*
output:
Enter length:
3
111 113 115 117 119 131 133 135 137 139 151 153 155
157 159 171 173 175 177 179 191 193 195 197 199 311
313 315 317 319 331 333 335 337 339 351 353 355 357
359 371 373 375 377 379 391 393 395 397 399 511 513
515 517 519 531 533 535 537 539 551 553 555 557 559
571 573 575 577 579 591 593 595 597 599 711 713 715
717 719 731 733 735 737 739 751 753 755 757 759 771
773 775 777 779 791 793 795 797 799 911 913 915 917
919 931 933 935 937 939 951 953 955 957 959 971 973
975 977 979 991 993 995 997 999
*/
// Problem3 java code
import java.util.Scanner;
// Java code to multiply 2 numbers
class Problem3 {
public static int multiply(int a, int b)
{
int temp = b;
for (int i = 1; i < a; i++ ) {
b = b + temp;
}
return b;
}
public static void main(String[] args) {
Scanner scan=new Scanner(System.in);
System.out.println(\"Enter a: \");
int a = scan.nextInt();
System.out.println(\"Enter b: \");
int b = scan.nextInt();
System.out.println(a + \"X\" + b + \" = \" + multiply(a,b));
}
}
/*
output:
Enter a:
7
Enter b:
6
7X6 = 42
*/
// Problem4 java code
import java.util.Scanner;
// Java code to find gcd 2 numbers
class Problem4 {
public static int gcd(int a, int b)
{
if (b!=0)
return gcd(b, a%b);
else
return a;
}
public static void main(String[] args) {
Scanner scan=new Scanner(System.in);
System.out.println(\"Enter a: \");
int a = scan.ne.
Add an interactive command line to your C++ application
How to add an interactive shell (remote, too) to a C++ application by using my open-source C++14 library:
https://github.com/daniele77/cli
In the slide deck you can learn how to use it, how does it work, and find some thoughts about C++ design and patterns used by the library.
My code is below How do I write this code without usin.pdf
My code is below...... How do I write this code without using arrays? I also need to write it without
using the while (true) or using a break statement. I need to use a prime read and a sentinel value
to control the repetition.
import java.text.DecimalFormat;
import java.util.Scanner;
public class AuthorPay2 {
public static void main(String[] args) {
//Declaring variables
double largestAmount = 0.0, avgAmt = 0.0, totAmount = 0.0;
int totNoOfPayments = 0;
//Creating an integer array
int[] countPayLevels = new int[3];
//DecimalFormat class is used to format the output
DecimalFormat df = new DecimalFormat(".00");
/*
*Creating an Scanner class object which is used to get the inputs
*entered by the user
*/
Scanner sc = new Scanner(System.in);
while (true) {
//Getting the input entered by the user
System.out.print("Enter the length of the story: ");
int length = sc.nextInt();
if (length != -1) {
System.out.print("Enter the level of the author: ");
char level = sc.next().charAt(0);
double amount = calculateAmount(length, level);
if (largestAmount < amount) {
largestAmount = amount;
}
totAmount += amount;
totNoOfPayments++;
if (level == 'A' || length == 'a') {
countPayLevels[0]++;
} else if (level == 'B' || length == 'b') {
countPayLevels[1]++;
} else if (level == 'C' || length == 'c') {
countPayLevels[2]++;
}
System.out.println("Length of the story: " + length + " Amount to be paid; $" + df.format(amount));
} else {
avgAmt = totAmount / totNoOfPayments;
System.out.println("nTotal no of payments: " + totNoOfPayments);
System.out.println("No of Payments made at level 'A': " + countPayLevels[0]);
System.out.println("No of Payments made at level 'B': " + countPayLevels[1]);
System.out.println("No of Payments made at level 'C': " + countPayLevels[2]);
System.out.printf("The average amount paid for a story: %.2fn", avgAmt);
System.out.printf("The largest amount paid for a story: %.2fn", largestAmount);
break;
}
}
}
private static double calculateAmount(int length, char level) {
double amount = 0.0;
if (length < 7500) {
amount = 0.08 * length;
} else if (length >= 7500 && length < 8000) {
amount = 600;
} else if (length >= 8000 && length < 17500) {
amount = 0.075 * length;
} else if (length >= 17500 && length <= 190000) {
amount = 1313;
} else if (length > 19000) {
amount = 0.07 * length;
}
if (level == 'A' || length == 'a') {
amount = 1.75 * amount;
} else if (level == 'B' || length == 'b') {
amount = 1.25 * amount;
}
return amount;
}
}.
Hands on Session on Python
This is the collection of slides when conducting a Python Workshop held at Dayananda Sagar College of Engineering.
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.
FileName EX06_1java Programmer import ja.pdf
//FileName: EX06_1.java
//Programmer: ............
import java.util.Scanner;
import java.util.Arrays;
public class EX06_1
{
public static void main(String[] args)
{
Scanner input = new Scanner(System.in);
System.out.print("Enter a list of SAT scores: ");
String str = input.nextLine();
String[] items = str.split(" ");
double[] values = new double[items.length];
for (int i = 0; i<items.length; i++)
{
values[i] = Double.parseDouble(items[i]);
}
//count
System.out.print("Count: ");
int count = 0;
for (int i=0; i<values.length; i++)
{
count++;
}
System.out.println((count == values.length) ? values.length : count);
//sum
double sum = 0;
for (int i = 0; i<values.length; i++)
{
sum += values[i];
}
System.out.println("Sum: " + sum);
//mean
double mean = (sum/count);
System.out.println("Mean: " + mean);
//min and max
double min = values[0];
double max = values[0];
for (int i=1; i<values.length; i++)
{
if (values[i] < min)
{
min = values[i];
}
if (values[i] > max)
{
max = values[i];
}
}
System.out.println("Minimum: " + min);
System.out.println("Maximum: " + max);
System.out.println("Range: " + (max-min));
//sorting
Arrays.sort(values);
//median
int position = (count+1) / 2;
if (count%2 != 0)
{
System.out.println("Median: " + values[position-1]);
}
else
{
System.out.println("Median: " + (( values[position-1] + values[position]) / 2));
}
//Standard deviation
double sigmap = 0; //for population
double sigmas = 0; //for sample
for (int i=0; i<values.length; i++)
{
sigmap += (values[i] - mean)*(values[i] - mean);
}
sigmas = sigmap;
//sd for population
sigmap = sigmap / count;
System.out.println("Variance of population: " + sigmap);
double sdp = Math.sqrt(sigmap);
System.out.println("Standard Deviation of population: " + sdp);
//sd for sample
sigmas = sigmas / (count - 1);
System.out.println("Variance of sample: " + sigmas);
double sds = Math.sqrt(sigmas);
System.out.println("Standard Deviation of sample: " + sds);
//Skewness
double sigma = 0;
for (int i=0; i<values.length; i++)
{
sigma += (values[i] - mean)*(values[i] - mean)*(values[i] - mean);
}
double N = (double) count;
double sk = (Math.sqrt(N*(N-1)) / (N-2)) * (sigma / (sdp*sdp*sdp*N));
System.out.println("Skewness: " + sk);
//mode
int repeated = -1;
int[] frq = new int[values.length];
for (int i=0; i<values.length; i++)
{
int occ = 1;
for (int j=i+1; j<values.length; j++)
{
if (values[i] == values[j])
{
frq[j] = repeated;
occ++;
}
}
if (frq[i] != repeated)
{
frq[i] = occ;
}
}
int maxFrq = frq[0];
for (int i=0; i<frq.length; i++)
{
if (frq[i] > maxFrq)
{
maxFrq = frq[i];
}
}
System.out.print("Mode: ");
if (maxFrq == 1)
{
System.out.println("N/A");
}
else
{
for (int i=0; i<frq.length; i++)
{
if (frq[i] == maxFrq)
{
System.out.print(values[i] + " ");
}
}
System.out.print("n");
}
double standardError=sds/Math.sqrt(count);
System.out.println("Standard Error: "+standardError);
}
}
Programming Exercise #06_2:
Instruction:
1. Make a copy of your EX06_01.java file and rename it to EX06_2.java.
2. Open the EX06.
I have written the code but cannot complete the assignment please help.pdf
I have written the code but cannot complete the assignment please help me to complete.
Please don't just copy other s answers as your own.
// Insertion sort
/*
#include <ctime>
#include <iostream>
using namespace std;
void insertionSort(int arr[], int n) {
int i, key, j;
for (i = 1; i < n; i++) {
key = arr[i];
j = i - 1;
// Move elements of arr[0..i-1], that are greater than key, to one position ahead of their current
position
while (j >= 0 && arr[j] > key) {
arr[j + 1] = arr[j];
j = j - 1;
}
arr[j + 1] = key;
}
}
int main() {
int n;
cout << "Enter the size of the array: ";
cin >> n;
int arr[n];
cout << "Enter the elements of the array: ";
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
int num = sizeof(arr) / sizeof(arr[0]);
clock_t start, end;
double timetaken;
start = clock();
insertionSort(arr, num);
end = clock();
cout << "Sorted array: \n";
for (int i = 0; i < n; i++)
cout << arr[i] << " ";
cout << endl;
timetaken = ((double) (end - start)) / CLOCKS_PER_SEC;
cout << "Time taken : " << fixed << timetaken << "s" << endl;
return 0;
}
*/
// Shell Sort
/*
#include <ctime>
#include <iostream>
using namespace std;
int shellSort(int arr[], int n) {
for (int gap = n/2; gap > 0; gap /= 2) {
for (int i = gap; i < n; i += 1) {
int temp = arr[i];
int j;
for (j = i; j >= gap && arr[j - gap] > temp; j -= gap)
arr[j] = arr[j - gap];
arr[j] = temp;
}
}
return 0;
}
void printArray(int arr[], int n) {
for (int i=0; i<n; i++)
cout << arr[i] << " ";
}
int main() {
int n;
cout << "Enter the size of the array: ";
cin >> n;
int arr[n];
cout << "Enter the elements of the array: ";
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
int num = sizeof(arr) / sizeof(arr[0]);
clock_t start, end;
double timetaken;
start = clock();
shellSort(arr, num);
end = clock();
cout << "\nArray after sorting: \n";
printArray(arr, n);
cout << endl;
timetaken = (double)(end - start) / CLOCKS_PER_SEC;
cout << "Time taken : " << fixed << timetaken << "s" << endl;
return 0;
}
*/
// MergeSort
/*
#include <ctime>
#include <iostream>
using namespace std;
void merge(int arr[], int l, int m, int r) {
int i, j, k;
int n1 = m - l + 1;
int n2 = r - m;
int L[n1], R[n2];
for (i = 0; i < n1; i++)
L[i] = arr[l + i];
for (j = 0; j < n2; j++)
R[j] = arr[m + 1 + j];
i = 0;
j = 0;
k = l;
while (i < n1 && j < n2) {
if (L[i] <= R[j]) {
arr[k] = L[i];
i++;
}
else {
arr[k] = R[j];
j++;
}
k++;
}
while (i < n1) {
arr[k] = L[i];
i++;
k++;
}
while (j < n2) {
arr[k] = R[j];
j++;
k++;
}
}
void mergeSort(int arr[], int l, int r) {
if (l < r) {
int m = l + (r - l) / 2;
mergeSort(arr, l, m);
mergeSort(arr, m + 1, r);
merge(arr, l, m, r);
}
}
int main() {
int n;
cout << "Enter the size of the array: ";
cin >> n;
int arr[n];
cout << "Enter the elements of the array: ";
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
int arr_size = sizeof(arr) / sizeof(arr[0]);
clock_t start;
clock_t end;
double timetaken;
start = clock();
mergeSort(arr, 0, arr_size - 1);
end = clock();
timetaken = (double)(end - start) / CLOCKS_PER_SEC;
.
2 BytesC++ course_2014_c3_ function basics¶meters and overloading
This is my C++ course / basic , intermediate and a little advance
Instruction1. Please read the two articles. (Kincheloe part 1 &.docx
Instruction:
1. Please read the two articles. (Kincheloe part 1 & 2)
2. Please choose some of the topics covered in each chapter, provide a brief summary (2-3 sentences) of those topics.
3. Then add your reflections, insights, or relevant experiences, etc. to help illustrate or expand upon the course.
4. This journal should be at least 400 words.
p5-start.cppp5-start.cpp/**
* @author Jane Student
* @cwid 123 45 678
* @class CSci 430, Spring 2018
* @ide Visual Studio Express 2010
* @date November 15, 2018
* @assg prog-04
*
* @description This program implements a simulation of process
* scheduling policies. In this program, we implement round-robin
* scheduling, where the time slice quantum can be specified as
* as a command line parameter. And we also implement shortest
* remaining time (SRT) scheduling policy
*/
#include<stdlib.h>
#include<iostream>
#include<iomanip>
#include<fstream>
#include<string>
#include<list>
usingnamespace std;
// global constants
// I won't test your round robin implementation with more than 20 processes
constint MAX_PROCESSES =20;
constint NO_PROCESS =0;
// Simple structure, holds all of the information about processes, their names
// arrival and service times, that we are to simulate.
typedefstruct
{
string processName;
int arrivalTime;
int serviceTime;
// holds running count of time slices for current time quantum, when
// serviceTime == quantum, time slice is up
int sliceTime;
// holds total number of time steps currently run, when == to
// serviceTime process is done
int totalTime;
// holds time when process finishes, used to calculate final stats,
// like T_r, T_r/T_s
int finishTime;
// a boolean flag, we will set this to true when the process is complete
bool finished;
}Process;
// Process table, holds table of information about processes we are simulating
typedefstruct
{
int numProcesses;
Process* process[MAX_PROCESSES];
}ProcessTable;
/** Create process table
* Allocate memory for a new process table. Load the process
* information from the simulation file into a table with the process
* information needed to perform the simulation. At the same time we
* initialize other information in process table for use in the
* simulation. Return the newly created ProcessTable
*
* @param processFilanem The name (char*) of the file to open and read
* the process information from.
* @param processTable This is actually a return parameter. This
* should be a pointer to an already allocated array of
* Process structure items. We will fill in this structure
* and return the process information.
*
* @returns ProcessTable* The newly allocated and initialized ProcessTable
* structure.
*/
ProcessTable* createProcessTable(char* processFilename)
{
ifstream simprocessfile(processFilename);
ProcessTable* processTable;
int pid;
string processName;
int arrivalTime;
int serviceTime;
// If we can't open file, abort and let ...
Java programs - bubble sort, iterator, linked list, hash set, reverse string,...
Java programs - bubble sort, iterator, linked list, hash set, reverse string,...Sunil Kumar Gunasekaran
Java Foundations: Data Types and Type Conversion
Learn how to use data types and variables in Java, how variables are stored in the memory and how to convert from one data type to another.
Watch the video lesson and access the hands-on exercises here: https://softuni.org/code-lessons/java-foundations-certification-data-types-and-variables
Advanced Java - Practical File
Advanced Java - Pratical File.
To Run the Output Use NetBeans.
OR
Run via CMD by throwing Java source.
Please help me figure out how to graph this- Eormulas- Solution- nput.pdf
Please help me figure out how to graph this.
Eormulas: Solution: nput Data Q = TCC = TOC = T I C = ROP = Dbjective: Find the order
quantity that minimizes the total cost of managing inventory.
PLease help KPIs and ROI are the same metric for social media marketin.pdf
PLease help
KPIs and ROI are the same metric for social media marketing.
True
False
It is important to use which type of metric to understand consumers' perceptions of and attitudes
toward a brand?
a. ROI
b. User-generated content
c. Quantitative
d. Qualitative
e. Number of shares.
More Related Content
Similar to please help finish sorting methods- import java-util-Arrays- import ja.pdf
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.
FileName EX06_1java Programmer import ja.pdf
//FileName: EX06_1.java
//Programmer: ............
import java.util.Scanner;
import java.util.Arrays;
public class EX06_1
{
public static void main(String[] args)
{
Scanner input = new Scanner(System.in);
System.out.print("Enter a list of SAT scores: ");
String str = input.nextLine();
String[] items = str.split(" ");
double[] values = new double[items.length];
for (int i = 0; i<items.length; i++)
{
values[i] = Double.parseDouble(items[i]);
}
//count
System.out.print("Count: ");
int count = 0;
for (int i=0; i<values.length; i++)
{
count++;
}
System.out.println((count == values.length) ? values.length : count);
//sum
double sum = 0;
for (int i = 0; i<values.length; i++)
{
sum += values[i];
}
System.out.println("Sum: " + sum);
//mean
double mean = (sum/count);
System.out.println("Mean: " + mean);
//min and max
double min = values[0];
double max = values[0];
for (int i=1; i<values.length; i++)
{
if (values[i] < min)
{
min = values[i];
}
if (values[i] > max)
{
max = values[i];
}
}
System.out.println("Minimum: " + min);
System.out.println("Maximum: " + max);
System.out.println("Range: " + (max-min));
//sorting
Arrays.sort(values);
//median
int position = (count+1) / 2;
if (count%2 != 0)
{
System.out.println("Median: " + values[position-1]);
}
else
{
System.out.println("Median: " + (( values[position-1] + values[position]) / 2));
}
//Standard deviation
double sigmap = 0; //for population
double sigmas = 0; //for sample
for (int i=0; i<values.length; i++)
{
sigmap += (values[i] - mean)*(values[i] - mean);
}
sigmas = sigmap;
//sd for population
sigmap = sigmap / count;
System.out.println("Variance of population: " + sigmap);
double sdp = Math.sqrt(sigmap);
System.out.println("Standard Deviation of population: " + sdp);
//sd for sample
sigmas = sigmas / (count - 1);
System.out.println("Variance of sample: " + sigmas);
double sds = Math.sqrt(sigmas);
System.out.println("Standard Deviation of sample: " + sds);
//Skewness
double sigma = 0;
for (int i=0; i<values.length; i++)
{
sigma += (values[i] - mean)*(values[i] - mean)*(values[i] - mean);
}
double N = (double) count;
double sk = (Math.sqrt(N*(N-1)) / (N-2)) * (sigma / (sdp*sdp*sdp*N));
System.out.println("Skewness: " + sk);
//mode
int repeated = -1;
int[] frq = new int[values.length];
for (int i=0; i<values.length; i++)
{
int occ = 1;
for (int j=i+1; j<values.length; j++)
{
if (values[i] == values[j])
{
frq[j] = repeated;
occ++;
}
}
if (frq[i] != repeated)
{
frq[i] = occ;
}
}
int maxFrq = frq[0];
for (int i=0; i<frq.length; i++)
{
if (frq[i] > maxFrq)
{
maxFrq = frq[i];
}
}
System.out.print("Mode: ");
if (maxFrq == 1)
{
System.out.println("N/A");
}
else
{
for (int i=0; i<frq.length; i++)
{
if (frq[i] == maxFrq)
{
System.out.print(values[i] + " ");
}
}
System.out.print("n");
}
double standardError=sds/Math.sqrt(count);
System.out.println("Standard Error: "+standardError);
}
}
Programming Exercise #06_2:
Instruction:
1. Make a copy of your EX06_01.java file and rename it to EX06_2.java.
2. Open the EX06.
I have written the code but cannot complete the assignment please help.pdf
I have written the code but cannot complete the assignment please help me to complete.
Please don't just copy other s answers as your own.
// Insertion sort
/*
#include <ctime>
#include <iostream>
using namespace std;
void insertionSort(int arr[], int n) {
int i, key, j;
for (i = 1; i < n; i++) {
key = arr[i];
j = i - 1;
// Move elements of arr[0..i-1], that are greater than key, to one position ahead of their current
position
while (j >= 0 && arr[j] > key) {
arr[j + 1] = arr[j];
j = j - 1;
}
arr[j + 1] = key;
}
}
int main() {
int n;
cout << "Enter the size of the array: ";
cin >> n;
int arr[n];
cout << "Enter the elements of the array: ";
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
int num = sizeof(arr) / sizeof(arr[0]);
clock_t start, end;
double timetaken;
start = clock();
insertionSort(arr, num);
end = clock();
cout << "Sorted array: \n";
for (int i = 0; i < n; i++)
cout << arr[i] << " ";
cout << endl;
timetaken = ((double) (end - start)) / CLOCKS_PER_SEC;
cout << "Time taken : " << fixed << timetaken << "s" << endl;
return 0;
}
*/
// Shell Sort
/*
#include <ctime>
#include <iostream>
using namespace std;
int shellSort(int arr[], int n) {
for (int gap = n/2; gap > 0; gap /= 2) {
for (int i = gap; i < n; i += 1) {
int temp = arr[i];
int j;
for (j = i; j >= gap && arr[j - gap] > temp; j -= gap)
arr[j] = arr[j - gap];
arr[j] = temp;
}
}
return 0;
}
void printArray(int arr[], int n) {
for (int i=0; i<n; i++)
cout << arr[i] << " ";
}
int main() {
int n;
cout << "Enter the size of the array: ";
cin >> n;
int arr[n];
cout << "Enter the elements of the array: ";
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
int num = sizeof(arr) / sizeof(arr[0]);
clock_t start, end;
double timetaken;
start = clock();
shellSort(arr, num);
end = clock();
cout << "\nArray after sorting: \n";
printArray(arr, n);
cout << endl;
timetaken = (double)(end - start) / CLOCKS_PER_SEC;
cout << "Time taken : " << fixed << timetaken << "s" << endl;
return 0;
}
*/
// MergeSort
/*
#include <ctime>
#include <iostream>
using namespace std;
void merge(int arr[], int l, int m, int r) {
int i, j, k;
int n1 = m - l + 1;
int n2 = r - m;
int L[n1], R[n2];
for (i = 0; i < n1; i++)
L[i] = arr[l + i];
for (j = 0; j < n2; j++)
R[j] = arr[m + 1 + j];
i = 0;
j = 0;
k = l;
while (i < n1 && j < n2) {
if (L[i] <= R[j]) {
arr[k] = L[i];
i++;
}
else {
arr[k] = R[j];
j++;
}
k++;
}
while (i < n1) {
arr[k] = L[i];
i++;
k++;
}
while (j < n2) {
arr[k] = R[j];
j++;
k++;
}
}
void mergeSort(int arr[], int l, int r) {
if (l < r) {
int m = l + (r - l) / 2;
mergeSort(arr, l, m);
mergeSort(arr, m + 1, r);
merge(arr, l, m, r);
}
}
int main() {
int n;
cout << "Enter the size of the array: ";
cin >> n;
int arr[n];
cout << "Enter the elements of the array: ";
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
int arr_size = sizeof(arr) / sizeof(arr[0]);
clock_t start;
clock_t end;
double timetaken;
start = clock();
mergeSort(arr, 0, arr_size - 1);
end = clock();
timetaken = (double)(end - start) / CLOCKS_PER_SEC;
.
2 BytesC++ course_2014_c3_ function basics¶meters and overloading
This is my C++ course / basic , intermediate and a little advance
Instruction1. Please read the two articles. (Kincheloe part 1 &.docx
Instruction:
1. Please read the two articles. (Kincheloe part 1 & 2)
2. Please choose some of the topics covered in each chapter, provide a brief summary (2-3 sentences) of those topics.
3. Then add your reflections, insights, or relevant experiences, etc. to help illustrate or expand upon the course.
4. This journal should be at least 400 words.
p5-start.cppp5-start.cpp/**
* @author Jane Student
* @cwid 123 45 678
* @class CSci 430, Spring 2018
* @ide Visual Studio Express 2010
* @date November 15, 2018
* @assg prog-04
*
* @description This program implements a simulation of process
* scheduling policies. In this program, we implement round-robin
* scheduling, where the time slice quantum can be specified as
* as a command line parameter. And we also implement shortest
* remaining time (SRT) scheduling policy
*/
#include<stdlib.h>
#include<iostream>
#include<iomanip>
#include<fstream>
#include<string>
#include<list>
usingnamespace std;
// global constants
// I won't test your round robin implementation with more than 20 processes
constint MAX_PROCESSES =20;
constint NO_PROCESS =0;
// Simple structure, holds all of the information about processes, their names
// arrival and service times, that we are to simulate.
typedefstruct
{
string processName;
int arrivalTime;
int serviceTime;
// holds running count of time slices for current time quantum, when
// serviceTime == quantum, time slice is up
int sliceTime;
// holds total number of time steps currently run, when == to
// serviceTime process is done
int totalTime;
// holds time when process finishes, used to calculate final stats,
// like T_r, T_r/T_s
int finishTime;
// a boolean flag, we will set this to true when the process is complete
bool finished;
}Process;
// Process table, holds table of information about processes we are simulating
typedefstruct
{
int numProcesses;
Process* process[MAX_PROCESSES];
}ProcessTable;
/** Create process table
* Allocate memory for a new process table. Load the process
* information from the simulation file into a table with the process
* information needed to perform the simulation. At the same time we
* initialize other information in process table for use in the
* simulation. Return the newly created ProcessTable
*
* @param processFilanem The name (char*) of the file to open and read
* the process information from.
* @param processTable This is actually a return parameter. This
* should be a pointer to an already allocated array of
* Process structure items. We will fill in this structure
* and return the process information.
*
* @returns ProcessTable* The newly allocated and initialized ProcessTable
* structure.
*/
ProcessTable* createProcessTable(char* processFilename)
{
ifstream simprocessfile(processFilename);
ProcessTable* processTable;
int pid;
string processName;
int arrivalTime;
int serviceTime;
// If we can't open file, abort and let ...
Java programs - bubble sort, iterator, linked list, hash set, reverse string,...
Java programs - bubble sort, iterator, linked list, hash set, reverse string,...Sunil Kumar Gunasekaran
Java Foundations: Data Types and Type Conversion
Learn how to use data types and variables in Java, how variables are stored in the memory and how to convert from one data type to another.
Watch the video lesson and access the hands-on exercises here: https://softuni.org/code-lessons/java-foundations-certification-data-types-and-variables
Advanced Java - Practical File
Advanced Java - Pratical File.
To Run the Output Use NetBeans.
OR
Run via CMD by throwing Java source.
Similar to please help finish sorting methods- import java-util-Arrays- import ja.pdf (20)
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
I have written the code but cannot complete the assignment please help.pdf
I have written the code but cannot complete the assignment please help.pdf
2 BytesC++ course_2014_c3_ function basics¶meters and overloading
2 BytesC++ course_2014_c3_ function basics¶meters and overloading
Instruction1. Please read the two articles. (Kincheloe part 1 &.docx
Instruction1. Please read the two articles. (Kincheloe part 1 &.docx
Java programs - bubble sort, iterator, linked list, hash set, reverse string,...
Java programs - bubble sort, iterator, linked list, hash set, reverse string,...
Quest 1 define a class batsman with the following specifications
Quest 1 define a class batsman with the following specifications
More from anfenterprises
Please help me figure out how to graph this- Eormulas- Solution- nput.pdf
Please help me figure out how to graph this.
Eormulas: Solution: nput Data Q = TCC = TOC = T I C = ROP = Dbjective: Find the order
quantity that minimizes the total cost of managing inventory.
PLease help KPIs and ROI are the same metric for social media marketin.pdf
PLease help
KPIs and ROI are the same metric for social media marketing.
True
False
It is important to use which type of metric to understand consumers' perceptions of and attitudes
toward a brand?
a. ROI
b. User-generated content
c. Quantitative
d. Qualitative
e. Number of shares.
please help i will like please and thank you The term Osmosis is gen.pdf
please help i will like please and thank you
The term Osmosis is generally used to describe water moving across a selectively permeable
membrane. True False Question 7 2 p pts Water will tend to move from an area of higher water
potential to an area of lower water potential. True Fatse Which of the following are true about
the calculation of water potential? Dissolving solutes in water lowers the water potential. Pulling
on water (creating a tension) lowers the water potential. Dissolving solutes in water raises the
water potential. Solute concentration makes no difference to the water potential. Question 9
Diffusion is not an effective way to move solutes over long distances in a plant. True False
Water potential ( Y ) of a solution is determined by the addition of Y p + Y s + Y g . Which two
of these three terms ( p , s, and g ) are most important for determining the Y of a single plant
cell? P and s 5 and g p and g Question 11 2 pts Aquaporins facilitate/speed-up the movement of
water across a membrane. True: False.
PLEASE HELP ASAP!! Quality Service Systems uses a perpetual inventory.pdf
PLEASE HELP ASAP!!
Quality Service Systems uses a perpetual inventory system. The adjusted trial balance of Quality
Service Systems at March 31, 2024, follows: (Click the icon to view the adjusted trial balance.)
Prepare Quality's multi-step income statement for the year ended March 31, 2024. (Use a minus
sign or parentheses to show other expenses.) Data table Data table Data table.
Please help ASAP for an upvote With the help of diagrams- explain the.pdf
Please help ASAP for an upvote
With the help of diagrams, explain the foundational blocks of a modern Graphic pipeline/system.
a) What roles do the GPU and CPU play in the process?
b) What difference do you find between OPENGL and WEBGL.
c) Give two examples of a WebGL function..
Please help answer the problem in the screenshot- Thanks! 5- Support (1).pdf
Please help answer the problem in the screenshot. Thanks!
5. Support Vectors: In the linearly separable case, prove that we need at most d + 1 support
vectors for a naive SVM, where d is the number of features. (Naive SVM means we use a hard-
margin SVM with "linear" kernel.).
Please help When preparing a smear from a solid culture of a suspecte.pdf
Please help
When preparing a smear from a solid culture of a suspected Acid Fast species Heat the slide
before making the smear Mix the bacteria into a drop of water on the glass slide Apply the
bacteria directly to the glass slide Mix the bacteria into a liquid broth before adding it to the slide
QUESTION 7 In a sample of endospore stained cells, the cells that produce spores are called
vegetative cells endospores vegetable cells exospores In the image below, what type of
endospore arrangement is shown? terminal, elliptical, not bulging subterminal, elliptical, bulging
central, elliptical, not bulging central, oval, bulging.
Please help Required information -The following information applies t.pdf
Please help
Required information [The following information applies to the questions displayed below.] Trey
Monson starts a merchandising business on December 1 and enters into the following three
inventory purchases. Monson uses a perpetual inventory system. Also, on December 15 ,
Monson sells 15 units for $32 each. Determine the costs assigned to ending inventory when costs
are assigned based on the LIFO method..
please help 5- (2 points) On Figure 1 there are two profiles- which y.pdf
please help
5. (2 points) On Figure 1 there are two profiles, which you should label as 1) dissolved oxygen
concentration, 2) nitrate concentration, 3) fraction of archaea. That means that one profile is
shaped like two different parameters and should therefore be identified twice. Additionally, on
your oxygen profile draw an arrow indicating the oxygen minimum zone. Figure 1. Water depth
versus representative profiles.
please help 3 Identify- label- and color the following structures on.pdf
please help
3 Identify, label, and color the following structures on Figure 7.3. Pectoralis major m . Serratus
anterior m. 2 External oblique m. 3 Umbilicus \& Internal oblique m .5 Transverse abdominis m
.6 Rectus abdominis m ..
Please help Draw a project network from the following information- W.pdf
Please help
Draw a project network from the following information. What activity(s) is a burst activity?
What activity(s) is a merge activity? What type of activity is each of the following? Activity A
Activity B Activity C Activity D Activity E.
Please help When staining endospores- the outer layers of the endos.pdf
Please help
When staining endospores, the outer layers of the endospore must be penetrated with to force
dyes inside the endospore. UV light Any of these can be used to penetrate the endospore acidic
pH heat QUESTION 10 Are endospores alive? In your own words, explain why you would
classify an endospore as a living or non-living structure. Hint: You can make a compelling
argument for either answer..
please help To map 3 genes in E coli- interrupted mating experiment.pdf
please help
To map 3 genes in E coli, interrupted mating experiments were done. The donor genes appeared
in the recipient as follows: O at 5 minutes, V at 11 minutes, and R at 8 minutes.
Which gene is in the middle?
cant be be determined using information given
O
R
V.
please give the solution with detailed steps and explanation subject -.pdf
please give the solution with detailed steps and explanation
subject :- theory of computation
i) Convert the regular Expression into Finite automata ( 1 + 1 + 0 + 1 + 1 ) 0101 Using direct and
subset construction method and convert the finite automata into Regular Expression using
equation, Ardens and state elimination methods.
Please go through the charts and identify the followings- Please go th.pdf
Please go through the charts and identify the followings:
Please go through the charts and identify the followings: 1. Hammer 2. Inverted Hammer 3.
Shooting Star 4. Hanging Man 5. Comment on RSI 6. Comment on MACD.
Please give the definition of the following key terms- anesthesia.pdf
Please give the definition of the following key terms:
anesthesia
emergence phase
emulsion
endotracheal (ET) tube
extubation
fasciculation
induction phase
intubation
lacrimation
laryngeal masked airway (LMA)
maintenance phase
minimum alveolar concentration (MAC)
opioid
post-anesthesia care unit (PACU)
Induction phase
rapid sequence induction (RSI)
amnestic
analgesia
anterograde
anticholinergic
anxiolytics
aspiration
benzodiazepine
NPO
opioid.
Please give some response to question 4- 3- Explain why sun and shade.pdf
Please give some response to question 4.
3. Explain why sun and shade plants have different maximum rates of photosynthesis and
different light saturation points? 4. How would you expect the light response curves of the sun
and shade leaves to differ if rates of photosynthesis were expressed per unit mass of leaf
chlorophyll rather than on a leaf area basis?.
Please fiview and the following statements and decide whether the stat.pdf
Please fiview and the following statements and decide whether the statement is mestly "True or
moatly "False." a. All that Entreprenours need is capital. b. Entrepreneurs have a very specilio
profile. c. The world of Entrepreneurship is unstructured and chactis. a. Eiprepreneurs are not
thinkers. a. Ertrepeeneurs are always inventora..
Please fill out Homestead Crafts- a distributor of handmade gifts- op.pdf
Please fill out
Homestead Crafts, a distributor of handmade gifts, operates out of owner Emma Finn's house. At
the end of the current period, Emma looks over her inventory and finds that she has - 1,100 units
(products) in her basement, 12 of which were damaged by water and cannot be sold. - 140 units
in her van, ready to deliver per a customer order, terms FOB destination. - 120 units out on
consignment to a friend who owns a retail store. How many total units should Emma include in
her company's period-end inventory?.
please explain with every detail possible thank you! I will up vote- (4).pdf
please explain with every detail possible thank you! I will up vote.
Find a regular expression for L = { a b n w : n 4 , w { a , b } + }.
More from anfenterprises (20)
Please help me figure out how to graph this- Eormulas- Solution- nput.pdf
Please help me figure out how to graph this- Eormulas- Solution- nput.pdf
PLease help KPIs and ROI are the same metric for social media marketin.pdf
PLease help KPIs and ROI are the same metric for social media marketin.pdf
please help i will like please and thank you The term Osmosis is gen.pdf
please help i will like please and thank you The term Osmosis is gen.pdf
PLEASE HELP ASAP!! Quality Service Systems uses a perpetual inventory.pdf
PLEASE HELP ASAP!! Quality Service Systems uses a perpetual inventory.pdf
Please help ASAP for an upvote With the help of diagrams- explain the.pdf
Please help ASAP for an upvote With the help of diagrams- explain the.pdf
Please help answer the problem in the screenshot- Thanks! 5- Support (1).pdf
Please help answer the problem in the screenshot- Thanks! 5- Support (1).pdf
Please help When preparing a smear from a solid culture of a suspecte.pdf
Please help When preparing a smear from a solid culture of a suspecte.pdf
Please help Required information -The following information applies t.pdf
Please help Required information -The following information applies t.pdf
please help 5- (2 points) On Figure 1 there are two profiles- which y.pdf
please help 5- (2 points) On Figure 1 there are two profiles- which y.pdf
please help 3 Identify- label- and color the following structures on.pdf
please help 3 Identify- label- and color the following structures on.pdf
Please help Draw a project network from the following information- W.pdf
Please help Draw a project network from the following information- W.pdf
Please help When staining endospores- the outer layers of the endos.pdf
Please help When staining endospores- the outer layers of the endos.pdf
please help To map 3 genes in E coli- interrupted mating experiment.pdf
please help To map 3 genes in E coli- interrupted mating experiment.pdf
please give the solution with detailed steps and explanation subject -.pdf
please give the solution with detailed steps and explanation subject -.pdf
Please go through the charts and identify the followings- Please go th.pdf
Please go through the charts and identify the followings- Please go th.pdf
Please give the definition of the following key terms- anesthesia.pdf
Please give the definition of the following key terms- anesthesia.pdf
Please give some response to question 4- 3- Explain why sun and shade.pdf
Please give some response to question 4- 3- Explain why sun and shade.pdf
Please fiview and the following statements and decide whether the stat.pdf
Please fiview and the following statements and decide whether the stat.pdf
Please fill out Homestead Crafts- a distributor of handmade gifts- op.pdf
Please fill out Homestead Crafts- a distributor of handmade gifts- op.pdf
please explain with every detail possible thank you! I will up vote- (4).pdf
please explain with every detail possible thank you! I will up vote- (4).pdf
Recently uploaded
Digital Artifact 2 - Investigating Pavilion Designs
Digital Artifact 2 - Pavilions
NGV Architecture Commission Competition
MPavilion Commission Competition
Other Pavilion Designs
Normal Labour/ Stages of Labour/ Mechanism of Labour
Normal labor is also termed spontaneous labor, defined as the natural physiological process through which the fetus, placenta, and membranes are expelled from the uterus through the birth canal at term (37 to 42 weeks
Azure Interview Questions and Answers PDF By ScholarHat
Azure Interview Questions and Answers PDF By ScholarHat
The Challenger.pdf DNHS Official Publication
Read| The latest issue of The Challenger is here! We are thrilled to announce that our school paper has qualified for the NATIONAL SCHOOLS PRESS CONFERENCE (NSPC) 2024. Thank you for your unwavering support and trust. Dive into the stories that made us stand out!
Best Digital Marketing Institute In NOIDA
Safalta Digital marketing institute in Noida, provide complete applications that encompass a huge range of virtual advertising and marketing additives, which includes search engine optimization, virtual communication advertising, pay-per-click on marketing, content material advertising, internet analytics, and greater. These university courses are designed for students who possess a comprehensive understanding of virtual marketing strategies and attributes.Safalta Digital Marketing Institute in Noida is a first choice for young individuals or students who are looking to start their careers in the field of digital advertising. The institute gives specialized courses designed and certification.
for beginners, providing thorough training in areas such as SEO, digital communication marketing, and PPC training in Noida. After finishing the program, students receive the certifications recognised by top different universitie, setting a strong foundation for a successful career in digital marketing.
A Strategic Approach: GenAI in Education
Artificial Intelligence (AI) technologies such as Generative AI, Image Generators and Large Language Models have had a dramatic impact on teaching, learning and assessment over the past 18 months. The most immediate threat AI posed was to Academic Integrity with Higher Education Institutes (HEIs) focusing their efforts on combating the use of GenAI in assessment. Guidelines were developed for staff and students, policies put in place too. Innovative educators have forged paths in the use of Generative AI for teaching, learning and assessments leading to pockets of transformation springing up across HEIs, often with little or no top-down guidance, support or direction.
This Gasta posits a strategic approach to integrating AI into HEIs to prepare staff, students and the curriculum for an evolving world and workplace. We will highlight the advantages of working with these technologies beyond the realm of teaching, learning and assessment by considering prompt engineering skills, industry impact, curriculum changes, and the need for staff upskilling. In contrast, not engaging strategically with Generative AI poses risks, including falling behind peers, missed opportunities and failing to ensure our graduates remain employable. The rapid evolution of AI technologies necessitates a proactive and strategic approach if we are to remain relevant.
Digital Tools and AI for Teaching Learning and Research
This Presentation in details discusses on Digital Tools and AI for Teaching Learning and Research
Operation Blue Star - Saka Neela Tara
Operation “Blue Star” is the only event in the history of Independent India where the state went into war with its own people. Even after about 40 years it is not clear if it was culmination of states anger over people of the region, a political game of power or start of dictatorial chapter in the democratic setup.
The people of Punjab felt alienated from main stream due to denial of their just demands during a long democratic struggle since independence. As it happen all over the word, it led to militant struggle with great loss of lives of military, police and civilian personnel. Killing of Indira Gandhi and massacre of innocent Sikhs in Delhi and other India cities was also associated with this movement.
Thesis Statement for students diagnonsed withADHD.ppt
Presentation required for the master in Education.
How to Make a Field invisible in Odoo 17
It is possible to hide or invisible some fields in odoo. Commonly using “invisible” attribute in the field definition to invisible the fields. This slide will show how to make a field invisible in odoo 17.
TESDA TM1 REVIEWER FOR NATIONAL ASSESSMENT WRITTEN AND ORAL QUESTIONS WITH A...
TESDA TM1 REVIEWER FOR NATIONAL ASSESSMENT WRITTEN AND ORAL QUESTIONS WITH ANSWERS.
Synthetic Fiber Construction in lab .pptx
Synthetic fiber production is a fascinating and complex field that blends chemistry, engineering, and environmental science. By understanding these aspects, students can gain a comprehensive view of synthetic fiber production, its impact on society and the environment, and the potential for future innovations. Synthetic fibers play a crucial role in modern society, impacting various aspects of daily life, industry, and the environment. ynthetic fibers are integral to modern life, offering a range of benefits from cost-effectiveness and versatility to innovative applications and performance characteristics. While they pose environmental challenges, ongoing research and development aim to create more sustainable and eco-friendly alternatives. Understanding the importance of synthetic fibers helps in appreciating their role in the economy, industry, and daily life, while also emphasizing the need for sustainable practices and innovation.
"Protectable subject matters, Protection in biotechnology, Protection of othe...
Protectable subject matters, Protection in biotechnology, Protection of other biological materials, Ownership and period of protection
CACJapan - GROUP Presentation 1- Wk 4.pdf
Macroeconomics- Movie Location
This will be used as part of your Personal Professional Portfolio once graded.
Objective:
Prepare a presentation or a paper using research, basic comparative analysis, data organization and application of economic information. You will make an informed assessment of an economic climate outside of the United States to accomplish an entertainment industry objective.
June 3, 2024 Anti-Semitism Letter Sent to MIT President Kornbluth and MIT Cor...
Letter from the Congress of the United States regarding Anti-Semitism sent June 3rd to MIT President Sally Kornbluth, MIT Corp Chair, Mark Gorenberg
Dear Dr. Kornbluth and Mr. Gorenberg,
The US House of Representatives is deeply concerned by ongoing and pervasive acts of antisemitic
harassment and intimidation at the Massachusetts Institute of Technology (MIT). Failing to act decisively to ensure a safe learning environment for all students would be a grave dereliction of your responsibilities as President of MIT and Chair of the MIT Corporation.
This Congress will not stand idly by and allow an environment hostile to Jewish students to persist. The House believes that your institution is in violation of Title VI of the Civil Rights Act, and the inability or
unwillingness to rectify this violation through action requires accountability.
Postsecondary education is a unique opportunity for students to learn and have their ideas and beliefs challenged. However, universities receiving hundreds of millions of federal funds annually have denied
students that opportunity and have been hijacked to become venues for the promotion of terrorism, antisemitic harassment and intimidation, unlawful encampments, and in some cases, assaults and riots.
The House of Representatives will not countenance the use of federal funds to indoctrinate students into hateful, antisemitic, anti-American supporters of terrorism. Investigations into campus antisemitism by the Committee on Education and the Workforce and the Committee on Ways and Means have been expanded into a Congress-wide probe across all relevant jurisdictions to address this national crisis. The undersigned Committees will conduct oversight into the use of federal funds at MIT and its learning environment under authorities granted to each Committee.
• The Committee on Education and the Workforce has been investigating your institution since December 7, 2023. The Committee has broad jurisdiction over postsecondary education, including its compliance with Title VI of the Civil Rights Act, campus safety concerns over disruptions to the learning environment, and the awarding of federal student aid under the Higher Education Act.
• The Committee on Oversight and Accountability is investigating the sources of funding and other support flowing to groups espousing pro-Hamas propaganda and engaged in antisemitic harassment and intimidation of students. The Committee on Oversight and Accountability is the principal oversight committee of the US House of Representatives and has broad authority to investigate “any matter” at “any time” under House Rule X.
• The Committee on Ways and Means has been investigating several universities since November 15, 2023, when the Committee held a hearing entitled From Ivory Towers to Dark Corners: Investigating the Nexus Between Antisemitism, Tax-Exempt Universities, and Terror Financing. The Committee followed the hearing with letters to those institutions on January 10, 202
Model Attribute Check Company Auto Property
In Odoo, the multi-company feature allows you to manage multiple companies within a single Odoo database instance. Each company can have its own configurations while still sharing common resources such as products, customers, and suppliers.
Introduction to AI for Nonprofits with Tapp Network
Dive into the world of AI! Experts Jon Hill and Tareq Monaur will guide you through AI's role in enhancing nonprofit websites and basic marketing strategies, making it easy to understand and apply.
Recently uploaded (20)
Digital Artifact 2 - Investigating Pavilion Designs
Digital Artifact 2 - Investigating Pavilion Designs
Normal Labour/ Stages of Labour/ Mechanism of Labour
Normal Labour/ Stages of Labour/ Mechanism of Labour
Azure Interview Questions and Answers PDF By ScholarHat
Azure Interview Questions and Answers PDF By ScholarHat
Digital Tools and AI for Teaching Learning and Research
Digital Tools and AI for Teaching Learning and Research
Thesis Statement for students diagnonsed withADHD.ppt
Thesis Statement for students diagnonsed withADHD.ppt
TESDA TM1 REVIEWER FOR NATIONAL ASSESSMENT WRITTEN AND ORAL QUESTIONS WITH A...
TESDA TM1 REVIEWER FOR NATIONAL ASSESSMENT WRITTEN AND ORAL QUESTIONS WITH A...
"Protectable subject matters, Protection in biotechnology, Protection of othe...
"Protectable subject matters, Protection in biotechnology, Protection of othe...
June 3, 2024 Anti-Semitism Letter Sent to MIT President Kornbluth and MIT Cor...
June 3, 2024 Anti-Semitism Letter Sent to MIT President Kornbluth and MIT Cor...
Introduction to AI for Nonprofits with Tapp Network
Introduction to AI for Nonprofits with Tapp Network
please help finish sorting methods- import java-util-Arrays- import ja.pdf
- 1. 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; }
- 2. 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: ");
- 3. 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);
- 4. 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); startTime = System.nanoTime(); bubbleSort(E); endTime = System.nanoTime(); time = (endTime - startTime) / ONE_BILLION; System.out.println( "Bubble sort finished - time = " + time + " seconds" ); pw.print(time + ", "); printArray(E);
- 5. System.out.println(); System.out.println( "Starting merge sort on sorted array ---------------- Size = " + C.length); startTime = System.nanoTime(); mergeSort(E); endTime = System.nanoTime(); time = (endTime - startTime) / ONE_BILLION; System.out.println( "Merge sort finished - time = " + time + " seconds."); pw.print(time + ", "); printArray(E); System.out.println(); System.out.println( "Starting quick sort on sorted array ---------------- Size = " + D.length); startTime = System.nanoTime(); quickSort(E); endTime = System.nanoTime(); time = (endTime - startTime) / ONE_BILLION; System.out.println( "quickSort finished - time = " + time + " seconds." ); pw.print(time + ", "); printArray(E); System.out.println(); System.out.println( "Starting java's Array sorted array ---------------- Size = " + D.length); startTime = System.nanoTime(); javaSort(E); endTime = System.nanoTime();
- 6. time = (endTime - startTime) / ONE_BILLION; System.out.println( "Java's Array sort finished - time = " + time + " seconds." ); pw.println(time); printArray(E); System.out.println(); sIdx = sIdx + 1; } pw.close(); } /* prints array or a portion of it if it's too large */ public static void printArray(int[] X) { if( X == null ) return; System.out.print("[ "); int i=0; for( ; i<15 && i<X.length; i++ ) { System.out.print( X[i] + " " ); } if( i < X.length ) System.out.print("... "); System.out.println("]"); } /* Finish Methods Below*/
- 7. public static void bubbleSort(int[] X) { } public static void mergeSort(int[] X) { } private static void merge(int[] B, int[] C, int[] A ) { } /* this is simply the sort used by Arrays class */ public static void javaSort(int[] X) { } public static void quickSort(int[] X) { quickSort(X, 0, X.length-1); } private static void quickSort(int[] X, int s, int e) { // check our stopping condition // get pivot point from partition method // call quickSort on left portion and quickSort on right portion }
- 8. private static int partition( int[]X, int s, int e ) { int pivotIdx=s; return pivotIdx; } }