import java.util.ArrayList;public class Checkout{private.docx
•Download as DOCX, PDF•
0 likes•3 views
The Checkout class manages items in a shopping cart. It allows adding and removing items, calculates the total cost and tax, and outputs a summary. The code tests the Checkout class by adding different items to the cart, calculating totals, and printing summaries. Item subclasses like Baguette and Rice override methods to return custom cost and string representations based on each item's attributes.
Report
Share
Report
Share
Recommended
import java.util.ArrayList;public class ArrayListADT { public .pdf
import java.util.ArrayList;
public class ArrayListADT {
public static void printArray(ArrayList numsList, int numOfElem) {
int i = 0;
for (i = 0; i < numOfElem; ++i) {
System.out.print(numsList.get(i));
System.out.print(\" \");
}
System.out.println(\"\");
}
public static void main (String [] args) {
ArrayList numsList = new ArrayList();
int numOfElem = 4;
numsList.add(new Integer(101));
numsList.add(new Integer(200));
numsList.add(new Integer(103));
numsList.remove(1); //remove 200 at index 1 as index starts from 0
numsList.add(0,new Integer(100)); //add 100 at index 0 so 101 will move to index 1
numsList.add(2,new Integer(102)); // add 102 at index 2 so 103 will move down to
index 3
printArray(numsList, numOfElem);
return;
}
}
Output
Solution
import java.util.ArrayList;
public class ArrayListADT {
public static void printArray(ArrayList numsList, int numOfElem) {
int i = 0;
for (i = 0; i < numOfElem; ++i) {
System.out.print(numsList.get(i));
System.out.print(\" \");
}
System.out.println(\"\");
}
public static void main (String [] args) {
ArrayList numsList = new ArrayList();
int numOfElem = 4;
numsList.add(new Integer(101));
numsList.add(new Integer(200));
numsList.add(new Integer(103));
numsList.remove(1); //remove 200 at index 1 as index starts from 0
numsList.add(0,new Integer(100)); //add 100 at index 0 so 101 will move to index 1
numsList.add(2,new Integer(102)); // add 102 at index 2 so 103 will move down to
index 3
printArray(numsList, numOfElem);
return;
}
}
Output.
JAVA...With N.E.T_B.E.A.N.S___________________________________.pdf
JAVA...W\'i\'t\'h
N.E.T_B.E.A.N.S_______________________________________________________________
_____________________________________________________________________________
_____________________________________________________________________________
____________________________________________________
***********Product*********************
package rooster.nest;
import java.text.NumberFormat;
public class Product {
private long id;
private String code;
private String description;
private double price;
public long getId() {
return id;
}
public void setId(long id) {
this.id = id;
}
public String getCode() {
return code;
}
public void setCode(String code) {
this.code = code;
}
public String getDescription() {
return description;
}
public void setDescription(String name) {
this.description = name;
}
public double getPrice() {
return price;
}
public void setPrice(double price) {
this.price = price;
}
public String getPriceFormatted() {
NumberFormat currencyFormatter =
NumberFormat.getCurrencyInstance();
return currencyFormatter.format(getPrice());
}
}
********DBException************
package crows.foot;
/*
* This is just a wrapper class so we can throw a common exception for
* the UI to catch without tightly coupling the UI to the database layer.
*/
public class DBException extends Exception {
DBException() {}
DBException(Exception e) {
super(e);
}
}
*******DBUtil************
package crows.foot;
import java.sql.Connection;
import java.sql.DriverManager;
import java.sql.SQLException;
public class DBUtil {
private static Connection connection;
private DBUtil() {}
public static synchronized Connection getConnection() throws DBException {
if (connection != null) {
return connection;
}
else {
try {
// set the db url, username, and password
String url = \"jdbc:mysql://localhost:3306/mma\";
String username = \"mma_user\";
String password = \"sesame\";
// get and return connection
connection = DriverManager.getConnection(
url, username, password);
return connection;
} catch (SQLException e) {
throw new DBException(e);
}
}
}
public static synchronized void closeConnection() throws DBException {
if (connection != null) {
try {
connection.close();
} catch (SQLException e) {
throw new DBException(e);
} finally {
connection = null;
}
}
}
}
*************ProductDB**************
package crows.foot;
import java.sql.Connection;
import java.sql.PreparedStatement;
import java.sql.ResultSet;
import java.sql.SQLException;
import java.util.ArrayList;
import java.util.List;
import rooster.nest.Product;
public class ProductDB {
private static Product getProductFromRow(ResultSet rs) throws SQLException {
int productID = rs.getInt(1);
String code = rs.getString(2);
String description = rs.getString(3);
double price = rs.getDouble(4);
String note = rs.getString(5);
Product p = new Product();
p.setId(productID);
p.setCode(code);
p.setDescription(description);
p.setPrice(price);
return p;
}
public static List getAll() throws DBException {
String sql = \"SELECT * FROM Product.
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.
An object of class StatCalc can be used to compute several simp.pdf
/*
An object of class StatCalc can be used to compute several simple statistics
for a set of numbers. Numbers are entered into the dataset using
the enter(double) method. Methods are provided to return the following
statistics for the set of numbers that have been entered: The number
of items, the sum of the items, the average, the standard deviation,
the maximum, and the minimum.
*/
public class Stats {
private int count; // Number of numbers that have been entered.
private double sum; // The sum of all the items that have been entered.
private double squareSum; // The sum of the squares of all the items.
private double max = Double.NEGATIVE_INFINITY; // Largest item seen.
private double min = Double.POSITIVE_INFINITY; // Smallest item seen.
int[] myList;
public int getCount() {
System.out.println(myList.size());
count = myList.size().
// Return number of items that have been entered.
return count;
}
public double getSum() {
int sum = 0;
for (int i = 0; i < myList.length; i++)
{
sum +=mylist[i];
}
return sum;
}
public double getMean() {
int sum = 0;
for (int i = 0; i < myList.length; i++)
{
sum +=mylist[i];
}
if(count > 0)
return sum / count;
else
return -1;
}
public double getMin() {
int smallest = myList[0];
int largetst = myList[0];
for(int i=1; i< mylist.length; i++)
{
if(mylist[i] > largetst)
largetst = numbers[i];
else if (mylist[i] < smallest)
smallest = numbers[i];
}
return smallest;
}
public double getMax() {
int smallest = myList[0];
int largetst = myList[0];
for(int i=1; i< mylist.length; i++)
{
if(mylist[i] > largetst)
largetst = numbers[i];
else if (mylist[i] < smallest)
smallest = numbers[i];
}
return largetst;
}
stats(int [] data)
{
if(data.count <= count)
{
if(myList.size() > 0)
System.arraycopy( myList, 0, data, 0, count );
}
}
stats()
{
Scanner s = new Scanner(System.in);
int count = s.nextInt();
s.nextLine(); // throw away the newline.
int [] numbers = new int[count];
Scanner numScanner = new Scanner(s.nextLine());
for (int i = 0; i < count; i++) {
if (numScanner.hasNextInt()) {
numbers[i] = numScanner.nextInt();
} else {
System.out.println(\"You didn\'t provide enough numbers\");
break;
}
}
System.arraycopy( myList, 0, numbers, 0, count );
}
stats(int size)
{
setValue(size);
}
private void setValue(int size)
{
count = size;
myList = new int[size];
}
} // end class StatCalc
public class SimpleStats {
public static void main(String[] args) {
Stat calc; // Computes stats for numbers entered by user.
calc = new Stat(100);
int arry[] = {20.20.40,30.80,,70,4,5,6,7,10}
calc.setvalue(array);
double item; // One number entered by the user.
TextIO.putln(\"Enter your numbers. Enter 0 to end.\");
TextIO.putln();
do {
TextIO.put(\"? \");
item = TextIO.getlnDouble();
if (item != 0)
calc.enter(item);
} while ( item != 0 );
TextIO.putln(\"\ Statistics about your calc:\ \");
TextIO.putln(\" Count: \" + calc.getCount());
TextIO.putln(\" Sum: \" + calc.getSum());
TextIO.putln(\" Minimum: \" + calc.getMin());
TextIO.putln(\" Maximum: \" + ca.
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.
Favor composition over inheritance
The document discusses favoring composition over inheritance when extending collection classes like HashSet. It shows how inheriting from HashSet to count element additions violates encapsulation and can cause errors. A better approach is to use composition by wrapping a Set in a new class that delegates method calls while also tracking additions. This InstrumentedSet class can work with any Set implementation rather than being tied to HashSet.
I need help creating a parametized JUnit test case for the following.pdf
I need help creating a parametized JUnit test case for the following class.
import java.util.Arrays;
import java.util.Collections;
import java.util.LinkedList;
import java.util.List;
import static java.lang.Integer.valueOf;
public class IntegerSet {
/**
* The only instance variable in the class. No other variables allowed.
*/
private List list;
public int size() {
return list.size();
}
public boolean isEmpty() {
return list.isEmpty();
}
/**
* Initializes the empty set.
*/
public IntegerSet() {
list = new LinkedList();
}
/**
* Initializes a set with the numbers in the argument.
*/
public IntegerSet(Integer[] integers) {
this();
if (integers == null) {
throw new NullPointerException(\"The argument cannot be null\");
} else {
for (Integer i : integers) {
if (!exists(i)) {
this.insertElement(i);
}
}
}
Collections.sort(list);
}
/**
* Inserts an integer to the set if the integer does not exist in the set
*/
public void insertElement(int i) {
if (!list.contains(i)) {
list.add(i);
}
}
/**
* Inserts to the set all the integers in the argument which do not exist in
* the set.
*/
public void insertAll(Integer[] data) {
if (data == null) {
throw new NullPointerException(\"The argument cannot be null\");
// throw new
// IllegalArgumentException(\"The argument cannot be null\");
} else {
Arrays.sort(data);
for (Integer num : data) {
if (!exists(num)) {
insertElement(num);
}
}
}
}
/**
* Deletes an integer from the set if it exists in the set.
*/
public void deleteElement(int i) {
list.remove(i);
}
/**
* Deletes all the elements in the set.
*/
public void deleteAll() {
list.clear();
}
/**
* Returns true if the argument exists in the set, false otherwise.
*/
public boolean exists(int i) {
return list.contains(i);
}
public String toString() {
char delimiter = \' \';
String str = \"[\";
for (Integer i : list) {
str += i;
str += delimiter;
}
return str + \"]\";
}
/**
* Finds the union of two sets. A null pointer is considered an empty set.
*
* Return \"new IntegerSet()\" when the result is an empty set.
*/
public static IntegerSet union(IntegerSet set1, IntegerSet set2) {
IntegerSet union = new IntegerSet();
if (set1.isEmpty() && set2.isEmpty()) {
return union;
}
if (!set1.list.isEmpty()) {
for (Integer num : set1.list) {
if (!union.list.contains(num)) {
union.list.add(num);
}
}
}
if (!set2.isEmpty()) {
for (Integer num : set2.list) {
if (!union.list.contains(num)) {
union.list.add(num);
}
}
}
return union;
}
/**
* Finds the intersection of two sets. A null pointer is considered an empty
* set.
*
* Return \"new IntegerSet()\" when the result is an empty set.
*/
public static IntegerSet intersection(IntegerSet set1, IntegerSet set2) {
IntegerSet intersection = new IntegerSet();
// check for null pointers
if (set1.list.isEmpty() || set2.list.isEmpty()) {
return intersection;
}
for (Integer num : set1.list) {
if ((!intersection.list.contains(num)) && set2.list.contains(num)) {
intersection.list.add(num);
}
}
return intersection;
}
/**
* Builds an array with the ele.
C# Starter L04-Collections
The document discusses collections in C# programming. It shows examples of using List and Dictionary collections to store and retrieve data. A List is used to store integer values and later iterate through them. A Dictionary is used to store Customer objects mapped by ID. The document also demonstrates converting between collection types using ConvertAll and a custom converter.
Recommended
import java.util.ArrayList;public class ArrayListADT { public .pdf
import java.util.ArrayList;
public class ArrayListADT {
public static void printArray(ArrayList numsList, int numOfElem) {
int i = 0;
for (i = 0; i < numOfElem; ++i) {
System.out.print(numsList.get(i));
System.out.print(\" \");
}
System.out.println(\"\");
}
public static void main (String [] args) {
ArrayList numsList = new ArrayList();
int numOfElem = 4;
numsList.add(new Integer(101));
numsList.add(new Integer(200));
numsList.add(new Integer(103));
numsList.remove(1); //remove 200 at index 1 as index starts from 0
numsList.add(0,new Integer(100)); //add 100 at index 0 so 101 will move to index 1
numsList.add(2,new Integer(102)); // add 102 at index 2 so 103 will move down to
index 3
printArray(numsList, numOfElem);
return;
}
}
Output
Solution
import java.util.ArrayList;
public class ArrayListADT {
public static void printArray(ArrayList numsList, int numOfElem) {
int i = 0;
for (i = 0; i < numOfElem; ++i) {
System.out.print(numsList.get(i));
System.out.print(\" \");
}
System.out.println(\"\");
}
public static void main (String [] args) {
ArrayList numsList = new ArrayList();
int numOfElem = 4;
numsList.add(new Integer(101));
numsList.add(new Integer(200));
numsList.add(new Integer(103));
numsList.remove(1); //remove 200 at index 1 as index starts from 0
numsList.add(0,new Integer(100)); //add 100 at index 0 so 101 will move to index 1
numsList.add(2,new Integer(102)); // add 102 at index 2 so 103 will move down to
index 3
printArray(numsList, numOfElem);
return;
}
}
Output.
JAVA...With N.E.T_B.E.A.N.S___________________________________.pdf
JAVA...W\'i\'t\'h
N.E.T_B.E.A.N.S_______________________________________________________________
_____________________________________________________________________________
_____________________________________________________________________________
____________________________________________________
***********Product*********************
package rooster.nest;
import java.text.NumberFormat;
public class Product {
private long id;
private String code;
private String description;
private double price;
public long getId() {
return id;
}
public void setId(long id) {
this.id = id;
}
public String getCode() {
return code;
}
public void setCode(String code) {
this.code = code;
}
public String getDescription() {
return description;
}
public void setDescription(String name) {
this.description = name;
}
public double getPrice() {
return price;
}
public void setPrice(double price) {
this.price = price;
}
public String getPriceFormatted() {
NumberFormat currencyFormatter =
NumberFormat.getCurrencyInstance();
return currencyFormatter.format(getPrice());
}
}
********DBException************
package crows.foot;
/*
* This is just a wrapper class so we can throw a common exception for
* the UI to catch without tightly coupling the UI to the database layer.
*/
public class DBException extends Exception {
DBException() {}
DBException(Exception e) {
super(e);
}
}
*******DBUtil************
package crows.foot;
import java.sql.Connection;
import java.sql.DriverManager;
import java.sql.SQLException;
public class DBUtil {
private static Connection connection;
private DBUtil() {}
public static synchronized Connection getConnection() throws DBException {
if (connection != null) {
return connection;
}
else {
try {
// set the db url, username, and password
String url = \"jdbc:mysql://localhost:3306/mma\";
String username = \"mma_user\";
String password = \"sesame\";
// get and return connection
connection = DriverManager.getConnection(
url, username, password);
return connection;
} catch (SQLException e) {
throw new DBException(e);
}
}
}
public static synchronized void closeConnection() throws DBException {
if (connection != null) {
try {
connection.close();
} catch (SQLException e) {
throw new DBException(e);
} finally {
connection = null;
}
}
}
}
*************ProductDB**************
package crows.foot;
import java.sql.Connection;
import java.sql.PreparedStatement;
import java.sql.ResultSet;
import java.sql.SQLException;
import java.util.ArrayList;
import java.util.List;
import rooster.nest.Product;
public class ProductDB {
private static Product getProductFromRow(ResultSet rs) throws SQLException {
int productID = rs.getInt(1);
String code = rs.getString(2);
String description = rs.getString(3);
double price = rs.getDouble(4);
String note = rs.getString(5);
Product p = new Product();
p.setId(productID);
p.setCode(code);
p.setDescription(description);
p.setPrice(price);
return p;
}
public static List getAll() throws DBException {
String sql = \"SELECT * FROM Product.
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.
An object of class StatCalc can be used to compute several simp.pdf
/*
An object of class StatCalc can be used to compute several simple statistics
for a set of numbers. Numbers are entered into the dataset using
the enter(double) method. Methods are provided to return the following
statistics for the set of numbers that have been entered: The number
of items, the sum of the items, the average, the standard deviation,
the maximum, and the minimum.
*/
public class Stats {
private int count; // Number of numbers that have been entered.
private double sum; // The sum of all the items that have been entered.
private double squareSum; // The sum of the squares of all the items.
private double max = Double.NEGATIVE_INFINITY; // Largest item seen.
private double min = Double.POSITIVE_INFINITY; // Smallest item seen.
int[] myList;
public int getCount() {
System.out.println(myList.size());
count = myList.size().
// Return number of items that have been entered.
return count;
}
public double getSum() {
int sum = 0;
for (int i = 0; i < myList.length; i++)
{
sum +=mylist[i];
}
return sum;
}
public double getMean() {
int sum = 0;
for (int i = 0; i < myList.length; i++)
{
sum +=mylist[i];
}
if(count > 0)
return sum / count;
else
return -1;
}
public double getMin() {
int smallest = myList[0];
int largetst = myList[0];
for(int i=1; i< mylist.length; i++)
{
if(mylist[i] > largetst)
largetst = numbers[i];
else if (mylist[i] < smallest)
smallest = numbers[i];
}
return smallest;
}
public double getMax() {
int smallest = myList[0];
int largetst = myList[0];
for(int i=1; i< mylist.length; i++)
{
if(mylist[i] > largetst)
largetst = numbers[i];
else if (mylist[i] < smallest)
smallest = numbers[i];
}
return largetst;
}
stats(int [] data)
{
if(data.count <= count)
{
if(myList.size() > 0)
System.arraycopy( myList, 0, data, 0, count );
}
}
stats()
{
Scanner s = new Scanner(System.in);
int count = s.nextInt();
s.nextLine(); // throw away the newline.
int [] numbers = new int[count];
Scanner numScanner = new Scanner(s.nextLine());
for (int i = 0; i < count; i++) {
if (numScanner.hasNextInt()) {
numbers[i] = numScanner.nextInt();
} else {
System.out.println(\"You didn\'t provide enough numbers\");
break;
}
}
System.arraycopy( myList, 0, numbers, 0, count );
}
stats(int size)
{
setValue(size);
}
private void setValue(int size)
{
count = size;
myList = new int[size];
}
} // end class StatCalc
public class SimpleStats {
public static void main(String[] args) {
Stat calc; // Computes stats for numbers entered by user.
calc = new Stat(100);
int arry[] = {20.20.40,30.80,,70,4,5,6,7,10}
calc.setvalue(array);
double item; // One number entered by the user.
TextIO.putln(\"Enter your numbers. Enter 0 to end.\");
TextIO.putln();
do {
TextIO.put(\"? \");
item = TextIO.getlnDouble();
if (item != 0)
calc.enter(item);
} while ( item != 0 );
TextIO.putln(\"\ Statistics about your calc:\ \");
TextIO.putln(\" Count: \" + calc.getCount());
TextIO.putln(\" Sum: \" + calc.getSum());
TextIO.putln(\" Minimum: \" + calc.getMin());
TextIO.putln(\" Maximum: \" + ca.
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.
Favor composition over inheritance
The document discusses favoring composition over inheritance when extending collection classes like HashSet. It shows how inheriting from HashSet to count element additions violates encapsulation and can cause errors. A better approach is to use composition by wrapping a Set in a new class that delegates method calls while also tracking additions. This InstrumentedSet class can work with any Set implementation rather than being tied to HashSet.
I need help creating a parametized JUnit test case for the following.pdf
I need help creating a parametized JUnit test case for the following class.
import java.util.Arrays;
import java.util.Collections;
import java.util.LinkedList;
import java.util.List;
import static java.lang.Integer.valueOf;
public class IntegerSet {
/**
* The only instance variable in the class. No other variables allowed.
*/
private List list;
public int size() {
return list.size();
}
public boolean isEmpty() {
return list.isEmpty();
}
/**
* Initializes the empty set.
*/
public IntegerSet() {
list = new LinkedList();
}
/**
* Initializes a set with the numbers in the argument.
*/
public IntegerSet(Integer[] integers) {
this();
if (integers == null) {
throw new NullPointerException(\"The argument cannot be null\");
} else {
for (Integer i : integers) {
if (!exists(i)) {
this.insertElement(i);
}
}
}
Collections.sort(list);
}
/**
* Inserts an integer to the set if the integer does not exist in the set
*/
public void insertElement(int i) {
if (!list.contains(i)) {
list.add(i);
}
}
/**
* Inserts to the set all the integers in the argument which do not exist in
* the set.
*/
public void insertAll(Integer[] data) {
if (data == null) {
throw new NullPointerException(\"The argument cannot be null\");
// throw new
// IllegalArgumentException(\"The argument cannot be null\");
} else {
Arrays.sort(data);
for (Integer num : data) {
if (!exists(num)) {
insertElement(num);
}
}
}
}
/**
* Deletes an integer from the set if it exists in the set.
*/
public void deleteElement(int i) {
list.remove(i);
}
/**
* Deletes all the elements in the set.
*/
public void deleteAll() {
list.clear();
}
/**
* Returns true if the argument exists in the set, false otherwise.
*/
public boolean exists(int i) {
return list.contains(i);
}
public String toString() {
char delimiter = \' \';
String str = \"[\";
for (Integer i : list) {
str += i;
str += delimiter;
}
return str + \"]\";
}
/**
* Finds the union of two sets. A null pointer is considered an empty set.
*
* Return \"new IntegerSet()\" when the result is an empty set.
*/
public static IntegerSet union(IntegerSet set1, IntegerSet set2) {
IntegerSet union = new IntegerSet();
if (set1.isEmpty() && set2.isEmpty()) {
return union;
}
if (!set1.list.isEmpty()) {
for (Integer num : set1.list) {
if (!union.list.contains(num)) {
union.list.add(num);
}
}
}
if (!set2.isEmpty()) {
for (Integer num : set2.list) {
if (!union.list.contains(num)) {
union.list.add(num);
}
}
}
return union;
}
/**
* Finds the intersection of two sets. A null pointer is considered an empty
* set.
*
* Return \"new IntegerSet()\" when the result is an empty set.
*/
public static IntegerSet intersection(IntegerSet set1, IntegerSet set2) {
IntegerSet intersection = new IntegerSet();
// check for null pointers
if (set1.list.isEmpty() || set2.list.isEmpty()) {
return intersection;
}
for (Integer num : set1.list) {
if ((!intersection.list.contains(num)) && set2.list.contains(num)) {
intersection.list.add(num);
}
}
return intersection;
}
/**
* Builds an array with the ele.
C# Starter L04-Collections
The document discusses collections in C# programming. It shows examples of using List and Dictionary collections to store and retrieve data. A List is used to store integer values and later iterate through them. A Dictionary is used to store Customer objects mapped by ID. The document also demonstrates converting between collection types using ConvertAll and a custom converter.
public static ArrayListInteger doArrayListInsertAtMedian(int nu.pdf
public static ArrayList doArrayListInsertAtMedian(int numItems) {
System.out.print(\"doArrayListInsertAtMedian: \");
ArrayList list = new ArrayList<>();
// TODO Write code that adds integers 0 through (numitems - 1)
// to list, inside a loop.
long startTime = getTimestamp();
// TODO Write code that adds -1 to list at index
// (list.size() / 2)
long endTime = getTimestamp();
long totalTime = endTime - startTime;
System.out.println(totalTime);
return list;
}
Solution
import java.util.ArrayList;
import java.util.Date;
public class ArrayUtils {
public static void main(String[] args) {
System.out.println(doArrayListInsertAtMedian(10));
}
/**
* @param numItems
* @return
*/
public static ArrayList doArrayListInsertAtMedian(int numItems) {
System.out.print(\"doArrayListInsertAtMedian: \");
ArrayList list = new ArrayList();
// TODO Write code that adds integers 0 through (numitems - 1)
// to list, inside a loop.
Date date = new Date();
long startTime = date.getTime();
for (int i = 0; i < numItems; i++) {
list.add(i);
}
// TODO Write code that adds -1 to list at index
// (list.size() / 2)
list.set(list.size() / 2, -1);
long endTime = date.getTime();
long totalTime = endTime - startTime;
System.out.println(totalTime);
return list;
}
}
OUTPUT:
doArrayListInsertAtMedian: 0
[0, 1, 2, 3, 4, -1, 6, 7, 8, 9].
20070329 Java Programing Tips
The document provides tips on Java concurrency. It discusses using synchronized, volatile and java.util.concurrent classes like AtomicInteger for thread-safe operations on shared resources like account balances. Synchronized uses locks for mutual exclusion but volatile only ensures visibility, so atomic classes use Compare-And-Swap (CAS) operations for thread-safe updates without blocking.
Implement the ADT stack by using an array stack to contain its entri.pdf
Implement the ADT stack by using an array stack to contain its entries. Expand the array
dynamically, as necessary. Maintain the stack’s bottom entry in stack[stack.length – 1].
Your Stack class must implement StackInterface (provided). You may use ArrayStack.java
(provided) as the starting point for your implementation.
You must implement a comprehensive set of unit tests using the main() method (and private
utility methods) in ArrayStack.java.
ArrayStack.java
public class ArrayStack implements StackInterface
{
private T[] stack; // Array of stack entries
private int topIndex; // Index of top entry
private boolean initialized = false;
private static final int DEFAULT_CAPACITY = 50;
private static final int MAX_CAPACITY = 10000;
public ArrayStack()
{
this(DEFAULT_CAPACITY);
} // end default constructor
public ArrayStack(int initialCapacity)
{
checkCapacity(initialCapacity);
// The cast is safe because the new array contains null entries
@SuppressWarnings(\"unchecked\")
T[] tempStack = (T[])new Object[initialCapacity];
stack = tempStack;
topIndex = -1;
initialized = true;
} // end constructor
// < Implementations of the stack operations go here. >
// < Implementations of the private methods go here; checkCapacity and
// checkInitialization are analogous to those in Chapter 2. >
// . . .
} // end ArrayStack
StackInterface.java
public interface StackInterface
{
/** Adds a new entry to the top of this stack.
@param newEntry An object to be added to the stack. */
public void push(T newEntry);
/** Removes and returns this stack\'s top entry.
@return The object at the top of the stack.
@throws EmptyStackException if the stack is empty before the operation. */
public T pop();
/** Retrieves this stack\'s top entry.
@return The object at the top of the stack.
@throws EmptyStackException if the stack is empty. */
public T peek();
/** Detects whether this stack is empty.
@return True if the stack is empty. */
public boolean isEmpty();
/** Removes all entries from this stack. */
public void clear();
} // end StackInterface
Solution
StackTester.java
public class StackTester
{
public static void main(String[] args)
{
ArrayStack aS = new ArrayStack();
aS.push(3);
aS.push(5);
aS.push(10);
aS.push(11);
System.out.println(\"\"+ aS.peek() + \", \" + aS.pop() + \", \" + aS.peek2());
aS.remove(1);
}
}
ArrayStack.java
import java.util.Arrays;
public class ArrayStack implements StackInterface
{
private T[] stack;
private int topIndex;
private boolean initialized = false;
private static final int DEFAULT_CAPACITY = 50;
private static final int MAX_CAPACITY = 10000;
public ArrayStack()
{
this(DEFAULT_CAPACITY);
}
public ArrayStack(int initialCapacity)
{
checkCapacity(initialCapacity);
@SuppressWarnings(\"unchecked\")
T[] tempStack = (T[])new Object[initialCapacity];
stack = tempStack;
topIndex = -1;
initialized = true;
}
public boolean isEmpty()
{
return topIndex < 0;
}
private void ensureCapacity()
{
if(topIndex == stack.length - 1)
{
int newLength = 2*stack.length;
.
Please review my code (java)Someone helped me with it but i cannot.pdf
Please make it to clear 12-95. The basketball passed through the hoop even though it barely
cleared the hands of the player B who attempted to block it. Neglecting the size of the ball,
determine the magnitude vn of its initial velocity and the height h of the ball when it passes over
player B 10 ft 5 ft Prob. 12-95
Solution
Consider the motion along horizontal direction
Vox = initial velocity in horizontal direction = Va Cos30
X = horizontal distance = 25 + 3 = 28 ft
t = time taken
t = X / Vox = 28/(Va Cos30) eq-1
consider the motion in vertical direction
Y = vertical displacement = 10 - 7 = 3 ft
a = acceleration = - 32.2
Voy = initial velocity = Va Sin30
t = time taken
using the equation
Y = Voy t + (0.5) a t2
3 = (Va Sin30) (28/(Va Cos30)) + (0.5) (- 32.2) (28/(Va Cos30))2
Va = 35.8 m/s
t\' = time taken to reach B = 25 / (Va Cos30) = 25 / (35.8 Cos30) = 0.81 sec
h = 7 + Voy t\' + (0.5) a t\'2
h = 7 + (35.8 Sin30) (0.81) + (0.5) (- 32.2) (0.81)2
h = 10.94 ft.
Beautiful java script
This document discusses how JavaScript code would look if Java was written in JavaScript. It provides examples of Java-like classes and methods written in JavaScript. It also discusses JavaScript design patterns like the Module pattern and MVC frameworks. Finally, it covers topics like unit testing JavaScript with Jasmine, SVG vs Canvas for graphs, and libraries like Underscore.js and CSS frameworks.
【Unity】Scriptable object 入門と活用例
ScriptableObjectとはどういった物か、ScriptableObjectを利用すると何が良いのかといった基本的な内容から、実際にScriptableObjectを活用した開発の効率化について紹介します。
このスライドは『ヴァルキリーコネコクト』のクオリティを支える開発技術最前線で講演した内容のスライドです。 http://www.a-tm.co.jp/recruit/news/event-6944/
C# labprograms
The program defines a jagged array with 3 inner arrays of unspecified length. It initializes the inner arrays. It then iterates through the jagged array and sums all elements of the inner arrays. The total sum is returned.
public class TrequeT extends AbstractListT { .pdf
/**
*/
public class Treque extends AbstractList {
/**
* You decide on the instance variables you need.
*/
public Treque(Class t) {
// Put your own code here
throw new UnsupportedOperationException(\"Constructor not yet implemented\");
}
public T get(int i) {
if (i < 0 || i > size() - 1) throw new IndexOutOfBoundsException();
// Put your own code here instead of throwing this exception
throw new UnsupportedOperationException(\"get(i) not yet implemented\");
}
public T set(int i, T x) {
if (i < 0 || i > size() - 1) throw new IndexOutOfBoundsException();
// Put your own code here instead of throwing this exception
throw new UnsupportedOperationException(\"set(i,x) not yet implemented\");
}
public void add(int i, T x) {
if (i < 0 || i > size()) throw new IndexOutOfBoundsException();
// Put your own code here
throw new UnsupportedOperationException(\"add(i,x) not yet implemented\");
}
public T remove(int i) {
if (i < 0 || i > size() - 1) throw new IndexOutOfBoundsException();
// Put your own code here
throw new UnsupportedOperationException(\"remove(i) not yet implemented\");
}
public int size() {
// Put your own code here
throw new UnsupportedOperationException(\"size() not yet implemented\");
}
public static void main(String[] args) {
//List tr = new ArrayDeque(Integer.class);
List tr = new Treque(Integer.class);
int K = 1000000;
Stopwatch s = new Stopwatch();
System.out.print(\"Appending \" + K + \" items...\");
System.out.flush();
s.start();
for (int i = 0; i < K; i++) {
tr.add(i);
}
s.stop();
System.out.println(\"done (\" + s.elapsedSeconds() + \"s)\");
System.out.print(\"Prepending \" + K + \" items...\");
System.out.flush();
for (int i = 0; i < K; i++) {
tr.add(0, i);
}
s.stop();
System.out.println(\"done (\" + s.elapsedSeconds() + \"s)\");
System.out.print(\"Midpending(?!) \" + K + \" items...\");
System.out.flush();
s.start();
for (int i = 0; i < K; i++) {
tr.add(tr.size()/2);
}
s.stop();
System.out.println(\"done (\" + s.elapsedSeconds() + \"s)\");
System.out.print(\"Removing \" + K + \" items from the back...\");
System.out.flush();
for (int i = 0; i < K; i++) {
tr.remove(tr.size()-1);
}
s.stop();
System.out.println(\"done (\" + s.elapsedSeconds() + \"s)\");
System.out.print(\"Removing \" + K + \" items from the front...\");
System.out.flush();
for (int i = 0; i < K; i++) {
tr.remove(0);
}
s.stop();
System.out.println(\"done (\" + s.elapsedSeconds() + \"s)\");
System.out.print(\"Removing \" + K + \" items from the middle...\");
System.out.flush();
for (int i = 0; i < K; i++) {
tr.remove(tr.size()/2);
}
s.stop();
System.out.println(\"done (\" + s.elapsedSeconds() + \"s)\");
}
}
-------------------------------------------------------------------
import java.util.AbstractList;
import java.util.ArrayList;
import java.util.List;
/**
* This class implements the List interface using a collection of arrays of
* sizes 1, 2, 3, 4, and so on. The main advantages of this over an
* implementation like ArrayList is that there is never more than O(sqr.
You are to simulate a dispatcher using a priority queue system in C+.pdf
You are to simulate a dispatcher using a priority queue system in C++. New processes are to be
entered using a GUI with priority included (numbering should be automatic). Processes are also
to be terminated by GUI command. Context switches are to be by command with the cause of the
switch being either a blocking call, time slice exceeded or termination. Assume only one CPU.
Priorities and numbers of processes can be kept small, just big enough to demonstrate the
required functionality. You may pre-populate the queues initially from a data file. I am looking
at the mechanism as you are NOT creating actual processes, just simulating them. Functionality
to be provided by you: 1. Priority based Ready Queue(s). 2. Blocked list. 3. Output of complete
system status after every context switch showing ready, blocked, and running processes.
Sample Output: A3 Antrian WAKTU TUN... TA1Telah diEksekusi Ambil No Antrian
Solution
//dispatcherSim.java
public class dispatcherSim {
public static void main(String[] args)
{
simulator sim=new simulator(1000);
sim.addProcessReady(1); //test data
sim.addProcessReady(3);
sim.addProcessReady(2);
sim.addProcessReady(7);
sim.addProcessReady(4);
sim.addProcessBlocked(1);
sim.addProcessBlocked(3);
sim.addProcessBlocked(2);
sim.addProcessBlocked(7);
sim.addProcessBlocked(4);
GUI gui=new GUI(sim);
gui.setVisible(true);
}
}
=====================================================================
=========
//GUI.java
import java.awt.BorderLayout;
import java.awt.Dialog.ModalityType;
import java.awt.Dimension;
import java.awt.event.ActionEvent;
import java.awt.event.ActionListener;
import javax.swing.ButtonGroup;
import javax.swing.JButton;
import javax.swing.JComboBox;
import javax.swing.JDialog;
import javax.swing.JFrame;
import javax.swing.JLabel;
import javax.swing.JMenu;
import javax.swing.JMenuBar;
import javax.swing.JMenuItem;
import javax.swing.JPanel;
import javax.swing.JRadioButton;
import javax.swing.JScrollPane;
import javax.swing.JTextArea;
import javax.swing.JTextField;
public class GUI extends JFrame {
private JPanel panel;
private JMenuBar menuBar;
private JMenu menu;
private JMenuItem addNew;
private JMenuItem unBlock;
private JMenuItem terminate;
private JMenuItem readMe;
private JMenuItem exit;
private JButton cSwitch;
private JTextArea info;
private JScrollPane scroll;
private simulator sim;
private final String CS = \"CONTEXT SWITCH: \";
private int count = 1;
public GUI(simulator disSim) {
sim = disSim;
initComponents();
}
private void addNewBox() {
final JDialog addDialog = new JDialog();
JPanel miniPanel = new JPanel(new BorderLayout());
miniPanel.setPreferredSize(new Dimension(175, 100));
ButtonGroup radioGroup = new ButtonGroup();
final JRadioButton blocked = new JRadioButton(\"Blocked List\");
final JRadioButton ready = new JRadioButton(\"Ready Queue\");
ready.setSelected(true);
radioGroup.add(ready);
radioGroup.add(blocked);
JPanel radios = new JPanel();
radios.setPreferredSize(new Dimension(50, 50));
.
Hello. I need help fixing this Java Code on Eclipse. Please fix part.pdf
Hello. I need help fixing this Java Code on Eclipse. Please fix parts indicated as \"//Fix\" or
\"//Fill-in\". The code given is the first image. Thank you! Sample outputs are given below along
with what the code is required to do. import java til. Random import java til. Scanner public class
GenCheeseShopv2 public static void intro (Stringt] names, double []prices int amounts Fill-in
public static void getAmount (Scanner input, String[] names, int[] amounts) public static void
itemizedList (String[] names, double Prices int[] amounts) Fill-i public static double
calcSubTotal (double prices, int amounts return 0; pub. lic static int discount (double subTotal
return 0; pub. lic static oid print Total (double subTotal int discount) Fill-in public static void mi
args final int MAXCH EESEE DO NOT CHANGE ANYTHING BELOW String[] names new
String CMAXCH EESE double[] prices new double EESE] int[] amounts new int
[MAXCHEESEJ Scanner input new Scanner (Syste intro names, prices, amounts get Amo unt
input, names, amounts double total calcSubTotal (prices, amounts if EESEE 0) System. out print
Display the itemized list? (1 for yes) int itemized input-nex if item 1) itemized List (names,
prices, amounts); System. out. println(); print Total(total, discount total));
Solution
import java.util.Random;
import java.util.Scanner;
public class GenCheeseShopv2 {
public static void intro(String[] names, double[] prices,int[] amounts){
System.out.println(\"We sell \"+names.length+\" kinds of cheese\");
for(int i=0;i0)
System.out.println(amounts[i]+\" lbs of \"+names[i]+\" @ \"+prices[i]+\" =
$\"+(amounts[i]*prices[i]));
}
}
public static double calcSubTotal( double[] prices,int[] amounts){
double subTotal=0;
for(int i=0;i100)
return 10;
else if(subTotal > 50)
return 25;
else
return 0;
}
public static void printTotal(double subTotal,int discount){
System.out.println(\"Sub Total : $\"+subTotal);
System.out.println(\"-Discount : $\"+discount);
System.out.println(\"Total : $\"+(subTotal-discount));
}
public static void main(String[] args){
final int MAXCHEESES=4;
String[] names = new String[MAXCHEESES];
double[] prices = new double[MAXCHEESES];
int[] amounts = new int[MAXCHEESES];
Scanner input = new Scanner(System.in);
intro(names, prices, amounts);
getAmount(input, names, amounts);
double total = calcSubTotal(prices, amounts);
if(MAXCHEESES>0){
System.out.println(\"Display the itemized list? (1 for yes)\");
int itemized = input.nextInt();
if(itemized==1){
itemizedList(names, prices, amounts);
}
}
System.out.println();
printTotal(total, discount(total));
}
}.
Please add-modify the following to the original code using C# 1- Delet.docx
The document requests adding or modifying code to an existing C# class that implements an array list to include the following methods: DeleteFirst, DeleteLast, DeleteValue(value), Delete(index), and Reverse. It provides the starting code for the MyList class and requests adding meaningful comments and returning an upvote.
VISUALIZAR REGISTROS EN UN JTABLE
This document discusses how to display records from a Northwind database in a JTable using NetBeans and SQL Server. It includes code to connect to the database, define a Product class with getters and setters, a ProductDAO class to retrieve data, and a GUI class to display the results in a JTable. The code retrieves product data including ID, name, category, supplier, price, quantity and units from the database and displays it in the table.
Here is the codeimport java.util.; class GroceryItem { Stri.pdf
Here is the code
import java.util.*;
class GroceryItem
{
String name;
double value;
GroceryItem(String n, double v)
{
name=n;
value=v;
}
void setName(String n)
{
name=n;
}
void setValue(double n)
{
if(n>0)
value=n;
else value=0;
}
String getName()
{
return name;
}
double getValue()
{
return value;
}
public String toString()
{
return \"Name: \"+name+\", Price: \"+value;
}
boolean equals(GroceryItem m)
{
if(this.name.equals(m.name) && this.value==m.value) return true;
else return false;
}
}
public class GroceryList
{
class ListNode
{
GroceryItem data;
ListNode link;
ListNode(GroceryItem i)
{
data=i;
link=null;
}
ListNode()
{
data=null;
link=null;
}
}
ListNode head, current, previous;
GroceryList()
{
head=null;
current=head;
previous=head;
}
void addItem(String s, double v)
{
ListNode n=new ListNode(new GroceryItem(s,v));
if(head==null)
{
head=n;
}
else if(head.link==null)
{
head.link=n;
}
else
{
ListNode t=head;
while(t.link!=null)
{
t=t.link;
}
t.link=n;
}
}
void goToNext()
{
if(current.link!=null)
{
previous=current;
current=current.link;
}
}
String getDataAtCurrent()
{
return current.data.toString();
}
void setDataAtCurrent(GroceryItem n)
{
if(current!=null)
{
current.data.setName(n.getName());
current.data.setValue(n.getValue());
}
}
void insertAfterCurrent(GroceryItem m)
{
if(current!=null)
{
ListNode n= new ListNode(m);
n.link=current.link;
current.link=n;
System.out.println(\"Node Added\");
}
}
void deleteCurrentNode()
{
if(current!=null)
{
previous.link=current.link;
}
}
void showList()
{
ListNode t=head;
while(t!=null)
{
System.out.println(t.data+\"\ \");
t=t.link;
}
System.out.println(\"Done! \");
}
boolean contains(String n, double v)
{
ListNode t=head;
GroceryItem i = new GroceryItem(n,v);
while(t!=null)
{
if(t.data.equals(i))
{
return true;
}
else t=t.link;
}
return false;
}
double totalCost()
{
ListNode t=head;
double cost=0;
while(t!=null)
{
cost+=t.data.getValue();
t=t.link;
}
return cost;
}
public static void main(String a[])
{
System.out.println(\"Grocery List Tester\");
System.out.println(\"Creating Grocery List\");
GroceryList l = new GroceryList();
System.out.println(\"Adding 5 grocery items\");
l.addItem(\"Taco Shells\", 2.0);
l.addItem(\"Salsa\", 1.59);
l.addItem(\"Ground Beef\", 4.59);
l.addItem(\"Taco Shells\", 1.3);
l.addItem(\"Shredded Cheese\", 2.99);
l.showList();
System.out.println(\"Do I remember the salsa? \"+l.contains(\"Salsa\", 1.59));
System.out.println(\"Total Cost \"+l.totalCost());
}
}
Solution
Here is the code
import java.util.*;
class GroceryItem
{
String name;
double value;
GroceryItem(String n, double v)
{
name=n;
value=v;
}
void setName(String n)
{
name=n;
}
void setValue(double n)
{
if(n>0)
value=n;
else value=0;
}
String getName()
{
return name;
}
double getValue()
{
return value;
}
public String toString()
{
return \"Name: \"+name+\", Price: \"+value;
}
boolean equals(GroceryItem m)
{
if(this.name.equals(m.name) && this.value==m.value) return true;
else return false;
}
}
public class GroceryList
{
.
Code javascript
This Java code defines a class called Soal07 that contains a main method for managing a student mark list. The main method uses Scanner objects to accept user input. It displays a menu with options to input student data, view all data, edit data, or exit. Based on the user's selection, it will either prompt the user to enter information for multiple students, display an existing student's data, or allow editing of an existing student's data by re-prompting for input. All student data, including name, ID, and mark, is stored in arrays.
ReverseList.javaimport java.util.ArrayList;public class Rever.pdf
This Java program defines a ReverseList class containing a static reverse method that takes an ArrayList and size as parameters. It reverses the order of elements in the list by swapping the first and last elements, second and second to last, and so on. The main method creates a sample list, prints it, calls reverse on the list, and prints the reversed list.
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) .
Easy Button
This document contains code for a Java GUI application called EasyGUI that allows users to generate automation results for order processing. It contains classes like EasyGUI, EasyButton, and BatchEngine that create a GUI, handle button clicks, and execute automation batches. When the submit button is clicked, it validates the order ID, runs batches to get conversation IDs, account numbers, and CSIXML files, and displays the results. It uses GridBagLayout to arrange components on the main panel and stores selection values in variables like orderID and accountNumber to pass to batch processing methods.
Clinical Reasoning Case Study Total Parenteral NutritionName ____.docx
Mrs. Morris is a 66-year-old woman with Crohn's disease and diabetes admitted to the hospital with a small bowel obstruction. She will require a bowel resection and will be NPO postoperatively, so total parenteral nutrition (TPN) through a peripherally inserted central catheter (PICC) line is ordered to provide nutrition for at least 10-14 days until her GI tract is accessible again. The nurse must assess relevant clinical data to determine nutritional needs, calculate caloric content of the TPN, and establish priorities to monitor for complications and engage with the patient.
Correctional Health Care AssignmentCourse Objective for Assignme.docx
You have been assigned as the Case Coordinator for a state female correctional health care facility. Your task is to develop a strategic plan to organize the 300 monthly outside specialty medical appointments for inmates without impairing internal services. As your first step, you must write a memorandum addressing the challenges of providing health care in a correctional setting according to the 1976 Supreme Court ruling of Estelle v. Gamble and for the unique needs of the female inmate population. You will apply a strategic planning framework to guide your strategic thinking and decision making.
Class Response 1 Making or implementing policies should ultima.docx
The document discusses the Affordable Care Act (ACA) and efforts by Republicans to repeal or replace it. It notes that Republicans prioritize reducing costs and smaller government over improving health and equity, while Democrats prioritize the latter goals over reducing costs. There were many Republican attempts to repeal the ACA during the Obama administration that were unsuccessful. Efforts to repeal the ACA could be detrimental to peoples' health by reducing access to care and disadvantaging those with pre-existing conditions. The document also discusses how legislators' decisions are often driven more by getting re-elected than serving citizens' needs.
Chapter 3 - Evaluation Rubric Criteria Does Not Meet 0.01 .docx
This document provides an evaluation rubric for chapters in a dissertation or thesis. It outlines various criteria that are evaluated on a scale from does not meet to meets/NA. The criteria include sections on the introduction, research methodology/design, population/sample, materials/instrumentation, operational definitions of variables, procedures, data collection/analysis, assumptions/limitations/delimitations, ethical assurances, and a summary. Meeting the criteria involves properly justifying and explaining these various components of the research process.
Chapter 4 (Sexual Assault)Points Possible 20Deliverable Len.docx
This document provides instructions for an assignment on sexual assault. Students must write a 3-4 page response answering two of three questions about the historic court case Rightout vs. Oregon, why the actual number of sexual assaults is much higher than those reported to police, or whether there is any validity to Todd Akin's controversial comments distinguishing between "legitimate" and "illegitimate" rape. The assignment is worth 20 points total and is due on September 17th by 11:55 pm.
More Related Content
Similar to import java.util.ArrayList;public class Checkout{private.docx
public static ArrayListInteger doArrayListInsertAtMedian(int nu.pdf
public static ArrayList doArrayListInsertAtMedian(int numItems) {
System.out.print(\"doArrayListInsertAtMedian: \");
ArrayList list = new ArrayList<>();
// TODO Write code that adds integers 0 through (numitems - 1)
// to list, inside a loop.
long startTime = getTimestamp();
// TODO Write code that adds -1 to list at index
// (list.size() / 2)
long endTime = getTimestamp();
long totalTime = endTime - startTime;
System.out.println(totalTime);
return list;
}
Solution
import java.util.ArrayList;
import java.util.Date;
public class ArrayUtils {
public static void main(String[] args) {
System.out.println(doArrayListInsertAtMedian(10));
}
/**
* @param numItems
* @return
*/
public static ArrayList doArrayListInsertAtMedian(int numItems) {
System.out.print(\"doArrayListInsertAtMedian: \");
ArrayList list = new ArrayList();
// TODO Write code that adds integers 0 through (numitems - 1)
// to list, inside a loop.
Date date = new Date();
long startTime = date.getTime();
for (int i = 0; i < numItems; i++) {
list.add(i);
}
// TODO Write code that adds -1 to list at index
// (list.size() / 2)
list.set(list.size() / 2, -1);
long endTime = date.getTime();
long totalTime = endTime - startTime;
System.out.println(totalTime);
return list;
}
}
OUTPUT:
doArrayListInsertAtMedian: 0
[0, 1, 2, 3, 4, -1, 6, 7, 8, 9].
20070329 Java Programing Tips
The document provides tips on Java concurrency. It discusses using synchronized, volatile and java.util.concurrent classes like AtomicInteger for thread-safe operations on shared resources like account balances. Synchronized uses locks for mutual exclusion but volatile only ensures visibility, so atomic classes use Compare-And-Swap (CAS) operations for thread-safe updates without blocking.
Implement the ADT stack by using an array stack to contain its entri.pdf
Implement the ADT stack by using an array stack to contain its entries. Expand the array
dynamically, as necessary. Maintain the stack’s bottom entry in stack[stack.length – 1].
Your Stack class must implement StackInterface (provided). You may use ArrayStack.java
(provided) as the starting point for your implementation.
You must implement a comprehensive set of unit tests using the main() method (and private
utility methods) in ArrayStack.java.
ArrayStack.java
public class ArrayStack implements StackInterface
{
private T[] stack; // Array of stack entries
private int topIndex; // Index of top entry
private boolean initialized = false;
private static final int DEFAULT_CAPACITY = 50;
private static final int MAX_CAPACITY = 10000;
public ArrayStack()
{
this(DEFAULT_CAPACITY);
} // end default constructor
public ArrayStack(int initialCapacity)
{
checkCapacity(initialCapacity);
// The cast is safe because the new array contains null entries
@SuppressWarnings(\"unchecked\")
T[] tempStack = (T[])new Object[initialCapacity];
stack = tempStack;
topIndex = -1;
initialized = true;
} // end constructor
// < Implementations of the stack operations go here. >
// < Implementations of the private methods go here; checkCapacity and
// checkInitialization are analogous to those in Chapter 2. >
// . . .
} // end ArrayStack
StackInterface.java
public interface StackInterface
{
/** Adds a new entry to the top of this stack.
@param newEntry An object to be added to the stack. */
public void push(T newEntry);
/** Removes and returns this stack\'s top entry.
@return The object at the top of the stack.
@throws EmptyStackException if the stack is empty before the operation. */
public T pop();
/** Retrieves this stack\'s top entry.
@return The object at the top of the stack.
@throws EmptyStackException if the stack is empty. */
public T peek();
/** Detects whether this stack is empty.
@return True if the stack is empty. */
public boolean isEmpty();
/** Removes all entries from this stack. */
public void clear();
} // end StackInterface
Solution
StackTester.java
public class StackTester
{
public static void main(String[] args)
{
ArrayStack aS = new ArrayStack();
aS.push(3);
aS.push(5);
aS.push(10);
aS.push(11);
System.out.println(\"\"+ aS.peek() + \", \" + aS.pop() + \", \" + aS.peek2());
aS.remove(1);
}
}
ArrayStack.java
import java.util.Arrays;
public class ArrayStack implements StackInterface
{
private T[] stack;
private int topIndex;
private boolean initialized = false;
private static final int DEFAULT_CAPACITY = 50;
private static final int MAX_CAPACITY = 10000;
public ArrayStack()
{
this(DEFAULT_CAPACITY);
}
public ArrayStack(int initialCapacity)
{
checkCapacity(initialCapacity);
@SuppressWarnings(\"unchecked\")
T[] tempStack = (T[])new Object[initialCapacity];
stack = tempStack;
topIndex = -1;
initialized = true;
}
public boolean isEmpty()
{
return topIndex < 0;
}
private void ensureCapacity()
{
if(topIndex == stack.length - 1)
{
int newLength = 2*stack.length;
.
Please review my code (java)Someone helped me with it but i cannot.pdf
Please make it to clear 12-95. The basketball passed through the hoop even though it barely
cleared the hands of the player B who attempted to block it. Neglecting the size of the ball,
determine the magnitude vn of its initial velocity and the height h of the ball when it passes over
player B 10 ft 5 ft Prob. 12-95
Solution
Consider the motion along horizontal direction
Vox = initial velocity in horizontal direction = Va Cos30
X = horizontal distance = 25 + 3 = 28 ft
t = time taken
t = X / Vox = 28/(Va Cos30) eq-1
consider the motion in vertical direction
Y = vertical displacement = 10 - 7 = 3 ft
a = acceleration = - 32.2
Voy = initial velocity = Va Sin30
t = time taken
using the equation
Y = Voy t + (0.5) a t2
3 = (Va Sin30) (28/(Va Cos30)) + (0.5) (- 32.2) (28/(Va Cos30))2
Va = 35.8 m/s
t\' = time taken to reach B = 25 / (Va Cos30) = 25 / (35.8 Cos30) = 0.81 sec
h = 7 + Voy t\' + (0.5) a t\'2
h = 7 + (35.8 Sin30) (0.81) + (0.5) (- 32.2) (0.81)2
h = 10.94 ft.
Beautiful java script
This document discusses how JavaScript code would look if Java was written in JavaScript. It provides examples of Java-like classes and methods written in JavaScript. It also discusses JavaScript design patterns like the Module pattern and MVC frameworks. Finally, it covers topics like unit testing JavaScript with Jasmine, SVG vs Canvas for graphs, and libraries like Underscore.js and CSS frameworks.
【Unity】Scriptable object 入門と活用例
ScriptableObjectとはどういった物か、ScriptableObjectを利用すると何が良いのかといった基本的な内容から、実際にScriptableObjectを活用した開発の効率化について紹介します。
このスライドは『ヴァルキリーコネコクト』のクオリティを支える開発技術最前線で講演した内容のスライドです。 http://www.a-tm.co.jp/recruit/news/event-6944/
C# labprograms
The program defines a jagged array with 3 inner arrays of unspecified length. It initializes the inner arrays. It then iterates through the jagged array and sums all elements of the inner arrays. The total sum is returned.
public class TrequeT extends AbstractListT { .pdf
/**
*/
public class Treque extends AbstractList {
/**
* You decide on the instance variables you need.
*/
public Treque(Class t) {
// Put your own code here
throw new UnsupportedOperationException(\"Constructor not yet implemented\");
}
public T get(int i) {
if (i < 0 || i > size() - 1) throw new IndexOutOfBoundsException();
// Put your own code here instead of throwing this exception
throw new UnsupportedOperationException(\"get(i) not yet implemented\");
}
public T set(int i, T x) {
if (i < 0 || i > size() - 1) throw new IndexOutOfBoundsException();
// Put your own code here instead of throwing this exception
throw new UnsupportedOperationException(\"set(i,x) not yet implemented\");
}
public void add(int i, T x) {
if (i < 0 || i > size()) throw new IndexOutOfBoundsException();
// Put your own code here
throw new UnsupportedOperationException(\"add(i,x) not yet implemented\");
}
public T remove(int i) {
if (i < 0 || i > size() - 1) throw new IndexOutOfBoundsException();
// Put your own code here
throw new UnsupportedOperationException(\"remove(i) not yet implemented\");
}
public int size() {
// Put your own code here
throw new UnsupportedOperationException(\"size() not yet implemented\");
}
public static void main(String[] args) {
//List tr = new ArrayDeque(Integer.class);
List tr = new Treque(Integer.class);
int K = 1000000;
Stopwatch s = new Stopwatch();
System.out.print(\"Appending \" + K + \" items...\");
System.out.flush();
s.start();
for (int i = 0; i < K; i++) {
tr.add(i);
}
s.stop();
System.out.println(\"done (\" + s.elapsedSeconds() + \"s)\");
System.out.print(\"Prepending \" + K + \" items...\");
System.out.flush();
for (int i = 0; i < K; i++) {
tr.add(0, i);
}
s.stop();
System.out.println(\"done (\" + s.elapsedSeconds() + \"s)\");
System.out.print(\"Midpending(?!) \" + K + \" items...\");
System.out.flush();
s.start();
for (int i = 0; i < K; i++) {
tr.add(tr.size()/2);
}
s.stop();
System.out.println(\"done (\" + s.elapsedSeconds() + \"s)\");
System.out.print(\"Removing \" + K + \" items from the back...\");
System.out.flush();
for (int i = 0; i < K; i++) {
tr.remove(tr.size()-1);
}
s.stop();
System.out.println(\"done (\" + s.elapsedSeconds() + \"s)\");
System.out.print(\"Removing \" + K + \" items from the front...\");
System.out.flush();
for (int i = 0; i < K; i++) {
tr.remove(0);
}
s.stop();
System.out.println(\"done (\" + s.elapsedSeconds() + \"s)\");
System.out.print(\"Removing \" + K + \" items from the middle...\");
System.out.flush();
for (int i = 0; i < K; i++) {
tr.remove(tr.size()/2);
}
s.stop();
System.out.println(\"done (\" + s.elapsedSeconds() + \"s)\");
}
}
-------------------------------------------------------------------
import java.util.AbstractList;
import java.util.ArrayList;
import java.util.List;
/**
* This class implements the List interface using a collection of arrays of
* sizes 1, 2, 3, 4, and so on. The main advantages of this over an
* implementation like ArrayList is that there is never more than O(sqr.
You are to simulate a dispatcher using a priority queue system in C+.pdf
You are to simulate a dispatcher using a priority queue system in C++. New processes are to be
entered using a GUI with priority included (numbering should be automatic). Processes are also
to be terminated by GUI command. Context switches are to be by command with the cause of the
switch being either a blocking call, time slice exceeded or termination. Assume only one CPU.
Priorities and numbers of processes can be kept small, just big enough to demonstrate the
required functionality. You may pre-populate the queues initially from a data file. I am looking
at the mechanism as you are NOT creating actual processes, just simulating them. Functionality
to be provided by you: 1. Priority based Ready Queue(s). 2. Blocked list. 3. Output of complete
system status after every context switch showing ready, blocked, and running processes.
Sample Output: A3 Antrian WAKTU TUN... TA1Telah diEksekusi Ambil No Antrian
Solution
//dispatcherSim.java
public class dispatcherSim {
public static void main(String[] args)
{
simulator sim=new simulator(1000);
sim.addProcessReady(1); //test data
sim.addProcessReady(3);
sim.addProcessReady(2);
sim.addProcessReady(7);
sim.addProcessReady(4);
sim.addProcessBlocked(1);
sim.addProcessBlocked(3);
sim.addProcessBlocked(2);
sim.addProcessBlocked(7);
sim.addProcessBlocked(4);
GUI gui=new GUI(sim);
gui.setVisible(true);
}
}
=====================================================================
=========
//GUI.java
import java.awt.BorderLayout;
import java.awt.Dialog.ModalityType;
import java.awt.Dimension;
import java.awt.event.ActionEvent;
import java.awt.event.ActionListener;
import javax.swing.ButtonGroup;
import javax.swing.JButton;
import javax.swing.JComboBox;
import javax.swing.JDialog;
import javax.swing.JFrame;
import javax.swing.JLabel;
import javax.swing.JMenu;
import javax.swing.JMenuBar;
import javax.swing.JMenuItem;
import javax.swing.JPanel;
import javax.swing.JRadioButton;
import javax.swing.JScrollPane;
import javax.swing.JTextArea;
import javax.swing.JTextField;
public class GUI extends JFrame {
private JPanel panel;
private JMenuBar menuBar;
private JMenu menu;
private JMenuItem addNew;
private JMenuItem unBlock;
private JMenuItem terminate;
private JMenuItem readMe;
private JMenuItem exit;
private JButton cSwitch;
private JTextArea info;
private JScrollPane scroll;
private simulator sim;
private final String CS = \"CONTEXT SWITCH: \";
private int count = 1;
public GUI(simulator disSim) {
sim = disSim;
initComponents();
}
private void addNewBox() {
final JDialog addDialog = new JDialog();
JPanel miniPanel = new JPanel(new BorderLayout());
miniPanel.setPreferredSize(new Dimension(175, 100));
ButtonGroup radioGroup = new ButtonGroup();
final JRadioButton blocked = new JRadioButton(\"Blocked List\");
final JRadioButton ready = new JRadioButton(\"Ready Queue\");
ready.setSelected(true);
radioGroup.add(ready);
radioGroup.add(blocked);
JPanel radios = new JPanel();
radios.setPreferredSize(new Dimension(50, 50));
.
Hello. I need help fixing this Java Code on Eclipse. Please fix part.pdf
Hello. I need help fixing this Java Code on Eclipse. Please fix parts indicated as \"//Fix\" or
\"//Fill-in\". The code given is the first image. Thank you! Sample outputs are given below along
with what the code is required to do. import java til. Random import java til. Scanner public class
GenCheeseShopv2 public static void intro (Stringt] names, double []prices int amounts Fill-in
public static void getAmount (Scanner input, String[] names, int[] amounts) public static void
itemizedList (String[] names, double Prices int[] amounts) Fill-i public static double
calcSubTotal (double prices, int amounts return 0; pub. lic static int discount (double subTotal
return 0; pub. lic static oid print Total (double subTotal int discount) Fill-in public static void mi
args final int MAXCH EESEE DO NOT CHANGE ANYTHING BELOW String[] names new
String CMAXCH EESE double[] prices new double EESE] int[] amounts new int
[MAXCHEESEJ Scanner input new Scanner (Syste intro names, prices, amounts get Amo unt
input, names, amounts double total calcSubTotal (prices, amounts if EESEE 0) System. out print
Display the itemized list? (1 for yes) int itemized input-nex if item 1) itemized List (names,
prices, amounts); System. out. println(); print Total(total, discount total));
Solution
import java.util.Random;
import java.util.Scanner;
public class GenCheeseShopv2 {
public static void intro(String[] names, double[] prices,int[] amounts){
System.out.println(\"We sell \"+names.length+\" kinds of cheese\");
for(int i=0;i0)
System.out.println(amounts[i]+\" lbs of \"+names[i]+\" @ \"+prices[i]+\" =
$\"+(amounts[i]*prices[i]));
}
}
public static double calcSubTotal( double[] prices,int[] amounts){
double subTotal=0;
for(int i=0;i100)
return 10;
else if(subTotal > 50)
return 25;
else
return 0;
}
public static void printTotal(double subTotal,int discount){
System.out.println(\"Sub Total : $\"+subTotal);
System.out.println(\"-Discount : $\"+discount);
System.out.println(\"Total : $\"+(subTotal-discount));
}
public static void main(String[] args){
final int MAXCHEESES=4;
String[] names = new String[MAXCHEESES];
double[] prices = new double[MAXCHEESES];
int[] amounts = new int[MAXCHEESES];
Scanner input = new Scanner(System.in);
intro(names, prices, amounts);
getAmount(input, names, amounts);
double total = calcSubTotal(prices, amounts);
if(MAXCHEESES>0){
System.out.println(\"Display the itemized list? (1 for yes)\");
int itemized = input.nextInt();
if(itemized==1){
itemizedList(names, prices, amounts);
}
}
System.out.println();
printTotal(total, discount(total));
}
}.
Please add-modify the following to the original code using C# 1- Delet.docx
The document requests adding or modifying code to an existing C# class that implements an array list to include the following methods: DeleteFirst, DeleteLast, DeleteValue(value), Delete(index), and Reverse. It provides the starting code for the MyList class and requests adding meaningful comments and returning an upvote.
VISUALIZAR REGISTROS EN UN JTABLE
This document discusses how to display records from a Northwind database in a JTable using NetBeans and SQL Server. It includes code to connect to the database, define a Product class with getters and setters, a ProductDAO class to retrieve data, and a GUI class to display the results in a JTable. The code retrieves product data including ID, name, category, supplier, price, quantity and units from the database and displays it in the table.
Here is the codeimport java.util.; class GroceryItem { Stri.pdf
Here is the code
import java.util.*;
class GroceryItem
{
String name;
double value;
GroceryItem(String n, double v)
{
name=n;
value=v;
}
void setName(String n)
{
name=n;
}
void setValue(double n)
{
if(n>0)
value=n;
else value=0;
}
String getName()
{
return name;
}
double getValue()
{
return value;
}
public String toString()
{
return \"Name: \"+name+\", Price: \"+value;
}
boolean equals(GroceryItem m)
{
if(this.name.equals(m.name) && this.value==m.value) return true;
else return false;
}
}
public class GroceryList
{
class ListNode
{
GroceryItem data;
ListNode link;
ListNode(GroceryItem i)
{
data=i;
link=null;
}
ListNode()
{
data=null;
link=null;
}
}
ListNode head, current, previous;
GroceryList()
{
head=null;
current=head;
previous=head;
}
void addItem(String s, double v)
{
ListNode n=new ListNode(new GroceryItem(s,v));
if(head==null)
{
head=n;
}
else if(head.link==null)
{
head.link=n;
}
else
{
ListNode t=head;
while(t.link!=null)
{
t=t.link;
}
t.link=n;
}
}
void goToNext()
{
if(current.link!=null)
{
previous=current;
current=current.link;
}
}
String getDataAtCurrent()
{
return current.data.toString();
}
void setDataAtCurrent(GroceryItem n)
{
if(current!=null)
{
current.data.setName(n.getName());
current.data.setValue(n.getValue());
}
}
void insertAfterCurrent(GroceryItem m)
{
if(current!=null)
{
ListNode n= new ListNode(m);
n.link=current.link;
current.link=n;
System.out.println(\"Node Added\");
}
}
void deleteCurrentNode()
{
if(current!=null)
{
previous.link=current.link;
}
}
void showList()
{
ListNode t=head;
while(t!=null)
{
System.out.println(t.data+\"\ \");
t=t.link;
}
System.out.println(\"Done! \");
}
boolean contains(String n, double v)
{
ListNode t=head;
GroceryItem i = new GroceryItem(n,v);
while(t!=null)
{
if(t.data.equals(i))
{
return true;
}
else t=t.link;
}
return false;
}
double totalCost()
{
ListNode t=head;
double cost=0;
while(t!=null)
{
cost+=t.data.getValue();
t=t.link;
}
return cost;
}
public static void main(String a[])
{
System.out.println(\"Grocery List Tester\");
System.out.println(\"Creating Grocery List\");
GroceryList l = new GroceryList();
System.out.println(\"Adding 5 grocery items\");
l.addItem(\"Taco Shells\", 2.0);
l.addItem(\"Salsa\", 1.59);
l.addItem(\"Ground Beef\", 4.59);
l.addItem(\"Taco Shells\", 1.3);
l.addItem(\"Shredded Cheese\", 2.99);
l.showList();
System.out.println(\"Do I remember the salsa? \"+l.contains(\"Salsa\", 1.59));
System.out.println(\"Total Cost \"+l.totalCost());
}
}
Solution
Here is the code
import java.util.*;
class GroceryItem
{
String name;
double value;
GroceryItem(String n, double v)
{
name=n;
value=v;
}
void setName(String n)
{
name=n;
}
void setValue(double n)
{
if(n>0)
value=n;
else value=0;
}
String getName()
{
return name;
}
double getValue()
{
return value;
}
public String toString()
{
return \"Name: \"+name+\", Price: \"+value;
}
boolean equals(GroceryItem m)
{
if(this.name.equals(m.name) && this.value==m.value) return true;
else return false;
}
}
public class GroceryList
{
.
Code javascript
This Java code defines a class called Soal07 that contains a main method for managing a student mark list. The main method uses Scanner objects to accept user input. It displays a menu with options to input student data, view all data, edit data, or exit. Based on the user's selection, it will either prompt the user to enter information for multiple students, display an existing student's data, or allow editing of an existing student's data by re-prompting for input. All student data, including name, ID, and mark, is stored in arrays.
ReverseList.javaimport java.util.ArrayList;public class Rever.pdf
This Java program defines a ReverseList class containing a static reverse method that takes an ArrayList and size as parameters. It reverses the order of elements in the list by swapping the first and last elements, second and second to last, and so on. The main method creates a sample list, prints it, calls reverse on the list, and prints the reversed list.
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) .
Easy Button
This document contains code for a Java GUI application called EasyGUI that allows users to generate automation results for order processing. It contains classes like EasyGUI, EasyButton, and BatchEngine that create a GUI, handle button clicks, and execute automation batches. When the submit button is clicked, it validates the order ID, runs batches to get conversation IDs, account numbers, and CSIXML files, and displays the results. It uses GridBagLayout to arrange components on the main panel and stores selection values in variables like orderID and accountNumber to pass to batch processing methods.
Similar to import java.util.ArrayList;public class Checkout{private.docx (17)
public static ArrayListInteger doArrayListInsertAtMedian(int nu.pdf
public static ArrayListInteger doArrayListInsertAtMedian(int nu.pdf
Implement the ADT stack by using an array stack to contain its entri.pdf
Implement the ADT stack by using an array stack to contain its entri.pdf
Please review my code (java)Someone helped me with it but i cannot.pdf
Please review my code (java)Someone helped me with it but i cannot.pdf
You are to simulate a dispatcher using a priority queue system in C+.pdf
You are to simulate a dispatcher using a priority queue system in C+.pdf
Hello. I need help fixing this Java Code on Eclipse. Please fix part.pdf
Hello. I need help fixing this Java Code on Eclipse. Please fix part.pdf
Please add-modify the following to the original code using C# 1- Delet.docx
Please add-modify the following to the original code using C# 1- Delet.docx
Here is the codeimport java.util.; class GroceryItem { Stri.pdf
Here is the codeimport java.util.; class GroceryItem { Stri.pdf
ReverseList.javaimport java.util.ArrayList;public class Rever.pdf
ReverseList.javaimport java.util.ArrayList;public class Rever.pdf
OrderTest.javapublic class OrderTest { Get an arra.pdf
OrderTest.javapublic class OrderTest { Get an arra.pdf
More from Abhinav816839
Clinical Reasoning Case Study Total Parenteral NutritionName ____.docx
Mrs. Morris is a 66-year-old woman with Crohn's disease and diabetes admitted to the hospital with a small bowel obstruction. She will require a bowel resection and will be NPO postoperatively, so total parenteral nutrition (TPN) through a peripherally inserted central catheter (PICC) line is ordered to provide nutrition for at least 10-14 days until her GI tract is accessible again. The nurse must assess relevant clinical data to determine nutritional needs, calculate caloric content of the TPN, and establish priorities to monitor for complications and engage with the patient.
Correctional Health Care AssignmentCourse Objective for Assignme.docx
You have been assigned as the Case Coordinator for a state female correctional health care facility. Your task is to develop a strategic plan to organize the 300 monthly outside specialty medical appointments for inmates without impairing internal services. As your first step, you must write a memorandum addressing the challenges of providing health care in a correctional setting according to the 1976 Supreme Court ruling of Estelle v. Gamble and for the unique needs of the female inmate population. You will apply a strategic planning framework to guide your strategic thinking and decision making.
Class Response 1 Making or implementing policies should ultima.docx
The document discusses the Affordable Care Act (ACA) and efforts by Republicans to repeal or replace it. It notes that Republicans prioritize reducing costs and smaller government over improving health and equity, while Democrats prioritize the latter goals over reducing costs. There were many Republican attempts to repeal the ACA during the Obama administration that were unsuccessful. Efforts to repeal the ACA could be detrimental to peoples' health by reducing access to care and disadvantaging those with pre-existing conditions. The document also discusses how legislators' decisions are often driven more by getting re-elected than serving citizens' needs.
Chapter 3 - Evaluation Rubric Criteria Does Not Meet 0.01 .docx
This document provides an evaluation rubric for chapters in a dissertation or thesis. It outlines various criteria that are evaluated on a scale from does not meet to meets/NA. The criteria include sections on the introduction, research methodology/design, population/sample, materials/instrumentation, operational definitions of variables, procedures, data collection/analysis, assumptions/limitations/delimitations, ethical assurances, and a summary. Meeting the criteria involves properly justifying and explaining these various components of the research process.
Chapter 4 (Sexual Assault)Points Possible 20Deliverable Len.docx
This document provides instructions for an assignment on sexual assault. Students must write a 3-4 page response answering two of three questions about the historic court case Rightout vs. Oregon, why the actual number of sexual assaults is much higher than those reported to police, or whether there is any validity to Todd Akin's controversial comments distinguishing between "legitimate" and "illegitimate" rape. The assignment is worth 20 points total and is due on September 17th by 11:55 pm.
CS547 Wireless Networking and Security Exam 1 Questio.docx
This document contains 10 exam questions for a wireless networking and security course. The questions cover topics such as simplifying trigonometric expressions, factors that affect transmission bandwidth and delay, fields in IPv4 headers, transmit power calculations, and diversity techniques in wireless systems. They assess understanding of wireless communication fundamentals including modulation, bandwidth, routing, and physical layer concepts.
Communicating professionally and ethically is an essential ski.docx
The document provides guidelines for students at Strayer University on proper writing standards for various types of assignments. It addresses formatting and design standards for essays, presentations, discussion posts, and citing sources. Key points covered include using 12-point font, double spacing, section headings, title pages, in-text citations, source lists, paraphrasing, quoting, citing images and tables, webpage citations, and footnotes. The document aims to help students present their work professionally and ethically by avoiding plagiarism and giving proper credit to sources.
Case Study The HouseCallCompany.com Abstract The case.docx
Dean Thomasson, president and CEO of The House Call Company, is grappling with the performance of his Service Manager Frank Whiting, who he had previously fired but recently rehired. Thomasson is losing confidence in Whiting's ability to effectively manage the service department and promote additional services to customers. Thomasson also wants to step back from day-to-day management and pursue a new business venture, so he is relying more on his new Operations Manager Ray Ward. The case explores the tension between Thomasson's desire to demonstrate faith through redemption and second chances, and his responsibility to effectively manage business growth.
CHAPTER 5Risk Response and MitigationIn this chapter, you will.docx
This document provides an overview of risk response and mitigation concepts covered in Domain 3 of the CRISC exam. It discusses various risk response options such as mitigation, sharing, and acceptance. It also describes several risk management frameworks and standards that cover risk response, including the NIST RMF, ISACA Risk IT Framework, and COBIT. The document aims to help readers understand how to select, implement, and assess appropriate risk responses based on business needs and frameworks.
BiopsychologySensation and PerceptionInstructionsTake a mom.docx
The document asks the reader to review parts of the brain and answer questions about which areas are responsible for problem-solving, processing memories, and processing emotions. It also asks the reader to discuss the most unusual concept about sensation and perception learned that week and support any opinions or ideas with citations in APA format.
Chapter 2Historical Perspectives on Case ManagementChapter In.docx
This document provides an overview of the history and evolution of case management. It discusses four perspectives on case management that have developed over the past 40 years: as a process, with a focus on client involvement, examining the role of the helper, and utilizing review and cost-benefit analysis. The impact of managed care organizations is also addressed. A case study of "Sam" is used to illustrate how case management has changed from focusing solely on assessment and placement to a more comprehensive approach incorporating various services.
Compare and Contrast Systems Development Life Cycle (SDLC Mo.docx
The document compares and contrasts two systems development life cycle (SDLC) models: the seven-step model and the four-step model. The seven-step model includes requirements, analysis, design, coding, testing, deployment, and maintenance phases. The four-step model includes planning, risk analysis, engineering, and evaluation phases. Both follow an iterative process, but the four-step model combines some phases.
C H A P T E R F O U R PROBLEMS OF COMMUNICATIONCri.docx
This chapter discusses problems of communication in criminal justice organizations. It covers the basic theory of communication including encoding, transmitting, receiving and decoding messages. It also discusses additional challenges with communication in organizations, including filters, chain of command, informal communication networks, rules and social structures. The chapter addresses communication roles, developing informal networks, and the impact of technology. It concludes with a thinking point about how an increase in a city's Muslim population may or may not affect police work.
By Day 6 of Week Due 917Respond to at least two of your c.docx
The document instructs students to respond to at least two colleagues on two different days for an assignment due on September 17th. Students are asked to expand on their colleagues' explanations by providing a supporting example or respectfully challenge their explanation with a counter example.
ASSIGNMENT 3 (CHAPTERS 8-9) QUESTIONS Name .docx
This document provides questions for an assignment covering chapters 8-9 on intellectual property. It includes 24 multiple choice and short answer questions about various intellectual property concepts such as trademarks, copyrights, patents, trade secrets, and international agreements. Key topics covered are definitions of trademarks, copyright and patent infringement, fair use exceptions, and protections under international treaties like the Berne Convention and TRIPS agreement. Students are asked to email their answers in Word format to the provided email address.
3 pages excluding the title and reference page.Describe how Ph.docx
The Phalen's/Tinel Test is used in healthcare to detect carpal tunnel syndrome. It is conducted by pressing on the median nerve at the wrist for 60 seconds and observing if tingling occurs in the fingers, indicating nerve compression. The test helps gather information about whether a patient has carpal tunnel syndrome based on whether they experience tingling in the fingers.
91422, 1134 AM Printhttpscontent.uagc.eduprintMcNe.docx
The document discusses strategies and challenges for health analytics. It introduces a healthcare value framework for increasing revenues and reducing costs through analytics. Several fundamental questions are addressed, including defining the scope of health analytics, different ways to perform analytics, determining the business value of analytics, addressing privacy concerns, and learning best practices from other industries. Specific chapters are summarized that cover a taxonomy of healthcare analytics, an analytics "cheat sheet" reference guide, proving the business value of analytics, managing privacy and security issues, and cross-industry analytics adaptations.
All details are posted in the documentPlease use this topics for.docx
This document discusses strategies for avoiding procrastination such as managing distractions, prioritizing tasks, and not taking on too many tasks at once. It also touches on the importance of delegation and ensuring others have the proper guidance, resources and authority to complete their assignments. Overall, the key ideas center around managing time effectively, focusing on the most crucial tasks, and making sure others have what they need to help share responsibilities.
1, Describe the mind as a stream of consciousness, and what it revea.docx
The document discusses the concept of stream of consciousness and how it relates to our daily lives and internal thoughts. It questions whether streams of consciousness reflect our daily experiences and important goals and values. It also asks what topics may surprise us and what things are not mentioned in our streams of consciousness.
2Some of the ways that students are diverse in todays schools .docx
This document discusses ways to be more culturally responsive in teaching diverse students. It provides examples of strategies teachers can use, such as learning about a student's culture from sources like books or websites. The document also discusses the differences between basic interpersonal communication skills (BICS) needed for social interactions, and cognitive academic language proficiency (CALP) required to understand academic content. Teachers are encouraged to use strategies like sheltered instruction, activating background knowledge, and differentiating instruction to help English language learners, especially those with disabilities.
More from Abhinav816839 (20)
Clinical Reasoning Case Study Total Parenteral NutritionName ____.docx
Clinical Reasoning Case Study Total Parenteral NutritionName ____.docx
Correctional Health Care AssignmentCourse Objective for Assignme.docx
Correctional Health Care AssignmentCourse Objective for Assignme.docx
Class Response 1 Making or implementing policies should ultima.docx
Class Response 1 Making or implementing policies should ultima.docx
Chapter 3 - Evaluation Rubric Criteria Does Not Meet 0.01 .docx
Chapter 3 - Evaluation Rubric Criteria Does Not Meet 0.01 .docx
Chapter 4 (Sexual Assault)Points Possible 20Deliverable Len.docx
Chapter 4 (Sexual Assault)Points Possible 20Deliverable Len.docx
CS547 Wireless Networking and Security Exam 1 Questio.docx
CS547 Wireless Networking and Security Exam 1 Questio.docx
Communicating professionally and ethically is an essential ski.docx
Communicating professionally and ethically is an essential ski.docx
Case Study The HouseCallCompany.com Abstract The case.docx
Case Study The HouseCallCompany.com Abstract The case.docx
CHAPTER 5Risk Response and MitigationIn this chapter, you will.docx
CHAPTER 5Risk Response and MitigationIn this chapter, you will.docx
BiopsychologySensation and PerceptionInstructionsTake a mom.docx
BiopsychologySensation and PerceptionInstructionsTake a mom.docx
Chapter 2Historical Perspectives on Case ManagementChapter In.docx
Chapter 2Historical Perspectives on Case ManagementChapter In.docx
Compare and Contrast Systems Development Life Cycle (SDLC Mo.docx
Compare and Contrast Systems Development Life Cycle (SDLC Mo.docx
C H A P T E R F O U R PROBLEMS OF COMMUNICATIONCri.docx
C H A P T E R F O U R PROBLEMS OF COMMUNICATIONCri.docx
By Day 6 of Week Due 917Respond to at least two of your c.docx
By Day 6 of Week Due 917Respond to at least two of your c.docx
3 pages excluding the title and reference page.Describe how Ph.docx
3 pages excluding the title and reference page.Describe how Ph.docx
91422, 1134 AM Printhttpscontent.uagc.eduprintMcNe.docx
91422, 1134 AM Printhttpscontent.uagc.eduprintMcNe.docx
All details are posted in the documentPlease use this topics for.docx
All details are posted in the documentPlease use this topics for.docx
1, Describe the mind as a stream of consciousness, and what it revea.docx
1, Describe the mind as a stream of consciousness, and what it revea.docx
2Some of the ways that students are diverse in todays schools .docx
2Some of the ways that students are diverse in todays schools .docx
Recently uploaded
RPMS TEMPLATE FOR SCHOOL YEAR 2023-2024 FOR TEACHER 1 TO TEACHER 3
RPMS Template 2023-2024 by: Irene S. Rueco
Hindi varnamala | hindi alphabet PPT.pdf
हिंदी वर्णमाला पीपीटी, hindi alphabet PPT presentation, hindi varnamala PPT, Hindi Varnamala pdf, हिंदी स्वर, हिंदी व्यंजन, sikhiye hindi varnmala, dr. mulla adam ali, hindi language and literature, hindi alphabet with drawing, hindi alphabet pdf, hindi varnamala for childrens, hindi language, hindi varnamala practice for kids, https://www.drmullaadamali.com
The Diamonds of 2023-2024 in the IGRA collection
A review of the growth of the Israel Genealogy Research Association Database Collection for the last 12 months. Our collection is now passed the 3 million mark and still growing. See which archives have contributed the most. See the different types of records we have, and which years have had records added. You can also see what we have for the future.
Executive Directors Chat Leveraging AI for Diversity, Equity, and Inclusion
Let’s explore the intersection of technology and equity in the final session of our DEI series. Discover how AI tools, like ChatGPT, can be used to support and enhance your nonprofit's DEI initiatives. Participants will gain insights into practical AI applications and get tips for leveraging technology to advance their DEI goals.
Top five deadliest dog breeds in America
Thinking of getting a dog? Be aware that breeds like Pit Bulls, Rottweilers, and German Shepherds can be loyal and dangerous. Proper training and socialization are crucial to preventing aggressive behaviors. Ensure safety by understanding their needs and always supervising interactions. Stay safe, and enjoy your furry friends!
Advanced Java[Extra Concepts, Not Difficult].docx
This is part 2 of my Java Learning Journey. This contains Hashing, ArrayList, LinkedList, Date and Time Classes, Calendar Class and more.
Digital Artifact 1 - 10VCD Environments Unit
Digital Artifact 1 - 10VCD Environments Unit - NGV Pavilion Concept Design
How to Fix the Import Error in the Odoo 17
An import error occurs when a program fails to import a module or library, disrupting its execution. In languages like Python, this issue arises when the specified module cannot be found or accessed, hindering the program's functionality. Resolving import errors is crucial for maintaining smooth software operation and uninterrupted development processes.
Natural birth techniques - Mrs.Akanksha Trivedi Rama University
Natural birth techniques - Mrs.Akanksha Trivedi Rama UniversityAkanksha trivedi rama nursing college kanpur.
Natural birth techniques are various type such as/ water birth , alexender method, hypnosis, bradley method, lamaze method etcYour Skill Boost Masterclass: Strategies for Effective Upskilling
Your Skill Boost Masterclass: Strategies for Effective UpskillingExcellence Foundation for South Sudan
Strategies for Effective Upskilling is a presentation by Chinwendu Peace in a Your Skill Boost Masterclass organisation by the Excellence Foundation for South Sudan on 08th and 09th June 2024 from 1 PM to 3 PM on each day.ANATOMY AND BIOMECHANICS OF HIP JOINT.pdf
it describes the bony anatomy including the femoral head , acetabulum, labrum . also discusses the capsule , ligaments . muscle that act on the hip joint and the range of motion are outlined. factors affecting hip joint stability and weight transmission through the joint are summarized.
A Strategic Approach: GenAI in Education
Artificial Intelligence (AI) technologies such as Generative AI, Image Generators and Large Language Models have had a dramatic impact on teaching, learning and assessment over the past 18 months. The most immediate threat AI posed was to Academic Integrity with Higher Education Institutes (HEIs) focusing their efforts on combating the use of GenAI in assessment. Guidelines were developed for staff and students, policies put in place too. Innovative educators have forged paths in the use of Generative AI for teaching, learning and assessments leading to pockets of transformation springing up across HEIs, often with little or no top-down guidance, support or direction.
This Gasta posits a strategic approach to integrating AI into HEIs to prepare staff, students and the curriculum for an evolving world and workplace. We will highlight the advantages of working with these technologies beyond the realm of teaching, learning and assessment by considering prompt engineering skills, industry impact, curriculum changes, and the need for staff upskilling. In contrast, not engaging strategically with Generative AI poses risks, including falling behind peers, missed opportunities and failing to ensure our graduates remain employable. The rapid evolution of AI technologies necessitates a proactive and strategic approach if we are to remain relevant.
clinical examination of hip joint (1).pdf
described clinical examination all orthopeadic conditions .
CACJapan - GROUP Presentation 1- Wk 4.pdf
Macroeconomics- Movie Location
This will be used as part of your Personal Professional Portfolio once graded.
Objective:
Prepare a presentation or a paper using research, basic comparative analysis, data organization and application of economic information. You will make an informed assessment of an economic climate outside of the United States to accomplish an entertainment industry objective.
Chapter 4 - Islamic Financial Institutions in Malaysia.pptx
Chapter 4 - Islamic Financial Institutions in Malaysia.pptxMohd Adib Abd Muin, Senior Lecturer at Universiti Utara Malaysia
This slide is special for master students (MIBS & MIFB) in UUM. Also useful for readers who are interested in the topic of contemporary Islamic banking.
Recently uploaded (20)
RPMS TEMPLATE FOR SCHOOL YEAR 2023-2024 FOR TEACHER 1 TO TEACHER 3
RPMS TEMPLATE FOR SCHOOL YEAR 2023-2024 FOR TEACHER 1 TO TEACHER 3
Liberal Approach to the Study of Indian Politics.pdf
Liberal Approach to the Study of Indian Politics.pdf
Executive Directors Chat Leveraging AI for Diversity, Equity, and Inclusion
Executive Directors Chat Leveraging AI for Diversity, Equity, and Inclusion
Natural birth techniques - Mrs.Akanksha Trivedi Rama University
Natural birth techniques - Mrs.Akanksha Trivedi Rama University
Your Skill Boost Masterclass: Strategies for Effective Upskilling
Your Skill Boost Masterclass: Strategies for Effective Upskilling
Chapter 4 - Islamic Financial Institutions in Malaysia.pptx
Chapter 4 - Islamic Financial Institutions in Malaysia.pptx
import java.util.ArrayList;public class Checkout{private.docx
- 1. import java.util.ArrayList; public class Checkout{ private ArrayList checkoutList; Checkout(){ checkoutList= new ArrayList(); } public int numberOfItems(){ return checkoutList.size(); } public int totalCost(){ int sum=0; for (Item i : checkoutList){ sum+=i.getCost(); } return sum; } public int totalTax(){
- 2. return (int) java.lang.Math. round (GroceryStore. TAX_RATE *totalCost()/100.0); } public void clear(){ checkoutList.clear(); } public void enterItem(Item i){ checkoutList.add(i); } public String toString(){ ; System. out .println("t"+GroceryStore. STORE_NAME ); System. out .println("nt-------------------"); for (Item i : checkoutList){
- 3. System. out .println(i.toString()); } System. out .println("nTax "+GroceryStore. cents2dollarsAndCents (totalTax())); System. out .println("nTotal Cost "+GroceryStore. cents2dollarsAndCents (totalCost()+totalTax())); return ""; } } // Test Check out public class TestCheckout { public static void main(String[] args) { Checkout checkout = new Checkout(); checkout.enterItem(new Rice("Basmati Rice", 2.25, 399));
- 4. checkout.enterItem(new Baguette("Wheat Baguette", 105)); checkout.enterItem(new FlavoredBaguette("White Baguette", 145, "Chocolate", 50)); checkout.enterItem(new Egg("Grade A Organic Eggs", 4, 399)); System. out .println("nNumber of items: " + checkout.numberOfItems() + "n"); System. out .println("nTotal cost: " + checkout.totalCost() + "n"); System. out .println("nTotal tax: " + checkout.totalTax() + "n"); System. out .println("nCost + Tax: " + (checkout.totalCost() + checkout.totalTax()) + "n"); System. out .println(checkout); checkout.clear(); checkout.enterItem(new Baguette("Organic Baguette", 145)); checkout.enterItem(new FlavoredBaguette("Wheat Baguette",
- 5. 105, "Caramel", 50)); checkout.enterItem(new Rice("Indian Brown Rice", 1.33, 89)); checkout.enterItem(new Egg("Grade B Egg", 4, 399)); checkout.enterItem(new Rice("Arabic White Rice", 1.5, 209)); checkout.enterItem(new Rice("Spanish Yellow Rice", 3.0, 109)); System. out .println("nNumber of items: " + checkout.numberOfItems() + "n"); System. out .println("nTotal cost: " + checkout.totalCost() + "n"); System. out .println("nTotal tax: " + checkout.totalTax() + "n"); System. out .println("nCost + Tax: " + (checkout.totalCost() + checkout.totalTax()) + "n"); System. out .println(checkout); } //Baguette
- 6. public class Baguette extends Item { private double cost; public Baguette(String name, double cost) { super(name); this.cost = cost; } @Override public int getCost() { return (int)Math. ceil (cost); } @Override public String toString() { return name+" @" + GroceryStore. cents2dollarsAndCents (getCost()); } }
- 7. public class Rice extends Item { double weight; double price; public Rice(String name, double weight, double price) { super(name); this.weight = weight; this.price = price; } @Override public int getCost() { return (int) Math. ceil (weight * price); } @Override public String toString() { return "rice" + weight + "lbs @" + GroceryStore. cents2dollarsAndCents