sumOfSquaresimport java.util.;public class Arraylistoperation.pdf
•
0 likes•2 views
sumOfSquares import java.util.*; public class Arraylistoperation { public static void main(String args[]) { ArrayList list = createSquaresList(10); printList(list); } public static ArrayList createSquaresList(int n) { ArrayList squares= new ArrayList<>(); double s = 0.0; for (double i = 0.0; i <= n-1; i++) { s = i*i; squares.add(s); } return squares; for(int i = 0; i < m.size(); i++) { s+= m.get(i); } return s; } } Like wise sumOfCubes Solution sumOfSquares import java.util.*; public class Arraylistoperation { public static void main(String args[]) { ArrayList list = createSquaresList(10); printList(list); } public static ArrayList createSquaresList(int n) { ArrayList squares= new ArrayList<>(); double s = 0.0; for (double i = 0.0; i <= n-1; i++) { s = i*i; squares.add(s); } return squares; for(int i = 0; i < m.size(); i++) { s+= m.get(i); } return s; } } Like wise sumOfCubes.
Report
Share
Report
Share
Download to read offline
![sumOfSquares
import java.util.*;
public class Arraylistoperation
{
public static void main(String args[])
{
ArrayList list = createSquaresList(10);
printList(list);
}
public static ArrayList createSquaresList(int n)
{
ArrayList squares= new ArrayList<>();
double s = 0.0;
for (double i = 0.0; i <= n-1; i++)
{
s = i*i;
squares.add(s);
}
return squares;
for(int i = 0; i < m.size(); i++)
{
s+= m.get(i);
}
return s;
}
}
Like wise sumOfCubes
Solution
sumOfSquares](https://image.slidesharecdn.com/sumofsquaresimportjava-230408163031-5e6d2113/85/sumOfSquaresimport-java-util-public-class-Arraylistoperation-pdf-1-320.jpg)
![import java.util.*;
public class Arraylistoperation
{
public static void main(String args[])
{
ArrayList list = createSquaresList(10);
printList(list);
}
public static ArrayList createSquaresList(int n)
{
ArrayList squares= new ArrayList<>();
double s = 0.0;
for (double i = 0.0; i <= n-1; i++)
{
s = i*i;
squares.add(s);
}
return squares;
for(int i = 0; i < m.size(); i++)
{
s+= m.get(i);
}
return s;
}
}
Like wise sumOfCubes](data:image/gif;base64,R0lGODlhAQABAIAAAAAAAP///yH5BAEAAAAALAAAAAABAAEAAAIBRAA7)
Recommended
import java-util-ArrayList- import java-util-Collections- import java-.pdf
import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
import static java.lang.System.out;
public class homework {
public static void main(String[] args) {
List<Integer> list = new ArrayList<>();
for (int i = 0; i < 10; i++)
list.add(int) (Math.random()* 10) + 1);
Collections.sort(list);
System.out.println("The list id : " + list);
int index =linearSearch(list, 10);
if (index >+ 0)
System.out.println("Linear search: the number 5 was found at index " + index);
else
System.out.println("Linear search: the number 5 is not found ");
List<String> names = new ArrayList<>();
names.add("Tyson");
names.add("John");
names.add("Edgar");
names.add("LouLou");
Collections.sort(list);
System.out.println("The names are : " + names);
index = linearSearch(names, "JOhn");
if (index >= 0)
System.out.println("Linear search: Edgar was found at index " + names);
else
System.out.println("Linear search: Edgar is not found" + names);
}
public static <E> int linearSearch(List<E> lsit, E data) {
for (int i = 0; i < list.size(); i++)
if (list.get(i).equals(data))
return i;
return -1;
}
}
Chapter 14 - Linear Search and Binary Search - Assignment Due Wednesday by 11:59pm P
Points 100 Submitting a text entry box or a file upload Allowed Attempts 1 Available until Mar
1 at 11:59pm Modify the binarySearch method shown in the video lecture so that it's generic.
Test it with at least two types to make sure it works. Hint 1: Examine the review problem and its
solution, which modifies the linear search algorithm in the same way. Hint 2: Your binarySearch
method signature should be: "private static < E extends Comparable > boolean binarySearch(List
list, E data): Turn in the following, - The source files (no zip file, just the individual java files). -
A screen shot of your program in action. It should show the result of the test run.
.
output and explain There is Mylist There is MyArrayList pa.pdf
output and explain
There is Mylist;
There is MyArrayList:
package com.mycompany.myarraylist;
import java.util.*;
public class MyArrayList<E> implements MyList<E> {
private class ArrayListIterator implements Iterator<E> {
private int index;
public ArrayListIterator() {
index=0;
}
public boolean hasNext() {
return index < size();
}
public E next() {
index++;
return arr[index-1];
}
public void remove() {
throw new UnsupportedOperationException();
}
}
private E[] arr;
private int logicalLength;
public MyArrayList(int initCapacity) {
arr = (E[]) new Object[initCapacity];
logicalLength = 0;
}
public MyArrayList() {
this(4);
}
public boolean add(E e) {
if(isFull())
grow();
arr[logicalLength] = e;
logicalLength++;
return true;
}
public void add(int index, E element) {
if(isOutOfBounds(index))
throw new IndexOutOfBoundsException(index + " doesn't exist");
if(isFull())
grow();
for(int i=size()-1; i>=index; i--)
arr[i+1] = arr[i];
arr[index] = element;
logicalLength++;
}
public void clear() {
logicalLength = 0;
}
public boolean contains(Object obj) {
return indexOf(obj) != -1;
}
public boolean equals(Object obj) {
if(!(obj instanceof MyArrayList))
return false;
MyArrayList<E> another = (MyArrayList<E>)obj;
if(size() != another.size())
return false;
for(int i=0; i<size(); i++)
if(! (arr[i].equals(another.arr[i])))
return false;
return true;
}
public E get(int index) {
if(isOutOfBounds(index))
throw new IndexOutOfBoundsException(index + " doesn't exist");
return arr[index];
}
public E set(int index, E element) {
if(isOutOfBounds(index))
throw new IndexOutOfBoundsException(index + " doesn't exist");
E answer = arr[index];
arr[index] = element;
return answer;
}
public int indexOf(Object obj) {
for(int i=0; i<size(); i++)
if(arr[i].equals(obj))
return i;
return -1;
}
public boolean isEmpty() {
return size()==0;
}
public int size() {
return logicalLength;
}
public Iterator<E> iterator() {
return new ArrayListIterator();
}
public int lastIndexOf(Object obj) {
for(int i=size()-1; i>=0; i--)
if(arr[i].equals(obj))
return i;
return -1;
}
public E remove(int index) {
if(isOutOfBounds(index))
throw new IndexOutOfBoundsException(index + " doesn't exist");
E data = arr[index];
for(int i=index+1; i<size(); i++)
arr[i-1] = arr[i];
logicalLength--;
return data;
}
public boolean remove(Object obj) {
int index = indexOf(obj);
if(index==-1)
return false;
remove(index);
return true;
}
public String toString() {
StringBuilder sb = new StringBuilder("[ ");
for(int i=0; i<logicalLength; i++) {
sb.append(arr[i]);
if(i < logicalLength-1)
sb.append(", ");
}
sb.append("]");
return sb.toString();
}
private void grow() {
int newCapacity = 2 * arr.length;
E[] temp = (E[]) new Object[newCapacity];
for(int i=0; i<logicalLength; i++)
temp[i] = arr[i];
arr = temp;
}
private boolean isFull() {
return logicalLength == arr.length;
}
private boolean isOutOfBounds(int index) {
return index<0 || index>=logicalLength;
}
public static void main(String[] args) {
MyArrayList<Integer> list = new My.
Favor composition over inheritance
A concrete example showing why composition is favored over inheritance.
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.
Create a new java class called ListNode. Implement ListNode as a gen.pdf
Create a new java class called ListNode. Implement ListNode as a generic version of IntNode.
public class ListNode { }
Create a generic class called Queue, which is a linked list implementation of a queue data type.
Queue must have the following methods:
• public void enqueue(T value){} This method should add a new node to the back of the queue.
• public T dequeue(){} This method should remove a node from the front of the queue and return
its value
• public T peek(){} This method should return the value of the front node without removing it
from the queue
Create a new generic class called Stack, which is a linked list implementation of a stack data
type. Stack must have the following methods:
• public void push(T value){} This method should add a new node to the top of the stack.
• public T pop(){} This method should remove a node from the top of the stack and return its
integer value
• public T peek(){} This method should return the integer value of the top node without
removing it from the stack
Solution
import java.util.Iterator;
public class LinkedList extends AbstractList {
private ListNode front; // refers to first node in list (null if empty)
public LinkedList() {
front = null; // null front means empty
}
public void add(int index, E value) {
if (index == 0) {
// insert at the front
front = new ListNode(value, front);
} else {
ListNode current = goTo(index - 1);
ListNode newNode = new ListNode(value, current.next);
current.next = newNode;
}
}
public E get(int index) {
ListNode current = goTo(index);
return current.data;
}
public int indexOf(E value) {
int index = 0;
ListNode current = front;
while (current != null) {
if (current.data == value) {
return index;
}
index++;
current = current.next;
}
return -1;
}
public Iterator iterator() {
return new LinkedListIterator();
}
public void remove(int index) {
if (index == 0) {
// removing from the front
front = front.next;
} else {
ListNode current = goTo(index - 1);
current.next = current.next.next; // deletes the node
}
}
public void set(int index, E value) {
ListNode current = goTo(index);
current.data = value;
}
public int size() {
int count = 0;
ListNode current = front;
while (current != null) {
current = current.next;
count++;
}
return count;
}
public String toString() {
if (front == null) {
return \"[]\";
} else {
String result = \"[\" + front.data;
ListNode current = front.next;
while (current != null) {
result += \", \" + current.data;
current = current.next;
}
result += \"]\";
return result;
}
}
private ListNode goTo(int index) {
ListNode current = front;
for (int i = 0; i < index; i++) {
current = current.next;
}
return current;
}
public class ListNode {
public E data;
public ListNode next;
public ListNode(E data) {
this.data = data;
this.next = null;
}
public ListNode(E data, ListNode next) {
this.data = data;
this.next = next;
}
}
private class LinkedListIterator implements Iterator {
private ListNode current; // current position in list
public LinkedListIterator() {
current = f.
import java-util--- public class MyLinkedList{ public static void.pdf
import java.util.*; public class MyLinkedList{ public static void main(String[] args){ } } //copy
MyList to here interface MyList extends Collection { /* MyList will inherite all methods from
Collection public boolean add(E e); public boolean addAll(Collection extends E> c); public void
clear(); public boolean contains(Object o); public boolean containsAll(Collection> c); public
boolean isEmpty(); public boolean remove(Object o); public boolean removeAll(Collection> c);
public boolean retainAll(Collection> c); public int size(); public Object[] toArray(); public T[]
toArray(T[] arr); */ //abstract method public void add(int index, E e); public E get(int index);
public int indexOf(Object e); public int lastIndexOf(E e); public E remove(int index); public E
set(int index, E e); //default method @Override public default boolean add(E e){ add(size(), e);
return true; } @Override public default boolean isEmpty(){ return size()==0; } @Override
public default boolean remove(Object e){ if(indexOf(e) >= 0){ remove(indexOf(e)); return true;
} else{ return false; } } @Override public default boolean containsAll(Collection> c){
for(Object e : c){ if(!contains(e)){ return false; } } return true; } @Override public default
boolean addAll( Collection extends E> c){ for(E e : c){ add(e); } return true; } /* removeAll:
this[1,1,2,3] c[1,2,4] this.removeAll(c) [3] */ @Override public default boolean removeAll(
Collection> c){ for(Object e : c){ while(contains(e)){ this.remove(e); } } return true; } /*
retainAll this[1,1,2,3] c[1,2,4] this.retainAll(c) [1,1,2] */ @Override public default boolean
retainAll( Collection> c){ for(E e : this){ if(!c.contains(e)){ this.remove(e); } } return true; }
@Override public default Object[] toArray(){ Object[] results = new Object[size()]; int i = 0;
for(E e : this){ results[i++] = e; } return results; } /* T[] array */ @Override public default T[]
toArray(T[] array){ int i = 0; for(E e : this){ array[i++] = (T)e; } return array; } } class
TwoWayLinkedList implements MyList { //inner static class Node public class Node { E
element; Node next; Node previous; public Node(E e){ element = e; } } private Node head, tail;
private int size = 0; public TwoWayLinkedList(){ /* head = null; tail = null; size = 0; */ } public
TwoWayLinkedList(E[] objects){ } public E getFirst(){ return null; } public E getLast(){ return
null; } public void addFirst(E e){ } public void addLast(E e){ } public E removeFirst(){ return
null; } public E removeLast(){ return null; } @Override public void add(int index, E e){ }
@Override public E remove(int index){ return null; } @Override public void clear(){ }
@Override public boolean contains(Object e){ return false; } @Override public E get(int index){
return null; } @Override public int indexOf(Object e){ return -1; } @Override public int
lastIndexOf(Object e){ return -1; } @Override public E set(int index, E e){ return null; }
@Override public int size(){ return size; } //toString() @Override public String.
public class EllipsoidList { private String list- private Array.pdf
public class EllipsoidList {
private String list;
private ArrayList<Ellipsoid> ellipsoidList;
private ArrayList<Ellipsoid> ellipsoids = new ArrayList<Ellipsoid>();
public ArrayList<Ellipsoid> readFile(String filename) throws FileNotFoundException {
Scanner input = new Scanner(new File(filename));
ArrayList<Ellipsoid> list = new ArrayList<Ellipsoid>();
while (input.hasNextLine()) {
String line = input.nextLine();
String[] parts = line.split(",");
String label = parts[0];
double a = Double.parseDouble(parts[1]);
double b = Double.parseDouble(parts[2]);
double c = Double.parseDouble(parts[3]);
list.add(new Ellipsoid(label, a, b, c));
}
input.close();
ellipsoidList = new ArrayList<Ellipsoid>();
return list;
}
public void addEllipsoid(String name, double a, double b, double c) {
Ellipsoid e = new Ellipsoid(name, a, b, c);
ellipsoids.add(e);
}
public Ellipsoid findEllipsoid(String name) {
for (Ellipsoid e : ellipsoids) {
if (e.getName().equalsIgnoreCase(name)) {
return e;
}
}
return null;
}
public Ellipsoid deleteEllipsoid(String name) {
for (int i = 0; i < ellipsoids.size(); i++) {
Ellipsoid e = ellipsoids.get(i);
if (e.getName().equalsIgnoreCase(name)) {
ellipsoids.remove(i);
return e;
}
}
return null;
}
public Ellipsoid editEllipsoid(String name, double a, double b, double c) {
for (int i = 0; i < ellipsoids.size(); i++) {
Ellipsoid e = ellipsoids.get(i);
if (e.getName().equalsIgnoreCase(name)) {
return e;
}
}
return null;
}
public ArrayList<Ellipsoid> getList() {
return ellipsoidList;
}
/**
* Create a EllipsoidList object.
* @param listIn for listName
* @param ellipsoidListIn for ellipsoidList
*/
public EllipsoidList(String listIn, ArrayList<Ellipsoid> ellipsoidListIn) {
list = listIn;
ellipsoidList = new ArrayList<Ellipsoid>();
for (Ellipsoid e : ellipsoidListIn) {
ellipsoidList.add(e);
}
}
//methods
/**
* @return the list name
*/
public String getName() {
return list;
}
/**
* @return the list name
*/
public int numberOfEllipsoids() {
return ellipsoidList.size();
}
/**
* @return the list name
*/
public double totalVolume() {
double total = 0;
//use for each loop
for (Ellipsoid e : ellipsoidList) {
if (e != null) {
total += (e.volume());
}
}
// return the total volume
return total;
}
/**
* counts the total.
*
* @return totalSurfaceArea
*/
public double totalSurfaceArea() {
double total = 0;
//use for each loop
for (Ellipsoid e : ellipsoidList) {
if (e != null) {
total += (e.surfaceArea());
}
}
return total;
}
/**
* finds.
*
* @return averageVolume
*/
public double averageVolume() {
if (this.numberOfEllipsoids() == 0) {
return 0;
}
else {
return this.totalVolume() / this.numberOfEllipsoids();
}
}
/**
* finds.
*
* @return averageSurfaceArea
*/
public double averageSurfaceArea() {
if (this.numberOfEllipsoids() == 0) {
return 0;
}
else {
return this.totalSurfaceArea() / this.numberOfEllipsoids();
}
}
/**
* gets a summary of the ellipsoid in the list.
*
* @return summaryInfo
*/
public String toString() {
String result = getName() + "\n";
int index =.
Recommended
import java-util-ArrayList- import java-util-Collections- import java-.pdf
import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
import static java.lang.System.out;
public class homework {
public static void main(String[] args) {
List<Integer> list = new ArrayList<>();
for (int i = 0; i < 10; i++)
list.add(int) (Math.random()* 10) + 1);
Collections.sort(list);
System.out.println("The list id : " + list);
int index =linearSearch(list, 10);
if (index >+ 0)
System.out.println("Linear search: the number 5 was found at index " + index);
else
System.out.println("Linear search: the number 5 is not found ");
List<String> names = new ArrayList<>();
names.add("Tyson");
names.add("John");
names.add("Edgar");
names.add("LouLou");
Collections.sort(list);
System.out.println("The names are : " + names);
index = linearSearch(names, "JOhn");
if (index >= 0)
System.out.println("Linear search: Edgar was found at index " + names);
else
System.out.println("Linear search: Edgar is not found" + names);
}
public static <E> int linearSearch(List<E> lsit, E data) {
for (int i = 0; i < list.size(); i++)
if (list.get(i).equals(data))
return i;
return -1;
}
}
Chapter 14 - Linear Search and Binary Search - Assignment Due Wednesday by 11:59pm P
Points 100 Submitting a text entry box or a file upload Allowed Attempts 1 Available until Mar
1 at 11:59pm Modify the binarySearch method shown in the video lecture so that it's generic.
Test it with at least two types to make sure it works. Hint 1: Examine the review problem and its
solution, which modifies the linear search algorithm in the same way. Hint 2: Your binarySearch
method signature should be: "private static < E extends Comparable > boolean binarySearch(List
list, E data): Turn in the following, - The source files (no zip file, just the individual java files). -
A screen shot of your program in action. It should show the result of the test run.
.
output and explain There is Mylist There is MyArrayList pa.pdf
output and explain
There is Mylist;
There is MyArrayList:
package com.mycompany.myarraylist;
import java.util.*;
public class MyArrayList<E> implements MyList<E> {
private class ArrayListIterator implements Iterator<E> {
private int index;
public ArrayListIterator() {
index=0;
}
public boolean hasNext() {
return index < size();
}
public E next() {
index++;
return arr[index-1];
}
public void remove() {
throw new UnsupportedOperationException();
}
}
private E[] arr;
private int logicalLength;
public MyArrayList(int initCapacity) {
arr = (E[]) new Object[initCapacity];
logicalLength = 0;
}
public MyArrayList() {
this(4);
}
public boolean add(E e) {
if(isFull())
grow();
arr[logicalLength] = e;
logicalLength++;
return true;
}
public void add(int index, E element) {
if(isOutOfBounds(index))
throw new IndexOutOfBoundsException(index + " doesn't exist");
if(isFull())
grow();
for(int i=size()-1; i>=index; i--)
arr[i+1] = arr[i];
arr[index] = element;
logicalLength++;
}
public void clear() {
logicalLength = 0;
}
public boolean contains(Object obj) {
return indexOf(obj) != -1;
}
public boolean equals(Object obj) {
if(!(obj instanceof MyArrayList))
return false;
MyArrayList<E> another = (MyArrayList<E>)obj;
if(size() != another.size())
return false;
for(int i=0; i<size(); i++)
if(! (arr[i].equals(another.arr[i])))
return false;
return true;
}
public E get(int index) {
if(isOutOfBounds(index))
throw new IndexOutOfBoundsException(index + " doesn't exist");
return arr[index];
}
public E set(int index, E element) {
if(isOutOfBounds(index))
throw new IndexOutOfBoundsException(index + " doesn't exist");
E answer = arr[index];
arr[index] = element;
return answer;
}
public int indexOf(Object obj) {
for(int i=0; i<size(); i++)
if(arr[i].equals(obj))
return i;
return -1;
}
public boolean isEmpty() {
return size()==0;
}
public int size() {
return logicalLength;
}
public Iterator<E> iterator() {
return new ArrayListIterator();
}
public int lastIndexOf(Object obj) {
for(int i=size()-1; i>=0; i--)
if(arr[i].equals(obj))
return i;
return -1;
}
public E remove(int index) {
if(isOutOfBounds(index))
throw new IndexOutOfBoundsException(index + " doesn't exist");
E data = arr[index];
for(int i=index+1; i<size(); i++)
arr[i-1] = arr[i];
logicalLength--;
return data;
}
public boolean remove(Object obj) {
int index = indexOf(obj);
if(index==-1)
return false;
remove(index);
return true;
}
public String toString() {
StringBuilder sb = new StringBuilder("[ ");
for(int i=0; i<logicalLength; i++) {
sb.append(arr[i]);
if(i < logicalLength-1)
sb.append(", ");
}
sb.append("]");
return sb.toString();
}
private void grow() {
int newCapacity = 2 * arr.length;
E[] temp = (E[]) new Object[newCapacity];
for(int i=0; i<logicalLength; i++)
temp[i] = arr[i];
arr = temp;
}
private boolean isFull() {
return logicalLength == arr.length;
}
private boolean isOutOfBounds(int index) {
return index<0 || index>=logicalLength;
}
public static void main(String[] args) {
MyArrayList<Integer> list = new My.
Favor composition over inheritance
A concrete example showing why composition is favored over inheritance.
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.
Create a new java class called ListNode. Implement ListNode as a gen.pdf
Create a new java class called ListNode. Implement ListNode as a generic version of IntNode.
public class ListNode { }
Create a generic class called Queue, which is a linked list implementation of a queue data type.
Queue must have the following methods:
• public void enqueue(T value){} This method should add a new node to the back of the queue.
• public T dequeue(){} This method should remove a node from the front of the queue and return
its value
• public T peek(){} This method should return the value of the front node without removing it
from the queue
Create a new generic class called Stack, which is a linked list implementation of a stack data
type. Stack must have the following methods:
• public void push(T value){} This method should add a new node to the top of the stack.
• public T pop(){} This method should remove a node from the top of the stack and return its
integer value
• public T peek(){} This method should return the integer value of the top node without
removing it from the stack
Solution
import java.util.Iterator;
public class LinkedList extends AbstractList {
private ListNode front; // refers to first node in list (null if empty)
public LinkedList() {
front = null; // null front means empty
}
public void add(int index, E value) {
if (index == 0) {
// insert at the front
front = new ListNode(value, front);
} else {
ListNode current = goTo(index - 1);
ListNode newNode = new ListNode(value, current.next);
current.next = newNode;
}
}
public E get(int index) {
ListNode current = goTo(index);
return current.data;
}
public int indexOf(E value) {
int index = 0;
ListNode current = front;
while (current != null) {
if (current.data == value) {
return index;
}
index++;
current = current.next;
}
return -1;
}
public Iterator iterator() {
return new LinkedListIterator();
}
public void remove(int index) {
if (index == 0) {
// removing from the front
front = front.next;
} else {
ListNode current = goTo(index - 1);
current.next = current.next.next; // deletes the node
}
}
public void set(int index, E value) {
ListNode current = goTo(index);
current.data = value;
}
public int size() {
int count = 0;
ListNode current = front;
while (current != null) {
current = current.next;
count++;
}
return count;
}
public String toString() {
if (front == null) {
return \"[]\";
} else {
String result = \"[\" + front.data;
ListNode current = front.next;
while (current != null) {
result += \", \" + current.data;
current = current.next;
}
result += \"]\";
return result;
}
}
private ListNode goTo(int index) {
ListNode current = front;
for (int i = 0; i < index; i++) {
current = current.next;
}
return current;
}
public class ListNode {
public E data;
public ListNode next;
public ListNode(E data) {
this.data = data;
this.next = null;
}
public ListNode(E data, ListNode next) {
this.data = data;
this.next = next;
}
}
private class LinkedListIterator implements Iterator {
private ListNode current; // current position in list
public LinkedListIterator() {
current = f.
import java-util--- public class MyLinkedList{ public static void.pdf
import java.util.*; public class MyLinkedList{ public static void main(String[] args){ } } //copy
MyList to here interface MyList extends Collection { /* MyList will inherite all methods from
Collection public boolean add(E e); public boolean addAll(Collection extends E> c); public void
clear(); public boolean contains(Object o); public boolean containsAll(Collection> c); public
boolean isEmpty(); public boolean remove(Object o); public boolean removeAll(Collection> c);
public boolean retainAll(Collection> c); public int size(); public Object[] toArray(); public T[]
toArray(T[] arr); */ //abstract method public void add(int index, E e); public E get(int index);
public int indexOf(Object e); public int lastIndexOf(E e); public E remove(int index); public E
set(int index, E e); //default method @Override public default boolean add(E e){ add(size(), e);
return true; } @Override public default boolean isEmpty(){ return size()==0; } @Override
public default boolean remove(Object e){ if(indexOf(e) >= 0){ remove(indexOf(e)); return true;
} else{ return false; } } @Override public default boolean containsAll(Collection> c){
for(Object e : c){ if(!contains(e)){ return false; } } return true; } @Override public default
boolean addAll( Collection extends E> c){ for(E e : c){ add(e); } return true; } /* removeAll:
this[1,1,2,3] c[1,2,4] this.removeAll(c) [3] */ @Override public default boolean removeAll(
Collection> c){ for(Object e : c){ while(contains(e)){ this.remove(e); } } return true; } /*
retainAll this[1,1,2,3] c[1,2,4] this.retainAll(c) [1,1,2] */ @Override public default boolean
retainAll( Collection> c){ for(E e : this){ if(!c.contains(e)){ this.remove(e); } } return true; }
@Override public default Object[] toArray(){ Object[] results = new Object[size()]; int i = 0;
for(E e : this){ results[i++] = e; } return results; } /* T[] array */ @Override public default T[]
toArray(T[] array){ int i = 0; for(E e : this){ array[i++] = (T)e; } return array; } } class
TwoWayLinkedList implements MyList { //inner static class Node public class Node { E
element; Node next; Node previous; public Node(E e){ element = e; } } private Node head, tail;
private int size = 0; public TwoWayLinkedList(){ /* head = null; tail = null; size = 0; */ } public
TwoWayLinkedList(E[] objects){ } public E getFirst(){ return null; } public E getLast(){ return
null; } public void addFirst(E e){ } public void addLast(E e){ } public E removeFirst(){ return
null; } public E removeLast(){ return null; } @Override public void add(int index, E e){ }
@Override public E remove(int index){ return null; } @Override public void clear(){ }
@Override public boolean contains(Object e){ return false; } @Override public E get(int index){
return null; } @Override public int indexOf(Object e){ return -1; } @Override public int
lastIndexOf(Object e){ return -1; } @Override public E set(int index, E e){ return null; }
@Override public int size(){ return size; } //toString() @Override public String.
public class EllipsoidList { private String list- private Array.pdf
public class EllipsoidList {
private String list;
private ArrayList<Ellipsoid> ellipsoidList;
private ArrayList<Ellipsoid> ellipsoids = new ArrayList<Ellipsoid>();
public ArrayList<Ellipsoid> readFile(String filename) throws FileNotFoundException {
Scanner input = new Scanner(new File(filename));
ArrayList<Ellipsoid> list = new ArrayList<Ellipsoid>();
while (input.hasNextLine()) {
String line = input.nextLine();
String[] parts = line.split(",");
String label = parts[0];
double a = Double.parseDouble(parts[1]);
double b = Double.parseDouble(parts[2]);
double c = Double.parseDouble(parts[3]);
list.add(new Ellipsoid(label, a, b, c));
}
input.close();
ellipsoidList = new ArrayList<Ellipsoid>();
return list;
}
public void addEllipsoid(String name, double a, double b, double c) {
Ellipsoid e = new Ellipsoid(name, a, b, c);
ellipsoids.add(e);
}
public Ellipsoid findEllipsoid(String name) {
for (Ellipsoid e : ellipsoids) {
if (e.getName().equalsIgnoreCase(name)) {
return e;
}
}
return null;
}
public Ellipsoid deleteEllipsoid(String name) {
for (int i = 0; i < ellipsoids.size(); i++) {
Ellipsoid e = ellipsoids.get(i);
if (e.getName().equalsIgnoreCase(name)) {
ellipsoids.remove(i);
return e;
}
}
return null;
}
public Ellipsoid editEllipsoid(String name, double a, double b, double c) {
for (int i = 0; i < ellipsoids.size(); i++) {
Ellipsoid e = ellipsoids.get(i);
if (e.getName().equalsIgnoreCase(name)) {
return e;
}
}
return null;
}
public ArrayList<Ellipsoid> getList() {
return ellipsoidList;
}
/**
* Create a EllipsoidList object.
* @param listIn for listName
* @param ellipsoidListIn for ellipsoidList
*/
public EllipsoidList(String listIn, ArrayList<Ellipsoid> ellipsoidListIn) {
list = listIn;
ellipsoidList = new ArrayList<Ellipsoid>();
for (Ellipsoid e : ellipsoidListIn) {
ellipsoidList.add(e);
}
}
//methods
/**
* @return the list name
*/
public String getName() {
return list;
}
/**
* @return the list name
*/
public int numberOfEllipsoids() {
return ellipsoidList.size();
}
/**
* @return the list name
*/
public double totalVolume() {
double total = 0;
//use for each loop
for (Ellipsoid e : ellipsoidList) {
if (e != null) {
total += (e.volume());
}
}
// return the total volume
return total;
}
/**
* counts the total.
*
* @return totalSurfaceArea
*/
public double totalSurfaceArea() {
double total = 0;
//use for each loop
for (Ellipsoid e : ellipsoidList) {
if (e != null) {
total += (e.surfaceArea());
}
}
return total;
}
/**
* finds.
*
* @return averageVolume
*/
public double averageVolume() {
if (this.numberOfEllipsoids() == 0) {
return 0;
}
else {
return this.totalVolume() / this.numberOfEllipsoids();
}
}
/**
* finds.
*
* @return averageSurfaceArea
*/
public double averageSurfaceArea() {
if (this.numberOfEllipsoids() == 0) {
return 0;
}
else {
return this.totalSurfaceArea() / this.numberOfEllipsoids();
}
}
/**
* gets a summary of the ellipsoid in the list.
*
* @return summaryInfo
*/
public String toString() {
String result = getName() + "\n";
int index =.
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) .
Beyond Scala Lens
A Lens is a functional concept which solves a very common problem: how to update a complex immutable structure. This is probably the reason why Lenses are relatively well known in functional programming languages such as Haskell or Scala. However, there are far less resources available on the generalization of Lenses known as "optics".
In this slides, I would like to go through a few of these optics namely Iso, Prism and Optional, by showing how they relate to each other as well as how to use optics in a day to day programming job.
Engineering lecture ppt by venay magen
Venay Magen likes the shading red, particularly on Tuesdays. He cherishes to drink bourbon (on all days). He figured out how to drink whisky from his youth companion Zippo, when they went to class together at Mount Temple Comprehensive School. He is best known as the lead vocalist for the band MN3.
Hi, Please find my code##### Sequence.java ##############import.pdf
Hi, Please find my code:
##### Sequence.java ##############
import java.util.ArrayList;
public class Sequence {
private ArrayList values;
public Sequence(){
values= new ArrayList();
}
public void add(int n){
values.add(n);
}
// return copy of list
public ArrayList getSequence(){
ArrayList copyList = new ArrayList<>(values.size());
for (Integer x : values) {
copyList.add(x);
}
return copyList;
}
public String toString(){
return values.toString();
}
public Sequence append(Sequence other){
Sequence res = new Sequence();
for(Integer x : values)
res.add(x);
for(Integer x:other.getSequence())
res.add(x);
return res;
}
public Sequence merge(Sequence other){
int i=0, j=0;
ArrayList otherList = other.getSequence();
Sequence mergeSeq = new Sequence();
while(i otherList = other.getSequence();
Sequence mergeSeq = new Sequence();
while(i otherList.get(j)){
mergeSeq.add(otherList.get(j));
j++;
}else{ // both have same value
mergeSeq.add(values.get(i));
i++;
j++;
}
}
while(i < values.size()){
mergeSeq.add(values.get(i));
i++;
}
while(j < otherList.size()){
mergeSeq.add(otherList.get(j));
j++;
}
return mergeSeq;
}
}
############ SequenceTest.java ###############
public class SequenceTest {
public static void main(String[] args) {
Sequence s1 = new Sequence();
Sequence s2 = new Sequence();
s1.add(1);
s1.add(4);
s1.add(9);
s1.add(16);
s2.add(9);
s2.add(7);
s2.add(4);
s2.add(9);
s2.add(11);
Sequence s3 = s1.merge(s2);
System.out.println(\"S1: \"+s1.toString());
System.out.println(\"S2: \"+s2.toString());
System.out.println(\"S1+S2: \"+s3.toString());
Sequence s4 = new Sequence();
s4.add(4);
s4.add(9);
s4.add(14);
s4.add(15);
s4.add(16);
s4.add(20);
s4.add(22);
Sequence s5 = s1.mergeNoDuplicates(s4);
System.out.println(\"S4: \"+s4.toString());
System.out.println(\"S1+S4(no duplicate): \"+s5.toString());
}
}
/*
Sample Output:
S1: [1, 4, 9, 16]
S2: [9, 7, 4, 9, 11]
S1+S2: [1, 9, 4, 7, 9, 4, 16, 9, 11]
S4: [4, 9, 14, 15, 16, 20, 22]
S1+S4(no duplicate): [1, 4, 9, 14, 15, 16, 20, 22]
*/
Solution
Hi, Please find my code:
##### Sequence.java ##############
import java.util.ArrayList;
public class Sequence {
private ArrayList values;
public Sequence(){
values= new ArrayList();
}
public void add(int n){
values.add(n);
}
// return copy of list
public ArrayList getSequence(){
ArrayList copyList = new ArrayList<>(values.size());
for (Integer x : values) {
copyList.add(x);
}
return copyList;
}
public String toString(){
return values.toString();
}
public Sequence append(Sequence other){
Sequence res = new Sequence();
for(Integer x : values)
res.add(x);
for(Integer x:other.getSequence())
res.add(x);
return res;
}
public Sequence merge(Sequence other){
int i=0, j=0;
ArrayList otherList = other.getSequence();
Sequence mergeSeq = new Sequence();
while(i otherList = other.getSequence();
Sequence mergeSeq = new Sequence();
while(i otherList.get(j)){
mergeSeq.add(otherList.get(j));
j++;
}else{ // both have same value
mergeSeq.add(values.get(i));
i++;
j++;
}
}
while(i < values.size(.
Labprogram.javaLinkedList.javaimport java.util.NoSuchElementEx.pdf
Labprogram.java
LinkedList.java
import java.util.NoSuchElementException;
public class LinkedList {
private class Node {
private T data;
private Node next;
private Node prev;
public Node(T data) {
this.data = data;
this.next = null;
this.prev = null;
}
}
private int length;
private Node first;
private Node last;
private Node iterator;
/**** CONSTRUCTORS ****/
public LinkedList() {
first = null;
last = null;
iterator = null;
length = 0;
}
/**
* Converts the given array into a LinkedList
*
* @param array the array of values to insert into this LinkedList
* @postcondition
*/
public LinkedList(T[] array) {
}
/**
* Instantiates a new LinkedList by copying another List
*
* @param original the LinkedList to copy
* @postcondition a new List object, which is an identical,
* but separate, copy of the LinkedList original
*/
public LinkedList(LinkedList original) {
}
public T getFirst() throws NoSuchElementException {
if (isEmpty()) {
throw new NoSuchElementException("The list is empty");
}
return first.data;
}
public T getLast() throws NoSuchElementException {
if (isEmpty()) {
throw new NoSuchElementException("The list is empty");
}
return last.data;
}
public T getIterator() throws NullPointerException {
if (iterator != null) {
return iterator.data;
} else {
throw new NullPointerException("Iterator is off the end opf the list.");
}
}
public int getLength() {
return length;
}
public boolean isEmpty() {
return length == 0;
}
public boolean offEnd() {
return iterator == null;
}
public void addFirst(T data) {
Node newNode = new Node(data);
if (isEmpty()) {
first = newNode;
last = newNode;
} else {
newNode.next = first;
first.prev = newNode;
first = newNode;
}
length++;
}
public void addLast(T data) {
Node newNode = new Node(data);
if (isEmpty()) {
first = newNode;
last = newNode;
} else {
last.next = newNode;
newNode.prev = last;
last = newNode;
}
length++;
}
public void addIterator(T data) throws NullPointerException {
if (offEnd()) {
throw new NullPointerException("addIterator Iterator is off end.");
}
if (iterator == last) {
addLast(data);
} else {
Node newNode = new Node(data);
Node next = iterator.next;
newNode.next = next;
newNode.prev = iterator;
iterator.next = newNode;
next.prev = newNode;
length++;
}
}
public void removeFirst() throws NoSuchElementException {
if (isEmpty()) {
throw new NoSuchElementException("The list is empty");
}
if (length == 1) {
first = null;
last = null;
iterator = null;
} else {
if (iterator == first) {
iterator = null;
}
first = first.next;
first.prev = null;
}
length--;
}
public void removeLast() throws NoSuchElementException {
if (isEmpty()) {
throw new NoSuchElementException("The list is empty");
}
if (length == 1) {
first = null;
last = null;
iterator = null;
} else {
if (iterator == last) {
iterator = null;
}
last = last.prev;
last.next = null;
}
length--;
}
public void removeIterator() throws NullPointerException {
if (offEnd()) {
throw new NullPointerException("Iterator is off the end opf the list.");
}
if (iterator .
Write a program that uses the ArrayList class and populate it with a.docx
Write a program that uses the ArrayList class and populate it with a list of your course codes, i.e MIS210, then use the ArrayList methods described in the example in class to add, remove, and display information about the ArrayList.
simple example of ArrayList:
package bmarina;
import java.util.ArrayList;
public class ArrayListExample {
public static void main(String[] args) {
ArrayList cityList = new ArrayList();
cityList.add("London");
cityList.add("New York");
cityList.add("Paris");
cityList.add("Toronto");
cityList.add("Hong Kong");
cityList.add("Singapore");
System.out.println("List size is " + cityList.size());
System.out.println("Is Toronto in the list? " + cityList.contains("Toronto"));
System.out.println("The location of New York in the list is " + cityList.indexOf("New York"));
System.out.println("Is the list empty? " + cityList.isEmpty());
cityList.add(2, "Beijin");
System.out.println("List size is " + cityList.size());
System.out.println("The location of Beijin in the list is " + cityList.indexOf("Beijin"));
cityList.remove("Toronto");
System.out.println("List size is " + cityList.size());
cityList.remove(0);
System.out.println("List size is " + cityList.size());
System.out.println(cityList.toString());
for (int i = cityList.size() - 1; i >= 0 ; i--) {
System.out.print(cityList.get(i) + " ");
}
System.out.println();
}
}
.
Hitchhiker's Guide to Functional Programming
Refactoring imperative Java code to functional following clean code principles
Les nouveautés de C# 6
Après des années d’évolution, C# continue d’évoluer dans une 6ème version que l’on peut considérer comme mineure mais qui apporte une multitude de nouveautés très utiles. Je suis prêt à parier que bon nombre d’entre vous les utiliseront tous les jours !
import java.util.ArrayList;public class Checkout{private.docx
import java.util.ArrayList;public class Checkout{private.docx
Software Design Thinking
Solving specific problems which fit within the following categories.
managing layers of software
creating pipelines for data processing
dealing with user input
maintaining complex business rules
dealing with class hierarchies
Most widely used Design Patterns discussed
Builder
Command
Composite
Decorator
Event-Observer
Factory
Specification
Strategy
Visitor
Speaker: Gokul Subramanian
Hi, Please find my codeimport java.util.Random;public class Pro.pdf
Hi, Please find my code:
import java.util.Random;
public class ProcessArray {
private int rows; //The attribute for number of rows in matrix
private int columns; //The attribute for number of columns in matrix
private int[][] firstArray; //The attribute for the first array
private int[][] secondArray; //The attribute for the second array
public int[][] getFirstArray() { return firstArray;}
public int[][] getSecondArray() { return secondArray;}
public ProcessArray(int rows, int columns){ //Constructor of object ProcessArray
this.rows = rows;
this.columns = columns;
int[][] array = new int[rows][columns];
initializeArray(array);
randomlyFillArray();
computeArrayValues();
printArray(secondArray);
}
public void initializeArray(int[][] array){ //Initializes first and second arrays and sets each value
to 0
firstArray = new int[rows][columns];
secondArray = new int[rows][columns];
}
public void randomlyFillArray(){ //Fills first array with random numbers
for(int i = 0; i < firstArray.length;i++){
for(int j = 0; j < firstArray[0].length;j++){
Random r = new Random();
int num = r.nextInt(16);
firstArray[i][j] = num;
}
}
}
public void computeArrayValues(){
int col = firstArray[0].length;
int row = firstArray.length;
for(int i = 0; i < row; i++){
for(int j = 0; j< col; j++){
secondArray[i][j] = 0;
if((i - 1) >=0){
secondArray[i][j] += firstArray[i-1][j];
if((j+1) < col)
secondArray[i][j] += firstArray[i-1][j+1];
if(j > 0)
secondArray[i][j] += firstArray[i-1][j-1];
}
if((j+1) < col)
secondArray[i][j] += firstArray[i][j+1];
if(j > 0)
secondArray[i][j] += firstArray[i][j-1];
if((i+1) < row){
secondArray[i][j] += firstArray[i+1][j];
if((j+1) < col)
secondArray[i][j] += firstArray[i+1][j+1];
if(j > 0)
secondArray[i][j] += firstArray[i+1][j-1];
}
}
}
}
public void printArray(int[][] Array){
System.out.println(\"\ Initial Array Filled With Random Numbers: \ \");
for(int a = 0; a < firstArray.length; a++){
for(int b = 0; b < firstArray[0].length; b++){
if(b == 0)
System.out.printf(\"%d \", firstArray[a][b]);
else
System.out.printf(\"%d \", firstArray[a][b]);
}System.out.println();
}System.out.println();
System.out.println(\"Computed Array: \ \");
for(int a = 0; a < secondArray.length; a++){
for(int b = 0; b < secondArray[0].length; b++){
if(b == 0)
System.out.printf(\"%d \", secondArray[a][b]);
else
System.out.printf(\"%d \", secondArray[a][b]);
}
System.out.println();
}System.out.println();
}
public static void main(String[] args) {
ProcessArray pr = new ProcessArray(3, 4);
}
}
/*
Sample Output:
Initial Array Filled With Random Numbers:
7 3 6 12
10 2 11 10
12 14 1 7
Computed Array:
15 36 38 27
38 64 55 37
26 36 44 22
*/
Solution
Hi, Please find my code:
import java.util.Random;
public class ProcessArray {
private int rows; //The attribute for number of rows in matrix
private int columns; //The attribute for number of columns in matrix
private int[][] firstArray; //The attribute for the first array
private int[][] secondArray; //The attribute for the second arr.
Collection Core Concept
Collection, Collections Framework, Core Java, Corporate Java, Rays Technologies, SunilOS, Rays Indore, Rays Pune, Rays Delhi
Lab_3- Objective- Experiment with Lists- Stacks- and Queues- Simulate.docx
Lab_3: Objective: Experiment with Lists, Stacks, and Queues: Simulate an OS task manager
Assignment:
Using the startup code, implement the following:
1-Create List L1 of 10 elements (task IDs), e.g. L1 = 1, 2, 3, 4, 5, 6, 7, 8, 9, 10;
2-Insert a new list element in between (at every other element), such as: 1,100, 2,200, 3,300, 4,400, ... 10,1000;
Simulate a new CPU core assignment:
3-Create another List L2, and extract the newly inserted elements into this new list L2
i.e. L1 should go back to the original list: L1 = 1, 2, 3, 4, 5, 6, 7, 8, 9, 10
L2 should be: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1000
Start executing:
4-Create a Queue Q1 by extracting L1, and inserting L2 elements: i.e. Q should start with: 1,2,3, ... 10, and (10, 20 ... 100) will be inserted
Q1=1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 100, 200, 300, 400, 500, 600, 700, 800, 900, 1000
Label tasks as finished with the possibility of revisiting a task, such as:
5-Create a Stack S1 which by deleting the elements of Q1 and inserting them in L1
6-Pop out all elements of the Stack, i.e. should end up with an empty stack
Extra credit: Simulate a re-executed task, i.e. Pop out a task out of the Stack and reinsert, this simulate a failed task.
7-Verify the functionality and capture the results in a report form.
List.h
main.cpp
#include "List.h"
#include <stdlib.h>
#include <iostream>
using namespace std;
template <typename Object>
class Stack
{
public:
bool isEmpty() const
{
return theList.empty();
}
const Object& top() const
{
return theList.front();
}
void push(const Object& x)
{
theList.push_front(x);
}
void pop(Object& x)
{
x = theList.front(); theList.pop_front();
}
private:
List<Object> theList;
};
template <typename Object>
class Queue
{
public:
bool isEmpty() const
{
return theList.empty();
}
const Object& getFront() const
{
return theList.front();
}
void enqueue(const Object& x)
{
theList.push_back(x);
}
void dequeue(Object& x)
{
x = theList.front(); theList.pop_front();
}
private:
List<Object> theList;
};
int main()
{
int i;
const int N = 10;
List<int> L1;
Stack<int> S1;
Queue<int> Q1;
List<int>::iterator node; //Variable to keep track of the position as we traverse
// List Section example:
//Q1: Create List L1 of 10 elements, e.g. L1 = 1, 2, 3, 4, 5, 6, 7, 8, 9, 10;
// create the list array as a starting point:
for (i = N; i > 0; --i)
{
L1.push_front(i);
}
// show L1 with an iterator
cout << "List L1 is:" << endl;
for (auto it = L1.begin(); it != L1.end(); ++it)
{
cout << *it << ' ';
}
// Stack Section example:
//
// Stack to be created per the above assignment requirment
cout << "\nStack S1 is:" << endl;;
for (i = N - 1; i >= 0; --i)
{
S1.push(i);
cout << S1.top() << " " << endl;
}
while (!S1.isEmpty())
{
cout << S1.top() << endl;
S1.pop(i);
}
// Queue section, to be created per the above assignment requirment
//
//
return 0;
}
please answer with C++ code thank you!
private: int theSize; Node *head.
57. Howard Florey 58. Albert Schatz 59. Ernst Boris Chain - .pdf
57. Howard Florey
58. Albert Schatz
59. Ernst Boris Chain - worked with Howard Florey in demonstrating therapeutic potential of
penicillin
60. Therapeutic Index
Solution
57. Howard Florey
58. Albert Schatz
59. Ernst Boris Chain - worked with Howard Florey in demonstrating therapeutic potential of
penicillin
60. Therapeutic Index.
9The von Neumann equation for time evolution10Solution9T.pdf
9
The von Neumann equation for time evolution
10
Solution
9
The von Neumann equation for time evolution
10.
More Related Content
Similar to sumOfSquaresimport java.util.;public class Arraylistoperation.pdf
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) .
Beyond Scala Lens
A Lens is a functional concept which solves a very common problem: how to update a complex immutable structure. This is probably the reason why Lenses are relatively well known in functional programming languages such as Haskell or Scala. However, there are far less resources available on the generalization of Lenses known as "optics".
In this slides, I would like to go through a few of these optics namely Iso, Prism and Optional, by showing how they relate to each other as well as how to use optics in a day to day programming job.
Engineering lecture ppt by venay magen
Venay Magen likes the shading red, particularly on Tuesdays. He cherishes to drink bourbon (on all days). He figured out how to drink whisky from his youth companion Zippo, when they went to class together at Mount Temple Comprehensive School. He is best known as the lead vocalist for the band MN3.
Hi, Please find my code##### Sequence.java ##############import.pdf
Hi, Please find my code:
##### Sequence.java ##############
import java.util.ArrayList;
public class Sequence {
private ArrayList values;
public Sequence(){
values= new ArrayList();
}
public void add(int n){
values.add(n);
}
// return copy of list
public ArrayList getSequence(){
ArrayList copyList = new ArrayList<>(values.size());
for (Integer x : values) {
copyList.add(x);
}
return copyList;
}
public String toString(){
return values.toString();
}
public Sequence append(Sequence other){
Sequence res = new Sequence();
for(Integer x : values)
res.add(x);
for(Integer x:other.getSequence())
res.add(x);
return res;
}
public Sequence merge(Sequence other){
int i=0, j=0;
ArrayList otherList = other.getSequence();
Sequence mergeSeq = new Sequence();
while(i otherList = other.getSequence();
Sequence mergeSeq = new Sequence();
while(i otherList.get(j)){
mergeSeq.add(otherList.get(j));
j++;
}else{ // both have same value
mergeSeq.add(values.get(i));
i++;
j++;
}
}
while(i < values.size()){
mergeSeq.add(values.get(i));
i++;
}
while(j < otherList.size()){
mergeSeq.add(otherList.get(j));
j++;
}
return mergeSeq;
}
}
############ SequenceTest.java ###############
public class SequenceTest {
public static void main(String[] args) {
Sequence s1 = new Sequence();
Sequence s2 = new Sequence();
s1.add(1);
s1.add(4);
s1.add(9);
s1.add(16);
s2.add(9);
s2.add(7);
s2.add(4);
s2.add(9);
s2.add(11);
Sequence s3 = s1.merge(s2);
System.out.println(\"S1: \"+s1.toString());
System.out.println(\"S2: \"+s2.toString());
System.out.println(\"S1+S2: \"+s3.toString());
Sequence s4 = new Sequence();
s4.add(4);
s4.add(9);
s4.add(14);
s4.add(15);
s4.add(16);
s4.add(20);
s4.add(22);
Sequence s5 = s1.mergeNoDuplicates(s4);
System.out.println(\"S4: \"+s4.toString());
System.out.println(\"S1+S4(no duplicate): \"+s5.toString());
}
}
/*
Sample Output:
S1: [1, 4, 9, 16]
S2: [9, 7, 4, 9, 11]
S1+S2: [1, 9, 4, 7, 9, 4, 16, 9, 11]
S4: [4, 9, 14, 15, 16, 20, 22]
S1+S4(no duplicate): [1, 4, 9, 14, 15, 16, 20, 22]
*/
Solution
Hi, Please find my code:
##### Sequence.java ##############
import java.util.ArrayList;
public class Sequence {
private ArrayList values;
public Sequence(){
values= new ArrayList();
}
public void add(int n){
values.add(n);
}
// return copy of list
public ArrayList getSequence(){
ArrayList copyList = new ArrayList<>(values.size());
for (Integer x : values) {
copyList.add(x);
}
return copyList;
}
public String toString(){
return values.toString();
}
public Sequence append(Sequence other){
Sequence res = new Sequence();
for(Integer x : values)
res.add(x);
for(Integer x:other.getSequence())
res.add(x);
return res;
}
public Sequence merge(Sequence other){
int i=0, j=0;
ArrayList otherList = other.getSequence();
Sequence mergeSeq = new Sequence();
while(i otherList = other.getSequence();
Sequence mergeSeq = new Sequence();
while(i otherList.get(j)){
mergeSeq.add(otherList.get(j));
j++;
}else{ // both have same value
mergeSeq.add(values.get(i));
i++;
j++;
}
}
while(i < values.size(.
Labprogram.javaLinkedList.javaimport java.util.NoSuchElementEx.pdf
Labprogram.java
LinkedList.java
import java.util.NoSuchElementException;
public class LinkedList {
private class Node {
private T data;
private Node next;
private Node prev;
public Node(T data) {
this.data = data;
this.next = null;
this.prev = null;
}
}
private int length;
private Node first;
private Node last;
private Node iterator;
/**** CONSTRUCTORS ****/
public LinkedList() {
first = null;
last = null;
iterator = null;
length = 0;
}
/**
* Converts the given array into a LinkedList
*
* @param array the array of values to insert into this LinkedList
* @postcondition
*/
public LinkedList(T[] array) {
}
/**
* Instantiates a new LinkedList by copying another List
*
* @param original the LinkedList to copy
* @postcondition a new List object, which is an identical,
* but separate, copy of the LinkedList original
*/
public LinkedList(LinkedList original) {
}
public T getFirst() throws NoSuchElementException {
if (isEmpty()) {
throw new NoSuchElementException("The list is empty");
}
return first.data;
}
public T getLast() throws NoSuchElementException {
if (isEmpty()) {
throw new NoSuchElementException("The list is empty");
}
return last.data;
}
public T getIterator() throws NullPointerException {
if (iterator != null) {
return iterator.data;
} else {
throw new NullPointerException("Iterator is off the end opf the list.");
}
}
public int getLength() {
return length;
}
public boolean isEmpty() {
return length == 0;
}
public boolean offEnd() {
return iterator == null;
}
public void addFirst(T data) {
Node newNode = new Node(data);
if (isEmpty()) {
first = newNode;
last = newNode;
} else {
newNode.next = first;
first.prev = newNode;
first = newNode;
}
length++;
}
public void addLast(T data) {
Node newNode = new Node(data);
if (isEmpty()) {
first = newNode;
last = newNode;
} else {
last.next = newNode;
newNode.prev = last;
last = newNode;
}
length++;
}
public void addIterator(T data) throws NullPointerException {
if (offEnd()) {
throw new NullPointerException("addIterator Iterator is off end.");
}
if (iterator == last) {
addLast(data);
} else {
Node newNode = new Node(data);
Node next = iterator.next;
newNode.next = next;
newNode.prev = iterator;
iterator.next = newNode;
next.prev = newNode;
length++;
}
}
public void removeFirst() throws NoSuchElementException {
if (isEmpty()) {
throw new NoSuchElementException("The list is empty");
}
if (length == 1) {
first = null;
last = null;
iterator = null;
} else {
if (iterator == first) {
iterator = null;
}
first = first.next;
first.prev = null;
}
length--;
}
public void removeLast() throws NoSuchElementException {
if (isEmpty()) {
throw new NoSuchElementException("The list is empty");
}
if (length == 1) {
first = null;
last = null;
iterator = null;
} else {
if (iterator == last) {
iterator = null;
}
last = last.prev;
last.next = null;
}
length--;
}
public void removeIterator() throws NullPointerException {
if (offEnd()) {
throw new NullPointerException("Iterator is off the end opf the list.");
}
if (iterator .
Write a program that uses the ArrayList class and populate it with a.docx
Write a program that uses the ArrayList class and populate it with a list of your course codes, i.e MIS210, then use the ArrayList methods described in the example in class to add, remove, and display information about the ArrayList.
simple example of ArrayList:
package bmarina;
import java.util.ArrayList;
public class ArrayListExample {
public static void main(String[] args) {
ArrayList cityList = new ArrayList();
cityList.add("London");
cityList.add("New York");
cityList.add("Paris");
cityList.add("Toronto");
cityList.add("Hong Kong");
cityList.add("Singapore");
System.out.println("List size is " + cityList.size());
System.out.println("Is Toronto in the list? " + cityList.contains("Toronto"));
System.out.println("The location of New York in the list is " + cityList.indexOf("New York"));
System.out.println("Is the list empty? " + cityList.isEmpty());
cityList.add(2, "Beijin");
System.out.println("List size is " + cityList.size());
System.out.println("The location of Beijin in the list is " + cityList.indexOf("Beijin"));
cityList.remove("Toronto");
System.out.println("List size is " + cityList.size());
cityList.remove(0);
System.out.println("List size is " + cityList.size());
System.out.println(cityList.toString());
for (int i = cityList.size() - 1; i >= 0 ; i--) {
System.out.print(cityList.get(i) + " ");
}
System.out.println();
}
}
.
Hitchhiker's Guide to Functional Programming
Refactoring imperative Java code to functional following clean code principles
Les nouveautés de C# 6
Après des années d’évolution, C# continue d’évoluer dans une 6ème version que l’on peut considérer comme mineure mais qui apporte une multitude de nouveautés très utiles. Je suis prêt à parier que bon nombre d’entre vous les utiliseront tous les jours !
import java.util.ArrayList;public class Checkout{private.docx
import java.util.ArrayList;public class Checkout{private.docx
Software Design Thinking
Solving specific problems which fit within the following categories.
managing layers of software
creating pipelines for data processing
dealing with user input
maintaining complex business rules
dealing with class hierarchies
Most widely used Design Patterns discussed
Builder
Command
Composite
Decorator
Event-Observer
Factory
Specification
Strategy
Visitor
Speaker: Gokul Subramanian
Hi, Please find my codeimport java.util.Random;public class Pro.pdf
Hi, Please find my code:
import java.util.Random;
public class ProcessArray {
private int rows; //The attribute for number of rows in matrix
private int columns; //The attribute for number of columns in matrix
private int[][] firstArray; //The attribute for the first array
private int[][] secondArray; //The attribute for the second array
public int[][] getFirstArray() { return firstArray;}
public int[][] getSecondArray() { return secondArray;}
public ProcessArray(int rows, int columns){ //Constructor of object ProcessArray
this.rows = rows;
this.columns = columns;
int[][] array = new int[rows][columns];
initializeArray(array);
randomlyFillArray();
computeArrayValues();
printArray(secondArray);
}
public void initializeArray(int[][] array){ //Initializes first and second arrays and sets each value
to 0
firstArray = new int[rows][columns];
secondArray = new int[rows][columns];
}
public void randomlyFillArray(){ //Fills first array with random numbers
for(int i = 0; i < firstArray.length;i++){
for(int j = 0; j < firstArray[0].length;j++){
Random r = new Random();
int num = r.nextInt(16);
firstArray[i][j] = num;
}
}
}
public void computeArrayValues(){
int col = firstArray[0].length;
int row = firstArray.length;
for(int i = 0; i < row; i++){
for(int j = 0; j< col; j++){
secondArray[i][j] = 0;
if((i - 1) >=0){
secondArray[i][j] += firstArray[i-1][j];
if((j+1) < col)
secondArray[i][j] += firstArray[i-1][j+1];
if(j > 0)
secondArray[i][j] += firstArray[i-1][j-1];
}
if((j+1) < col)
secondArray[i][j] += firstArray[i][j+1];
if(j > 0)
secondArray[i][j] += firstArray[i][j-1];
if((i+1) < row){
secondArray[i][j] += firstArray[i+1][j];
if((j+1) < col)
secondArray[i][j] += firstArray[i+1][j+1];
if(j > 0)
secondArray[i][j] += firstArray[i+1][j-1];
}
}
}
}
public void printArray(int[][] Array){
System.out.println(\"\ Initial Array Filled With Random Numbers: \ \");
for(int a = 0; a < firstArray.length; a++){
for(int b = 0; b < firstArray[0].length; b++){
if(b == 0)
System.out.printf(\"%d \", firstArray[a][b]);
else
System.out.printf(\"%d \", firstArray[a][b]);
}System.out.println();
}System.out.println();
System.out.println(\"Computed Array: \ \");
for(int a = 0; a < secondArray.length; a++){
for(int b = 0; b < secondArray[0].length; b++){
if(b == 0)
System.out.printf(\"%d \", secondArray[a][b]);
else
System.out.printf(\"%d \", secondArray[a][b]);
}
System.out.println();
}System.out.println();
}
public static void main(String[] args) {
ProcessArray pr = new ProcessArray(3, 4);
}
}
/*
Sample Output:
Initial Array Filled With Random Numbers:
7 3 6 12
10 2 11 10
12 14 1 7
Computed Array:
15 36 38 27
38 64 55 37
26 36 44 22
*/
Solution
Hi, Please find my code:
import java.util.Random;
public class ProcessArray {
private int rows; //The attribute for number of rows in matrix
private int columns; //The attribute for number of columns in matrix
private int[][] firstArray; //The attribute for the first array
private int[][] secondArray; //The attribute for the second arr.
Collection Core Concept
Collection, Collections Framework, Core Java, Corporate Java, Rays Technologies, SunilOS, Rays Indore, Rays Pune, Rays Delhi
Lab_3- Objective- Experiment with Lists- Stacks- and Queues- Simulate.docx
Lab_3: Objective: Experiment with Lists, Stacks, and Queues: Simulate an OS task manager
Assignment:
Using the startup code, implement the following:
1-Create List L1 of 10 elements (task IDs), e.g. L1 = 1, 2, 3, 4, 5, 6, 7, 8, 9, 10;
2-Insert a new list element in between (at every other element), such as: 1,100, 2,200, 3,300, 4,400, ... 10,1000;
Simulate a new CPU core assignment:
3-Create another List L2, and extract the newly inserted elements into this new list L2
i.e. L1 should go back to the original list: L1 = 1, 2, 3, 4, 5, 6, 7, 8, 9, 10
L2 should be: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1000
Start executing:
4-Create a Queue Q1 by extracting L1, and inserting L2 elements: i.e. Q should start with: 1,2,3, ... 10, and (10, 20 ... 100) will be inserted
Q1=1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 100, 200, 300, 400, 500, 600, 700, 800, 900, 1000
Label tasks as finished with the possibility of revisiting a task, such as:
5-Create a Stack S1 which by deleting the elements of Q1 and inserting them in L1
6-Pop out all elements of the Stack, i.e. should end up with an empty stack
Extra credit: Simulate a re-executed task, i.e. Pop out a task out of the Stack and reinsert, this simulate a failed task.
7-Verify the functionality and capture the results in a report form.
List.h
main.cpp
#include "List.h"
#include <stdlib.h>
#include <iostream>
using namespace std;
template <typename Object>
class Stack
{
public:
bool isEmpty() const
{
return theList.empty();
}
const Object& top() const
{
return theList.front();
}
void push(const Object& x)
{
theList.push_front(x);
}
void pop(Object& x)
{
x = theList.front(); theList.pop_front();
}
private:
List<Object> theList;
};
template <typename Object>
class Queue
{
public:
bool isEmpty() const
{
return theList.empty();
}
const Object& getFront() const
{
return theList.front();
}
void enqueue(const Object& x)
{
theList.push_back(x);
}
void dequeue(Object& x)
{
x = theList.front(); theList.pop_front();
}
private:
List<Object> theList;
};
int main()
{
int i;
const int N = 10;
List<int> L1;
Stack<int> S1;
Queue<int> Q1;
List<int>::iterator node; //Variable to keep track of the position as we traverse
// List Section example:
//Q1: Create List L1 of 10 elements, e.g. L1 = 1, 2, 3, 4, 5, 6, 7, 8, 9, 10;
// create the list array as a starting point:
for (i = N; i > 0; --i)
{
L1.push_front(i);
}
// show L1 with an iterator
cout << "List L1 is:" << endl;
for (auto it = L1.begin(); it != L1.end(); ++it)
{
cout << *it << ' ';
}
// Stack Section example:
//
// Stack to be created per the above assignment requirment
cout << "\nStack S1 is:" << endl;;
for (i = N - 1; i >= 0; --i)
{
S1.push(i);
cout << S1.top() << " " << endl;
}
while (!S1.isEmpty())
{
cout << S1.top() << endl;
S1.pop(i);
}
// Queue section, to be created per the above assignment requirment
//
//
return 0;
}
please answer with C++ code thank you!
private: int theSize; Node *head.
Similar to sumOfSquaresimport java.util.;public class Arraylistoperation.pdf (20)
OrderTest.javapublic class OrderTest { Get an arra.pdf
OrderTest.javapublic class OrderTest { Get an arra.pdf
Data Structures and Agorithm: DS 02 Array List.pptx
Data Structures and Agorithm: DS 02 Array List.pptx
Hi, Please find my code##### Sequence.java ##############import.pdf
Hi, Please find my code##### Sequence.java ##############import.pdf
Labprogram.javaLinkedList.javaimport java.util.NoSuchElementEx.pdf
Labprogram.javaLinkedList.javaimport java.util.NoSuchElementEx.pdf
Write a program that uses the ArrayList class and populate it with a.docx
Write a program that uses the ArrayList class and populate it with a.docx
import java.util.ArrayList;public class Checkout{private.docx
import java.util.ArrayList;public class Checkout{private.docx
Hi, Please find my codeimport java.util.Random;public class Pro.pdf
Hi, Please find my codeimport java.util.Random;public class Pro.pdf
Lab_3- Objective- Experiment with Lists- Stacks- and Queues- Simulate.docx
Lab_3- Objective- Experiment with Lists- Stacks- and Queues- Simulate.docx
More from ankit482504
57. Howard Florey 58. Albert Schatz 59. Ernst Boris Chain - .pdf
57. Howard Florey
58. Albert Schatz
59. Ernst Boris Chain - worked with Howard Florey in demonstrating therapeutic potential of
penicillin
60. Therapeutic Index
Solution
57. Howard Florey
58. Albert Schatz
59. Ernst Boris Chain - worked with Howard Florey in demonstrating therapeutic potential of
penicillin
60. Therapeutic Index.
9The von Neumann equation for time evolution10Solution9T.pdf
9
The von Neumann equation for time evolution
10
Solution
9
The von Neumann equation for time evolution
10.
27. Microtubules- made of Tubulidentata and present in cytoplasm28.pdf
27. Microtubules- made of Tubulidentata and present in cytoplasm
28. Intermediate filaments- attachments with desmosones helps in adhering
29. Actin filaments- helps in contraction and muscle movement.
30. Micro tubules and intermediate filaments have the alpha helical proteins
31. Intermediate filaments- in skin and other epithelial cells
Solution
27. Microtubules- made of Tubulidentata and present in cytoplasm
28. Intermediate filaments- attachments with desmosones helps in adhering
29. Actin filaments- helps in contraction and muscle movement.
30. Micro tubules and intermediate filaments have the alpha helical proteins
31. Intermediate filaments- in skin and other epithelial cells.
Nature of the reports produced. Financial accounting reports tend to.pdf
Nature of the reports produced. Financial accounting reports tend to be general purpose. That is,
they contain financial information that will be useful for a broad range of users and decisions
rather than being specifically designed for the needs of a particular group or set of decisions.
Management accounting reports, on the other hand, are often for a specific purpose. They are
designed either with a particular decision in mind or for a particular manager. Level of detail.
Financial reports provide users with a broad overview of the performance and position of the
business for a period. As a result, information is aggregated and detail is often lost. Management
accounting reports, however, often provide managers with considerable detail to help them with
a particular operational decision. Regulations. Financial reports, for many businesses, are
subject to accounting regulations that try to ensure they are produced with standard content and
in a standard format. Law and accounting rule setters impose these regulations. Since
management accounting reports are for internal use only, there are no regulations from external
sources concerning the form and content of the reports. They can be designed to meet the needs
of particular managers. Reporting interval. For most businesses, financial accounting reports are
produced on an annual basis, though many large businesses produce half-yearly reports and a
few produce quarterly ones. Management accounting reports may be produced as frequently as
required by managers. In many businesses, managers are provided with certain reports on a
monthly, weekly or even daily basis, which allows them to check progress frequently. In
addition, special-purpose reports will be prepared when required (for example, to evaluate a
proposal to purchase a piece of machinery). Time horizon. Financial reports reflect the
performance and position of the business for the past period. In essence, they are backward
looking. Management accounting reports, on the other hand, often provide information
concerning future performance as well as past performance. It is an oversimplification, however,
to suggest that financial accounting reports never incorporate expectations concerning the future.
Occasionally, businesses will release projected information to other users in an attempt to raise
capital or to fight off unwanted takeover bids. Range and quality of information. Financial
accounting reports concentrate on information that can be quantified in monetary terms.
Management accounting also produces such reports, but is also more likely to produce reports
that contain information of a non-financial nature such as measures of physical quantities of
inventories (stocks) and output. Financial accounting places greater emphasis on the use of
objective, verifiable evidence when preparing reports. Management accounting reports may use
information that is less objective and verifiable, but they provide managers with the information
t.
1.5 Legal Labels in Verilog areSystem Verilog extends it and al.pdf
1.
5 Legal Labels in Verilog are:
System Verilog extends it and allows one to add named blocks to reserve word end and join.
Also SystemVerilog allows to add the LABLE or NAMED BLOCK before begin, fork as below.
1.\"MY NAMED_ BLOCK\":Begin
2..\"MY NAMED_ BLOCK\":End
3..\"MY NAMED_ BLOCK\":Fork
4..\"MY NAMED_ BLOCK\":Join
5..\"MY NAMED_ BLOCK\":Initial Begin
It is illegal to have both a label before a begin or fork and a block name after the begin or fork. A
label cannot appear before the end, join, join_any or join_none, as these keywords do not form a
statement.
2.Verilog Provides in-built primitives for basic gate and switch level modeling. Any circuit can
be modeled by using continuous assignment of gate and switch level primitives.
and (strong1, weak0)#(1,2) gate1(out, in1, in2);
This is an and gate with output \'out\' and two inputs in1 and in2. Strong1 and weak0 are
optional driving strengths and gate1 is optional instance name that can be used while debugging.
First parameter in the bracket is output and you can have any number of inputs after that. This is
how you use a 3 input and gate without instance name, delay and driving strengths:
3.verilog has built in primitives like gates,transmission gates,and switches.if we need complex
primitives then verilog provides UDP or simply user defined primitives using UDP we can
model:
1.Combinational Logic
2.Sequential Logic
Verilog has 2 primitives
1.User Defined primitives
2.HDL gate primitive
4.
UDP definitions are independent of modules; they are at the same level as module definitions in
the syntax hierarchy. They can appear anywhere in the source text, either before or after they are
used inside a module. They may not appear between the keywords module and endmodule.
User-Defined Primitives(UDP) :
5. Yes it is True
One of the advanced concepts in verilog
non synthesizable
single output many iput
consume very less memory
I/Os must be scalar (i.e. bit)
1) UDPs can take only scalar input terminals (1 bit). Multiple input terminals are permitted.
2) UDPs can have only one scalar output terminal (1 bit). The output terminal must
always appear first in the terminal list. Multiple output terminals are not allowed.
3) In the declarations section, the output terminal is declared with the keyword output. Since
sequential UDPs store state, the output terminal must also be declared as a reg.
4) The inputs are declared with the keyword input.
5) The state in a sequential UDP can be initialized with an ‘initial’ statement. This statement is
optional. A 1-bit value is assigned to the output, which is declared as reg.
6) The state table entries can contain values 0,1,or x . UDPs do not handle z values. Z values
passed to a UDP are treated x values.
7)UDPs are defined at the same level as modules. UDPs can not be defined inside modules.
They can be instantiated only inside modules. UDPs are instantiated exactly like
gate primitives.
8)UDPs do not support inout ports.
6
The module is the basic unit of hier.
Step1 Fe is oxidised ; its oxidation state change.pdf
Step1 Fe is oxidised ; its oxidation state changes from 0 to +2 Step2 Sb2S3 is being
reduced ; oxidation state of Sb changes from +3 to 0.
Solution
Step1 Fe is oxidised ; its oxidation state changes from 0 to +2 Step2 Sb2S3 is being
reduced ; oxidation state of Sb changes from +3 to 0..
The process of performing the procedure known as a Tracheostomy is c.pdf
The process of performing the procedure known as a Tracheostomy is considered as a utilitarian
surgical procedure of access.
Solution
The process of performing the procedure known as a Tracheostomy is considered as a utilitarian
surgical procedure of access..
The Nixon shockwas a series of economic measures undertaken by Unite.pdf
The Nixon shockwas a series of economic measures undertaken by United States President
Richard Nixon in 1971, the most significant of which was the unilateral cancellation of the direct
international convertibility of the United States dollar to gold.
At the time, the U.S. also had an unemployment rate of 6.1% (August 1971) and an inflation rate
of 5.84% (1971).
To combat these problems, relying heavily on the advice of the self-confident Connally, decided
to break up Bretton Woods by suspending the convertibility of the dollar into gold; freezing
wages and prices for 90 days to combat potential inflationary effects; and impose an import
surcharge of 10 percent, to prevent a run on the dollar, stabilize the US economy, and decrease
US unemployment and inflation rates.
The first order was for the gold window to be closed. Foreign governments could no longer
exchange their dollars for gold; in effect, the international monetary system turned into a fiat
one.
Shortly after the plan was implemented, the growth of employment and production in the United
States increased. Inflation was practically halted during the 90-day wage-price freeze but would
soon reappear as the monetary momentum in support of inflation had already begun.
Solution
The Nixon shockwas a series of economic measures undertaken by United States President
Richard Nixon in 1971, the most significant of which was the unilateral cancellation of the direct
international convertibility of the United States dollar to gold.
At the time, the U.S. also had an unemployment rate of 6.1% (August 1971) and an inflation rate
of 5.84% (1971).
To combat these problems, relying heavily on the advice of the self-confident Connally, decided
to break up Bretton Woods by suspending the convertibility of the dollar into gold; freezing
wages and prices for 90 days to combat potential inflationary effects; and impose an import
surcharge of 10 percent, to prevent a run on the dollar, stabilize the US economy, and decrease
US unemployment and inflation rates.
The first order was for the gold window to be closed. Foreign governments could no longer
exchange their dollars for gold; in effect, the international monetary system turned into a fiat
one.
Shortly after the plan was implemented, the growth of employment and production in the United
States increased. Inflation was practically halted during the 90-day wage-price freeze but would
soon reappear as the monetary momentum in support of inflation had already begun..
The IUPAC names of the above compounds areZ-4,5-dichloro pent-4-e.pdf
The IUPAC names of the above compounds are:
Z-4,5-dichloro pent-4-ene-2ol
2-butanol
2,4 pentane-diol
Solution
The IUPAC names of the above compounds are:
Z-4,5-dichloro pent-4-ene-2ol
2-butanol
2,4 pentane-diol.
Secant is 1cosineRangeof cosine is(-1,1)Secant function cannot .pdf
Secant is 1/cosine
Rangeof cosine is(-1,1)
Secant function cannot lie between (-1,1)
So -0.43 is not in the rqnge of secant function
Solution
Secant is 1/cosine
Rangeof cosine is(-1,1)
Secant function cannot lie between (-1,1)
So -0.43 is not in the rqnge of secant function.
Ro is the reproduction number. It gives the average number of people.pdf
Ro is the reproduction number. It gives the average number of people who will catch a diseae
from one person.
Ro = C * P * D
C = the number of contacts made by the infectious person per unit time (day, week, month, etc.)
P = chance of transmission per contact with the infectious person
D = the duration which an infected person remains infectious to others
Hence, RO = 1000 x 0.0002 x 3 = 0.6
Solution
Ro is the reproduction number. It gives the average number of people who will catch a diseae
from one person.
Ro = C * P * D
C = the number of contacts made by the infectious person per unit time (day, week, month, etc.)
P = chance of transmission per contact with the infectious person
D = the duration which an infected person remains infectious to others
Hence, RO = 1000 x 0.0002 x 3 = 0.6.
the salt bridge acts as a porous wall between the.pdf
the salt bridge acts as a porous wall between the electrolytes one can use graphite
sheets instead of that the air bubble occupies good enough space and limits the transfer of ions to
a good extent
Solution
the salt bridge acts as a porous wall between the electrolytes one can use graphite
sheets instead of that the air bubble occupies good enough space and limits the transfer of ions to
a good extent.
solution or homogeneous mixture Solution .pdf
solution or homogeneous mixture
Solution
solution or homogeneous mixture.
Look at the Periodic Table. Elements are more me.pdf
Look at the Periodic Table. Elements are more metallic as you go down a group.
The more metallic they are, the more ionic character they would have in a bond with Cl.
Solution
Look at the Periodic Table. Elements are more metallic as you go down a group.
The more metallic they are, the more ionic character they would have in a bond with Cl..
HOAc + NAOH = OAc- + H2O 0.1 0.03 0.07 0 0.03 pH .pdf
HOAc + NAOH = OAc- + H2O 0.1 0.03 0.07 0 0.03 pH =pKa + 0.03/0.07 = 4.75 +
0.4285 = 5.1785
Solution
HOAc + NAOH = OAc- + H2O 0.1 0.03 0.07 0 0.03 pH =pKa + 0.03/0.07 = 4.75 +
0.4285 = 5.1785.
CCl4 because it has for bond pairs and 0 lone pai.pdf
CCl4 because it has for bond pairs and 0 lone pairs n SP3 hybidization
Solution
CCl4 because it has for bond pairs and 0 lone pairs n SP3 hybidization.
C) each nitrogen has one nonbinding electron pair.pdf
C) each nitrogen has one nonbinding electron pair
Solution
C) each nitrogen has one nonbinding electron pair.
b.Ignore the fact that the orbitals for carbon an.pdf
b.Ignore the fact that the orbitals for carbon and oxygen are different. Combine the
orbitals to make new CO molecular orbitals.
Solution
b.Ignore the fact that the orbitals for carbon and oxygen are different. Combine the
orbitals to make new CO molecular orbitals..
More from ankit482504 (20)
57. Howard Florey 58. Albert Schatz 59. Ernst Boris Chain - .pdf
57. Howard Florey 58. Albert Schatz 59. Ernst Boris Chain - .pdf
9The von Neumann equation for time evolution10Solution9T.pdf
9The von Neumann equation for time evolution10Solution9T.pdf
27. Microtubules- made of Tubulidentata and present in cytoplasm28.pdf
27. Microtubules- made of Tubulidentata and present in cytoplasm28.pdf
Nature of the reports produced. Financial accounting reports tend to.pdf
Nature of the reports produced. Financial accounting reports tend to.pdf
1.5 Legal Labels in Verilog areSystem Verilog extends it and al.pdf
1.5 Legal Labels in Verilog areSystem Verilog extends it and al.pdf
Step1 Fe is oxidised ; its oxidation state change.pdf
Step1 Fe is oxidised ; its oxidation state change.pdf
The process of performing the procedure known as a Tracheostomy is c.pdf
The process of performing the procedure known as a Tracheostomy is c.pdf
The Nixon shockwas a series of economic measures undertaken by Unite.pdf
The Nixon shockwas a series of economic measures undertaken by Unite.pdf
The IUPAC names of the above compounds areZ-4,5-dichloro pent-4-e.pdf
The IUPAC names of the above compounds areZ-4,5-dichloro pent-4-e.pdf
Secant is 1cosineRangeof cosine is(-1,1)Secant function cannot .pdf
Secant is 1cosineRangeof cosine is(-1,1)Secant function cannot .pdf
Ro is the reproduction number. It gives the average number of people.pdf
Ro is the reproduction number. It gives the average number of people.pdf
the salt bridge acts as a porous wall between the.pdf
the salt bridge acts as a porous wall between the.pdf
Look at the Periodic Table. Elements are more me.pdf
Look at the Periodic Table. Elements are more me.pdf
HOAc + NAOH = OAc- + H2O 0.1 0.03 0.07 0 0.03 pH .pdf
HOAc + NAOH = OAc- + H2O 0.1 0.03 0.07 0 0.03 pH .pdf
CCl4 because it has for bond pairs and 0 lone pai.pdf
CCl4 because it has for bond pairs and 0 lone pai.pdf
C) each nitrogen has one nonbinding electron pair.pdf
C) each nitrogen has one nonbinding electron pair.pdf
b.Ignore the fact that the orbitals for carbon an.pdf
b.Ignore the fact that the orbitals for carbon an.pdf
Recently uploaded
The Roman Empire A Historical Colossus.pdf
The Roman Empire, a vast and enduring power, stands as one of history's most remarkable civilizations, leaving an indelible imprint on the world. It emerged from the Roman Republic, transitioning into an imperial powerhouse under the leadership of Augustus Caesar in 27 BCE. This transformation marked the beginning of an era defined by unprecedented territorial expansion, architectural marvels, and profound cultural influence.
The empire's roots lie in the city of Rome, founded, according to legend, by Romulus in 753 BCE. Over centuries, Rome evolved from a small settlement to a formidable republic, characterized by a complex political system with elected officials and checks on power. However, internal strife, class conflicts, and military ambitions paved the way for the end of the Republic. Julius Caesar’s dictatorship and subsequent assassination in 44 BCE created a power vacuum, leading to a civil war. Octavian, later Augustus, emerged victorious, heralding the Roman Empire’s birth.
Under Augustus, the empire experienced the Pax Romana, a 200-year period of relative peace and stability. Augustus reformed the military, established efficient administrative systems, and initiated grand construction projects. The empire's borders expanded, encompassing territories from Britain to Egypt and from Spain to the Euphrates. Roman legions, renowned for their discipline and engineering prowess, secured and maintained these vast territories, building roads, fortifications, and cities that facilitated control and integration.
The Roman Empire’s society was hierarchical, with a rigid class system. At the top were the patricians, wealthy elites who held significant political power. Below them were the plebeians, free citizens with limited political influence, and the vast numbers of slaves who formed the backbone of the economy. The family unit was central, governed by the paterfamilias, the male head who held absolute authority.
Culturally, the Romans were eclectic, absorbing and adapting elements from the civilizations they encountered, particularly the Greeks. Roman art, literature, and philosophy reflected this synthesis, creating a rich cultural tapestry. Latin, the Roman language, became the lingua franca of the Western world, influencing numerous modern languages.
Roman architecture and engineering achievements were monumental. They perfected the arch, vault, and dome, constructing enduring structures like the Colosseum, Pantheon, and aqueducts. These engineering marvels not only showcased Roman ingenuity but also served practical purposes, from public entertainment to water supply.
Synthetic Fiber Construction in lab .pptx
Synthetic fiber production is a fascinating and complex field that blends chemistry, engineering, and environmental science. By understanding these aspects, students can gain a comprehensive view of synthetic fiber production, its impact on society and the environment, and the potential for future innovations. Synthetic fibers play a crucial role in modern society, impacting various aspects of daily life, industry, and the environment. ynthetic fibers are integral to modern life, offering a range of benefits from cost-effectiveness and versatility to innovative applications and performance characteristics. While they pose environmental challenges, ongoing research and development aim to create more sustainable and eco-friendly alternatives. Understanding the importance of synthetic fibers helps in appreciating their role in the economy, industry, and daily life, while also emphasizing the need for sustainable practices and innovation.
ESC Beyond Borders _From EU to You_ InfoPack general.pdf
ESC Beyond Borders _From EU to You_ InfoPack general.pdfFundacja Rozwoju Społeczeństwa Przedsiębiorczego
Wolontariat grupowyStudents, digital devices and success - Andreas Schleicher - 27 May 2024..pptx
Andreas Schleicher presents at the OECD webinar ‘Digital devices in schools: detrimental distraction or secret to success?’ on 27 May 2024. The presentation was based on findings from PISA 2022 results and the webinar helped launch the PISA in Focus ‘Managing screen time: How to protect and equip students against distraction’ https://www.oecd-ilibrary.org/education/managing-screen-time_7c225af4-en and the OECD Education Policy Perspective ‘Students, digital devices and success’ can be found here - https://oe.cd/il/5yV
TESDA TM1 REVIEWER FOR NATIONAL ASSESSMENT WRITTEN AND ORAL QUESTIONS WITH A...
TESDA TM1 REVIEWER FOR NATIONAL ASSESSMENT WRITTEN AND ORAL QUESTIONS WITH ANSWERS.
The geography of Taylor Swift - some ideas
Geographical themes connected with Taylor Swift's ERAS tour - coming to the UK in June 2024
How to Split Bills in the Odoo 17 POS Module
Bills have a main role in point of sale procedure. It will help to track sales, handling payments and giving receipts to customers. Bill splitting also has an important role in POS. For example, If some friends come together for dinner and if they want to divide the bill then it is possible by POS bill splitting. This slide will show how to split bills in odoo 17 POS.
How libraries can support authors with open access requirements for UKRI fund...
How libraries can support authors with open access requirements for UKRI funded books
Wednesday 22 May 2024, 14:00-15:00.
The French Revolution Class 9 Study Material pdf free download
The French Revolution, which began in 1789, was a period of radical social and political upheaval in France. It marked the decline of absolute monarchies, the rise of secular and democratic republics, and the eventual rise of Napoleon Bonaparte. This revolutionary period is crucial in understanding the transition from feudalism to modernity in Europe.
For more information, visit-www.vavaclasses.com
Operation Blue Star - Saka Neela Tara
Operation “Blue Star” is the only event in the history of Independent India where the state went into war with its own people. Even after about 40 years it is not clear if it was culmination of states anger over people of the region, a political game of power or start of dictatorial chapter in the democratic setup.
The people of Punjab felt alienated from main stream due to denial of their just demands during a long democratic struggle since independence. As it happen all over the word, it led to militant struggle with great loss of lives of military, police and civilian personnel. Killing of Indira Gandhi and massacre of innocent Sikhs in Delhi and other India cities was also associated with this movement.
Sectors of the Indian Economy - Class 10 Study Notes pdf
The Indian economy is classified into different sectors to simplify the analysis and understanding of economic activities. For Class 10, it's essential to grasp the sectors of the Indian economy, understand their characteristics, and recognize their importance. This guide will provide detailed notes on the Sectors of the Indian Economy Class 10, using specific long-tail keywords to enhance comprehension.
For more information, visit-www.vavaclasses.com
Overview on Edible Vaccine: Pros & Cons with Mechanism
This ppt include the description of the edible vaccine i.e. a new concept over the traditional vaccine administered by injection.
Ethnobotany and Ethnopharmacology ......
Ethnobotany and Ethnopharmacology:
Ethnobotany in herbal drug evaluation,
Impact of Ethnobotany in traditional medicine,
New development in herbals,
Bio-prospecting tools for drug discovery,
Role of Ethnopharmacology in drug evaluation,
Reverse Pharmacology.
Home assignment II on Spectroscopy 2024 Answers.pdf
Answers to Home assignment on UV-Visible spectroscopy: Calculation of wavelength of UV-Visible absorption
1.4 modern child centered education - mahatma gandhi-2.pptx
Child centred education is an educational approach that priorities the interest, needs and abilities of the child in the learning process.
The Challenger.pdf DNHS Official Publication
Read| The latest issue of The Challenger is here! We are thrilled to announce that our school paper has qualified for the NATIONAL SCHOOLS PRESS CONFERENCE (NSPC) 2024. Thank you for your unwavering support and trust. Dive into the stories that made us stand out!
Recently uploaded (20)
ESC Beyond Borders _From EU to You_ InfoPack general.pdf
ESC Beyond Borders _From EU to You_ InfoPack general.pdf
Students, digital devices and success - Andreas Schleicher - 27 May 2024..pptx
Students, digital devices and success - Andreas Schleicher - 27 May 2024..pptx
TESDA TM1 REVIEWER FOR NATIONAL ASSESSMENT WRITTEN AND ORAL QUESTIONS WITH A...
TESDA TM1 REVIEWER FOR NATIONAL ASSESSMENT WRITTEN AND ORAL QUESTIONS WITH A...
How libraries can support authors with open access requirements for UKRI fund...
How libraries can support authors with open access requirements for UKRI fund...
The French Revolution Class 9 Study Material pdf free download
The French Revolution Class 9 Study Material pdf free download
Sectors of the Indian Economy - Class 10 Study Notes pdf
Sectors of the Indian Economy - Class 10 Study Notes pdf
Overview on Edible Vaccine: Pros & Cons with Mechanism
Overview on Edible Vaccine: Pros & Cons with Mechanism
Home assignment II on Spectroscopy 2024 Answers.pdf
Home assignment II on Spectroscopy 2024 Answers.pdf
1.4 modern child centered education - mahatma gandhi-2.pptx
1.4 modern child centered education - mahatma gandhi-2.pptx
sumOfSquaresimport java.util.;public class Arraylistoperation.pdf
- 1. sumOfSquares import java.util.*; public class Arraylistoperation { public static void main(String args[]) { ArrayList list = createSquaresList(10); printList(list); } public static ArrayList createSquaresList(int n) { ArrayList squares= new ArrayList<>(); double s = 0.0; for (double i = 0.0; i <= n-1; i++) { s = i*i; squares.add(s); } return squares; for(int i = 0; i < m.size(); i++) { s+= m.get(i); } return s; } } Like wise sumOfCubes Solution sumOfSquares
- 2. import java.util.*; public class Arraylistoperation { public static void main(String args[]) { ArrayList list = createSquaresList(10); printList(list); } public static ArrayList createSquaresList(int n) { ArrayList squares= new ArrayList<>(); double s = 0.0; for (double i = 0.0; i <= n-1; i++) { s = i*i; squares.add(s); } return squares; for(int i = 0; i < m.size(); i++) { s+= m.get(i); } return s; } } Like wise sumOfCubes