UserInputHandlerjava package midterm2023 import javautil.pdf
•
0 likes•2 views
UserInputHandler.java package midterm2023; import java.util.ArrayList; import java.util.List; import java.util.Scanner; public class UserInputHandler { public static List<String> readUserInput() { List<String> userData = new ArrayList<>(); System.out.println("Please enter your data below: (send 'bye' to exit) "); Scanner input = new Scanner(System.in); while (true) { String line = input.nextLine(); if ("bye".equalsIgnoreCase(line)) { break; } userData.add(line); } return userData; } public static void main(String[] args) { List<String> userData = readUserInput(); System.out.printf("User Input Data:n%s", String.join("n", userData)); } } UserInputHandlerUnitTest.java package midterm2023; import org.junit.jupiter.api.Test; import java.io.ByteArrayInputStream; import java.io.InputStream; import java.util.Arrays; import java.util.List; import java.util.stream.Collectors; import static org.assertj.core.api.Assertions.assertThat; public class UserInputHandlerUnitTest { //@Test void testByMakeUpDataInSystemIn() { String[] inputLines = new String[]{ "The first line.", "The second line.", "bye", "The last line.", "anything after 'bye' will be ignored" }; String[] expectedLines = Arrays.copyOf(inputLines, inputLines.length - 2); List<String> expected = Arrays.stream(expectedLines).collect(Collectors.toList()); InputStream stdin = System.in; try { System.setIn(new ByteArrayInputStream(String.join("n", inputLines).getBytes())); List<String> actual = UserInputHandler.readUserInput(); assertThat(actual).isEqualTo(expected); } finally { System.setIn(stdin); } } } QuickSort.java package coen352.ch07; public class QuickSort { public static <E extends Comparable<? super E>> void sort(E[] A) { qsort(A, 0, A.length-1);} static <E extends Comparable<? super E>> void qsort(E[] A, int i, int j) { // Quicksort int pivotindex = findpivot(A, i, j); // Pick a pivot DSutil.swap(A, pivotindex, j); // Stick pivot at end // k will be the first position in the right subarray int k = partition(A, i-1, j, A[j]); DSutil.swap(A, k, j); // Put pivot in place if ((k-i) > 1) qsort(A, i, k-1); // Sort left partition if ((j-k) > 1) qsort(A, k+1, j); // Sort right partition } static <E extends Comparable<? super E>> int partition(E[] A, int l, int r, E pivot) { do {// Move bounds inward until they meet while (A[++l].compareTo(pivot)<0); while ((r!=0) && (A[--r].compareTo(pivot)>0)); DSutil.swap(A, l, r); // Swap out-of-place values } while (l < r); // Stop when they cross DSutil.swap(A, l, r); // Reverse last, wasted swap return l; // Return first position in right partition } static <E extends Comparable<? super E>> int findpivot(E[] A, int i, int j) { return (i+j)/2; } } In this assignment, we aim to practise white box testing and coverage strategies to produce unit test cases. Problem 1 (30 MARKS) The UserInputHandler program code is provided in the attachment. It is a simple function that stores the user's input until a certain terminating token is typed. The original code applies.
Report
Share
Report
Share
Download to read offline
![UserInputHandler.java
package midterm2023;
import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;
public class UserInputHandler {
public static List<String> readUserInput() {
List<String> userData = new ArrayList<>();
System.out.println("Please enter your data below: (send 'bye' to exit) ");
Scanner input = new Scanner(System.in);
while (true) {
String line = input.nextLine();
if ("bye".equalsIgnoreCase(line)) {
break;
}
userData.add(line);
}
return userData;
}
public static void main(String[] args) {
List<String> userData = readUserInput();
System.out.printf("User Input Data:n%s", String.join("n", userData));
}
}
UserInputHandlerUnitTest.java
package midterm2023;
import org.junit.jupiter.api.Test;
import java.io.ByteArrayInputStream;
import java.io.InputStream;
import java.util.Arrays;
import java.util.List;
import java.util.stream.Collectors;
import static org.assertj.core.api.Assertions.assertThat;
public class UserInputHandlerUnitTest {
//@Test
void testByMakeUpDataInSystemIn() {
String[] inputLines = new String[]{
"The first line.",
"The second line.",
"bye",
"The last line.",
"anything after 'bye' will be ignored"](https://image.slidesharecdn.com/userinputhandlerjavapackagemidterm2023importjavautil-230321185113-8b710f5c/85/UserInputHandlerjava-package-midterm2023-import-javautil-pdf-1-320.jpg)
![};
String[] expectedLines = Arrays.copyOf(inputLines, inputLines.length - 2);
List<String> expected = Arrays.stream(expectedLines).collect(Collectors.toList());
InputStream stdin = System.in;
try {
System.setIn(new ByteArrayInputStream(String.join("n", inputLines).getBytes()));
List<String> actual = UserInputHandler.readUserInput();
assertThat(actual).isEqualTo(expected);
} finally {
System.setIn(stdin);
}
}
}
QuickSort.java
package coen352.ch07;
public class QuickSort {
public static <E extends Comparable<? super E>> void sort(E[] A) {
qsort(A, 0, A.length-1);}
static <E extends Comparable<? super E>>
void qsort(E[] A, int i, int j) { // Quicksort
int pivotindex = findpivot(A, i, j); // Pick a pivot
DSutil.swap(A, pivotindex, j); // Stick pivot at end
// k will be the first position in the right subarray
int k = partition(A, i-1, j, A[j]);
DSutil.swap(A, k, j); // Put pivot in place
if ((k-i) > 1) qsort(A, i, k-1); // Sort left partition
if ((j-k) > 1) qsort(A, k+1, j); // Sort right partition
}
static <E extends Comparable<? super E>>
int partition(E[] A, int l, int r, E pivot) {
do {// Move bounds inward until they meet
while (A[++l].compareTo(pivot)<0);
while ((r!=0) && (A[--r].compareTo(pivot)>0));](data:image/gif;base64,R0lGODlhAQABAIAAAAAAAP///yH5BAEAAAAALAAAAAABAAEAAAIBRAA7)
Recommended
Prompt a user to enter a series of integers separated by spaces and .pdf
Prompt a user to enter a series of integers separated by spaces and accept the input as a String.
Display the list of integers and their sum. Save the file as SumIntegersInString.java.
I have tried the following code, but it just runs continuously with no opportunity for input.
import java.io.*;
import java.util.Scanner;
class SumIntegersInString
{
public static void main(String args[])
{
Scanner in = new Scanner(System.in);
String input = in.nextLine();
int sum = 0;
for(String value : input.split(\" \"))
{
System.out.print(value + \" \");
sum += Integer.parseInt(value);
}
System.out.println(\"Sum:\" + sum);
}
}
Solution
import java.io.*;
import java.util.Scanner;
public class SumIntegersInString
{
public static void main(String args[])
{
// statement to prompt the user for a series of integers
System.out.print(\"Enter a series of integers separated by a space: \");
Scanner in = new Scanner(System.in);
String input = in.nextLine();
int sum = 0;
for(String value : input.split(\" \"))
{
System.out.print(value + \" \");
sum += Integer.parseInt(value);
}
System.out.println(\"\ Sum:\" + sum);
}
}.
public class TrequeT extends AbstractListT { .pdf
/**
*/
public class Treque extends AbstractList {
/**
* You decide on the instance variables you need.
*/
public Treque(Class t) {
// Put your own code here
throw new UnsupportedOperationException(\"Constructor not yet implemented\");
}
public T get(int i) {
if (i < 0 || i > size() - 1) throw new IndexOutOfBoundsException();
// Put your own code here instead of throwing this exception
throw new UnsupportedOperationException(\"get(i) not yet implemented\");
}
public T set(int i, T x) {
if (i < 0 || i > size() - 1) throw new IndexOutOfBoundsException();
// Put your own code here instead of throwing this exception
throw new UnsupportedOperationException(\"set(i,x) not yet implemented\");
}
public void add(int i, T x) {
if (i < 0 || i > size()) throw new IndexOutOfBoundsException();
// Put your own code here
throw new UnsupportedOperationException(\"add(i,x) not yet implemented\");
}
public T remove(int i) {
if (i < 0 || i > size() - 1) throw new IndexOutOfBoundsException();
// Put your own code here
throw new UnsupportedOperationException(\"remove(i) not yet implemented\");
}
public int size() {
// Put your own code here
throw new UnsupportedOperationException(\"size() not yet implemented\");
}
public static void main(String[] args) {
//List tr = new ArrayDeque(Integer.class);
List tr = new Treque(Integer.class);
int K = 1000000;
Stopwatch s = new Stopwatch();
System.out.print(\"Appending \" + K + \" items...\");
System.out.flush();
s.start();
for (int i = 0; i < K; i++) {
tr.add(i);
}
s.stop();
System.out.println(\"done (\" + s.elapsedSeconds() + \"s)\");
System.out.print(\"Prepending \" + K + \" items...\");
System.out.flush();
for (int i = 0; i < K; i++) {
tr.add(0, i);
}
s.stop();
System.out.println(\"done (\" + s.elapsedSeconds() + \"s)\");
System.out.print(\"Midpending(?!) \" + K + \" items...\");
System.out.flush();
s.start();
for (int i = 0; i < K; i++) {
tr.add(tr.size()/2);
}
s.stop();
System.out.println(\"done (\" + s.elapsedSeconds() + \"s)\");
System.out.print(\"Removing \" + K + \" items from the back...\");
System.out.flush();
for (int i = 0; i < K; i++) {
tr.remove(tr.size()-1);
}
s.stop();
System.out.println(\"done (\" + s.elapsedSeconds() + \"s)\");
System.out.print(\"Removing \" + K + \" items from the front...\");
System.out.flush();
for (int i = 0; i < K; i++) {
tr.remove(0);
}
s.stop();
System.out.println(\"done (\" + s.elapsedSeconds() + \"s)\");
System.out.print(\"Removing \" + K + \" items from the middle...\");
System.out.flush();
for (int i = 0; i < K; i++) {
tr.remove(tr.size()/2);
}
s.stop();
System.out.println(\"done (\" + s.elapsedSeconds() + \"s)\");
}
}
-------------------------------------------------------------------
import java.util.AbstractList;
import java.util.ArrayList;
import java.util.List;
/**
* This class implements the List interface using a collection of arrays of
* sizes 1, 2, 3, 4, and so on. The main advantages of this over an
* implementation like ArrayList is that there is never more than O(sqr.
Pragmatic functional refactoring with java 8
You may be hearing a lot of buzz around functional programming. For example, Java 8 recently introduced new features (lambda expressions and method references) and APIs (Streams, Optional and CompletableFutures) inspired from functional ideas such as first-class functions, composition and immutability.
However, what does this mean for my existing codebase?
In this talk we show how you can refactor your traditional object-oriented Java to using FP features and APIs from Java 8 in a beneficial manner.
We will discuss:
- How to adapt to requirement changes using first-class functions
- How you can enhance code reusability using currying
- How you can make your code more robust by favouring immutability over mutability
- How you can design better APIs and reduce unintended null pointer exceptions using an optional data type"
Recommended
Prompt a user to enter a series of integers separated by spaces and .pdf
Prompt a user to enter a series of integers separated by spaces and accept the input as a String.
Display the list of integers and their sum. Save the file as SumIntegersInString.java.
I have tried the following code, but it just runs continuously with no opportunity for input.
import java.io.*;
import java.util.Scanner;
class SumIntegersInString
{
public static void main(String args[])
{
Scanner in = new Scanner(System.in);
String input = in.nextLine();
int sum = 0;
for(String value : input.split(\" \"))
{
System.out.print(value + \" \");
sum += Integer.parseInt(value);
}
System.out.println(\"Sum:\" + sum);
}
}
Solution
import java.io.*;
import java.util.Scanner;
public class SumIntegersInString
{
public static void main(String args[])
{
// statement to prompt the user for a series of integers
System.out.print(\"Enter a series of integers separated by a space: \");
Scanner in = new Scanner(System.in);
String input = in.nextLine();
int sum = 0;
for(String value : input.split(\" \"))
{
System.out.print(value + \" \");
sum += Integer.parseInt(value);
}
System.out.println(\"\ Sum:\" + sum);
}
}.
public class TrequeT extends AbstractListT { .pdf
/**
*/
public class Treque extends AbstractList {
/**
* You decide on the instance variables you need.
*/
public Treque(Class t) {
// Put your own code here
throw new UnsupportedOperationException(\"Constructor not yet implemented\");
}
public T get(int i) {
if (i < 0 || i > size() - 1) throw new IndexOutOfBoundsException();
// Put your own code here instead of throwing this exception
throw new UnsupportedOperationException(\"get(i) not yet implemented\");
}
public T set(int i, T x) {
if (i < 0 || i > size() - 1) throw new IndexOutOfBoundsException();
// Put your own code here instead of throwing this exception
throw new UnsupportedOperationException(\"set(i,x) not yet implemented\");
}
public void add(int i, T x) {
if (i < 0 || i > size()) throw new IndexOutOfBoundsException();
// Put your own code here
throw new UnsupportedOperationException(\"add(i,x) not yet implemented\");
}
public T remove(int i) {
if (i < 0 || i > size() - 1) throw new IndexOutOfBoundsException();
// Put your own code here
throw new UnsupportedOperationException(\"remove(i) not yet implemented\");
}
public int size() {
// Put your own code here
throw new UnsupportedOperationException(\"size() not yet implemented\");
}
public static void main(String[] args) {
//List tr = new ArrayDeque(Integer.class);
List tr = new Treque(Integer.class);
int K = 1000000;
Stopwatch s = new Stopwatch();
System.out.print(\"Appending \" + K + \" items...\");
System.out.flush();
s.start();
for (int i = 0; i < K; i++) {
tr.add(i);
}
s.stop();
System.out.println(\"done (\" + s.elapsedSeconds() + \"s)\");
System.out.print(\"Prepending \" + K + \" items...\");
System.out.flush();
for (int i = 0; i < K; i++) {
tr.add(0, i);
}
s.stop();
System.out.println(\"done (\" + s.elapsedSeconds() + \"s)\");
System.out.print(\"Midpending(?!) \" + K + \" items...\");
System.out.flush();
s.start();
for (int i = 0; i < K; i++) {
tr.add(tr.size()/2);
}
s.stop();
System.out.println(\"done (\" + s.elapsedSeconds() + \"s)\");
System.out.print(\"Removing \" + K + \" items from the back...\");
System.out.flush();
for (int i = 0; i < K; i++) {
tr.remove(tr.size()-1);
}
s.stop();
System.out.println(\"done (\" + s.elapsedSeconds() + \"s)\");
System.out.print(\"Removing \" + K + \" items from the front...\");
System.out.flush();
for (int i = 0; i < K; i++) {
tr.remove(0);
}
s.stop();
System.out.println(\"done (\" + s.elapsedSeconds() + \"s)\");
System.out.print(\"Removing \" + K + \" items from the middle...\");
System.out.flush();
for (int i = 0; i < K; i++) {
tr.remove(tr.size()/2);
}
s.stop();
System.out.println(\"done (\" + s.elapsedSeconds() + \"s)\");
}
}
-------------------------------------------------------------------
import java.util.AbstractList;
import java.util.ArrayList;
import java.util.List;
/**
* This class implements the List interface using a collection of arrays of
* sizes 1, 2, 3, 4, and so on. The main advantages of this over an
* implementation like ArrayList is that there is never more than O(sqr.
Pragmatic functional refactoring with java 8
You may be hearing a lot of buzz around functional programming. For example, Java 8 recently introduced new features (lambda expressions and method references) and APIs (Streams, Optional and CompletableFutures) inspired from functional ideas such as first-class functions, composition and immutability.
However, what does this mean for my existing codebase?
In this talk we show how you can refactor your traditional object-oriented Java to using FP features and APIs from Java 8 in a beneficial manner.
We will discuss:
- How to adapt to requirement changes using first-class functions
- How you can enhance code reusability using currying
- How you can make your code more robust by favouring immutability over mutability
- How you can design better APIs and reduce unintended null pointer exceptions using an optional data type"
META-INFMANIFEST.MFManifest-Version 1.0.classpath.docx
META-INF/MANIFEST.MF
Manifest-Version: 1.0
.classpath
PriorityQueue.classpublicsynchronizedclass PriorityQueue {
Heap q;
public void PriorityQueue(int, java.util.Comparator);
public Object peek();
public Object remove();
void add(Object);
boolean isEmpty();
public int size();
}
PriorityQueue.javaPriorityQueue.javaimport java.util.Comparator;
publicclassPriorityQueue<E>{
Heap q;
/**
*PriorityQueue initializes the queue.
*
* @param initialCapacity an int that is the heaps initial size.
* @param comparator the priority of various imputs.
*/
publicPriorityQueue(int initialCapacity,Comparator<?super E> comparator){
q=newHeap(initialCapacity,comparator);
}
/**
* Peek, returns the next item in the queue without removing it.
*
* If it is empty then null is returned.
* @return the next item in the queue.
*/
public E peek(){
if(q.size()==0){
returnnull;
}
return(E) q.findMax();
}
/**
* This removes the first item from the queue.
*
* It returns null if the queue is empty.
* @return the first item in the queue.
*/
public E remove(){
if(q.size()==0){
returnnull;
}
return(E) q.removeMax();
}
/**
* This adds item to the queue
* @param item that is added to the queue.
*/
void add(E item){
q.insert(item);
}
/**
* isEmpty returns if the queue is empty or not.
*
* @return boolean if the queue is empty or not.
*/
boolean isEmpty(){
if(q.size()!=0){
returnfalse;
}
returntrue;
}
/**
* size returns the size of the queue.
*
* @return int the size of the queue.
*/
publicint size(){
return q.size();
}
}
ArithmeticExpression.classpublicsynchronizedclass ArithmeticExpression {
BinaryTree t;
java.util.ArrayList list;
String equation;
void ArithmeticExpression(String) throws java.text.ParseException;
public String toString(BinaryTree);
public String toPostfixString(BinaryTree);
void setVariable(String, int) throws java.rmi.NotBoundException;
public int evaluate(BinaryTree);
}
ArithmeticExpression.javaArithmeticExpression.javaimport java.rmi.NotBoundException;
import java.text.ParseException;
import java.util.ArrayList;
import java.util.Stack;
/**
* ArithmeticExpression takes equations in the form of strings creates a binary
* tree, and can return either the regular or postfix equation. It also allows
* them to be calculated.
*
*
* Extra Credit:
* ** it can handle spaces or no spaces in the string inputted. ** it can return
* regular or postfix notation
*
* @author tai-lanhirabayashi
*
*/
publicclassArithmeticExpression{
BinaryTree t;
ArrayList list;
String equation;
/**
* ArithmeticExpression is the construction which takes in a space
* delimitated equation containing "*,/,+,-" symbols and converts it into a
* binary tree.
*
* If the expression is not valid it will throw a ParseException. This is ...
java programming cheatsheet
A cheatsheet (or crib sheet) is a concise set of notes that contains terms, concepts, and
information to help someone remember something, summarize knowledge or use it as a quick
reference.
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/
import java.util.;public class Program{public static void.pdf
import java.util.*;
public class Program
{
public static void main(String[] args) {
Scanner input = new Scanner(System.in);
String x=\"X\";
int amount;
System.out.println(\"Enter amount\");
amount=input.nextInt();
System.out.println(\"Amount is: \"+amount);
for(int i=1; i<=amount; i++)
{
System.out.println(x);
for(int j=1; j<=i; j++)
{
System.out.print(x);
}
}
}
}
Why does It print out the last set of X\'s twice? I am doing basic Java so please try to explain
using the most basic codes.
import java.util.*;
public class Program
{
public static void main(String[] args) {
Scanner input = new Scanner(System.in);
String x=\"X\";
int amount;
System.out.println(\"Enter amount\");
amount=input.nextInt();
System.out.println(\"Amount is: \"+amount);
for(int i=1; i<=amount; i++)
{
System.out.println(x);
for(int j=1; j<=i; j++)
{
System.out.print(x);
}
}
}
}
Why does It print out the last set of X\'s twice? I am doing basic Java so please try to explain
using the most basic codes.
import java.util.*;
public class Program
{
public static void main(String[] args) {
Scanner input = new Scanner(System.in);
String x=\"X\";
int amount;
System.out.println(\"Enter amount\");
amount=input.nextInt();
System.out.println(\"Amount is: \"+amount);
for(int i=1; i<=amount; i++)
{
System.out.println(x);
for(int j=1; j<=i; j++)
{
System.out.print(x);
}
}
}
}
Why does It print out the last set of X\'s twice? I am doing basic Java so please try to explain
using the most basic codes.
Solution
Hi,
I have modified the code. it is working as expected now. Highlighted the code changes below.
Issue here is with you have written this statement twice System.out.println(x); which causes the
issue.
Program.java
import java.util.*;
public class Program
{
public static void main(String[] args) {
Scanner input = new Scanner(System.in);
String x=\"X\";
int amount;
System.out.println(\"Enter amount\");
amount=input.nextInt();
System.out.println(\"Amount is: \"+amount);
for(int i=1; i<=amount; i++)
{
System.out.println();
for(int j=1; j<=i; j++)
{
System.out.print(x);
}
}
}
}
Output:
Enter amount
10
Amount is: 10
X
XX
XXX
XXXX
XXXXX
XXXXXX
XXXXXXX
XXXXXXXX
XXXXXXXXX
XXXXXXXXXX.
In Class AssignmetzCST280W13a-1.pdfCST 280 In-Class Pract.docx
In Class Assignmetz/CST280W13a-1.pdf
CST 280 In-Class Practice – Week 13
Manually determine the configuration of the priority queue (stored as a heap) created
by the following operations. Trace the following logic and define the output:
enqueue(7);
enqueue(17);
enqueue(2);
enqueue(5);
enqueue(22);
enqueue(19);
enqueue(6);
enqueue(11);
enqueue(13);
write the queue contents
dequeue and write front item
enqueue(15);
enqueue(8);
dequeue and write front item
dequeue and write front item
enqueue(24);
enqueue(14);
write the queue contents
Part 2
Then, verify the output by implementing the algorithm by rewriting the priority
queue demonstration program discussed in class. Files needed:
testPQueue.cpp pqType.h heap.cpp
Deliverables
• This cover sheet (with your names on it)
• Driver source code and output for verification program exectution.
In Class Assignmetz/CST280W13b.pdf
CST 280 In-Class Practice – Week 13
Use this page as a worksheet to sketch the progression of the elements up to the first
split for the QuickSort algorithm. Use the middle array element as the split value:
15 34 99 42 11 41 66 23 55 93 48
Next, access the file quickSort.cpp from the course web page. Tailor the program
by entering the array values above in place of the integer values used for an in-class
demonstration. Be sure to adjust the index range to match the size of this array.
Remember that the parameters to the QuickSort algorithm are starting and ending index
values, not the size of the array.
Next, insert code to demonstrate the state of the array after the first split. This should
verify what you did by hand above. Insert the following code at various points within
the partition function to “see” the array at various stages of processing:
for (int i = start; i <= end; i++) // <== ADD
cout << set[i] << ' ';
cout << endl;
Insert the code at these positions:
int partition(int set[], int start, int end)
{
int pivotValue, pivotIndex, mid;
mid = (start + end) / 2;
swap(set[start], set[mid]);
pivotIndex = start;
pivotValue = set[start];
ç HERE
for (int scan = start + 1; scan <= end; scan++)
{
if (set[scan] < pivotValue)
{
pivotIndex++;
swap(set[pivotIndex], set[scan]);
}
ç HERE
}
swap(set[start], set[pivotIndex]);
ç HERE
return pivotIndex;
}
Finally, identify the line that matches what you concluded above.
Deliverables:
Deliver the following for this assignment:
• This work sheet with a sketch of the array first split
• Program source code with required change
• Program output demonstrating array configuration after first split .
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
Write the code above and the ones below in netbeans IDE 8.13. (Eli.pdf
Write the code above and the ones below in netbeans IDE 8.1
3. (Eliminate duplicates) Write a method that returns a new array by eliminating the duplicate
values in the array using the following method header: public static int[]
eliminateDuplicates(int[] list) Write a test program that reads in ten integers, invokes the method,
and displays the result. Here is the sample run of the program:
Enter ten numbers: 1 2 3 2 1 6 3 4 5 2 [Enter]
The distinct numbers are: 1 2 3 6 4 5
4. (Sort students) Write a program that prompts the user to enter the number of students, the
students’ names, and their scores, and prints student names in decreasing order of their scores.
Solution
Please follow the code and comments for description :
a)
CODE :
import java.util.Scanner;
public class MeanSD {
public static double deviation (double[] x) { // method to return the deviation
double sum = 0, mean = 0, deviation = 0; // required initialisations
double[] temp = new double[10]; // temporary array
for (int i = 0; i < 10; i++) //calculate the standard deviation
{
temp[i] = Math.pow((x[i] - mean), 2); // assigning the value to the array
sum += temp[i]; // adding up the values
}
mean = sum / 10; // getting the mean
deviation = Math.sqrt(mean); // calculating the deviation
return deviation; // returning the deviation
}
public static double mean (double[] x) { // method to return themean of the values entered
double sum = 0, mean; // required initialisations
for (int i = 0; i < 10; i++) //Take input in the array
{
sum += x[i]; //sum of all elements
}
mean = sum / 10; // calculating the mean
return mean; // returning the mean value
}
public static void main(String[] args) { // driver method
System.out.println(\"Enter the 10 numbers.\"); // prompt to enter the data
Scanner in = new Scanner(System.in); // scanner class to get the data from the user
double[] arr = new double[10]; // array that saves the data
double sum = 0, mean = 0, deviation = 0; // required initialisations
for (int i = 0; i < 10; i++) //Take input in the array
{
System.out.print(\"Enter a number : \"); // prompt to enter the number
arr[i] = in.nextDouble(); // getting the data from the console
}
mean = mean(arr); // calling the method to return the mean value
System.out.println(\"Mean : \" + mean); //Display mean of all elements
deviation = deviation(arr); // calling the method to return teh deviation value
System.out.println(\"Deviation : \" + deviation); // display the result
}
}
OUPTPUT :
Enter the 10 numbers.
Enter a number : 1
Enter a number : 2
Enter a number : 3
Enter a number : 4
Enter a number : 5
Enter a number : 6
Enter a number : 7
Enter a number : 8
Enter a number : 9
Enter a number : 10
Mean : 5.5
Deviation : 6.2048368229954285
b)
CODE :
import java.util.Scanner;
public class MyDuplicateElements {
public static int[] eliminateDuplicates(int[] input) { // method to remove the duplicates
int j = 0; // required initialisations
int i = 1;
//return if the array length is less than 2
if (input..
Please help with this JAVA Assignment and show output if you can ple.pdf
Please help with this JAVA Assignment and show output if you can please
Complete required scripts based on eclipse and troubleshoot the scripts until the tasks are done.
1. Implement linear-sort, merge-sort and quick-sort (write the code for them).
Solution
Linear or Insertion Sort
import java.util.*;
import java.lang.*;
import java.io.*;
import java.util.Scanner;
class LinearSort
{
public static void sort( int values[] )
{
int N = values.length;
int i, j, temp;
for (i = 1; i< N; i++)
{
j = i;
temp = values[i];
while (j > 0 && temp < values[j-1])
{
values[j] = values[j-1];
j = j-1;
}
values[j] = temp;
}
}
public static void main(String[] args)
{
Scanner scan = new Scanner( System.in );
int n, i;
System.out.println(\"Enter number of elements\");
n = scan.nextInt();
int values[] = new int[n];
System.out.println(\"\ Enter elements\");
for (i = 0; i < n; i++)
values[i] = scan.nextInt();
sort(values);
System.out.println(\"\ Sorted Elements\");
for (i = 0; i < n; i++)
System.out.print(values[i]+\" \");
System.out.println();
}
}
Output:
Enter number of elements
6
Enter elements
34 56 12 8 9 23
Sorted Elements
8 9 12 23 34 56
Merge Sort
import java.util.Scanner;
public class Mergesort
{
public static void mergesort(int[] a, int low, int high)
{
int N = high - low;
if (N <= 1)
return;
int mid = low + N/2;
mergesort(a, low, mid);
mergesort(a, mid, high);
int[] temp = new int[N];
int i = low, j = mid;
for (int k = 0; k < N; k++)
{
if (i == mid)
temp[k] = a[j++];
else if (j == high)
temp[k] = a[i++];
else if (a[j] pivot)
j--;
if (i <= j)
{
temp = values[i];
values[i] = values[j];
values[j] = temp;
i++;
j--;
}
}
if (low < j)
quickquicksort(values, low, j);
if (i < high)
quickquicksort(values, i, high);
}
public static void main(String[] args)
{
Scanner scan = new Scanner( System.in );
int n, i;
System.out.println(\"Enter number of elements\");
n = scan.nextInt();
int values[] = new int[ n ];
System.out.println(\"\ Enter elements\");
for (i = 0; i < n; i++)
values[i] = scan.nextInt();
quicksort(values);
System.out.println(\"\ qSorted Elements \");
for (i = 0; i < n; i++)
System.out.print(values[i]+\" \");
System.out.println();
}
}
Output:
Enter number of elements
8
Enter elements
89 23 90 56 13 71 46 13
Sorted Elements
13 13 23 46 56 71 89 90.
Java 8 Lambda Built-in Functional Interfaces
In Java 8, the java.util.function has numerous built-in interfaces. Other packages in the Java library (notably java.util.stream package) make use of the interfaces defined in this package. Java 8 developers should be familiar with using key interfaces provided in this package. This presentation provides an overview of four key functional interfaces (Consumer, Supplier, Function, and Predicate) provided in this package.
- the modification will be done in Main class- first, asks the use.pdf
- the modification will be done in Main class
- first, asks the user if it is a regular user or from the company.
-second, compare the username and password if it is from a company.
note:
-the code:
package project;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.net.InetAddress;
import java.text.SimpleDateFormat;
import java.util.Date;
import java.util.Scanner;
public class project {
private static final int MAX_INVALID_INPUTS = 3;
private static final String LOG_FILE_PATH = "failed_attempts.txt";
public static void main(String[] args) {
SE_dep SE_obj = new SE_dep();
CSAI_Dep csaiDepartment = new CSAI_Dep();
CY_Dep cyDepartment = new CY_Dep();
DS_Dep dsDep = new DS_Dep();
double SE_minIndustSalary;
double SE_prevGPA;
String SE_interestOfStudent;
Scanner input = new Scanner(System.in);
System.out.println("Please enter the Minimum acceptable industry salary: ");
SE_minIndustSalary = validateInput(input, 10); // Maximum of 10 digits
System.out.println("Please Enter Your previous GPA: ");
SE_prevGPA = validateInput(input, 3); // Maximum of 3 digits
SE_interestOfStudent = validateInterestInput(input);
System.out.println("Student inputs: Minimum acceptable industry salary[" +
SE_minIndustSalary + "] Previous GPA[" + SE_prevGPA + "] Computer Programming
interest[" + SE_interestOfStudent + "]");
System.out.println("Suggested programs:\n\n");
SE_obj.ifIncluded_SE(SE_minIndustSalary, SE_prevGPA, SE_interestOfStudent);
cyDepartment.recommendPrograms(SE_minIndustSalary, SE_prevGPA,
SE_interestOfStudent);
csaiDepartment.recommendPrograms(SE_minIndustSalary, SE_prevGPA,
SE_interestOfStudent);
dsDep.DS_Program(SE_minIndustSalary, SE_prevGPA, SE_interestOfStudent);
double studyHours = SE_prevGPA * 1.0; // Each GPA point corresponds to 1 hour of study
int hours = (int) studyHours; // Extract the integer part (hours)
int minutes = (int) ((studyHours - hours) * 60); // Calculate the minutes
System.out.println("Required study hours (at home beside lectures): " + hours + " hours and
" + minutes + " minutes");
input.close();
}
private static double validateInput(Scanner input, int maxDigits) {
int invalidInputs = 0;
while (invalidInputs < MAX_INVALID_INPUTS) {
String userInput = input.next();
try {
double value = Double.parseDouble(userInput);
if (userInput.length() <= maxDigits) {
return value; // Input has the desired number of digits, return the value
} else {
System.out.println("Invalid input! Please enter a number with no more than " +
maxDigits + " digits: ");
invalidInputs++;
}
} catch (NumberFormatException e) {
invalidInputs++;
System.out.println("Invalid input! Please enter a valid number: ");
}
}
System.out.println("Maximum number of invalid inputs reached. Exiting...");
logFailedAttempt("Invalid input: " + input);
System.exit(0); // Terminate the program gracefully
return 0; // This line won't be executed, added to satisfy the method return type
}
private static String validateInterestInput(Scanner input).
Using best responses to evaluate this matrix Find all the s.pdf
Using best responses to evaluate this matrix: Find all the solution(s) to this game: and Note to
write your answer in the proper form, with a<> around the answer, a comma separating the words,
and a space after the comma. No other spaces. Write the names exactly as they appear in the
matrix, and be careful about capitalizations. For example: Up, LC.
Using Bankers algorithm answer the following questions i.pdf
Using Banker's algorithm, answer the following questions:- i) What is the available vector? ii) What
are the contents of need matrix? iii) Find if the system is in safe state? If it is, find the safe
sequence. If there are four process and 4 resources A,B,C and D each with instances 3,14,12 and
12..
More Related Content
Similar to UserInputHandlerjava package midterm2023 import javautil.pdf
META-INFMANIFEST.MFManifest-Version 1.0.classpath.docx
META-INF/MANIFEST.MF
Manifest-Version: 1.0
.classpath
PriorityQueue.classpublicsynchronizedclass PriorityQueue {
Heap q;
public void PriorityQueue(int, java.util.Comparator);
public Object peek();
public Object remove();
void add(Object);
boolean isEmpty();
public int size();
}
PriorityQueue.javaPriorityQueue.javaimport java.util.Comparator;
publicclassPriorityQueue<E>{
Heap q;
/**
*PriorityQueue initializes the queue.
*
* @param initialCapacity an int that is the heaps initial size.
* @param comparator the priority of various imputs.
*/
publicPriorityQueue(int initialCapacity,Comparator<?super E> comparator){
q=newHeap(initialCapacity,comparator);
}
/**
* Peek, returns the next item in the queue without removing it.
*
* If it is empty then null is returned.
* @return the next item in the queue.
*/
public E peek(){
if(q.size()==0){
returnnull;
}
return(E) q.findMax();
}
/**
* This removes the first item from the queue.
*
* It returns null if the queue is empty.
* @return the first item in the queue.
*/
public E remove(){
if(q.size()==0){
returnnull;
}
return(E) q.removeMax();
}
/**
* This adds item to the queue
* @param item that is added to the queue.
*/
void add(E item){
q.insert(item);
}
/**
* isEmpty returns if the queue is empty or not.
*
* @return boolean if the queue is empty or not.
*/
boolean isEmpty(){
if(q.size()!=0){
returnfalse;
}
returntrue;
}
/**
* size returns the size of the queue.
*
* @return int the size of the queue.
*/
publicint size(){
return q.size();
}
}
ArithmeticExpression.classpublicsynchronizedclass ArithmeticExpression {
BinaryTree t;
java.util.ArrayList list;
String equation;
void ArithmeticExpression(String) throws java.text.ParseException;
public String toString(BinaryTree);
public String toPostfixString(BinaryTree);
void setVariable(String, int) throws java.rmi.NotBoundException;
public int evaluate(BinaryTree);
}
ArithmeticExpression.javaArithmeticExpression.javaimport java.rmi.NotBoundException;
import java.text.ParseException;
import java.util.ArrayList;
import java.util.Stack;
/**
* ArithmeticExpression takes equations in the form of strings creates a binary
* tree, and can return either the regular or postfix equation. It also allows
* them to be calculated.
*
*
* Extra Credit:
* ** it can handle spaces or no spaces in the string inputted. ** it can return
* regular or postfix notation
*
* @author tai-lanhirabayashi
*
*/
publicclassArithmeticExpression{
BinaryTree t;
ArrayList list;
String equation;
/**
* ArithmeticExpression is the construction which takes in a space
* delimitated equation containing "*,/,+,-" symbols and converts it into a
* binary tree.
*
* If the expression is not valid it will throw a ParseException. This is ...
java programming cheatsheet
A cheatsheet (or crib sheet) is a concise set of notes that contains terms, concepts, and
information to help someone remember something, summarize knowledge or use it as a quick
reference.
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/
import java.util.;public class Program{public static void.pdf
import java.util.*;
public class Program
{
public static void main(String[] args) {
Scanner input = new Scanner(System.in);
String x=\"X\";
int amount;
System.out.println(\"Enter amount\");
amount=input.nextInt();
System.out.println(\"Amount is: \"+amount);
for(int i=1; i<=amount; i++)
{
System.out.println(x);
for(int j=1; j<=i; j++)
{
System.out.print(x);
}
}
}
}
Why does It print out the last set of X\'s twice? I am doing basic Java so please try to explain
using the most basic codes.
import java.util.*;
public class Program
{
public static void main(String[] args) {
Scanner input = new Scanner(System.in);
String x=\"X\";
int amount;
System.out.println(\"Enter amount\");
amount=input.nextInt();
System.out.println(\"Amount is: \"+amount);
for(int i=1; i<=amount; i++)
{
System.out.println(x);
for(int j=1; j<=i; j++)
{
System.out.print(x);
}
}
}
}
Why does It print out the last set of X\'s twice? I am doing basic Java so please try to explain
using the most basic codes.
import java.util.*;
public class Program
{
public static void main(String[] args) {
Scanner input = new Scanner(System.in);
String x=\"X\";
int amount;
System.out.println(\"Enter amount\");
amount=input.nextInt();
System.out.println(\"Amount is: \"+amount);
for(int i=1; i<=amount; i++)
{
System.out.println(x);
for(int j=1; j<=i; j++)
{
System.out.print(x);
}
}
}
}
Why does It print out the last set of X\'s twice? I am doing basic Java so please try to explain
using the most basic codes.
Solution
Hi,
I have modified the code. it is working as expected now. Highlighted the code changes below.
Issue here is with you have written this statement twice System.out.println(x); which causes the
issue.
Program.java
import java.util.*;
public class Program
{
public static void main(String[] args) {
Scanner input = new Scanner(System.in);
String x=\"X\";
int amount;
System.out.println(\"Enter amount\");
amount=input.nextInt();
System.out.println(\"Amount is: \"+amount);
for(int i=1; i<=amount; i++)
{
System.out.println();
for(int j=1; j<=i; j++)
{
System.out.print(x);
}
}
}
}
Output:
Enter amount
10
Amount is: 10
X
XX
XXX
XXXX
XXXXX
XXXXXX
XXXXXXX
XXXXXXXX
XXXXXXXXX
XXXXXXXXXX.
In Class AssignmetzCST280W13a-1.pdfCST 280 In-Class Pract.docx
In Class Assignmetz/CST280W13a-1.pdf
CST 280 In-Class Practice – Week 13
Manually determine the configuration of the priority queue (stored as a heap) created
by the following operations. Trace the following logic and define the output:
enqueue(7);
enqueue(17);
enqueue(2);
enqueue(5);
enqueue(22);
enqueue(19);
enqueue(6);
enqueue(11);
enqueue(13);
write the queue contents
dequeue and write front item
enqueue(15);
enqueue(8);
dequeue and write front item
dequeue and write front item
enqueue(24);
enqueue(14);
write the queue contents
Part 2
Then, verify the output by implementing the algorithm by rewriting the priority
queue demonstration program discussed in class. Files needed:
testPQueue.cpp pqType.h heap.cpp
Deliverables
• This cover sheet (with your names on it)
• Driver source code and output for verification program exectution.
In Class Assignmetz/CST280W13b.pdf
CST 280 In-Class Practice – Week 13
Use this page as a worksheet to sketch the progression of the elements up to the first
split for the QuickSort algorithm. Use the middle array element as the split value:
15 34 99 42 11 41 66 23 55 93 48
Next, access the file quickSort.cpp from the course web page. Tailor the program
by entering the array values above in place of the integer values used for an in-class
demonstration. Be sure to adjust the index range to match the size of this array.
Remember that the parameters to the QuickSort algorithm are starting and ending index
values, not the size of the array.
Next, insert code to demonstrate the state of the array after the first split. This should
verify what you did by hand above. Insert the following code at various points within
the partition function to “see” the array at various stages of processing:
for (int i = start; i <= end; i++) // <== ADD
cout << set[i] << ' ';
cout << endl;
Insert the code at these positions:
int partition(int set[], int start, int end)
{
int pivotValue, pivotIndex, mid;
mid = (start + end) / 2;
swap(set[start], set[mid]);
pivotIndex = start;
pivotValue = set[start];
ç HERE
for (int scan = start + 1; scan <= end; scan++)
{
if (set[scan] < pivotValue)
{
pivotIndex++;
swap(set[pivotIndex], set[scan]);
}
ç HERE
}
swap(set[start], set[pivotIndex]);
ç HERE
return pivotIndex;
}
Finally, identify the line that matches what you concluded above.
Deliverables:
Deliver the following for this assignment:
• This work sheet with a sketch of the array first split
• Program source code with required change
• Program output demonstrating array configuration after first split .
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
Write the code above and the ones below in netbeans IDE 8.13. (Eli.pdf
Write the code above and the ones below in netbeans IDE 8.1
3. (Eliminate duplicates) Write a method that returns a new array by eliminating the duplicate
values in the array using the following method header: public static int[]
eliminateDuplicates(int[] list) Write a test program that reads in ten integers, invokes the method,
and displays the result. Here is the sample run of the program:
Enter ten numbers: 1 2 3 2 1 6 3 4 5 2 [Enter]
The distinct numbers are: 1 2 3 6 4 5
4. (Sort students) Write a program that prompts the user to enter the number of students, the
students’ names, and their scores, and prints student names in decreasing order of their scores.
Solution
Please follow the code and comments for description :
a)
CODE :
import java.util.Scanner;
public class MeanSD {
public static double deviation (double[] x) { // method to return the deviation
double sum = 0, mean = 0, deviation = 0; // required initialisations
double[] temp = new double[10]; // temporary array
for (int i = 0; i < 10; i++) //calculate the standard deviation
{
temp[i] = Math.pow((x[i] - mean), 2); // assigning the value to the array
sum += temp[i]; // adding up the values
}
mean = sum / 10; // getting the mean
deviation = Math.sqrt(mean); // calculating the deviation
return deviation; // returning the deviation
}
public static double mean (double[] x) { // method to return themean of the values entered
double sum = 0, mean; // required initialisations
for (int i = 0; i < 10; i++) //Take input in the array
{
sum += x[i]; //sum of all elements
}
mean = sum / 10; // calculating the mean
return mean; // returning the mean value
}
public static void main(String[] args) { // driver method
System.out.println(\"Enter the 10 numbers.\"); // prompt to enter the data
Scanner in = new Scanner(System.in); // scanner class to get the data from the user
double[] arr = new double[10]; // array that saves the data
double sum = 0, mean = 0, deviation = 0; // required initialisations
for (int i = 0; i < 10; i++) //Take input in the array
{
System.out.print(\"Enter a number : \"); // prompt to enter the number
arr[i] = in.nextDouble(); // getting the data from the console
}
mean = mean(arr); // calling the method to return the mean value
System.out.println(\"Mean : \" + mean); //Display mean of all elements
deviation = deviation(arr); // calling the method to return teh deviation value
System.out.println(\"Deviation : \" + deviation); // display the result
}
}
OUPTPUT :
Enter the 10 numbers.
Enter a number : 1
Enter a number : 2
Enter a number : 3
Enter a number : 4
Enter a number : 5
Enter a number : 6
Enter a number : 7
Enter a number : 8
Enter a number : 9
Enter a number : 10
Mean : 5.5
Deviation : 6.2048368229954285
b)
CODE :
import java.util.Scanner;
public class MyDuplicateElements {
public static int[] eliminateDuplicates(int[] input) { // method to remove the duplicates
int j = 0; // required initialisations
int i = 1;
//return if the array length is less than 2
if (input..
Please help with this JAVA Assignment and show output if you can ple.pdf
Please help with this JAVA Assignment and show output if you can please
Complete required scripts based on eclipse and troubleshoot the scripts until the tasks are done.
1. Implement linear-sort, merge-sort and quick-sort (write the code for them).
Solution
Linear or Insertion Sort
import java.util.*;
import java.lang.*;
import java.io.*;
import java.util.Scanner;
class LinearSort
{
public static void sort( int values[] )
{
int N = values.length;
int i, j, temp;
for (i = 1; i< N; i++)
{
j = i;
temp = values[i];
while (j > 0 && temp < values[j-1])
{
values[j] = values[j-1];
j = j-1;
}
values[j] = temp;
}
}
public static void main(String[] args)
{
Scanner scan = new Scanner( System.in );
int n, i;
System.out.println(\"Enter number of elements\");
n = scan.nextInt();
int values[] = new int[n];
System.out.println(\"\ Enter elements\");
for (i = 0; i < n; i++)
values[i] = scan.nextInt();
sort(values);
System.out.println(\"\ Sorted Elements\");
for (i = 0; i < n; i++)
System.out.print(values[i]+\" \");
System.out.println();
}
}
Output:
Enter number of elements
6
Enter elements
34 56 12 8 9 23
Sorted Elements
8 9 12 23 34 56
Merge Sort
import java.util.Scanner;
public class Mergesort
{
public static void mergesort(int[] a, int low, int high)
{
int N = high - low;
if (N <= 1)
return;
int mid = low + N/2;
mergesort(a, low, mid);
mergesort(a, mid, high);
int[] temp = new int[N];
int i = low, j = mid;
for (int k = 0; k < N; k++)
{
if (i == mid)
temp[k] = a[j++];
else if (j == high)
temp[k] = a[i++];
else if (a[j] pivot)
j--;
if (i <= j)
{
temp = values[i];
values[i] = values[j];
values[j] = temp;
i++;
j--;
}
}
if (low < j)
quickquicksort(values, low, j);
if (i < high)
quickquicksort(values, i, high);
}
public static void main(String[] args)
{
Scanner scan = new Scanner( System.in );
int n, i;
System.out.println(\"Enter number of elements\");
n = scan.nextInt();
int values[] = new int[ n ];
System.out.println(\"\ Enter elements\");
for (i = 0; i < n; i++)
values[i] = scan.nextInt();
quicksort(values);
System.out.println(\"\ qSorted Elements \");
for (i = 0; i < n; i++)
System.out.print(values[i]+\" \");
System.out.println();
}
}
Output:
Enter number of elements
8
Enter elements
89 23 90 56 13 71 46 13
Sorted Elements
13 13 23 46 56 71 89 90.
Java 8 Lambda Built-in Functional Interfaces
In Java 8, the java.util.function has numerous built-in interfaces. Other packages in the Java library (notably java.util.stream package) make use of the interfaces defined in this package. Java 8 developers should be familiar with using key interfaces provided in this package. This presentation provides an overview of four key functional interfaces (Consumer, Supplier, Function, and Predicate) provided in this package.
- the modification will be done in Main class- first, asks the use.pdf
- the modification will be done in Main class
- first, asks the user if it is a regular user or from the company.
-second, compare the username and password if it is from a company.
note:
-the code:
package project;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.net.InetAddress;
import java.text.SimpleDateFormat;
import java.util.Date;
import java.util.Scanner;
public class project {
private static final int MAX_INVALID_INPUTS = 3;
private static final String LOG_FILE_PATH = "failed_attempts.txt";
public static void main(String[] args) {
SE_dep SE_obj = new SE_dep();
CSAI_Dep csaiDepartment = new CSAI_Dep();
CY_Dep cyDepartment = new CY_Dep();
DS_Dep dsDep = new DS_Dep();
double SE_minIndustSalary;
double SE_prevGPA;
String SE_interestOfStudent;
Scanner input = new Scanner(System.in);
System.out.println("Please enter the Minimum acceptable industry salary: ");
SE_minIndustSalary = validateInput(input, 10); // Maximum of 10 digits
System.out.println("Please Enter Your previous GPA: ");
SE_prevGPA = validateInput(input, 3); // Maximum of 3 digits
SE_interestOfStudent = validateInterestInput(input);
System.out.println("Student inputs: Minimum acceptable industry salary[" +
SE_minIndustSalary + "] Previous GPA[" + SE_prevGPA + "] Computer Programming
interest[" + SE_interestOfStudent + "]");
System.out.println("Suggested programs:\n\n");
SE_obj.ifIncluded_SE(SE_minIndustSalary, SE_prevGPA, SE_interestOfStudent);
cyDepartment.recommendPrograms(SE_minIndustSalary, SE_prevGPA,
SE_interestOfStudent);
csaiDepartment.recommendPrograms(SE_minIndustSalary, SE_prevGPA,
SE_interestOfStudent);
dsDep.DS_Program(SE_minIndustSalary, SE_prevGPA, SE_interestOfStudent);
double studyHours = SE_prevGPA * 1.0; // Each GPA point corresponds to 1 hour of study
int hours = (int) studyHours; // Extract the integer part (hours)
int minutes = (int) ((studyHours - hours) * 60); // Calculate the minutes
System.out.println("Required study hours (at home beside lectures): " + hours + " hours and
" + minutes + " minutes");
input.close();
}
private static double validateInput(Scanner input, int maxDigits) {
int invalidInputs = 0;
while (invalidInputs < MAX_INVALID_INPUTS) {
String userInput = input.next();
try {
double value = Double.parseDouble(userInput);
if (userInput.length() <= maxDigits) {
return value; // Input has the desired number of digits, return the value
} else {
System.out.println("Invalid input! Please enter a number with no more than " +
maxDigits + " digits: ");
invalidInputs++;
}
} catch (NumberFormatException e) {
invalidInputs++;
System.out.println("Invalid input! Please enter a valid number: ");
}
}
System.out.println("Maximum number of invalid inputs reached. Exiting...");
logFailedAttempt("Invalid input: " + input);
System.exit(0); // Terminate the program gracefully
return 0; // This line won't be executed, added to satisfy the method return type
}
private static String validateInterestInput(Scanner input).
Similar to UserInputHandlerjava package midterm2023 import javautil.pdf (20)
META-INFMANIFEST.MFManifest-Version 1.0.classpath.docx
META-INFMANIFEST.MFManifest-Version 1.0.classpath.docx
import java.util.;public class Program{public static void.pdf
import java.util.;public class Program{public static void.pdf
In Class AssignmetzCST280W13a-1.pdfCST 280 In-Class Pract.docx
In Class AssignmetzCST280W13a-1.pdfCST 280 In-Class Pract.docx
Java programs - bubble sort, iterator, linked list, hash set, reverse string,...
Java programs - bubble sort, iterator, linked list, hash set, reverse string,...
Write the code above and the ones below in netbeans IDE 8.13. (Eli.pdf
Write the code above and the ones below in netbeans IDE 8.13. (Eli.pdf
Please help with this JAVA Assignment and show output if you can ple.pdf
Please help with this JAVA Assignment and show output if you can ple.pdf
- the modification will be done in Main class- first, asks the use.pdf
- the modification will be done in Main class- first, asks the use.pdf
More from adityknits
Using best responses to evaluate this matrix Find all the s.pdf
Using best responses to evaluate this matrix: Find all the solution(s) to this game: and Note to
write your answer in the proper form, with a<> around the answer, a comma separating the words,
and a space after the comma. No other spaces. Write the names exactly as they appear in the
matrix, and be careful about capitalizations. For example: Up, LC.
Using Bankers algorithm answer the following questions i.pdf
Using Banker's algorithm, answer the following questions:- i) What is the available vector? ii) What
are the contents of need matrix? iii) Find if the system is in safe state? If it is, find the safe
sequence. If there are four process and 4 resources A,B,C and D each with instances 3,14,12 and
12..
User Requirements Event handlers are often called event list.pdf
User Requirements
Event handlers are often called event listeners; the terms are often used interchangeably they are
basically the same: The listener listens for the events to happen; the handler is the code in
response to the event. They enable a web page to be more interactive, based on the users
actions.
JavaScript code: For your web page,
A. create and use 5 different JavaScript events EXCEPT click, dblclick, focus, blur, mouseover or
mouseout
B. use the addEventListener() method
C. perform some action for each event addEventListener() method EXCEPT an alert.
D. Display the results and/ or demonstrate each of these items in your HTML file.
Regarding the exceptions: You may use the excepted events and method as long as you satisfy
the required minimums in your code. For example: You may use the click event as long as you
have 5 other different events besides the exceptions listed above.
Theme
Use a vacation theme for your project. All code should be related to any vacation you choose,
realistic or fictional (Trip to the Sun). Use your creativity and have fun with this.
Notes
Please label all parts of your project so that when it's displayed to the screen, I know exactly what
the data is.
NOT USE NO (console.log) so please do not use this.
I will be using Google Chrome and Firefox to test your project.
Youre welcome to use images and colors, but please adhere to proper coding and design
standards. (See the course announcement, Is your website UGLY? r regarding this).
Using a company that you know or fictitious company briefly .pdf
Using a company that you know or fictitious company briefly states its main business. (a) Define
and explain what you understand by TOWS (10 marks) (b) Draw a TOWS Matrix and indicate
appropriate columns for Strengths, Weaknesses, Opportunities and Threats? (10 marks) (c) List
down the companys Strengths, Weaknesses, Opportunities and Threats?.
used below format to complete Write your code in the incompl.pdf
used below format to complete
Write your code in the incomplete program given below: #include using namespace std; int main()
{ char vCode; double vRate; // Toll rate for the vehicle double toll, distance; //Write your code here
1/ 1/ 1/ 1/ return 0; } }Translate the following flowchart into C++ code using switch.
Use to answer the following questions Match the letters wit.pdf
Use to answer the following questions. Match the letters with the statement(s). Some letter may be
used once, more than once or not at all. Surgical removal of will affect the destruction of red blood
cells C F D E BLymph from which organ is not collected by the right lymphatic duct? right lung
spleen right arm right headThe thoracic duct drains lymph from the and parts of the body. upper
left side, lower extremities (e.g abdomein, lower limbs) upper right, side, lower extremities (e.g
abdomein, lower limbs) lower extremities only upper right side aloneBlood vessels that received
lymph from the lymphatic ducts include left and right subclavian arteries left and right brachial
arteries left and right subclavian veins left and right axilary veins.
Use this list of terms to complete the sentences that follow.pdf
Use this list of terms to complete the sentences that follow. (a) establish goals for the company's
sales and production personnel. (b) The is a set of interrelated budgets that constitutes a plan of
action for a specified time period. (c) reduces the risk of having unrealistic budgets. (d) include the
cash budget and the budgeted balance sheet. (e) The budget is formed within the framework of a
(f) contain considerably less detail than budgets..
Use the Web to find as many examples as you can of open sour.pdf
Use the Web to find as many examples as you can of open source search en-
gines, information retrieval systems, or related technology. Give a brief descrip-
tion of each search engine and summarize the similarities and differences between
them.
1.4. List five web services or sites that you use that appear to use search, notinclud-
ing web search engines. Describe the role of search for that service. Also describe
whether the search is based on a database or grep style of matching, or if the search
is using some type of ranking..
Use the spreadsheet extract to answer the questions Requir.pdf
Use the spreadsheet extract to answer the questions
Required
Which of the following cells require the input of an actual value rather than a formula relating to
another cell on the spreadsheet?Answer 1Choose...B15B16C10C7
Suggest a formula for the following:
D17; Answer 2Choose...=-B15 or =-C14*0.04=SUM(D14:D16)=D10 or =D7*B25=C17*B26 or
=C17*$B$26=D7+B25=D10*D7
The total column has yet to be completed. Match up the cells below with the appropriate formulae
in order to complete this column.
E15: Answer
3Choose...=E10=SUM(B16:D16)=D15=B15=SUM(B10:D10)=D16=B16=SUM(B10:E10)=SUM(B1
5:D15)
E10: Answer
3Choose...=E10=SUM(B16:D16)=D15=B15=SUM(B10:D10)=D16=B16=SUM(B10:E10)=SUM(B1
5:D15).
Use the scenario to come up with the metabolic pathways requ.pdf
Use the scenario to come up with the metabolic pathways required for the microbe, then identify it
Use the table to come up with a metabolic pathway (like shown in Figure 2) regarding the given
scenario. Then, identify what microbe it could be based on given characteristics.
MIC 220 Unit 3# of pathways to use: 3-4. Scenario 2 : a microbe to be taken to a new colony in
Mars where there will be not sugars, low oxygen, no organic nitrogen, but yes minerals nutrients
and a low but possible way to acquire water. Need to handle well tanning given high sun light
exposure, can survive well in dry desert-like conditions scavenging any little water by
condensation of air humidity and living inside rocks.Blank template of critical details to include on
each pathway Figure 2: End product example An example of showcasing critical details of each
pathway and showing how they fit together.1. Solved Table of pathways (insert) 2. Board merging
deck of pathways (insert figure as in page 2) 3. Possible microbe fitting scenario and
characteristics (keep it brief)Figure 2: End product example An example of showcasing critical
details of each pathway and showing how they fit together..
Use the RTL design process to create an alarm system that se.pdf
Use the RTL design process to create an alarm system that sets a single-bit output alarm to 1
when the average temperature of four consecutive samples meets or exceeds a user-defined
threshold value. A 32-bit unsigned input CT indicates the current temperature, and a 32-bit
unsigned input WT indicates the warning threshold. Samples should be taken every few clock
cycles. A single-bit input clr when 1 disables the alarm and the sampling process. Start by
capturing the desired system behavior as an HLSM, and then convert to a controller/datapath..
Use the micrograph of the Gram stain to draw conclusions and.pdf
Use the micrograph of the Gram stain to draw conclusions and make predictions about the
indicated bacterium. ew the image in greater detail. Based on your observation of the indicated
bacterium in this Gram stain, select ALL appropriate statements.View Available Hint(s) The
indicated bacterium has a strepto-formation The indicated bacterium is Gram-negative Eosin
Methylene Blue (EMB) or MacConkey agar would NOT be good choices of media to grow the
indciated bacterium The indicated bacterium is a bacillus The indicated bacterium produces
endotoxin (also known as lipopolysaccharide, LPS) The indicated bacterium is Gram-positive The
indicated bacterium is a spirochete.
Use the following code for the tasks public class Animal .pdf
Use the following code for the tasks:
public class Animal {
private String name;
public Animal ( String name ) {
this.name = name;
}
public String getName ( ) { return name; }
public String speak ( ) {
return name;
}
}
public class Cat extends Animal {
public Cat ( String name ) {
super ( name );
}
public String speak ( ) {
return "Rawr!";
}
}
public class Dog extends Animal {
public Dog ( String name ) {
super ( name );
}
public String speak ( ) {
return "Woof!";
}
}
import java.util.ArrayList;
public class Speak {
public static void main ( String [] args ) {
// Instantiate an object and make it speak.
Animal a = ?;
System.out.println ( a.speak() );
}
}
Task #1:
Examine the contents of the Speak.java class. This file doesn't really contain much. But create at
least 1 animal of either a Dog or Cat type. Then print out the results of the animal speaking. You
should see a "Woof!" or "Rawr!" outputted to the console.
But then modify the Dog or Cat class (whichever you created) such that the speak method returns
the name of the animal, the type of the animal, and then the noise the animal makes. Such that
the output looks something like this:
Barkley (dog): Woof!
OR
Miss Kitty (cat): Meow!
I recommend that you use the getName method to get the name of the animal. Test the output so
that it produces the expected results. The modify the other subclass for animal such that it act
similarly.
Task #2:
Now create your own subclass for animal. Use the Cat or Dog as a guide on how to create the
new subclass. The subclass must be an animal whose first letter of the type is the same first letter
as your name. For instance, if your name is "Zendaya" then you may want to make and animal
subtype "Zebra". Make sure that you make a speak method for the animal such that it makes the
animal's common noise.
Be sure to test the animal out in the same way that you tested for Task #1.
Zebulon (zebra): Yip!
Task #3:
But wait a second. Typical housecats don't really roar (rawr!). That's something that lions do. Make
a copy of the Cat class, naming the copy "Lion" instead. It should do everything a Cat does except
it should be a lion. So really the Lion class should extend the Cat class.
Then go back and change the Cat class so that it says "Meow!" instead of roaring. Test the code
for Cat and Lion in your Speak class to ensure that they both work.
Task #4:
Once you have complete task #3. Create a similar change in the Animal hierarchy for Dog. This
time make a new Wolf class that extends Dog. This new class should do everything a Dog does.
Except when it speaks it should howl: "Awoooooooo!". You can decide how many o's this should
contain. Test the code for Dog and Wolf in your Speak class to ensure that they both work.
Task #5:
We should have a hierarchy of animals that looks like the image at the bottom of the page (except
the Zebra will probably be different). So our last task is to make an ArrayList of all these different
types of animals. Declare and instantiate t.
Use the Internet to identify and compare three different mob.pdf
Use the Internet to identify and compare three different mobile device management (MDM) tools.
Create a table that lists their various features for on-boarding, off-boarding, configuration,
quarantine, modification of device settings, etc. Which of the tools would you recommend for a
small business with 10 employees who use smartphones but has a single person managing IT
services? Why?.
Use the graph below to answer questions 1012 10 Highlight .pdf
Use the graph below to answer questions 1012. 10. Highlight the areas of loss for the firm. 11.
What is the significance of Point A and Point B ? 12. What does the area between point A and
point B represent? 13. Suppose the government imposes an excise tax on the production of a
good produced in a perfectly competitive market that was in long run equilibrium. Draw side by
side market and firm graphs showing the short run impact on the firm and the market..
Use the grey point star symbol to indicate the competitive.pdf
Use the grey point (star symbol) to indicate the competitive market equilibrum. Then use the green
point (triangle symbol) to shade the area that represents consumer surplus in this market. Next
use the purple point (diamond symbol) to shade the area that represents producer surplus. finally,
use the black point (plus symbol) to indicate the deadweight loss in this market. (Hint: If the value
for any of these graphical objects is zero, leave that element on the palette.)Suppase that the
government imposes a tax on pirrerias of 11 per pirza sold. On the following gragh, use the arey
segment (star symbols) to show the tax wedoe that forms at the mes guasbty asid because of the
fax. Then iseOn the following graph, use the grey segment (star symbols) to show the tax wedge
that forms at the new guantiry sold becatre of the tax Jhen use the tan polyoon (dash symbols) to
indicate the tax revenue generated by this tax. Then use the green point (triangle symbol) to
shade the area that represents consumer sumplus, and the purple point (diamond symbol) to
shade the area that represents producer surplus. Finally, use the black pomt (olus symbol) to
indicate the deodweight loss in this market. (Hint: If the value for any of these graphical objects is
zere, lorve that element on the palette.]Indicate whecher each of the arews listed in the following
table increased, decreased, or remained the same as a result of the tax. It the tax were removed,
pima eaters and sellers would be better off, but the government would lose tax revenue. Suppose
that consumers and producers voluntarily transferred some of their gains to the government. True
or False: All parties (including the government) could be made better off with this transfer than
they were with a tax. True False.
Use the following information for the Exercises below The .pdf
Use the following information for the Exercises below. [The following information applies to the
questions displayed below.] The following adjusted trial balance at December 31 of Wilson
Trucking Company. Exercise 4-10 (Algo) Preparing an income statement & statement of owner's
equity LO C1 The K. Wilson. Capital account balance was $187,000 at December 31 of the prlor
year, and there were no owner investments during the year. (1) Prepare the income statement for
the year ended December 31. (2) Preoare the statement of owner's ecuitv for the vear ended
December 31 ..
Use the images from the wild type cell shown below to answer.pdf
Use the images from the wild type cell shown below to answer the following questions using your
understanding of our experiments this quarter and our reading of the literature. (i) Define the
protein fusions (i.e., what they encode for and relevant signal sequences) used to mark the
organelles in the images below. Explain their localizations and functions in the context of the cell
and/or the experiment. (ii) In the context of the findings from Yeger-Lotem et al 2009, explain the
significance of the position of the a-synuclein-GFP inclusions with respect to both the HDEL-
dsRed and BFP-Pho8. (iii) Propose and explain a model that connects the HDEL-dsRed structure
indicated by the arrow on the right to the ability of Nvj1 to suppress a-synuclein induced cell
toxicity. Connect the model to our observations this quarter and be sure to discuss both the HDEL-
dsRed and BFP-Pho8 structures..
Use the given information to find the indicated probability.pdf
Use the given information to find the indicated probability. A and B are mutually exclusive. P(A)=
0.2,P(B)=0.3. Find P((AB)). P((AB))=Use the given information to find the indicated probability. P(A
B)=0.5andP(AB)=0.4.FindP(A)+P(B)P(A)+P(B)=.
Use the following scenario to respond to items 10 and 11 T.pdf
Use the following scenario to respond to items 10 and 11 : The Garavan Insthute collected data en
different hocmone levels for patents with thyroid disease. The data prowided are the TT 4 levels
and FTi levels for indhiduai patients. Cick the liek belaw 10 douniload the data in Crunchiti
Coufichin Create a scatterplot of the FTt levels by the TT levels. Dased on the scafterplot. what
words can be used to fein the blanks: The direction of the scatherplot is The form and strength of
the asseciation between the TTd levels and FTI laverls of patients is A poskive, inoderately strong
linest B. poskive; whak Inear C. negative: weak inear D. poskive, strong norilhad E. negatlve;
stiong nsolnear F. negatve; moderately steong Enear QUESTION 11 Use Cruncllit is calculate the
correlaties cseffient. What is the value of th (Pound your anseer is 3 plates afler the decimal).
More from adityknits (20)
Using best responses to evaluate this matrix Find all the s.pdf
Using best responses to evaluate this matrix Find all the s.pdf
Using Bankers algorithm answer the following questions i.pdf
Using Bankers algorithm answer the following questions i.pdf
User Requirements Event handlers are often called event list.pdf
User Requirements Event handlers are often called event list.pdf
Using a company that you know or fictitious company briefly .pdf
Using a company that you know or fictitious company briefly .pdf
used below format to complete Write your code in the incompl.pdf
used below format to complete Write your code in the incompl.pdf
Use to answer the following questions Match the letters wit.pdf
Use to answer the following questions Match the letters wit.pdf
Use this list of terms to complete the sentences that follow.pdf
Use this list of terms to complete the sentences that follow.pdf
Use the Web to find as many examples as you can of open sour.pdf
Use the Web to find as many examples as you can of open sour.pdf
Use the spreadsheet extract to answer the questions Requir.pdf
Use the spreadsheet extract to answer the questions Requir.pdf
Use the scenario to come up with the metabolic pathways requ.pdf
Use the scenario to come up with the metabolic pathways requ.pdf
Use the RTL design process to create an alarm system that se.pdf
Use the RTL design process to create an alarm system that se.pdf
Use the micrograph of the Gram stain to draw conclusions and.pdf
Use the micrograph of the Gram stain to draw conclusions and.pdf
Use the following code for the tasks public class Animal .pdf
Use the following code for the tasks public class Animal .pdf
Use the Internet to identify and compare three different mob.pdf
Use the Internet to identify and compare three different mob.pdf
Use the graph below to answer questions 1012 10 Highlight .pdf
Use the graph below to answer questions 1012 10 Highlight .pdf
Use the grey point star symbol to indicate the competitive.pdf
Use the grey point star symbol to indicate the competitive.pdf
Use the following information for the Exercises below The .pdf
Use the following information for the Exercises below The .pdf
Use the images from the wild type cell shown below to answer.pdf
Use the images from the wild type cell shown below to answer.pdf
Use the given information to find the indicated probability.pdf
Use the given information to find the indicated probability.pdf
Use the following scenario to respond to items 10 and 11 T.pdf
Use the following scenario to respond to items 10 and 11 T.pdf
Recently uploaded
Thesis Statement for students diagnonsed withADHD.ppt
Presentation required for the master in Education.
How to Create Map Views in the Odoo 17 ERP
The map views are useful for providing a geographical representation of data. They allow users to visualize and analyze the data in a more intuitive manner.
The French Revolution Class 9 Study Material pdf free download
The French Revolution, which began in 1789, was a period of radical social and political upheaval in France. It marked the decline of absolute monarchies, the rise of secular and democratic republics, and the eventual rise of Napoleon Bonaparte. This revolutionary period is crucial in understanding the transition from feudalism to modernity in Europe.
For more information, visit-www.vavaclasses.com
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.
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.
Polish students' mobility in the Czech Republic
Polish students mobility to the Czech Republic within eTwinning project "Medieval adventures with Marco Polo"
1.4 modern child centered education - mahatma gandhi-2.pptx
Child centred education is an educational approach that priorities the interest, needs and abilities of the child in the learning process.
Overview on Edible Vaccine: Pros & Cons with Mechanism
This ppt include the description of the edible vaccine i.e. a new concept over the traditional vaccine administered by injection.
The Roman Empire A Historical Colossus.pdf
The Roman Empire, a vast and enduring power, stands as one of history's most remarkable civilizations, leaving an indelible imprint on the world. It emerged from the Roman Republic, transitioning into an imperial powerhouse under the leadership of Augustus Caesar in 27 BCE. This transformation marked the beginning of an era defined by unprecedented territorial expansion, architectural marvels, and profound cultural influence.
The empire's roots lie in the city of Rome, founded, according to legend, by Romulus in 753 BCE. Over centuries, Rome evolved from a small settlement to a formidable republic, characterized by a complex political system with elected officials and checks on power. However, internal strife, class conflicts, and military ambitions paved the way for the end of the Republic. Julius Caesar’s dictatorship and subsequent assassination in 44 BCE created a power vacuum, leading to a civil war. Octavian, later Augustus, emerged victorious, heralding the Roman Empire’s birth.
Under Augustus, the empire experienced the Pax Romana, a 200-year period of relative peace and stability. Augustus reformed the military, established efficient administrative systems, and initiated grand construction projects. The empire's borders expanded, encompassing territories from Britain to Egypt and from Spain to the Euphrates. Roman legions, renowned for their discipline and engineering prowess, secured and maintained these vast territories, building roads, fortifications, and cities that facilitated control and integration.
The Roman Empire’s society was hierarchical, with a rigid class system. At the top were the patricians, wealthy elites who held significant political power. Below them were the plebeians, free citizens with limited political influence, and the vast numbers of slaves who formed the backbone of the economy. The family unit was central, governed by the paterfamilias, the male head who held absolute authority.
Culturally, the Romans were eclectic, absorbing and adapting elements from the civilizations they encountered, particularly the Greeks. Roman art, literature, and philosophy reflected this synthesis, creating a rich cultural tapestry. Latin, the Roman language, became the lingua franca of the Western world, influencing numerous modern languages.
Roman architecture and engineering achievements were monumental. They perfected the arch, vault, and dome, constructing enduring structures like the Colosseum, Pantheon, and aqueducts. These engineering marvels not only showcased Roman ingenuity but also served practical purposes, from public entertainment to water supply.
Cambridge International AS A Level Biology Coursebook - EBook (MaryFosbery J...
for studentd in cabridge board
TESDA TM1 REVIEWER FOR NATIONAL ASSESSMENT WRITTEN AND ORAL QUESTIONS WITH A...
TESDA TM1 REVIEWER FOR NATIONAL ASSESSMENT WRITTEN AND ORAL QUESTIONS WITH ANSWERS.
The approach at University of Liverpool.pptx
How libraries can support authors with open access requirements for UKRI funded books
Wednesday 22 May 2024, 14:00-15:00.
Palestine last event orientationfvgnh .pptx
An EFL lesson about the current events in Palestine. It is intended to be for intermediate students who wish to increase their listening skills through a short lesson in power point.
Home assignment II on Spectroscopy 2024 Answers.pdf
Answers to Home assignment on UV-Visible spectroscopy: Calculation of wavelength of UV-Visible absorption
MARUTI SUZUKI- A Successful Joint Venture in India.pptx
Let us know about Maruti Suzuki, a successful Joint venture in India.
Recently uploaded (20)
Thesis Statement for students diagnonsed withADHD.ppt
Thesis Statement for students diagnonsed withADHD.ppt
aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa
aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa
The French Revolution Class 9 Study Material pdf free download
The French Revolution Class 9 Study Material pdf free download
1.4 modern child centered education - mahatma gandhi-2.pptx
1.4 modern child centered education - mahatma gandhi-2.pptx
Overview on Edible Vaccine: Pros & Cons with Mechanism
Overview on Edible Vaccine: Pros & Cons with Mechanism
Cambridge International AS A Level Biology Coursebook - EBook (MaryFosbery J...
Cambridge International AS A Level Biology Coursebook - EBook (MaryFosbery J...
TESDA TM1 REVIEWER FOR NATIONAL ASSESSMENT WRITTEN AND ORAL QUESTIONS WITH A...
TESDA TM1 REVIEWER FOR NATIONAL ASSESSMENT WRITTEN AND ORAL QUESTIONS WITH A...
Home assignment II on Spectroscopy 2024 Answers.pdf
Home assignment II on Spectroscopy 2024 Answers.pdf
MARUTI SUZUKI- A Successful Joint Venture in India.pptx
MARUTI SUZUKI- A Successful Joint Venture in India.pptx
UserInputHandlerjava package midterm2023 import javautil.pdf
- 1. UserInputHandler.java package midterm2023; import java.util.ArrayList; import java.util.List; import java.util.Scanner; public class UserInputHandler { public static List<String> readUserInput() { List<String> userData = new ArrayList<>(); System.out.println("Please enter your data below: (send 'bye' to exit) "); Scanner input = new Scanner(System.in); while (true) { String line = input.nextLine(); if ("bye".equalsIgnoreCase(line)) { break; } userData.add(line); } return userData; } public static void main(String[] args) { List<String> userData = readUserInput(); System.out.printf("User Input Data:n%s", String.join("n", userData)); } } UserInputHandlerUnitTest.java package midterm2023; import org.junit.jupiter.api.Test; import java.io.ByteArrayInputStream; import java.io.InputStream; import java.util.Arrays; import java.util.List; import java.util.stream.Collectors; import static org.assertj.core.api.Assertions.assertThat; public class UserInputHandlerUnitTest { //@Test void testByMakeUpDataInSystemIn() { String[] inputLines = new String[]{ "The first line.", "The second line.", "bye", "The last line.", "anything after 'bye' will be ignored"
- 2. }; String[] expectedLines = Arrays.copyOf(inputLines, inputLines.length - 2); List<String> expected = Arrays.stream(expectedLines).collect(Collectors.toList()); InputStream stdin = System.in; try { System.setIn(new ByteArrayInputStream(String.join("n", inputLines).getBytes())); List<String> actual = UserInputHandler.readUserInput(); assertThat(actual).isEqualTo(expected); } finally { System.setIn(stdin); } } } QuickSort.java package coen352.ch07; public class QuickSort { public static <E extends Comparable<? super E>> void sort(E[] A) { qsort(A, 0, A.length-1);} static <E extends Comparable<? super E>> void qsort(E[] A, int i, int j) { // Quicksort int pivotindex = findpivot(A, i, j); // Pick a pivot DSutil.swap(A, pivotindex, j); // Stick pivot at end // k will be the first position in the right subarray int k = partition(A, i-1, j, A[j]); DSutil.swap(A, k, j); // Put pivot in place if ((k-i) > 1) qsort(A, i, k-1); // Sort left partition if ((j-k) > 1) qsort(A, k+1, j); // Sort right partition } static <E extends Comparable<? super E>> int partition(E[] A, int l, int r, E pivot) { do {// Move bounds inward until they meet while (A[++l].compareTo(pivot)<0); while ((r!=0) && (A[--r].compareTo(pivot)>0));
- 3. DSutil.swap(A, l, r); // Swap out-of-place values } while (l < r); // Stop when they cross DSutil.swap(A, l, r); // Reverse last, wasted swap return l; // Return first position in right partition } static <E extends Comparable<? super E>> int findpivot(E[] A, int i, int j) { return (i+j)/2; } } In this assignment, we aim to practise white box testing and coverage strategies to produce unit test cases. Problem 1 (30 MARKS) The UserInputHandler program code is provided in the attachment. It is a simple function that stores the user's input until a certain terminating token is typed. The original code applies the token 'bye' to terminate. Now please revise the program to make the options with token 'bye' or 'quit' or 'exit'. 1.1. Develop CFG of the revised program and compute the CC value (5 MARKS). 1.2. Based on the CC value, derive the basic paths. (5 MARKS) 1.3. Analyze the program's code structure and estimate the number of test cases needed for condition coverage and decision coverage respectively. (5MARKS) 1.4. Generate test cases for 100% basic path coverage, condition coverage and