Can someone tell me why I'm getting Java error cannot invoke add(int).pdf
•
0 likes•8 views
Can someone tell me why I'm getting Java error cannot invoke add(int) on array type int on the bold line? I need this method to calculate median based on file that will be input in a different method. Do no change to a main method as I need to reserve that to only have a contructor. public int Problem7(File file) throws FileNotFoundException { int[] listInt; try { Scanner scanner = new Scanner(file); while (scanner.hasNextLine()) { String value = scanner.nextLine(); listInt.add(Integer.parseInt(value)); System.out.println(value); } scanner.close(); } catch (Exception ex) { ex.printStackTrace(); } Arrays.sort(listInt); int middle = listInt.length/2; int median = 0; if (listInt.length%2 == 1) median = listInt[middle]; else median = (listInt[middle-1] + listInt[middle]) / 2; return median; }}.
Report
Share
Report
Share
Download to read offline
![Can someone tell me why I'm getting Java error cannot invoke add(int) on array type int on the
bold line? I need this method to calculate median based on file that will be input in a different
method. Do no change to a main method as I need to reserve that to only have a contructor.
public int Problem7(File file) throws FileNotFoundException {
int[] listInt;
try {
Scanner scanner = new Scanner(file);
while (scanner.hasNextLine()) {
String value = scanner.nextLine();
listInt.add(Integer.parseInt(value));
System.out.println(value);
}
scanner.close();
} catch (Exception ex) {
ex.printStackTrace();
}
Arrays.sort(listInt);
int middle = listInt.length/2;
int median = 0;
if (listInt.length%2 == 1)
median = listInt[middle];
else
median = (listInt[middle-1] + listInt[middle]) / 2;
return median;](https://image.slidesharecdn.com/cansomeonetellmewhyimgettingjavaerrorcannotinvokeaddint-230313120613-14099e55/85/Can-someone-tell-me-why-I-m-getting-Java-error-cannot-invoke-add-int-pdf-1-320.jpg)
Recommended
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.
Mixing functional programming approaches in an object oriented language
My slides from Biz Tech Delhi
Create a menu-driven program that will accept a collection of non-ne.pdf
Create a menu-driven program that will accept a collection of non-negative integers from the
keyboard, calculate the mean and median values and display those values on the screen. Your
menu should have 6 options: 1. Add a number to the array 2. Display the mean 3. Display the
median 4. Print the array to the screen 5. Print the array in reverse order 6. Quit
Program particulars: Use an array of type int to store the integers entered by the user. There
must be error checking on the input integer. If it is negative, the program will print an error
message and re-prompt. This process will continue until a non-negative integer is entered. You
must use a try-catch structure to trap both types of input errors (like letters where numbers
should go) and range errors (like -1). You must write your own selectionSort utility method to
sort your array. Place the method in an external file named SortSearchUtil.java. There must be
error checking on the menu choice entered. If the user enters a choice not on the menu, the
program will print an error message, re-display the menu and re-prompt. This process will
continue until a valid option value is entered. Your solution must be modular. The design of your
methods is up to you, but the rules of “highly cohesive” and “loosely coupled” must be followed.
Your program should be well-documented. Explain what you’re doing in your code. Be sure to
include the usual name and assignment notes. Note your program will have to sort your array
before you can find the median. Include your SortSearchUtil.java file which will contain your
sort method.
This is what my project looks like already: Please fix it thanks. The SortSearchUtil will also be
included.
import java.util.Scanner;
public class ArraySorting
{
public static void main(String[] args)
{
int option;
int integer = 0;
int optionOne;
int optionTwo;
int optionThree;
int optionFour;
int optionFive;
int[] numbers = new int[5];
Scanner kb = new Scanner(System.in);
System.out.println(\"Please enter a non-negative integer: \");
integer = kb.nextInt();
while((integer < 0))
{
System.out.println(\"I am sorry that is not a non-negative integer.\");
System.out.println(\"\");
System.out.println(\"Please enter a non-negative integer: \");
integer = kb.nextInt();
}
option = displayMenu(kb);
while (option != 6)
{
switch (option)
{
case 1:
optionOne(numbers);
System.out.println(\"\");
break;
case 2:
optionTwo(numbers);
System.out.println(\"\");
case 3:
//optionThree();
System.out.println(\"\");
break;
case 4:
//optionFour();
System.out.println(\"\");
break;
case 5:
//optionFive();
System.out.println(\"\");
break;
}
option = displayMenu(kb);
}
if (option == 6)
{
System.out.println();
System.out.println(\"Thank you. Have a nice day.\");
}
}
private static int displayMenu(Scanner kb)
{
int option = 0;
while (option != 1 && option != 2 && option != 3 && option != 4 && option !=5 && option
!=6)
{
System.out.println(\"\\t\\t1. Add a number to the array\ \\t\\t2. Display the mean\ \\t\.
Mixing Functional and Object Oriented Approaches to Programming in C#
Mixing Functional and Object Oriented Approaches to Programming in C#, Michael Wagg, Mark Needham
Javathis is my current code i need help to implement public void s.pdf
Java
this is my current code i need help to implement public void sort method (TODO part)
import java.util.List;
import java.util.ArrayList;
import java.util.Collections;
class MergeSort {
public static void sort(List list) {
//TODO call the method private static void sort with parameters(length of input list, 0,0);
}
private static void sort(List list, int startIndex, int endIndex){
int length = endIndex - startIndex;
if(length <= 1) {
return;
}
int middleIndex = startIndex + (length/2);
sort(list,startIndex,middleIndex);
sort(list,middleIndex,endIndex);
int upperStart = startIndex;
int upperEnd = startIndex + (length/2);
int lowerStart = upperEnd;
int lowerEnd = endIndex;
int i = upperStart;
int j = lowerStart;
List tmpList = new ArrayList();
while ( i < upperEnd || j < lowerEnd){
if(i >= upperEnd){
tmpList.add(list.get(j));
j++;
}
else if(j >= lowerEnd) {
tmpList.add(list.get(i));
i++;
}
else{
if(list.get(i) < list.get(j)){
tmpList.add(list.get(i));
i++;
}
else{
tmpList.add(list.get(j));
j++;
}
}
for(int k = startIndex; k < endIndex; k++){
list.set(k,tmpList.get(k - startIndex));
}
}
}
}
Solution
import java.util.List;
import java.util.ArrayList;
import java.util.Collections;
class MergeSort {
public static void sort(List list) {
//call the method private static void sort with parameters(length of input list, 0,0);
sort(list.size(), 0,0);
}
private static void sort(List list, int startIndex, int endIndex){
int length = endIndex - startIndex;
if(length <= 1) {
return;
}
int middleIndex = startIndex + (length/2);
sort(list,startIndex,middleIndex);
sort(list,middleIndex,endIndex);
int upperStart = startIndex;
int upperEnd = startIndex + (length/2);
int lowerStart = upperEnd;
int lowerEnd = endIndex;
int i = upperStart;
int j = lowerStart;
List tmpList = new ArrayList();
while ( i < upperEnd || j < lowerEnd){
if(i >= upperEnd){
tmpList.add(list.get(j));
j++;
}
else if(j >= lowerEnd) {
tmpList.add(list.get(i));
i++;
}
else{
if(list.get(i) < list.get(j)){
tmpList.add(list.get(i));
i++;
}
else{
tmpList.add(list.get(j));
j++;
}
}
for(int k = startIndex; k < endIndex; k++){
list.set(k,tmpList.get(k - startIndex));
}
}
}
}.
The implementation for Mergesort given in Section 7.4 takes an array .pdf
The implementation for Mergesort given in Section 7.4 takes an array as input and soils that
array. At the beginning of Section 7.4 there is a simple pseudocode implementation for sorting a
linked list using Mergesort. Implement both a linked list-based version of Mergesort and the
array-based version of Mergesort, and compare and analyze their running times.
Solution
program
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Iterator;
public class Merge
{
public static int[] merge(int [] list)
{
if (list.length <= 1)
{
return list;
}
int[] first = new int[list.length / 2];
int[] second = new int[list.length - first.length];
System.arraycopy(list, 0, first, 0, first.length);
System.arraycopy(list, first.length, second, 0, second.length);
merge(first);
merge(second);
mergesort(first, second, list);
return list;
}
private static void mergesort(int[] first, int[] second, int [] result) {
int iFirst = 0;
int iSecond = 0;
int j = 0;
while (iFirst < first.length && iSecond < second.length)
{
if (first[iFirst] < second[iSecond])
{
result[j] = first[iFirst];
iFirst++;
} else
{
result[j] = second[iSecond];
iSecond++;
}
j++;
}
System.arraycopy(first, iFirst, result, j, first.length - iFirst);
System.arraycopy(second, iSecond, result, j, second.length - iSecond);
}
public static void main(String args[]) throws Exception
{
String list=\"\";
int i=0,n=0;
Merge s= new Merge();
ArrayList arrlist=new ArrayList();
System.out.println(\" \");
System.out.println(\" \");
System.out.println(\"Please enter the list of elements,one element per line\");
System.out.println(\" write \'STOP\' when list is completed \");
BufferedReader bf=new BufferedReader(new InputStreamReader(System.in));
while(!(list=bf.readLine()).equalsIgnoreCase(\"stop\"))
{
int intelement=Integer.parseInt(list);
arrlist.add(intelement);
}
int elementlist[] = new int[arrlist.size()];
Iterator iter = arrlist.iterator();
for (int j=0;iter.hasNext();j++) {
elementlist[j] = iter.next();
}
elementlist=merge(elementlist);
System.out.println(\" \");
System.out.println(\" \");
System.out.println(\" \");
System.out.println(\"Values after Merge Sort : \");
for (int j=0;j.
Recommended
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.
Mixing functional programming approaches in an object oriented language
My slides from Biz Tech Delhi
Create a menu-driven program that will accept a collection of non-ne.pdf
Create a menu-driven program that will accept a collection of non-negative integers from the
keyboard, calculate the mean and median values and display those values on the screen. Your
menu should have 6 options: 1. Add a number to the array 2. Display the mean 3. Display the
median 4. Print the array to the screen 5. Print the array in reverse order 6. Quit
Program particulars: Use an array of type int to store the integers entered by the user. There
must be error checking on the input integer. If it is negative, the program will print an error
message and re-prompt. This process will continue until a non-negative integer is entered. You
must use a try-catch structure to trap both types of input errors (like letters where numbers
should go) and range errors (like -1). You must write your own selectionSort utility method to
sort your array. Place the method in an external file named SortSearchUtil.java. There must be
error checking on the menu choice entered. If the user enters a choice not on the menu, the
program will print an error message, re-display the menu and re-prompt. This process will
continue until a valid option value is entered. Your solution must be modular. The design of your
methods is up to you, but the rules of “highly cohesive” and “loosely coupled” must be followed.
Your program should be well-documented. Explain what you’re doing in your code. Be sure to
include the usual name and assignment notes. Note your program will have to sort your array
before you can find the median. Include your SortSearchUtil.java file which will contain your
sort method.
This is what my project looks like already: Please fix it thanks. The SortSearchUtil will also be
included.
import java.util.Scanner;
public class ArraySorting
{
public static void main(String[] args)
{
int option;
int integer = 0;
int optionOne;
int optionTwo;
int optionThree;
int optionFour;
int optionFive;
int[] numbers = new int[5];
Scanner kb = new Scanner(System.in);
System.out.println(\"Please enter a non-negative integer: \");
integer = kb.nextInt();
while((integer < 0))
{
System.out.println(\"I am sorry that is not a non-negative integer.\");
System.out.println(\"\");
System.out.println(\"Please enter a non-negative integer: \");
integer = kb.nextInt();
}
option = displayMenu(kb);
while (option != 6)
{
switch (option)
{
case 1:
optionOne(numbers);
System.out.println(\"\");
break;
case 2:
optionTwo(numbers);
System.out.println(\"\");
case 3:
//optionThree();
System.out.println(\"\");
break;
case 4:
//optionFour();
System.out.println(\"\");
break;
case 5:
//optionFive();
System.out.println(\"\");
break;
}
option = displayMenu(kb);
}
if (option == 6)
{
System.out.println();
System.out.println(\"Thank you. Have a nice day.\");
}
}
private static int displayMenu(Scanner kb)
{
int option = 0;
while (option != 1 && option != 2 && option != 3 && option != 4 && option !=5 && option
!=6)
{
System.out.println(\"\\t\\t1. Add a number to the array\ \\t\\t2. Display the mean\ \\t\.
Mixing Functional and Object Oriented Approaches to Programming in C#
Mixing Functional and Object Oriented Approaches to Programming in C#, Michael Wagg, Mark Needham
Javathis is my current code i need help to implement public void s.pdf
Java
this is my current code i need help to implement public void sort method (TODO part)
import java.util.List;
import java.util.ArrayList;
import java.util.Collections;
class MergeSort {
public static void sort(List list) {
//TODO call the method private static void sort with parameters(length of input list, 0,0);
}
private static void sort(List list, int startIndex, int endIndex){
int length = endIndex - startIndex;
if(length <= 1) {
return;
}
int middleIndex = startIndex + (length/2);
sort(list,startIndex,middleIndex);
sort(list,middleIndex,endIndex);
int upperStart = startIndex;
int upperEnd = startIndex + (length/2);
int lowerStart = upperEnd;
int lowerEnd = endIndex;
int i = upperStart;
int j = lowerStart;
List tmpList = new ArrayList();
while ( i < upperEnd || j < lowerEnd){
if(i >= upperEnd){
tmpList.add(list.get(j));
j++;
}
else if(j >= lowerEnd) {
tmpList.add(list.get(i));
i++;
}
else{
if(list.get(i) < list.get(j)){
tmpList.add(list.get(i));
i++;
}
else{
tmpList.add(list.get(j));
j++;
}
}
for(int k = startIndex; k < endIndex; k++){
list.set(k,tmpList.get(k - startIndex));
}
}
}
}
Solution
import java.util.List;
import java.util.ArrayList;
import java.util.Collections;
class MergeSort {
public static void sort(List list) {
//call the method private static void sort with parameters(length of input list, 0,0);
sort(list.size(), 0,0);
}
private static void sort(List list, int startIndex, int endIndex){
int length = endIndex - startIndex;
if(length <= 1) {
return;
}
int middleIndex = startIndex + (length/2);
sort(list,startIndex,middleIndex);
sort(list,middleIndex,endIndex);
int upperStart = startIndex;
int upperEnd = startIndex + (length/2);
int lowerStart = upperEnd;
int lowerEnd = endIndex;
int i = upperStart;
int j = lowerStart;
List tmpList = new ArrayList();
while ( i < upperEnd || j < lowerEnd){
if(i >= upperEnd){
tmpList.add(list.get(j));
j++;
}
else if(j >= lowerEnd) {
tmpList.add(list.get(i));
i++;
}
else{
if(list.get(i) < list.get(j)){
tmpList.add(list.get(i));
i++;
}
else{
tmpList.add(list.get(j));
j++;
}
}
for(int k = startIndex; k < endIndex; k++){
list.set(k,tmpList.get(k - startIndex));
}
}
}
}.
The implementation for Mergesort given in Section 7.4 takes an array .pdf
The implementation for Mergesort given in Section 7.4 takes an array as input and soils that
array. At the beginning of Section 7.4 there is a simple pseudocode implementation for sorting a
linked list using Mergesort. Implement both a linked list-based version of Mergesort and the
array-based version of Mergesort, and compare and analyze their running times.
Solution
program
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Iterator;
public class Merge
{
public static int[] merge(int [] list)
{
if (list.length <= 1)
{
return list;
}
int[] first = new int[list.length / 2];
int[] second = new int[list.length - first.length];
System.arraycopy(list, 0, first, 0, first.length);
System.arraycopy(list, first.length, second, 0, second.length);
merge(first);
merge(second);
mergesort(first, second, list);
return list;
}
private static void mergesort(int[] first, int[] second, int [] result) {
int iFirst = 0;
int iSecond = 0;
int j = 0;
while (iFirst < first.length && iSecond < second.length)
{
if (first[iFirst] < second[iSecond])
{
result[j] = first[iFirst];
iFirst++;
} else
{
result[j] = second[iSecond];
iSecond++;
}
j++;
}
System.arraycopy(first, iFirst, result, j, first.length - iFirst);
System.arraycopy(second, iSecond, result, j, second.length - iSecond);
}
public static void main(String args[]) throws Exception
{
String list=\"\";
int i=0,n=0;
Merge s= new Merge();
ArrayList arrlist=new ArrayList();
System.out.println(\" \");
System.out.println(\" \");
System.out.println(\"Please enter the list of elements,one element per line\");
System.out.println(\" write \'STOP\' when list is completed \");
BufferedReader bf=new BufferedReader(new InputStreamReader(System.in));
while(!(list=bf.readLine()).equalsIgnoreCase(\"stop\"))
{
int intelement=Integer.parseInt(list);
arrlist.add(intelement);
}
int elementlist[] = new int[arrlist.size()];
Iterator iter = arrlist.iterator();
for (int j=0;iter.hasNext();j++) {
elementlist[j] = iter.next();
}
elementlist=merge(elementlist);
System.out.println(\" \");
System.out.println(\" \");
System.out.println(\" \");
System.out.println(\"Values after Merge Sort : \");
for (int j=0;j.
Why following sort does not work (It does not sort last 2 - 3 numbe.pdf
Why following sort does not work? (It does not sort last 2 - 3 numbers)
//Sort order
class SortNumbListener implements ActionListener
{
@Override
public void actionPerformed(ActionEvent e)
{
Collections.sort(list);
for(int i = 0; i < list.size(); i++)
{
textfield2.setText(list.toString());
}
System.out.print(list + \"\ \");
}
}
Solution
import java.awt.event.ActionEvent;
import java.awt.event.ActionListener;
import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
import javax.swing.JTextField;
public class SorAction {
public JTextField textfield2;
public List list;
public SorAction() {
// TODO Auto-generated constructor stub
textfield2 = new JTextField();
list = new ArrayList();
list.add(20);
list.add(12);
list.add(32);
list.add(3);
new SortNumbListener().actionPerformed(new ActionEvent(\"\", 0, null));
}
public static void main(String[] args) {
try {
new SorAction();
} catch (Exception e) {
// TODO: handle exception
e.printStackTrace();
}
}
class SortNumbListener implements ActionListener {
@Override
public void actionPerformed(ActionEvent e) {
Collections.sort(list);
textfield2.setText(list.toString());
System.out.print(list + \"\ \");
}
}
}
OUTPUT:
[3, 12, 20, 32]
NOTE: please check the above example, sorting fine, but what is the need of loop,
if you want to add the text to textbox use setText() method of textfield.
Here is my code for a linefile editor Please help me figure out wh.pdf
Here is my code for a line/file editor: Please help me figure out when I input "E" to exit and save
to the textin.txt file, it is not saving anything in textin.txt file. It also is prints "1>" twice when I
hit enter before it will move on to "2>" See my output below and the needed output and I need
the command "E" to save the output to the textin.txt file and terminate the program. "E"
terminates my program, but is not saving to the txt file.
import java.io.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.io.IOException;
import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;
public class FileEdit {
public static List lines = new ArrayList();
public static void main(String[] args) throws IOException
{
Scanner s = new Scanner(System.in);
System.out.print("EDIT: ");
String fileName = s.nextLine();
BufferedReader br = new BufferedReader(new FileReader(new File(fileName)));
String str="";
int count=0;
while((str=br.readLine())!=null)
{
lines.add(count, str);
System.out.println((++count) + "> "+ str);
}
String text="";
String command = "";
System.out.print((++count)+"> ");
command=s.nextLine();
String commandArr[];
int flag;
while(!command.equals("E"))
{
flag=0;
commandArr = command.split("\\s");
if(commandArr[0].equals("I")) //Insertion
{
while(true)
{
if(commandArr.length==1&&flag!=2)
{
System.out.print((count)+"> ");
text = s.nextLine();
insertLine(text,count-1);
}
else if(commandArr.length==2&&flag!=2)
{
System.out.print((commandArr[1])+"> ");
count=Integer.parseInt(commandArr[1]);
text = s.nextLine();
insertLine(text,Integer.parseInt(commandArr[1])-1);
}
else
insertLine(text,count-1);
System.out.print((++count)+"> ");
command=s.nextLine();
commandArr = command.split("\\s");
if(commandArr[0].equals("I")||commandArr[0].equals("L")||commandArr[0].equals("D")||comm
andArr[0].equals("E"))
{
flag=1;
break;
}
else
{
flag=2;
text=command;
}
}
}
else if(commandArr[0].equals("L")) //Listing
{
printList();
}
else if(commandArr[0].equals("D")) //Deletion
{
if(commandArr.length==1)
{
deleteLine(count-1,count-1);
}
else if(commandArr.length==2)
{
deleteLine(Integer.parseInt(commandArr[1])-1,Integer.parseInt(commandArr[1])-1);
}
else if(commandArr.length==3)
{
deleteLine(Integer.parseInt(commandArr[1])-1,Integer.parseInt(commandArr[2])-1);
}
count=lines.size();
}
if(flag!=1)
{
System.out.print((count++)+"> ");
command = s.nextLine();
}
}
}
public static void insertLine(String text,int count)
{
if (count >= lines.size()) {
for(int i = lines.size(); i <= count; i++) {
lines.add(null);
}
}
lines.set(count,text);
}
public static void deleteLine(int start,int end)
{
for(int i=start;i<=end;i++)
lines.remove(i);
}
public static void printList()
{
for(int i=0;i "+lines.get(i));
}
}
Here is the output I am getting:
EDIT: textin.txt
1> The First Line
1>
2> And another line
3> I 3
3> The second line
4> One more line
5> L
1>
2>
3> The second line
4> One more line
5> D 2
3> L
1>
2> The second line
3> One more line
4> E
Out.
Please I am trying to get this code to output in -txt file- I need you.pdf
Please I am trying to get this code to output in .txt file:
I need your help:
import java.io.File; // Import the File class
import java.io.FileNotFoundException; // Import this class to handle errors
// Import the Scanner class to read text files
import java.util.*;
import java.io.*;
public class KMeans {
List<double []> clusterCentroids;
Map<Integer,List<Double>> dataMatrix;
List<double[]> data;
Integer numClusters;
public void writeFile(List<Double> value, File filename) {
try {
FileWriter myWriter = new FileWriter(filename);
myWriter.write(value.toString());
myWriter.close();
System.out.println("Successfully wrote to the file.");
} catch (IOException e) {
System.out.println("An error occurred.");
e.printStackTrace();
}
}
public KMeans() {
data = new ArrayList<double []>();
dataMatrix = new LinkedHashMap<>();
}
void readData(String filePath, int n, List<Double> c) {
numClusters = n;
try {
BufferedReader br = new BufferedReader(new FileReader(new File(filePath)));
String line;
int i = 0;
while((line = br.readLine()) != null) {
String [] elem = line.split("\\s+");
int j = 0;
for(String d : elem) {
if(isCentroid(j, c)) {
this.clusterCentroids.get(i)[j] = ((Double.valueOf(d)));
}
//data.get(i)[j] = ((Double.valueOf(d)));
System.out.println(data.get(j)[i]);
}
System.out.println();
i++;
}
br.close();
} catch (IOException ex) {
ex.printStackTrace();
}
}
private boolean isCentroid(int j, List<Double> c) {
for(int i = 0; i < c.size(); i++) {
if(j == c.get(i)) {
return true;
}
}
return false;
}
public static void main(String [] args) {
Scanner sc = new Scanner(System.in);
List<Double> centroids = new ArrayList<>();
String filePath = ("C:\\Users\\mamdo\\eclipse-
workspace\\K_project\\src\\synthetic_control_data.txt");
int n = 6;
for(int i=0;i<n;i++) {
Random r = new Random();
centroids.add((double)r.nextInt(600)+1);
}
System.out.println("Initial Clusters Centroids : " + centroids);
KMeans km = new KMeans();
//km.readData(filePath,n,centroids);
//km.calc();
}
}
.
Javaa. The mean of a list of numbers is its arithmetic average. T.pdf
Java:
a. The mean of a list of numbers is its arithmetic average. The median of a list is its middle value
when the values are placed in order. For example, if a list contains 1, 4, 7, 8, and 10, then the
mean is 6 and the median is 7. Write an application that allows you to enter five integers and
displays the values, their mean, and their median.
Save the file as MeanMedian.java.
b. Revise the MeanMedian class so that the user can enter any number of values up to 20. If the
list has an even number of values, the median is the numeric average of the values in the two
middle positions. Save the file as
MeanMedian2.java
Solution
Ans a):
import java.util.*;
import java.lang.*;
import java.io.*;
class MeanMedian
{
public static void main (String[] args) throws java.lang.Exception
{
Scanner scan=new Scanner(System.in);
int arr[]=new int[5];
System.out.println(\"Enter the integers :\"); //asking the user to enter 5 integers
for(int i=0;i<5;i++)
arr[i]=scan.nextInt();
int sum=0;
for(int i=0;i<5;i++)
sum=sum+arr[i];
int mean=sum/5; //calculating mean
int median=arr[2]; //calculating median
System.out.println(\"Integers entered by the user \");
for(int i=0;i<5;i++)
System.out.print(arr[i]+\" \"); //printing values entered by user
System.out.println();
System.out.println(\"Mean = \"+mean); //printing mean
System.out.println(\"Median = \"+median); //printing median
}
}
******OUTPUT******
Enter the integers :
1 4 7 8 10
Integers entered by the user
1 4 7 8 10
Mean = 6
Median = 7
******OUTPUT******
Ansb):
import java.util.*;
import java.lang.*;
import java.io.*;
class MeanMedian //class MeanMedian
{
public static void main (String[] args) throws java.lang.Exception
{
int sum=0; //variable to store the sum of values
int mean=0; //variable to store the mean of values
int median=0; //variable to store the median of values
Scanner scan=new Scanner(System.in);
System.out.println(\"Enter the number of values upto you want to enter,it must not be greater
than 20 :\"); //asking the user for no.of values
int n=scan.nextInt(); //store size in n
int arr[]=new int[n]; //array to store integers
System.out.println(\"Enter the integers\"); //asking the user to enter the integers
for(int i=0;i.
2.(Sorted list array implementation)This sorted list ADT discussed .pdf
2.(Sorted list: array implementation)This sorted list ADT discussed in class should be extended
by the addition of two new methods:
//Interface: ArrayListADT
//works for int
public interface ArrayListADT {
public boolean isEmpty(); //Method to determine whether the list is empty.
public boolean isFull(); //Method to determine whether the list is full.
public int listSize(); //Method to return the number of elements in the list.
public int maxListSize(); //Method to return the maximum size of the list.
public void print(); //Method to output the elements of the list.
public boolean isItemAtEqual(int location, int item); //Method to determine whether item is
the same as the item in the list at location.
public void insertAt(int location, int insertItem); //Method to insert insertItem in the list at
the position
public void insertEnd(int insertItem); //Method to insert insertItem at the end of the list.
public void removeAt(int location); //Method to remove the item from the list at location.
public int retrieveAt(int location); //Method to retrieve the element from the list at location.
public void replaceAt(int location, int repItem); //Method to replace the element in the list at
location with repItem.
public void clearList(); //Method to remove all the elements from the list.
public int search(int searchItem); //Method to determine whether searchItem is in the list.
public void remove(int removeItem); //Method to remove an item from the list.
}
//Class: ArrayListClass implements
//Interface: ArrayListADT
public abstract class ArrayListClass implements ArrayListADT {
protected int length; //to store the length of the list
protected int maxSize; //to store the maximum size of the list
protected int[] list; //array to hold the list elements
//Default constructor
public ArrayListClass() {
maxSize = 100;
length = 0;
list = new int[maxSize];
}
//Alternate Constructor
public ArrayListClass(int size) {
if(size <= 0) {
System.err.println(\"The array size must be positive. Creating an array of size 100.\");
maxSize = 100;
}
else
maxSize = size;
length = 0;
list = new int[maxSize];
}
public boolean isEmpty() {
return (length == 0);
}
public boolean isFull() {
return (length == maxSize);
}
public int listSize() {
return length;
}
public int maxListSize() {
return maxSize;
}
public void print() {
for (int i = 0; i < length; i++)
System.out.print(list[i] + \" \");
System.out.println();
}
public boolean isItemAtEqual(int location, int item) {
if (location < 0 || location >= length) {
System.err.println(\"The location of the item to be compared is out of range.\");
return false;
}
return list[location]== item;
}
public void clearList() {
for (int i = 0; i < length; i++)
list[i] = 0;
length = 0;
System.gc(); //invoke the Java garbage collector
}
public void removeAt(int location) {
if (location < 0 || location >= length)
System.err.println(\"The location of the item to be removed is out of range.\");
else {
for(int i = location; i < length - 1; i++)
list[i] .
JAVALAB #8 - ARRAY BASED LISTSThe next exercise is based on this.pdf
JAVA
LAB #8 - ARRAY BASED LISTS
The next exercise is based on this implemetation for an UnorderedArrayList of integers:
//Interface: ArrayListADT
//works for int
public interface ArrayListADT {
public boolean isEmpty(); //Method to determine whether the list is empty.
public boolean isFull(); //Method to determine whether the list is full.
public int listSize(); //Method to return the number of elements in the list.
public int maxListSize(); //Method to return the maximum size of the list.
public void print(); //Method to output the elements of the list.
public boolean isItemAtEqual(int location, int item); //Method to determine whether item is
the same as the item in the list at location.
public void insertAt(int location, int insertItem); //Method to insert insertItem in the list at
the position
public void insertEnd(int insertItem); //Method to insert insertItem at the end of the list.
public void removeAt(int location); //Method to remove the item from the list at location.
public int retrieveAt(int location); //Method to retrieve the element from the list at location.
public void replaceAt(int location, int repItem); //Method to replace the element in the list at
location with repItem.
public void clearList(); //Method to remove all the elements from the list.
public int search(int searchItem); //Method to determine whether searchItem is in the list.
public void remove(int removeItem); //Method to remove an item from the list.
}
//Class: ArrayListClass implements
//Interface: ArrayListADT
public abstract class ArrayListClass implements ArrayListADT {
protected int length; //to store the length of the list
protected int maxSize; //to store the maximum size of the list
protected int[] list; //array to hold the list elements
//Default constructor
public ArrayListClass() {
maxSize = 100;
length = 0;
list = new int[maxSize];
}
//Alternate Constructor
public ArrayListClass(int size) {
if(size <= 0) {
System.err.println(\"The array size must be positive. Creating an array of size 100.\");
maxSize = 100;
}
else
maxSize = size;
length = 0;
list = new int[maxSize];
}
public boolean isEmpty() {
return (length == 0);
}
public boolean isFull() {
return (length == maxSize);
}
public int listSize() {
return length;
}
public int maxListSize() {
return maxSize;
}
public void print() {
for (int i = 0; i < length; i++)
System.out.print(list[i] + \" \");
System.out.println();
}
public boolean isItemAtEqual(int location, int item) {
if (location < 0 || location >= length) {
System.err.println(\"The location of the item to be compared is out of range.\");
return false;
}
return list[location]== item;
}
public void clearList() {
for (int i = 0; i < length; i++)
list[i] = 0;
length = 0;
System.gc(); //invoke the Java garbage collector
}
public void removeAt(int location) {
if (location < 0 || location >= length)
System.err.println(\"The location of the item to be removed is out of range.\");
else {
for(int i = location; i < length - 1; i++)
list[i] = list[i + 1.
Step 1 Implement the getSortedRunLength() methodImplement the get.pdf
Step 1: Implement the getSortedRunLength() method
Implement the getSortedRunLength() method in NaturalMergeSorter.java. Access
NaturalMergeSorter.java by clicking on the orange arrow next to NaturalMerge.java at the top of
the coding window.
getSortedRunLength() has three parameters:
array: a reference to an array of integers,
arrayLength: an integer for the array's length, and
startIndex: an integer for the run's starting index.
The method returns the number of array elements sorted in ascending order, starting at startIndex
and ending either at the end of the sorted run, or the end of the array, whichever comes first. The
method returns 0 if startIndex is out of bounds.
File NaturalMerge.java has several test cases for getSortedRunLength() that can be run by
clicking the "Run program" button. One test case also exists for naturalMergeSort(), but that can
be ignored until step two is completed.
The program's output does not affect grading.
Submit for grading to ensure that the getSortedRunLength() unit tests pass before proceeding.
Step 2: Implement the naturalMergeSort() method
Implement the naturalMergeSort() method in NaturalMergeSorter.java. naturalMergeSort() must:
Start at index i=0
Get the length of the first sorted run, starting at i
Return if the first run's length equals the array length
If the first run ends at the array's end, reassign i=0 and repeat step 2
Get the length of the second sorted run, starting immediately after the first
Merge the two runs with the provided merge() method
Reassign i with the first index after the second run, or 0 if the second run ends at the array's end
Go to step 2
NaturalMergeSorter.java
public class NaturalMergeSorter {
public static int getSortedRunLength(int[] array, int arrayLength, int startIndex) {
if (startIndex < 0 || startIndex >= arrayLength) {
return 0;
}
int length = 1;
for (int i = startIndex + 1; i < arrayLength; i++) {
if (array[i] >= array[i - 1]) {
length++;
} else {
break;
}
}
return length;
}
public static int getSortedRunLength(double[] array, int arrayLength, int startIndex) {
if (startIndex < 0 || startIndex >= arrayLength) {
return 0;
}
int length = 1;
for (int i = startIndex + 1; i < arrayLength; i++) {
if (array[i] >= array[i - 1]) {
length++;
} else {
break;
}
}
return length;
}
public static void naturalMergeSort(int[] array, int arrayLength) {
int i = 0;
while (i < arrayLength) {
int firstRunLength = getSortedRunLength(array, arrayLength, i);
if (firstRunLength == arrayLength) {
return;
}
int secondRunLength = getSortedRunLength(array, arrayLength, i + firstRunLength);
merge(array, i, i + firstRunLength - 1, i + firstRunLength + secondRunLength - 1);
if (i + firstRunLength + secondRunLength == arrayLength) {
i = 0;
} else {
i = i + firstRunLength + secondRunLength;
}
}
}
public static void naturalMergeSort(double[] array, int arrayLength) {
int i = 0;
while (i < arrayLength) {
int firstRunLength = getSortedRunLength(array, arrayLength, i);
if (firstRunLength == arrayLen.
Create a Queue class that implements a queue abstraction. A queue is.docx
Create a Queue class that implements a queue abstraction. A queue is a FIFO list (First In First Out queue). A simple example is waiting in line, where the first person in the line is the first served. New arrivals are added to the back of the line, the next person served is (removed) from the front of the line.
The Queue class needs to implement the following operations:
adding to the queue at one end (the tail)
removing from the queue at the other end (the head)
printing all items the queue (from head to tail)
erasing all items in the queue (leaving the queue empty).
destructor to empty the queue before it's destroyed (to release all memory)
Additions and removals always occur at the opposite ends of the queue.
You should create the following methods in your Queue class to implement the above operations
addItem
removeItem
print
erase
Your Queue class must implement a linked list. Linked lists are implemented using individual items which contain a pointer to the next item in the list, as well as the information to be stored.
Your Queue implementation uses a companion QueueItem class to represent each element in the list. A QueueItem contains character string as the data value, a unique (among all QueueItems in a Queue) integer item identifier, and a pointer to the next QueueItem in the list. The following is the definition for the QueueItem class.
class QueueItem {
public:
QueueItem(char *pData, int id); // ctor
void setNext(QueueItem *pItem);
QueueItem* getNext() const;
int getId() const;
const char* getData() const;
private:
char _data[30]; // or, use a char* if you want to dynamically alloc memory
const int _itemId; // unique id for item in queue
QueueItem* _pNext; // next item in queue
};
The QueueItem member functions are very basic, just setting or getting data members of the class. All the linked list manipulation is done by the Queue class member functions.
The Queue class member functions manipulate the linked list of QueueItem's, creating and destroying QueueItem objects as needed using the C++ new and delete operators. The Queue class member data includes a pointer to the head and and pointer to the tail of the linked list of QueueItems, and an integer item counter used to provide a unique item ID for every newly created QueueItem (incremented each time a new QueueItem is added, and passed as a parameter to the QueueItem constructor. It is never decremented).
The following is a partial example of the Queue class; you will need to fill in the remaining methods.
class Queue {
public:
Queue(); // ctor inits a new empty Queue
~Queue(); // dtor erases any remaining QueueItems
void addItem(char *pData);
void removeItem();
...
private:
QueueItem *_pHead; // always points to first QueueItem in .
UserInputHandlerjava package midterm2023 import javautil.pdf
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.
OrderTest.javapublic class OrderTest { Get an arra.pdf
OrderTest.java
public class OrderTest {
/**
* Get an array of specified size and pass it to Order.order().
* Report the results.
*/
public static void main(String[] args) {
if (args.length != 1) {//1
System.out.println(\"Usage: java OrderTest sizeOfArray\ \"
+ \"\\tor\ \\tjava OrderTest arrayFile\");
System.exit(1);
}
// create or read the int[]
int size = 0;
int[] array = new int[0];//5
try {
size = Integer.parseInt(args[0]);
array = ArrayOfInts.randomizedArray(size);
} catch (NumberFormatException nfe) {//8
try {
array = ArrayOfInts.arrayFromFile(args[0]);
size = array.length;
} catch (Exception e) {
System.err.println(\"unable to read array from \" + args[0]);
System.exit(1);//14
}
}
System.out.println(\"before:\");//15
for (int i = 0; i < array.length; i++) {//2 n
System.out.printf(((i+1) % 10 > 0) ? \" %d\" : \" %d\ \", array[i]);//1
}
int myNum = Order.order(array); //this is the call we want to measure
System.out.println(\"\ after:\");//18
for (int i = 0; i < array.length; i++) {//2 n
System.out.printf(((i+1) % 10 > 0) ? \" %d\" : \" %d\ \", array[i]);
}
System.out.println(myNum);
}
}
ArrayOfInts.java
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Collections;
import java.util.InputMismatchException;
import java.util.Scanner;
public class ArrayOfInts {
/**
* Returns an array of consecutive ints from 1 to size.
*/
public static int[] orderedArray(int size) {
int[] a = new int[size];
for (int i = 0; i < size; i++) {
a[i] = i+1;
}
return a;
}
/**
* Returns a randomized array containing ints from 1 to size.
*/
public static int[] randomizedArray(int size) {
ArrayList aL = new ArrayList();
for (int i = 0; i < size; i++) {
aL.add(i+1);
}
Collections.shuffle(aL);
int[] a = new int[size];
for (int i = 0; i < size; i++) {
a[i] = aL.get(i);
}
return a;
}
/**
* Writes an int[] to a plain-text file with ints separated by spaces.
* Useful for creating input files for repeatable tests.
*/
public static void arrayToFile(int[] array, String outfile) {
try {
FileWriter fw = new FileWriter(outfile);
BufferedWriter bw = new BufferedWriter(fw);
PrintWriter outFile = new PrintWriter(bw);
for (int i : array) {
outFile.print(i + \" \");
}
outFile.close();
} catch (IOException e) {
System.err.println(\"Could not write to \" + outfile + \"\ \" + e);
}
}
/**
* Read ints from a file and return them in an int[]
*/
public static int[] arrayFromFile(String infile) throws FileNotFoundException,
InputMismatchException {
Scanner scan = new Scanner(new File(infile));
ArrayList aL = new ArrayList();
while (scan.hasNext()) {
aL.add(scan.nextInt());
}
scan.close();
int[] a = new int[aL.size()];
for (int i = 0; i < a.length; i++) {
a[i] = aL.get(i);
}
return a;
}
}
Order.java
public class Order {
/**
* Take an int[] and reorganize it so they are in ascending order.
*/
public static int order(int[] array) .
Java interface and inheritance
For more Classes Visit
www.tutorialoutlet.com
Java interface and inheritance
Cardiovascular drift as a result of dehydration caused by sweat loss d.pdf
Cardiovascular drift as a result of dehydration caused by sweat loss during exercise describes.
A)An increase in heart rate and a reduction in stroke volume
B)An increase in heart rate and an increase in stroke volume
C)A reduction in heart rate and increase in stroke volume
D)A reduction in heart rate and a reduction in stroke volume.
Carbon cioxide ( CO2) is readily soluble in water- according to the eq.pdf
Carbon cioxide ( CO 2 ) is readily soluble in water, according to the equation: CO 2 + H 2 O H 2
CO 3 . Carbonic acid ( H 2 CO ) is a weik acid. In a class experiment, a student bubbled CO 2
into a beaker centaining pure, freshly distilled water, and presented the following yraph in bisher
Resalts section of the laboratory report. Please provide a brief cribiqae to these resalis..
More Related Content
Similar to Can someone tell me why I'm getting Java error cannot invoke add(int).pdf
Why following sort does not work (It does not sort last 2 - 3 numbe.pdf
Why following sort does not work? (It does not sort last 2 - 3 numbers)
//Sort order
class SortNumbListener implements ActionListener
{
@Override
public void actionPerformed(ActionEvent e)
{
Collections.sort(list);
for(int i = 0; i < list.size(); i++)
{
textfield2.setText(list.toString());
}
System.out.print(list + \"\ \");
}
}
Solution
import java.awt.event.ActionEvent;
import java.awt.event.ActionListener;
import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
import javax.swing.JTextField;
public class SorAction {
public JTextField textfield2;
public List list;
public SorAction() {
// TODO Auto-generated constructor stub
textfield2 = new JTextField();
list = new ArrayList();
list.add(20);
list.add(12);
list.add(32);
list.add(3);
new SortNumbListener().actionPerformed(new ActionEvent(\"\", 0, null));
}
public static void main(String[] args) {
try {
new SorAction();
} catch (Exception e) {
// TODO: handle exception
e.printStackTrace();
}
}
class SortNumbListener implements ActionListener {
@Override
public void actionPerformed(ActionEvent e) {
Collections.sort(list);
textfield2.setText(list.toString());
System.out.print(list + \"\ \");
}
}
}
OUTPUT:
[3, 12, 20, 32]
NOTE: please check the above example, sorting fine, but what is the need of loop,
if you want to add the text to textbox use setText() method of textfield.
Here is my code for a linefile editor Please help me figure out wh.pdf
Here is my code for a line/file editor: Please help me figure out when I input "E" to exit and save
to the textin.txt file, it is not saving anything in textin.txt file. It also is prints "1>" twice when I
hit enter before it will move on to "2>" See my output below and the needed output and I need
the command "E" to save the output to the textin.txt file and terminate the program. "E"
terminates my program, but is not saving to the txt file.
import java.io.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.io.IOException;
import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;
public class FileEdit {
public static List lines = new ArrayList();
public static void main(String[] args) throws IOException
{
Scanner s = new Scanner(System.in);
System.out.print("EDIT: ");
String fileName = s.nextLine();
BufferedReader br = new BufferedReader(new FileReader(new File(fileName)));
String str="";
int count=0;
while((str=br.readLine())!=null)
{
lines.add(count, str);
System.out.println((++count) + "> "+ str);
}
String text="";
String command = "";
System.out.print((++count)+"> ");
command=s.nextLine();
String commandArr[];
int flag;
while(!command.equals("E"))
{
flag=0;
commandArr = command.split("\\s");
if(commandArr[0].equals("I")) //Insertion
{
while(true)
{
if(commandArr.length==1&&flag!=2)
{
System.out.print((count)+"> ");
text = s.nextLine();
insertLine(text,count-1);
}
else if(commandArr.length==2&&flag!=2)
{
System.out.print((commandArr[1])+"> ");
count=Integer.parseInt(commandArr[1]);
text = s.nextLine();
insertLine(text,Integer.parseInt(commandArr[1])-1);
}
else
insertLine(text,count-1);
System.out.print((++count)+"> ");
command=s.nextLine();
commandArr = command.split("\\s");
if(commandArr[0].equals("I")||commandArr[0].equals("L")||commandArr[0].equals("D")||comm
andArr[0].equals("E"))
{
flag=1;
break;
}
else
{
flag=2;
text=command;
}
}
}
else if(commandArr[0].equals("L")) //Listing
{
printList();
}
else if(commandArr[0].equals("D")) //Deletion
{
if(commandArr.length==1)
{
deleteLine(count-1,count-1);
}
else if(commandArr.length==2)
{
deleteLine(Integer.parseInt(commandArr[1])-1,Integer.parseInt(commandArr[1])-1);
}
else if(commandArr.length==3)
{
deleteLine(Integer.parseInt(commandArr[1])-1,Integer.parseInt(commandArr[2])-1);
}
count=lines.size();
}
if(flag!=1)
{
System.out.print((count++)+"> ");
command = s.nextLine();
}
}
}
public static void insertLine(String text,int count)
{
if (count >= lines.size()) {
for(int i = lines.size(); i <= count; i++) {
lines.add(null);
}
}
lines.set(count,text);
}
public static void deleteLine(int start,int end)
{
for(int i=start;i<=end;i++)
lines.remove(i);
}
public static void printList()
{
for(int i=0;i "+lines.get(i));
}
}
Here is the output I am getting:
EDIT: textin.txt
1> The First Line
1>
2> And another line
3> I 3
3> The second line
4> One more line
5> L
1>
2>
3> The second line
4> One more line
5> D 2
3> L
1>
2> The second line
3> One more line
4> E
Out.
Please I am trying to get this code to output in -txt file- I need you.pdf
Please I am trying to get this code to output in .txt file:
I need your help:
import java.io.File; // Import the File class
import java.io.FileNotFoundException; // Import this class to handle errors
// Import the Scanner class to read text files
import java.util.*;
import java.io.*;
public class KMeans {
List<double []> clusterCentroids;
Map<Integer,List<Double>> dataMatrix;
List<double[]> data;
Integer numClusters;
public void writeFile(List<Double> value, File filename) {
try {
FileWriter myWriter = new FileWriter(filename);
myWriter.write(value.toString());
myWriter.close();
System.out.println("Successfully wrote to the file.");
} catch (IOException e) {
System.out.println("An error occurred.");
e.printStackTrace();
}
}
public KMeans() {
data = new ArrayList<double []>();
dataMatrix = new LinkedHashMap<>();
}
void readData(String filePath, int n, List<Double> c) {
numClusters = n;
try {
BufferedReader br = new BufferedReader(new FileReader(new File(filePath)));
String line;
int i = 0;
while((line = br.readLine()) != null) {
String [] elem = line.split("\\s+");
int j = 0;
for(String d : elem) {
if(isCentroid(j, c)) {
this.clusterCentroids.get(i)[j] = ((Double.valueOf(d)));
}
//data.get(i)[j] = ((Double.valueOf(d)));
System.out.println(data.get(j)[i]);
}
System.out.println();
i++;
}
br.close();
} catch (IOException ex) {
ex.printStackTrace();
}
}
private boolean isCentroid(int j, List<Double> c) {
for(int i = 0; i < c.size(); i++) {
if(j == c.get(i)) {
return true;
}
}
return false;
}
public static void main(String [] args) {
Scanner sc = new Scanner(System.in);
List<Double> centroids = new ArrayList<>();
String filePath = ("C:\\Users\\mamdo\\eclipse-
workspace\\K_project\\src\\synthetic_control_data.txt");
int n = 6;
for(int i=0;i<n;i++) {
Random r = new Random();
centroids.add((double)r.nextInt(600)+1);
}
System.out.println("Initial Clusters Centroids : " + centroids);
KMeans km = new KMeans();
//km.readData(filePath,n,centroids);
//km.calc();
}
}
.
Javaa. The mean of a list of numbers is its arithmetic average. T.pdf
Java:
a. The mean of a list of numbers is its arithmetic average. The median of a list is its middle value
when the values are placed in order. For example, if a list contains 1, 4, 7, 8, and 10, then the
mean is 6 and the median is 7. Write an application that allows you to enter five integers and
displays the values, their mean, and their median.
Save the file as MeanMedian.java.
b. Revise the MeanMedian class so that the user can enter any number of values up to 20. If the
list has an even number of values, the median is the numeric average of the values in the two
middle positions. Save the file as
MeanMedian2.java
Solution
Ans a):
import java.util.*;
import java.lang.*;
import java.io.*;
class MeanMedian
{
public static void main (String[] args) throws java.lang.Exception
{
Scanner scan=new Scanner(System.in);
int arr[]=new int[5];
System.out.println(\"Enter the integers :\"); //asking the user to enter 5 integers
for(int i=0;i<5;i++)
arr[i]=scan.nextInt();
int sum=0;
for(int i=0;i<5;i++)
sum=sum+arr[i];
int mean=sum/5; //calculating mean
int median=arr[2]; //calculating median
System.out.println(\"Integers entered by the user \");
for(int i=0;i<5;i++)
System.out.print(arr[i]+\" \"); //printing values entered by user
System.out.println();
System.out.println(\"Mean = \"+mean); //printing mean
System.out.println(\"Median = \"+median); //printing median
}
}
******OUTPUT******
Enter the integers :
1 4 7 8 10
Integers entered by the user
1 4 7 8 10
Mean = 6
Median = 7
******OUTPUT******
Ansb):
import java.util.*;
import java.lang.*;
import java.io.*;
class MeanMedian //class MeanMedian
{
public static void main (String[] args) throws java.lang.Exception
{
int sum=0; //variable to store the sum of values
int mean=0; //variable to store the mean of values
int median=0; //variable to store the median of values
Scanner scan=new Scanner(System.in);
System.out.println(\"Enter the number of values upto you want to enter,it must not be greater
than 20 :\"); //asking the user for no.of values
int n=scan.nextInt(); //store size in n
int arr[]=new int[n]; //array to store integers
System.out.println(\"Enter the integers\"); //asking the user to enter the integers
for(int i=0;i.
2.(Sorted list array implementation)This sorted list ADT discussed .pdf
2.(Sorted list: array implementation)This sorted list ADT discussed in class should be extended
by the addition of two new methods:
//Interface: ArrayListADT
//works for int
public interface ArrayListADT {
public boolean isEmpty(); //Method to determine whether the list is empty.
public boolean isFull(); //Method to determine whether the list is full.
public int listSize(); //Method to return the number of elements in the list.
public int maxListSize(); //Method to return the maximum size of the list.
public void print(); //Method to output the elements of the list.
public boolean isItemAtEqual(int location, int item); //Method to determine whether item is
the same as the item in the list at location.
public void insertAt(int location, int insertItem); //Method to insert insertItem in the list at
the position
public void insertEnd(int insertItem); //Method to insert insertItem at the end of the list.
public void removeAt(int location); //Method to remove the item from the list at location.
public int retrieveAt(int location); //Method to retrieve the element from the list at location.
public void replaceAt(int location, int repItem); //Method to replace the element in the list at
location with repItem.
public void clearList(); //Method to remove all the elements from the list.
public int search(int searchItem); //Method to determine whether searchItem is in the list.
public void remove(int removeItem); //Method to remove an item from the list.
}
//Class: ArrayListClass implements
//Interface: ArrayListADT
public abstract class ArrayListClass implements ArrayListADT {
protected int length; //to store the length of the list
protected int maxSize; //to store the maximum size of the list
protected int[] list; //array to hold the list elements
//Default constructor
public ArrayListClass() {
maxSize = 100;
length = 0;
list = new int[maxSize];
}
//Alternate Constructor
public ArrayListClass(int size) {
if(size <= 0) {
System.err.println(\"The array size must be positive. Creating an array of size 100.\");
maxSize = 100;
}
else
maxSize = size;
length = 0;
list = new int[maxSize];
}
public boolean isEmpty() {
return (length == 0);
}
public boolean isFull() {
return (length == maxSize);
}
public int listSize() {
return length;
}
public int maxListSize() {
return maxSize;
}
public void print() {
for (int i = 0; i < length; i++)
System.out.print(list[i] + \" \");
System.out.println();
}
public boolean isItemAtEqual(int location, int item) {
if (location < 0 || location >= length) {
System.err.println(\"The location of the item to be compared is out of range.\");
return false;
}
return list[location]== item;
}
public void clearList() {
for (int i = 0; i < length; i++)
list[i] = 0;
length = 0;
System.gc(); //invoke the Java garbage collector
}
public void removeAt(int location) {
if (location < 0 || location >= length)
System.err.println(\"The location of the item to be removed is out of range.\");
else {
for(int i = location; i < length - 1; i++)
list[i] .
JAVALAB #8 - ARRAY BASED LISTSThe next exercise is based on this.pdf
JAVA
LAB #8 - ARRAY BASED LISTS
The next exercise is based on this implemetation for an UnorderedArrayList of integers:
//Interface: ArrayListADT
//works for int
public interface ArrayListADT {
public boolean isEmpty(); //Method to determine whether the list is empty.
public boolean isFull(); //Method to determine whether the list is full.
public int listSize(); //Method to return the number of elements in the list.
public int maxListSize(); //Method to return the maximum size of the list.
public void print(); //Method to output the elements of the list.
public boolean isItemAtEqual(int location, int item); //Method to determine whether item is
the same as the item in the list at location.
public void insertAt(int location, int insertItem); //Method to insert insertItem in the list at
the position
public void insertEnd(int insertItem); //Method to insert insertItem at the end of the list.
public void removeAt(int location); //Method to remove the item from the list at location.
public int retrieveAt(int location); //Method to retrieve the element from the list at location.
public void replaceAt(int location, int repItem); //Method to replace the element in the list at
location with repItem.
public void clearList(); //Method to remove all the elements from the list.
public int search(int searchItem); //Method to determine whether searchItem is in the list.
public void remove(int removeItem); //Method to remove an item from the list.
}
//Class: ArrayListClass implements
//Interface: ArrayListADT
public abstract class ArrayListClass implements ArrayListADT {
protected int length; //to store the length of the list
protected int maxSize; //to store the maximum size of the list
protected int[] list; //array to hold the list elements
//Default constructor
public ArrayListClass() {
maxSize = 100;
length = 0;
list = new int[maxSize];
}
//Alternate Constructor
public ArrayListClass(int size) {
if(size <= 0) {
System.err.println(\"The array size must be positive. Creating an array of size 100.\");
maxSize = 100;
}
else
maxSize = size;
length = 0;
list = new int[maxSize];
}
public boolean isEmpty() {
return (length == 0);
}
public boolean isFull() {
return (length == maxSize);
}
public int listSize() {
return length;
}
public int maxListSize() {
return maxSize;
}
public void print() {
for (int i = 0; i < length; i++)
System.out.print(list[i] + \" \");
System.out.println();
}
public boolean isItemAtEqual(int location, int item) {
if (location < 0 || location >= length) {
System.err.println(\"The location of the item to be compared is out of range.\");
return false;
}
return list[location]== item;
}
public void clearList() {
for (int i = 0; i < length; i++)
list[i] = 0;
length = 0;
System.gc(); //invoke the Java garbage collector
}
public void removeAt(int location) {
if (location < 0 || location >= length)
System.err.println(\"The location of the item to be removed is out of range.\");
else {
for(int i = location; i < length - 1; i++)
list[i] = list[i + 1.
Step 1 Implement the getSortedRunLength() methodImplement the get.pdf
Step 1: Implement the getSortedRunLength() method
Implement the getSortedRunLength() method in NaturalMergeSorter.java. Access
NaturalMergeSorter.java by clicking on the orange arrow next to NaturalMerge.java at the top of
the coding window.
getSortedRunLength() has three parameters:
array: a reference to an array of integers,
arrayLength: an integer for the array's length, and
startIndex: an integer for the run's starting index.
The method returns the number of array elements sorted in ascending order, starting at startIndex
and ending either at the end of the sorted run, or the end of the array, whichever comes first. The
method returns 0 if startIndex is out of bounds.
File NaturalMerge.java has several test cases for getSortedRunLength() that can be run by
clicking the "Run program" button. One test case also exists for naturalMergeSort(), but that can
be ignored until step two is completed.
The program's output does not affect grading.
Submit for grading to ensure that the getSortedRunLength() unit tests pass before proceeding.
Step 2: Implement the naturalMergeSort() method
Implement the naturalMergeSort() method in NaturalMergeSorter.java. naturalMergeSort() must:
Start at index i=0
Get the length of the first sorted run, starting at i
Return if the first run's length equals the array length
If the first run ends at the array's end, reassign i=0 and repeat step 2
Get the length of the second sorted run, starting immediately after the first
Merge the two runs with the provided merge() method
Reassign i with the first index after the second run, or 0 if the second run ends at the array's end
Go to step 2
NaturalMergeSorter.java
public class NaturalMergeSorter {
public static int getSortedRunLength(int[] array, int arrayLength, int startIndex) {
if (startIndex < 0 || startIndex >= arrayLength) {
return 0;
}
int length = 1;
for (int i = startIndex + 1; i < arrayLength; i++) {
if (array[i] >= array[i - 1]) {
length++;
} else {
break;
}
}
return length;
}
public static int getSortedRunLength(double[] array, int arrayLength, int startIndex) {
if (startIndex < 0 || startIndex >= arrayLength) {
return 0;
}
int length = 1;
for (int i = startIndex + 1; i < arrayLength; i++) {
if (array[i] >= array[i - 1]) {
length++;
} else {
break;
}
}
return length;
}
public static void naturalMergeSort(int[] array, int arrayLength) {
int i = 0;
while (i < arrayLength) {
int firstRunLength = getSortedRunLength(array, arrayLength, i);
if (firstRunLength == arrayLength) {
return;
}
int secondRunLength = getSortedRunLength(array, arrayLength, i + firstRunLength);
merge(array, i, i + firstRunLength - 1, i + firstRunLength + secondRunLength - 1);
if (i + firstRunLength + secondRunLength == arrayLength) {
i = 0;
} else {
i = i + firstRunLength + secondRunLength;
}
}
}
public static void naturalMergeSort(double[] array, int arrayLength) {
int i = 0;
while (i < arrayLength) {
int firstRunLength = getSortedRunLength(array, arrayLength, i);
if (firstRunLength == arrayLen.
Create a Queue class that implements a queue abstraction. A queue is.docx
Create a Queue class that implements a queue abstraction. A queue is a FIFO list (First In First Out queue). A simple example is waiting in line, where the first person in the line is the first served. New arrivals are added to the back of the line, the next person served is (removed) from the front of the line.
The Queue class needs to implement the following operations:
adding to the queue at one end (the tail)
removing from the queue at the other end (the head)
printing all items the queue (from head to tail)
erasing all items in the queue (leaving the queue empty).
destructor to empty the queue before it's destroyed (to release all memory)
Additions and removals always occur at the opposite ends of the queue.
You should create the following methods in your Queue class to implement the above operations
addItem
removeItem
print
erase
Your Queue class must implement a linked list. Linked lists are implemented using individual items which contain a pointer to the next item in the list, as well as the information to be stored.
Your Queue implementation uses a companion QueueItem class to represent each element in the list. A QueueItem contains character string as the data value, a unique (among all QueueItems in a Queue) integer item identifier, and a pointer to the next QueueItem in the list. The following is the definition for the QueueItem class.
class QueueItem {
public:
QueueItem(char *pData, int id); // ctor
void setNext(QueueItem *pItem);
QueueItem* getNext() const;
int getId() const;
const char* getData() const;
private:
char _data[30]; // or, use a char* if you want to dynamically alloc memory
const int _itemId; // unique id for item in queue
QueueItem* _pNext; // next item in queue
};
The QueueItem member functions are very basic, just setting or getting data members of the class. All the linked list manipulation is done by the Queue class member functions.
The Queue class member functions manipulate the linked list of QueueItem's, creating and destroying QueueItem objects as needed using the C++ new and delete operators. The Queue class member data includes a pointer to the head and and pointer to the tail of the linked list of QueueItems, and an integer item counter used to provide a unique item ID for every newly created QueueItem (incremented each time a new QueueItem is added, and passed as a parameter to the QueueItem constructor. It is never decremented).
The following is a partial example of the Queue class; you will need to fill in the remaining methods.
class Queue {
public:
Queue(); // ctor inits a new empty Queue
~Queue(); // dtor erases any remaining QueueItems
void addItem(char *pData);
void removeItem();
...
private:
QueueItem *_pHead; // always points to first QueueItem in .
UserInputHandlerjava package midterm2023 import javautil.pdf
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.
OrderTest.javapublic class OrderTest { Get an arra.pdf
OrderTest.java
public class OrderTest {
/**
* Get an array of specified size and pass it to Order.order().
* Report the results.
*/
public static void main(String[] args) {
if (args.length != 1) {//1
System.out.println(\"Usage: java OrderTest sizeOfArray\ \"
+ \"\\tor\ \\tjava OrderTest arrayFile\");
System.exit(1);
}
// create or read the int[]
int size = 0;
int[] array = new int[0];//5
try {
size = Integer.parseInt(args[0]);
array = ArrayOfInts.randomizedArray(size);
} catch (NumberFormatException nfe) {//8
try {
array = ArrayOfInts.arrayFromFile(args[0]);
size = array.length;
} catch (Exception e) {
System.err.println(\"unable to read array from \" + args[0]);
System.exit(1);//14
}
}
System.out.println(\"before:\");//15
for (int i = 0; i < array.length; i++) {//2 n
System.out.printf(((i+1) % 10 > 0) ? \" %d\" : \" %d\ \", array[i]);//1
}
int myNum = Order.order(array); //this is the call we want to measure
System.out.println(\"\ after:\");//18
for (int i = 0; i < array.length; i++) {//2 n
System.out.printf(((i+1) % 10 > 0) ? \" %d\" : \" %d\ \", array[i]);
}
System.out.println(myNum);
}
}
ArrayOfInts.java
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Collections;
import java.util.InputMismatchException;
import java.util.Scanner;
public class ArrayOfInts {
/**
* Returns an array of consecutive ints from 1 to size.
*/
public static int[] orderedArray(int size) {
int[] a = new int[size];
for (int i = 0; i < size; i++) {
a[i] = i+1;
}
return a;
}
/**
* Returns a randomized array containing ints from 1 to size.
*/
public static int[] randomizedArray(int size) {
ArrayList aL = new ArrayList();
for (int i = 0; i < size; i++) {
aL.add(i+1);
}
Collections.shuffle(aL);
int[] a = new int[size];
for (int i = 0; i < size; i++) {
a[i] = aL.get(i);
}
return a;
}
/**
* Writes an int[] to a plain-text file with ints separated by spaces.
* Useful for creating input files for repeatable tests.
*/
public static void arrayToFile(int[] array, String outfile) {
try {
FileWriter fw = new FileWriter(outfile);
BufferedWriter bw = new BufferedWriter(fw);
PrintWriter outFile = new PrintWriter(bw);
for (int i : array) {
outFile.print(i + \" \");
}
outFile.close();
} catch (IOException e) {
System.err.println(\"Could not write to \" + outfile + \"\ \" + e);
}
}
/**
* Read ints from a file and return them in an int[]
*/
public static int[] arrayFromFile(String infile) throws FileNotFoundException,
InputMismatchException {
Scanner scan = new Scanner(new File(infile));
ArrayList aL = new ArrayList();
while (scan.hasNext()) {
aL.add(scan.nextInt());
}
scan.close();
int[] a = new int[aL.size()];
for (int i = 0; i < a.length; i++) {
a[i] = aL.get(i);
}
return a;
}
}
Order.java
public class Order {
/**
* Take an int[] and reorganize it so they are in ascending order.
*/
public static int order(int[] array) .
Java interface and inheritance
For more Classes Visit
www.tutorialoutlet.com
Java interface and inheritance
Similar to Can someone tell me why I'm getting Java error cannot invoke add(int).pdf (20)
Why following sort does not work (It does not sort last 2 - 3 numbe.pdf
Why following sort does not work (It does not sort last 2 - 3 numbe.pdf
Here is my code for a linefile editor Please help me figure out wh.pdf
Here is my code for a linefile editor Please help me figure out wh.pdf
Please I am trying to get this code to output in -txt file- I need you.pdf
Please I am trying to get this code to output in -txt file- I need you.pdf
Javaa. The mean of a list of numbers is its arithmetic average. T.pdf
Javaa. The mean of a list of numbers is its arithmetic average. T.pdf
2.(Sorted list array implementation)This sorted list ADT discussed .pdf
2.(Sorted list array implementation)This sorted list ADT discussed .pdf
JAVALAB #8 - ARRAY BASED LISTSThe next exercise is based on this.pdf
JAVALAB #8 - ARRAY BASED LISTSThe next exercise is based on this.pdf
Step 1 Implement the getSortedRunLength() methodImplement the get.pdf
Step 1 Implement the getSortedRunLength() methodImplement the get.pdf
Create a Queue class that implements a queue abstraction. A queue is.docx
Create a Queue class that implements a queue abstraction. A queue is.docx
UserInputHandlerjava package midterm2023 import javautil.pdf
UserInputHandlerjava package midterm2023 import javautil.pdf
OrderTest.javapublic class OrderTest { Get an arra.pdf
OrderTest.javapublic class OrderTest { Get an arra.pdf
More from aonetelecompune
Cardiovascular drift as a result of dehydration caused by sweat loss d.pdf
Cardiovascular drift as a result of dehydration caused by sweat loss during exercise describes.
A)An increase in heart rate and a reduction in stroke volume
B)An increase in heart rate and an increase in stroke volume
C)A reduction in heart rate and increase in stroke volume
D)A reduction in heart rate and a reduction in stroke volume.
Carbon cioxide ( CO2) is readily soluble in water- according to the eq.pdf
Carbon cioxide ( CO 2 ) is readily soluble in water, according to the equation: CO 2 + H 2 O H 2
CO 3 . Carbonic acid ( H 2 CO ) is a weik acid. In a class experiment, a student bubbled CO 2
into a beaker centaining pure, freshly distilled water, and presented the following yraph in bisher
Resalts section of the laboratory report. Please provide a brief cribiqae to these resalis..
Capstone project topic Wireless Infrastructure in the Cloud Wireless d.pdf
Capstone project topic Wireless Infrastructure in the Cloud Wireless devices have changed the
way organisations and their customers interact. Wireless enabled devices have driven the
mindset that wireless networks must be ubiquitous, fast, and constantly available. These are
demands that have traditionally put organisations and their user communities in direct conflict
with their IT departments, as constructing and maintaining wireless infrastructures are typically
time-consuming, complex, and costly endeavours. 1.1 Background to the Problem 1.2 Problem
Statement 1.3 Aim of the Study 1.4 Research Objectives 1.5 Research Questions 1.6 Research
Method 1.7 Target Population 1.8 Sample Size.
Capsule Staining Staphylococcus aureus- Escherichia coli- Bacillus meg.pdf
Capsule Staining Staphylococcus aureus, Escherichia coli, Bacillus megaterium, Klebsiella
pneumonia, streptococcus pneumoniae, Salmonella typhimirium, Micrococcus lutes, Serratia
marcescens, Proteus, Pseudomonas 1. List three bacteria that does not have a capsule 2. List
three bacteria that does have a capsule.
Can you site your sources for the information given please Step 1- Res.pdf
Can you site your sources for the information given please
Step 1: Respond to the following: - Discuss how gene transfer is an essential part of the natural
world. How do organisms benefit from gene transfer? Choose at least two applications of genetic
engineering and describe what beneficial products are produced using this technology. What, if
any, are the negatives associated with genetic engineering?.
Can you please provide a example of how these linux commands are used.pdf
Can you please provide a example of how these linux commands are used through photo?
Thanks
man
ps
date
time
alias
|
>
>>
<
su
sudo
systemctl
grep
iptables
ipconfig
nc / netcat
nmap
.
Capital Markets provide which of the following to a firm- (Select all.pdf
Capital Markets provide which of the following to a firm? (Select all that are true.)
Group of answer choices
A mechanism for solving conflicts of interest between owners and managers.
A source of financing.
A means for investors to structure investments to meet their cash flow timing needs.
Answer is NOT all are correct.
Capital flight is Question 32 options- 1) 2) 3).pdf
Capital flight is
Question 32 options:
1)
2)
3)
4)
an environment in which well-connected unscrupulous business people use corrupt political
1)
systems to their advantage in order to obtain preferential treatment from government
an environment in which property rights and contracts are respected and administered fairly
2)
and transparently, without favoritism
a conjecture that poor countries will remain poor since they do not have sufficient resources
3)
available to make the investments in capital which are necessary for economic growth
tendency for wealthy people in poor countries to invest their financial capital abroad instead
4)
of at home.
Capillaries are better for material exchange because compared to arter.pdf
Capillaries are better for material exchange because compared to arteries and veins, capillaries...
I. have blood moving slower through them II. have blood move faster through them III. have a
lower SA:V IV. have a higher SA:V I and IV II and III.
Can this be done with an Arduino Uno- if so can I get pictures of how.pdf
Can this be done with an Arduino Uno? if so can I get pictures of how it wires up and the code
for it?
and function. Show the function shown in the table below relating the inputs to the outputs. Your
system should have two input switches (S1 and S2) and two outputs (LED 1 and LED 2)..
Can someone Please solve Question 1 part B - Thanks!.pdf
Can someone Please solve Question 1 part B ? Thanks!
List of Accounts-
Accounts Receivable
Administration Expenses
Advertising Expense
Cash
Cost of Goods Sold
Deferred Revenue
Depreciation Expense
Distribution Expenses
Dividend Revenue
Engineering Expenses
Financing Expenses
Gain on Sale of Land
General and Administrative Expenses
Income Tax Expense
Insurance Expense
Interest Expense
Interest Revenue
Inventory
Investment Revenue
Loss from Flood Damage
No Entry
Offce Salaries Expense
Office Supplies Expense
Refund Liability
Rent Expense
Rent Revenue
Research and Development Expenses
Sales and Marketing Expenses
Sales Commissions
Sales Revenue
Selling Expenses
Selling and Administrative Expenses
Service Revenue
Subscription Revenue
Supplies Expense
Utilities Expense
Wages Expense
Warranty Expense
Warranty Liability
Current Attempt in Progress The following account balances are taken from Sunland L.td.s
adjusted trial balance at fune 30, 2024: Prepare a multi step statement of income for the vear
ended lune 30.2024 Here is the Single-Step Income Statement:
.
Canada's Quota on European Cheese- In 2021- Canada imposed a quota on.pdf
Canada's Quota on European Cheese: In 2021, Canada imposed a quota on European
cheese imports, limiting the amount of cheese that could enter the country.
write short summary on it
write short summary on it.
Charles named several programs and philosophies that are integral to t.pdf
Charles named several programs and philosophies that are integral to the past success of
Rosalie's restaurant. All of these factors go into forming the market orientation of Rosalie's.
What doesn't fall in the concept of marketing orientation?
A. location of competition
B. high-quality ingredients
C. supporting community programs
D. limited menu
E. higher price points.
Chapters 5 - 11 book is Human Resource Management in Health Care princ.pdf
Chapters 5 - 11 book is Human Resource Management in Health Care principles and practice
. Q1: What is the principal difference between "exempt" and "nonexempt" employees?
Q2: How should managers react if representatives of an external regulatory organization arrive at
their departments to audit their activities?
Q3: (Performance Appraisals): How can past appraisals of performance influence the outcomes
of employment-related legal actions?.
Chapter Review Questions Labeling Itentifu she thene ratanovien of mur (1).pdf
Chapter Review Questions Labeling Itentifu she thene ratanovien of murelo thous halmu
Multiple choice: Select the correct answes from the list provided. Tissue that is specialized for
contraction is 16. Aovons, dendrites, and a cell body are characteristic of cels a) epithelial tissue.
located in b) connective tissue. a) nervous tissue. c) muscle tissue. b) connective tiswue. d)
nervous tissue. c) muscle tissue. d) epithelial tisstue. The specialized intercellular junctions
found in cardiac muncle are I7 Specialired cell, extracellular protein fiber, and ground a)
hemidesarosomes. substance are characteristic of which type of tissue? b) intercalated discs. a)
muscle bisue c) desmosomes. b) epithellal tissue d) microvilli. c) nervous tissue d) connective
tissue 15 . Collections of specialized cells and cell ptoducts that perform a limited number of
functions are called 18. Which of the following epithelia most easly permits diffusion? al cellular
aggregates. a) stratifed squamous epitheliurn b) ergans. b) simple squamous epithelium c)
tissues. c) transitional epithelium d) organ systems. d) simple columnar epithelium.
Chapter 8 sample study questions What is the difference between a Lang.pdf
Chapter 8 sample study questions What is the difference between a Langerhans cells (in the
immune system) and a dendritic cell? What changes occur to turn one into the other? Where do
APCs generally encounter their antigen? Where do they go to present that antigen to the T cell?
Describe the role macrophages play in antigen presentation to T cells. Describe four different
mechanisms of antigen processing in dendritic cells. What role does the CCR7 protein have in
dendritic cells? What does it bind to, and what cellular response occurs if that binding happens?
Describe the key cell surface proteins involved in T cell homing. What is meant by co-
stimulation during activation of T cells? Which molecules are essential for this costimulation?
Describe the role of CTL A 4 during T cell activation. What is the significance of T cells
expressing a receptor proteins for SIP (sphingosine-1-phosphate)? What are the three cell types
that can act as professional APCs for T cells? How do their roles differ? What is a T cell
(immunological) synapse? -when a T cell binds the peptide:, Region of contact and
communication between the two cells - protein-protein interactions in the area of contact
between a T cell and an antigen presenting cell The T cell synapse is divided into two general
regions: c-SMAC and p-SMAC. How do these regions differ in physiological roles and key
molecules found in each? - C: inner structure where T-cell receptors, co-receptors, CD28, CD2
and signaling molecules are concentrated -p: contains LFA-1, ICAM-1, talin, forming a tight seal
around the SMAC Why are tyrosine kinases important in T cell activation? What are the main
tyrosine kinases involved? Generally, describe the signal tnunsduction pathway in T cell
activation that results in changes of gene expression. Why is IL-2 important following T cell
activation? Why do some drugs seck to inhibit IL-2 function? What are adjuvants, and why are
they an important thing to consider when developing new vaccines? What are the signals needed
to differentiate a CD4 T cell into its specific type of effector?.
Chapter 6 Define virus- viroid- virion- prion- provirus- reverse trans.pdf
Chapter 6
Define virus, viroid, virion, prion, provirus, reverse transcriptase, bacteriophage, and plaque.
List four unique characteristics of viruses.
Describe the structure of a naked virus and an enveloped virus.
Describe three morphological groups of viruses.
Discuss viral replication and contrast replication in naked viruses, enveloped viruses, and
bacteriophage.
Distinguish between lytic and lysogenic (temperate) bacteriophage.
Describe two methods for the cultivation of animal viruses.
Define and give examples of viral cytopathic effects
Define oncogenic virus, latent viral infection, and lysogenic conversion..
Chapter 7 Discussion Key Handling This chapter discusses the importanc.pdf
Chapter 7 Discussion Key Handling
This chapter discusses the importance of having keys properly handled. Discuss the procedures
and why it is important to have a proper process in place. What are some of the downsides of not
having proper procedures. Discuss in detail and cite your sources..
Can someone pls explain the table- FOr the labelled A to E- How do you.pdf
Can someone pls explain the table.
FOr the labelled A to E: How do you identify whether the bands are linear or supercoiled,
whether the bands represents insert only, insert + vector, or vector only.? Could you also kindly
provide some explanation to assist my understanding. Thank you
12000.
Chapter 4- Trees- Show that if any complete- balanced tree has three c.pdf
Chapter 4, Trees: Show that if any complete, balanced tree has three children at every node its
depth k = lo g 3 ( 2 + 1 ) where N is the total number of nodes in the tree including the root. ( lo
g 3 means lo g base three). Don't just show a few examples, that does not prove anything. Show
a math procedure, argument, or proof. Hint: refer to DS Math.pptx Module 1 Lectures \&
Presentations slide..
More from aonetelecompune (20)
Cardiovascular drift as a result of dehydration caused by sweat loss d.pdf
Cardiovascular drift as a result of dehydration caused by sweat loss d.pdf
Carbon cioxide ( CO2) is readily soluble in water- according to the eq.pdf
Carbon cioxide ( CO2) is readily soluble in water- according to the eq.pdf
Capstone project topic Wireless Infrastructure in the Cloud Wireless d.pdf
Capstone project topic Wireless Infrastructure in the Cloud Wireless d.pdf
Capsule Staining Staphylococcus aureus- Escherichia coli- Bacillus meg.pdf
Capsule Staining Staphylococcus aureus- Escherichia coli- Bacillus meg.pdf
Can you site your sources for the information given please Step 1- Res.pdf
Can you site your sources for the information given please Step 1- Res.pdf
Can you please provide a example of how these linux commands are used.pdf
Can you please provide a example of how these linux commands are used.pdf
Capital Markets provide which of the following to a firm- (Select all.pdf
Capital Markets provide which of the following to a firm- (Select all.pdf
Capital flight is Question 32 options- 1) 2) 3).pdf
Capital flight is Question 32 options- 1) 2) 3).pdf
Capillaries are better for material exchange because compared to arter.pdf
Capillaries are better for material exchange because compared to arter.pdf
Can this be done with an Arduino Uno- if so can I get pictures of how.pdf
Can this be done with an Arduino Uno- if so can I get pictures of how.pdf
Can someone Please solve Question 1 part B - Thanks!.pdf
Can someone Please solve Question 1 part B - Thanks!.pdf
Canada's Quota on European Cheese- In 2021- Canada imposed a quota on.pdf
Canada's Quota on European Cheese- In 2021- Canada imposed a quota on.pdf
Charles named several programs and philosophies that are integral to t.pdf
Charles named several programs and philosophies that are integral to t.pdf
Chapters 5 - 11 book is Human Resource Management in Health Care princ.pdf
Chapters 5 - 11 book is Human Resource Management in Health Care princ.pdf
Chapter Review Questions Labeling Itentifu she thene ratanovien of mur (1).pdf
Chapter Review Questions Labeling Itentifu she thene ratanovien of mur (1).pdf
Chapter 8 sample study questions What is the difference between a Lang.pdf
Chapter 8 sample study questions What is the difference between a Lang.pdf
Chapter 6 Define virus- viroid- virion- prion- provirus- reverse trans.pdf
Chapter 6 Define virus- viroid- virion- prion- provirus- reverse trans.pdf
Chapter 7 Discussion Key Handling This chapter discusses the importanc.pdf
Chapter 7 Discussion Key Handling This chapter discusses the importanc.pdf
Can someone pls explain the table- FOr the labelled A to E- How do you.pdf
Can someone pls explain the table- FOr the labelled A to E- How do you.pdf
Chapter 4- Trees- Show that if any complete- balanced tree has three c.pdf
Chapter 4- Trees- Show that if any complete- balanced tree has three c.pdf
Recently uploaded
Polish students' mobility in the Czech Republic
Polish students mobility to the Czech Republic within eTwinning project "Medieval adventures with Marco Polo"
Unit 8 - Information and Communication Technology (Paper I).pdf
This slides describes the basic concepts of ICT, basics of Email, Emerging Technology and Digital Initiatives in Education. This presentations aligns with the UGC Paper I syllabus.
Honest Reviews of Tim Han LMA Course Program.pptx
Personal development courses are widely available today, with each one promising life-changing outcomes. Tim Han’s Life Mastery Achievers (LMA) Course has drawn a lot of interest. In addition to offering my frank assessment of Success Insider’s LMA Course, this piece examines the course’s effects via a variety of Tim Han LMA course reviews and Success Insider comments.
Unit 2- Research Aptitude (UGC NET Paper I).pdf
This slide describes the research aptitude of unit 2 in the UGC NET paper I.
Chapter 3 - Islamic Banking Products and Services.pptx
Chapter 3 - Islamic Banking Products and Services.pptxMohd Adib Abd Muin, Senior Lecturer at Universiti Utara Malaysia
This slide is prepared for master's students (MIFB & MIBS) UUM. May it be useful to all.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.
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.
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.
The geography of Taylor Swift - some ideas
Geographical themes connected with Taylor Swift's ERAS tour - coming to the UK in June 2024
Thesis Statement for students diagnonsed withADHD.ppt
Presentation required for the master in Education.
Acetabularia Information For Class 9 .docx
Acetabularia acetabulum is a single-celled green alga that in its vegetative state is morphologically differentiated into a basal rhizoid and an axially elongated stalk, which bears whorls of branching hairs. The single diploid nucleus resides in the rhizoid.
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.
"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
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.
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!
Francesca Gottschalk - How can education support child empowerment.pptx
Francesca Gottschalk from the OECD’s Centre for Educational Research and Innovation presents at the Ask an Expert Webinar: How can education support child empowerment?
Recently uploaded (20)
Unit 8 - Information and Communication Technology (Paper I).pdf
Unit 8 - Information and Communication Technology (Paper I).pdf
Chapter 3 - Islamic Banking Products and Services.pptx
Chapter 3 - Islamic Banking Products and Services.pptx
Overview on Edible Vaccine: Pros & Cons with Mechanism
Overview on Edible Vaccine: Pros & Cons with Mechanism
Thesis Statement for students diagnonsed withADHD.ppt
Thesis Statement for students diagnonsed withADHD.ppt
"Protectable subject matters, Protection in biotechnology, Protection of othe...
"Protectable subject matters, Protection in biotechnology, Protection of othe...
Francesca Gottschalk - How can education support child empowerment.pptx
Francesca Gottschalk - How can education support child empowerment.pptx
Can someone tell me why I'm getting Java error cannot invoke add(int).pdf
- 1. Can someone tell me why I'm getting Java error cannot invoke add(int) on array type int on the bold line? I need this method to calculate median based on file that will be input in a different method. Do no change to a main method as I need to reserve that to only have a contructor. public int Problem7(File file) throws FileNotFoundException { int[] listInt; try { Scanner scanner = new Scanner(file); while (scanner.hasNextLine()) { String value = scanner.nextLine(); listInt.add(Integer.parseInt(value)); System.out.println(value); } scanner.close(); } catch (Exception ex) { ex.printStackTrace(); } Arrays.sort(listInt); int middle = listInt.length/2; int median = 0; if (listInt.length%2 == 1) median = listInt[middle]; else median = (listInt[middle-1] + listInt[middle]) / 2; return median;
- 2. }}