output and explain There is Mylist There is MyArrayList pa.pdf
•
0 likes•2 views
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.
Report
Share
Report
Share
Download to read offline
![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();](https://image.slidesharecdn.com/outputandexplainthereismylistthereismyarraylistpa-230318090451-2d6cd10f/85/output-and-explain-There-is-Mylist-There-is-MyArrayList-pa-pdf-1-320.jpg)
![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))](data:image/gif;base64,R0lGODlhAQABAIAAAAAAAP///yH5BAEAAAAALAAAAAABAAEAAAIBRAA7)
Recommended
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.
i am looking for help on the method AddSorted and the method Copy only.pdf
I am in need of homework help please. Thank you!
For this assignment grade you will evaluate the similarities and differences between the AHIMA
code of ethics and other health professionals. Overview: 1. Healthcare Information and
Management Systems Society (HIMSS) https://www.ehra.org/resource-library/ehr-codeconduct
2. American Academy of Professional Coders (AAPC) https://www. aapc.com/aboutus/code-of-
ethics.aspx 3. American Nurses Association (ANA) http://nursingworld.org/codeofethics 4.
American College of Healthcare Executives (ACHE) http://ache.org/ABT_ACHE/code.cfm 5.
National Association for Healthcare Quality (NAHQ) https://nahq.org/about/code-of-ethics To
do: "Number your page from 1 to 5. *Compare the AHIMA code of ethics with the other health
organizations above. "Formulate a closing statement..
Infinum Android Talks #20 - DiffUtil
We're taking a closer look into a new utility class from Android Support Library. It enables you to calculate the difference between two lists and output a list of update operations swiftly and with style. Presented by Željko Plesac from Infinum.
Favor composition over inheritance
A concrete example showing why composition is favored over inheritance.
SOURCE CODEimport java.util.Iterator;public class CircularLinke.pdf
SOURCE CODE:
import java.util.Iterator;
public class CircularLinkedList implements Iterable {
Node head , tail;
int size;
CircularLinkedList() {
head = null;
tail = null;
size = 0;
}
public boolean add(E e) {
Node ele = new Node(e);
ele.next = head;
if(head == null)
{
head = ele;
ele.next = head;
tail = head;
}
else
{
tail.next = ele;
tail = ele;
}
size++;
return true;
}
public boolean add(int index, E e){
Node ele = new Node(e);
Node ptr = head;
index = index - 1 ;
for (int i = 1; i < size - 1; i++)
{
if (i == index)
{
Node tmp = ptr.next;
ptr.next = ele;
ele.next = tmp;
break;
}
ptr = ptr.next;
}
size++ ;
return true;
}
private Node getNode(int index ) {
return null;
}
public E remove(int index) {
Node ret;
if (size == 1 && index == 1)
{
ret = head;
head = null;
tail = null;
size = 0;
return ret.getElement();
}
if (index == 1)
{
ret = head;
head = head.next;
tail.next = head;
size--;
return ret.getElement();
}
if (index == size)
{
Node s = head;
Node t = head;
while (s != tail)
{
t = s;
s = s.next;
}
ret = tail;
tail = head;
tail = t;
size --;
return ret.getElement();
}
Node ptr = head;
index = index - 1 ;
for (int i = 1; i < size - 1; i++)
{
if (i == index)
{
Node tmp = ptr.next;
tmp = tmp.next;
ptr.next = tmp;
break;
}
ptr = ptr.next;
}
size-- ;
return ptr.getElement();
}
public String toString()
{
Node current = head;
String result = \"\";
if(size == 0){
return \"\";
}
if(size == 1) {
return head.getElement().toString();
}
else{
do{
result = result + current.getElement().toString();
result = result + \" ==> \";
current = current.next;
} while(current != head);
}
return result;
}
public Iterator iterator() {
return new ListIterator();
}
private class ListIterator implements Iterator{
Node nextItem;
Node prev;
int index;
@SuppressWarnings(\"unchecked\")
public ListIterator(){
nextItem = (Node) head;
index = 0;
}
public boolean hasNext() {
return size != 0;
}
public E next() {
prev = nextItem;
nextItem = nextItem.next;
index = (index + 1) % size;
return prev.getElement();
}
public void remove() {
int target;
if(nextItem == head) {
target = size - 1;
} else{
target = index - 1;
index--;
}
CircularLinkedList.this.remove(target); //calls the above class
}
}
// Solve the problem in the main method
// The answer of n = 13, k = 2 is
// the 11th person in the ring (index 10)
public static void main(String[] args){
CircularLinkedList l = new CircularLinkedList();
int n=13;
int k=2;
for(int i=1;i<=n;i++)
l.add(Integer.valueOf(i));
int j = 13,i=0;
while(j>0)
{
System.out.println(l.toString());
i = i + k;
if(i>j)
i = k;
l.remove(i);
j--;
}
}
}
OUTPUT:
1 ==> 2 ==> 3 ==> 4 ==> 5 ==> 6 ==> 7 ==> 8 ==> 9 ==> 10 ==> 11 ==> 12 ==> 13 ==>
1 ==> 3 ==> 4 ==> 5 ==> 6 ==> 7 ==> 8 ==> 9 ==> 10 ==> 11 ==> 12 ==> 13 ==>
1 ==> 3 ==> 4 ==> 6 ==> 7 ==> 8 ==> 9 ==> 10 ==> 11 ==> 12 ==> 13 ==>
1 ==> 3 ==> 4 ==> 6 ==> 7 ==> 9 ==> 10 ==> 11 ==> 12 ==> 13 ==>
1 ==> 3 ==> 4 ==> 6 ==> 7 ==> 9 ==> 10 ==> 12 ==> 13 ==>
1 ==> 4 ==> 6 ==> 7 ==> 9 ==> 10 ==> 12 ==> 13 ==>
1 ==> 4.
I need help with this code working Create another project and add yo.pdf
I need help with this code working Create another project and add your jar file in this project. In
the main method of App class of this second project test your MyArrayList class. It is mandatory
to follow the instructions to get full credit. You need to perform the following actions. 1. Create
five strings, A1",,'B2",,'C3",'D4",'E5" 2. Save these Strings in your MyArrayList 3. Print a
message "Displaying List" 4. Display the list 5. Insert another String in your MyArrayList at
location 2 6. Print a message "Inserting Item" 7. Display the list 8. Remove String at location 0 9.
Print a message "Removing Item" 10. Display the list 11. Print a message "Setting a String" 12.
Set a new String in location 1 13. Display the list 14. Check whether "D4" is present in the list or
not, print an appropriate message 15. Find the index of "E5" in your list, print an appropriate
message 16. Print a message "Emptying List" 17. Empty the list 18. Print the size of the list
These steps check most of your MyArrayList functionality. I will also perform my own checks of
your code while grading. Deliverable: a. Copy the utils.jar file in your project folder. b. Make a
zip file of full project, not the src folder only or java files only. c. Submit the zip file. Grading
Rubric: The project is not submitted as required: 0 points
st.java J MyArrayList.java 2 J App.java 2 J MyFile.java 2 rc >J MyArrayList.java >q&
MyArrayList > get(int) public class MyArrayList implements MyList \{ Object [] obj = new
Object [1]; int size; public int size()\{ return size; \} public object get(int index) if (index <0
index >= size ){// throw new indexo return obj [index]; \} return index; // this should be deleted
after public void add (Object 0 ) \{ //if this test fails there is a space in the array. // it will pass
itself. if ( size == obj. length ){ Object [] obj2 = new 0 bject [obj. length 2]; for(int i=0;i<0bj.
length; i++){ obj2[i]=obj [i] ; \} obj=obj2; \} obj [ size ]=0; size++; \} public void add(int index,
Object o) \{ if(index > size || index <0 ) \{ throw new IndexOut0fBoundsException(index); \} if
(size == obj. length ){ Object [] obj2 = new Object [obj. length 2 ]; for(int i=0;i<0bj. length;
i++){ obj 2[i]=obj[i]; \} obj=obj2; \} if (index i=size;i>= index; i){ nhi [i=nhii1 : Ln 16, Col 56
Spaces: 4 UTF-8 LF \{\} Java
In this lab you will add an interface to the MyUtils project, and implement it in your
MyArrayList class in the MyUtils project. You will test the newly added functionality of your
MyArrayList class in another project. The UML for the Interface is as follows S Description of
methods Following method are self-explanatory: size(), get(int index), add (object o), remove
(int index), and isEmpty). Below is the description of all other methods. void add(int index,
Object o) inserts the given reference of object o at location index, making all entries move down
a spot. void remove (Object o) removes the first occurrence of object o in the list, moving all
entries .
Recommended
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.
i am looking for help on the method AddSorted and the method Copy only.pdf
I am in need of homework help please. Thank you!
For this assignment grade you will evaluate the similarities and differences between the AHIMA
code of ethics and other health professionals. Overview: 1. Healthcare Information and
Management Systems Society (HIMSS) https://www.ehra.org/resource-library/ehr-codeconduct
2. American Academy of Professional Coders (AAPC) https://www. aapc.com/aboutus/code-of-
ethics.aspx 3. American Nurses Association (ANA) http://nursingworld.org/codeofethics 4.
American College of Healthcare Executives (ACHE) http://ache.org/ABT_ACHE/code.cfm 5.
National Association for Healthcare Quality (NAHQ) https://nahq.org/about/code-of-ethics To
do: "Number your page from 1 to 5. *Compare the AHIMA code of ethics with the other health
organizations above. "Formulate a closing statement..
Infinum Android Talks #20 - DiffUtil
We're taking a closer look into a new utility class from Android Support Library. It enables you to calculate the difference between two lists and output a list of update operations swiftly and with style. Presented by Željko Plesac from Infinum.
Favor composition over inheritance
A concrete example showing why composition is favored over inheritance.
SOURCE CODEimport java.util.Iterator;public class CircularLinke.pdf
SOURCE CODE:
import java.util.Iterator;
public class CircularLinkedList implements Iterable {
Node head , tail;
int size;
CircularLinkedList() {
head = null;
tail = null;
size = 0;
}
public boolean add(E e) {
Node ele = new Node(e);
ele.next = head;
if(head == null)
{
head = ele;
ele.next = head;
tail = head;
}
else
{
tail.next = ele;
tail = ele;
}
size++;
return true;
}
public boolean add(int index, E e){
Node ele = new Node(e);
Node ptr = head;
index = index - 1 ;
for (int i = 1; i < size - 1; i++)
{
if (i == index)
{
Node tmp = ptr.next;
ptr.next = ele;
ele.next = tmp;
break;
}
ptr = ptr.next;
}
size++ ;
return true;
}
private Node getNode(int index ) {
return null;
}
public E remove(int index) {
Node ret;
if (size == 1 && index == 1)
{
ret = head;
head = null;
tail = null;
size = 0;
return ret.getElement();
}
if (index == 1)
{
ret = head;
head = head.next;
tail.next = head;
size--;
return ret.getElement();
}
if (index == size)
{
Node s = head;
Node t = head;
while (s != tail)
{
t = s;
s = s.next;
}
ret = tail;
tail = head;
tail = t;
size --;
return ret.getElement();
}
Node ptr = head;
index = index - 1 ;
for (int i = 1; i < size - 1; i++)
{
if (i == index)
{
Node tmp = ptr.next;
tmp = tmp.next;
ptr.next = tmp;
break;
}
ptr = ptr.next;
}
size-- ;
return ptr.getElement();
}
public String toString()
{
Node current = head;
String result = \"\";
if(size == 0){
return \"\";
}
if(size == 1) {
return head.getElement().toString();
}
else{
do{
result = result + current.getElement().toString();
result = result + \" ==> \";
current = current.next;
} while(current != head);
}
return result;
}
public Iterator iterator() {
return new ListIterator();
}
private class ListIterator implements Iterator{
Node nextItem;
Node prev;
int index;
@SuppressWarnings(\"unchecked\")
public ListIterator(){
nextItem = (Node) head;
index = 0;
}
public boolean hasNext() {
return size != 0;
}
public E next() {
prev = nextItem;
nextItem = nextItem.next;
index = (index + 1) % size;
return prev.getElement();
}
public void remove() {
int target;
if(nextItem == head) {
target = size - 1;
} else{
target = index - 1;
index--;
}
CircularLinkedList.this.remove(target); //calls the above class
}
}
// Solve the problem in the main method
// The answer of n = 13, k = 2 is
// the 11th person in the ring (index 10)
public static void main(String[] args){
CircularLinkedList l = new CircularLinkedList();
int n=13;
int k=2;
for(int i=1;i<=n;i++)
l.add(Integer.valueOf(i));
int j = 13,i=0;
while(j>0)
{
System.out.println(l.toString());
i = i + k;
if(i>j)
i = k;
l.remove(i);
j--;
}
}
}
OUTPUT:
1 ==> 2 ==> 3 ==> 4 ==> 5 ==> 6 ==> 7 ==> 8 ==> 9 ==> 10 ==> 11 ==> 12 ==> 13 ==>
1 ==> 3 ==> 4 ==> 5 ==> 6 ==> 7 ==> 8 ==> 9 ==> 10 ==> 11 ==> 12 ==> 13 ==>
1 ==> 3 ==> 4 ==> 6 ==> 7 ==> 8 ==> 9 ==> 10 ==> 11 ==> 12 ==> 13 ==>
1 ==> 3 ==> 4 ==> 6 ==> 7 ==> 9 ==> 10 ==> 11 ==> 12 ==> 13 ==>
1 ==> 3 ==> 4 ==> 6 ==> 7 ==> 9 ==> 10 ==> 12 ==> 13 ==>
1 ==> 4 ==> 6 ==> 7 ==> 9 ==> 10 ==> 12 ==> 13 ==>
1 ==> 4.
I need help with this code working Create another project and add yo.pdf
I need help with this code working Create another project and add your jar file in this project. In
the main method of App class of this second project test your MyArrayList class. It is mandatory
to follow the instructions to get full credit. You need to perform the following actions. 1. Create
five strings, A1",,'B2",,'C3",'D4",'E5" 2. Save these Strings in your MyArrayList 3. Print a
message "Displaying List" 4. Display the list 5. Insert another String in your MyArrayList at
location 2 6. Print a message "Inserting Item" 7. Display the list 8. Remove String at location 0 9.
Print a message "Removing Item" 10. Display the list 11. Print a message "Setting a String" 12.
Set a new String in location 1 13. Display the list 14. Check whether "D4" is present in the list or
not, print an appropriate message 15. Find the index of "E5" in your list, print an appropriate
message 16. Print a message "Emptying List" 17. Empty the list 18. Print the size of the list
These steps check most of your MyArrayList functionality. I will also perform my own checks of
your code while grading. Deliverable: a. Copy the utils.jar file in your project folder. b. Make a
zip file of full project, not the src folder only or java files only. c. Submit the zip file. Grading
Rubric: The project is not submitted as required: 0 points
st.java J MyArrayList.java 2 J App.java 2 J MyFile.java 2 rc >J MyArrayList.java >q&
MyArrayList > get(int) public class MyArrayList implements MyList \{ Object [] obj = new
Object [1]; int size; public int size()\{ return size; \} public object get(int index) if (index <0
index >= size ){// throw new indexo return obj [index]; \} return index; // this should be deleted
after public void add (Object 0 ) \{ //if this test fails there is a space in the array. // it will pass
itself. if ( size == obj. length ){ Object [] obj2 = new 0 bject [obj. length 2]; for(int i=0;i<0bj.
length; i++){ obj2[i]=obj [i] ; \} obj=obj2; \} obj [ size ]=0; size++; \} public void add(int index,
Object o) \{ if(index > size || index <0 ) \{ throw new IndexOut0fBoundsException(index); \} if
(size == obj. length ){ Object [] obj2 = new Object [obj. length 2 ]; for(int i=0;i<0bj. length;
i++){ obj 2[i]=obj[i]; \} obj=obj2; \} if (index i=size;i>= index; i){ nhi [i=nhii1 : Ln 16, Col 56
Spaces: 4 UTF-8 LF \{\} Java
In this lab you will add an interface to the MyUtils project, and implement it in your
MyArrayList class in the MyUtils project. You will test the newly added functionality of your
MyArrayList class in another project. The UML for the Interface is as follows S Description of
methods Following method are self-explanatory: size(), get(int index), add (object o), remove
(int index), and isEmpty). Below is the description of all other methods. void add(int index,
Object o) inserts the given reference of object o at location index, making all entries move down
a spot. void remove (Object o) removes the first occurrence of object o in the list, moving all
entries .
6. Generics. Collections. Streams
6.1 Generics
6.2 Коллекции
6.3 Функциональные интерфейсы
6.4 Stream API
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.
can you add a delete button and a add button to the below program. j.pdf
can you add a delete button and a add button to the below program. java fx
package nusoft;
public class Car {
private String make;
private String model;
private int year;
private String color;
public Car(String make, int year, String model, String color) {
this.make = make;
this.model = model;
this.year = year;
this.color = color;
}
public String getMake() {
return make;
}
public void setMake(String make) {
this.make = make;
}
public String getModel() {
return model;
}
public void setModel(String model) {
this.model = model;
}
public int getYear() {
return year;
}
public void setYear(int year) {
this.year = year;
}
public String getColor() {
return color;
}
public void setColor(String color) {
this.color = color;
}
@Override
public String toString() {
return year + " " + make + " " + model + " (" + color + ")";
}
}
package nusoft;
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.util.ArrayList;
import javafx.application.Application;
import javafx.geometry.Pos;
import javafx.scene.Scene;
import javafx.scene.control.Button;
import javafx.scene.control.Label;
import javafx.scene.layout.BorderPane;
import javafx.scene.layout.VBox;
import javafx.stage.Stage;
public class CarNavigator extends Application {
private ArrayList cars = new ArrayList<>();
private int currentIndex = 0;
@Override
public void start(Stage primaryStage) throws Exception {
readCarsFile();
Label carLabel = new Label();
carLabel.setAlignment(Pos.CENTER);
updateCarLabel(carLabel);
Button prevButton = new Button("Previous");
prevButton.setOnAction(e -> {
currentIndex--;
if (currentIndex < 0) {
currentIndex = cars.size() - 1;
}
updateCarLabel(carLabel);
});
Button nextButton = new Button("Next");
nextButton.setOnAction(e -> {
currentIndex++;
if (currentIndex >= cars.size()) {
currentIndex = 0;
}
updateCarLabel(carLabel);
});
VBox buttonBox = new VBox(10, prevButton, nextButton);
buttonBox.setAlignment(Pos.CENTER);
BorderPane root = new BorderPane(carLabel, null, null, buttonBox, null);
Scene scene = new Scene(root, 400, 200);
primaryStage.setScene(scene);
primaryStage.show();
}
private void readCarsFile() throws IOException {
BufferedReader reader = new BufferedReader(new FileReader("cars.txt"));
String line;
while ((line = reader.readLine()) != null) {
cars.add(line);
}
reader.close();
}
private void updateCarLabel(Label label) {
label.setText(cars.get(currentIndex));
}
public static void main(String[] args) {
launch(args);
}
}
package nusoft.utils;
import java.util.NoSuchElementException;
import nusoft.Car;
public class NuLinkedList {
private Node head;
private Node tail;
private int size;
private static class Node {
E element;
Node prev;
Node next;
Node(E element, Node prev, Node next) {
this.element = element;
this.prev = prev;
this.next = next;
}
}
public boolean contains(E e) {
return indexOf(e) != -1;
}
public E get(int index) {
if (index < 0 || index >= size) {
throw new IndexOutOfBoundsException();
}
return getNode(index).el.
Please use Java to solve the following So.pdf
Please use Java to solve the following :
Solution
import java.util.Arrays;
import java.util.NoSuchElementException;
public class TernaryPQ
{
private int heapSize;
private int[] heap;
public TernaryPQ ()
{
heapSize = 0;
heap = new int[10 + 1];
Arrays.fill(heap, -1);
}
public boolean isEmpty( )
{
return heapSize == 0;
}
public boolean isFull( )
{
return heapSize == heap.length;
}
public void clear( )
{
heapSize = 0;
}
public int parent(int i)
{
return (i - 1)/3;
}
public int kthChild(int i, int k)
{
return 3 * i + k;
}
/** Function to insert element */
public void insert(int x)
{
if (isFull( ) )
throw new NoSuchElementException(\"Overflow Exception\");
heap[heapSize++] = x;
heapifyUp(heapSize - 1);
}
public int findMax( )
{
if (isEmpty() )
throw new NoSuchElementException(\"Underflow Exception\");
return heap[0];
}
public int delete(int ind)
{
if (isEmpty() )
throw new NoSuchElementException(\"Underflow Exception\");
int keyItem = heap[ind];
heap[ind] = heap[heapSize - 1];
heapSize--;
heapifyDown(ind);
return keyItem;
}
/** Function heapifyUp **/
private void heapifyUp(int childInd)
{
int tmp = heap[childInd];
while (childInd > 0 && tmp > heap[parent(childInd)])
{
heap[childInd] = heap[ parent(childInd) ];
childInd = parent(childInd);
}
heap[childInd] = tmp;
}
/** Function heapifyDown **/
private void heapifyDown(int ind)
{
int child;
int tmp = heap[ ind ];
while (kthChild(ind, 1) < heapSize)
{
child = maxChild(ind);
if (heap[child] > tmp)
heap[ind] = heap[child];
else
break;
ind = child;
}
heap[ind] = tmp;
}
public int maxChild(int ind)
{
int bestChild = kthChild(ind, 1);
int k = 2;
int pos = kthChild(ind, k);
while ((k <= 3) && (pos < heapSize))
{
if (heap[pos] > heap[bestChild])
bestChild = pos;
pos = kthChild(ind, k++);
}
return bestChild;
}
public void printHeap()
{
System.out.print(\"\ Heap = \");
for (int i = 0; i < heapSize; i++)
System.out.print(heap[i] +\" \");
System.out.println();
}
public static void main(String[] args)
{
TernaryPQ myheap = new TernaryPQ( );
myheap.insert(1);
myheap.insert(2);
myheap.insert(3);
myheap.printHeap();
System.out.println(\"maximum element is \"+ myheap.findMax());
myheap.insert(4);
myheap.insert(5);
myheap.printHeap();
// extracting the maximam
myheap.delete(0);
myheap.printHeap();
System.out.println(\"maximum element is \"+ myheap.findMax());
}
}.
sumOfSquaresimport java.util.;public class Arraylistoperation.pdf
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.
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) .
import java-util-Iterator- import java-util-NoSuchElementException- im.pdf
import java.util.Iterator;
import java.util.NoSuchElementException;
import lab4.util.List;
public class SinglyLinkedList<E> implements List<E> {
@SuppressWarnings("hiding")
private class SinglyLinkedListIterator<E> implements Iterator<E>{
private Node<E> nextNode;
@SuppressWarnings("unchecked")
public SinglyLinkedListIterator() {
this.nextNode = (Node<E>) header.getNext();
}
@Override
public boolean hasNext() {
return nextNode != null;
}
@Override
public E next() {
if (this.hasNext()) {
E result = this.nextNode.getElement();
this.nextNode = this.nextNode.getNext();
return result;
}
else {
throw new NoSuchElementException();
}
}
}
private static class Node<E> {
private E element;
private Node<E> next;
public Node(E element, Node<E> next) {
super();
this.element = element;
this.next = next;
}
public Node() {
super();
}
public E getElement() {
return element;
}
public void setElement(E element) {
this.element = element;
}
public Node<E> getNext() {
return next;
}
public void setNext(Node<E> next) {
this.next = next;
}
}
private Node<E> header;
private int currentSize;
public SinglyLinkedList() {
this.header = new Node<>();
this.currentSize = 0;
}
@Override
public int size() {
return this.currentSize;
}
@Override
public boolean isEmpty() {
return this.size() == 0;
}
@Override
public boolean contains(E e) {
return this.firstIndexOf(e) >= 0;
}
@Override
public int firstIndexOf(E e) {
int i = 0;
for (Node<E> temp = this.header.getNext(); temp != null;
temp = temp.getNext(), ++i) {
if (temp.getElement().equals(e)) {
return i;
}
}
// not found
return -1;
}
@Override
public void add(E e) {
if (this.isEmpty()) {
this.header.setNext(new Node<E>(e, null));
this.currentSize++;
}
else {
Node<E>temp= this.header.getNext();
while (temp.getNext() != null) {
temp = temp.getNext();
}
Node<E> newNode = new Node<>(e, null);
temp.setNext(newNode);
this.currentSize++;
}
}
@Override
public void add(E e, int index) {
if ((index < 0) || (index > this.currentSize)) {
throw new IndexOutOfBoundsException();
}
if (index == this.currentSize) {
this.add(e);
}
else {
Node<E> temp = null;
if (index == 0) {
temp = this.header;
}
else {
temp = this.getPosition(index -1);
}
Node<E> newNode = new Node<>();
newNode.setElement(e);
newNode.setNext(temp.getNext());
temp.setNext(newNode);
this.currentSize++;
}
}
@Override
public E get(int position) {
if ((position < 0) || position >= this.currentSize) {
throw new IndexOutOfBoundsException();
}
Node<E> temp = this.getPosition(position);
return temp.getElement();
}
private Node<E> getPosition(int index){
int currentPosition=0;
Node<E> temp = this.header.getNext();
while(currentPosition != index) {
temp = temp.getNext();
currentPosition++;
}
return temp;
}
@Override
public boolean remove(int index) {
if ((index < 0) || (index >= this.currentSize)){
throw new IndexOutOfBoundsException();
}
else {
Node<E> temp = this.header;
int currentPosition =0;
Node<E> target = null;
while (currentPosition != index) {
temp = temp.getNext();
currentPosit.
Basic java, java collection Framework and Date Time API
Basic java, java collection Framework and Date Time API
Complete the class ArraySet1java which implements the SetA.pdf
Complete the class ArraySet-1.java which implements the SetADT.java interface. Implement only
the methods
public Set<E> union(Set<E> set)
public Set<E> intersection(Set<E> set)
ArraySet-1.java
public class ArraySet<E> implements Set<E>, Iterable<E> {
private static Random rand = new Random();
private final int DEFAULT_CAPACITY = 100;
private final int NOT_FOUND = -1;
private int count; // the current number of elements in the set
private E[] contents;
private int modCount;
public ArraySet() {
count = 0;
modCount = 0;
contents = (E[])(new Object[DEFAULT_CAPACITY]);
}
public ArraySet(int initialCapacity) {
count = 0;
contents = (E[])(new Object[initialCapacity]);
}
public boolean add(E element) {
boolean result = false;
if (!(contains(element))) {
if (size() == contents.length) {
expandCapacity();
}
contents[count] = element;
count += 1;
result = true;
}
modCount += 1;
return result;
}
public void addAll(Set<E> set) {
Iterator<E> scan = set.iterator();
while (scan.hasNext()) {
add (scan.next());
}
modCount += 1;
}
public E removeRandom() throws NoSuchElementException {
if (isEmpty()) {
throw new NoSuchElementException("ArraySet");
}
int choice = rand.nextInt(count);
E result = contents[choice];
contents[choice] = contents[count-1]; // fill the gap
contents[count-1] = null;
count--;
modCount += 1;
return result;
}
public E remove(E target) throws NoSuchElementException, NoSuchElementException {
int search = NOT_FOUND;
if (isEmpty()) {
throw new NoSuchElementException("ArraySet");
}
for (int index=0; index < count && search == NOT_FOUND; index += 1) {
if (contents[index].equals(target)) {
search = index;
}
}
if (search == NOT_FOUND) {
throw new NoSuchElementException();
}
E result = contents[search];
contents[search] = contents[count-1];
contents[count-1] = null;
count--;
modCount += 1;
return result;
}
public Set<E> union(Set<E> set) {
// Implement this method
return null; // Replace when implementinging this method
}
public Set<E> difference(Set<E> set) {
ArraySet<E> diff = new ArraySet<E>();
for (int index = 0; index < count; index += 1) {
if (!(set.contains(contents[index]))) {
diff.add (contents[index]);
}
}
return diff;
}
public Set<E> intersection(Set<E> set) {
// Implement this method
return null; // Replace when implmenting this method
}
public boolean contains (E target) {
int search = NOT_FOUND;
for (int index=0; index < count && search == NOT_FOUND; index += 1) {
if (contents[index].equals(target)) {
search = index;
}
}
return (search != NOT_FOUND);
}
public boolean equals(Set<E> set) {
boolean result = false;
ArraySet<E> temp1 = new ArraySet<E>();
ArraySet<E> temp2 = new ArraySet<E>();
E element;
if (size() == set.size()) {
temp1.addAll(this);
temp2.addAll(set);
Iterator<E> scan = set.iterator();
while (scan.hasNext()) {
element = scan.next();
if (temp1.contains(element)) {
temp1.remove(element);
temp2.remove(element);
}
}
result = (temp1.isEmpty() && temp2.isEmpty());
}
return result;
}
public boolean isEmpty() {
return (count == 0).
Kotlin for Android Developers - Victor Kropp - Codemotion Rome 2018
Kotlin is a programming language developed by JetBrains that targets multiple platforms including the JVM, JavaScript, and native binaries. A year ago it has been adopted as an officially supported language for Android development. Kotlin offers clean and concise syntax, interoperability, both object-oriented and functional code constructs, and a lot of other cool features with little or no overhead. Let's find out together why developers love this language and how it helps them to be productive and have fun!
Hi,I have added the methods and main class as per your requirement.pdf
Hi,
I have added the methods and main class as per your requirement. it is working fine now.
Highlighted the code changes.
MyLinkedListTest.java
public class MyLinkedListTest {
/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
MyLinkedList list = new MyLinkedList();
list.addFirst(\"AAAAA\");
list.add(\"1\");
list.add(\"2\");
list.add(\"3\");
list.addLast(\"ZZZZZ\");
System.out.println(\"Linked List Elements : \"+list.toString());
System.out.println(\"First element: \"+list.getFirst());
System.out.println(\"Second element: \"+list.getLast());
System.out.println(\"Removed First Element: \"+list.removeFirst());
System.out.println(\"Now Linked List Elements : \"+list.toString());
System.out.println(\"Removed Last Element: \"+list.removeLast());
System.out.println(\"Now Linked List Elements : \"+list.toString());
System.out.println(\"Removed all element: \");
list.removeAll();
System.out.println(\"Now Linked List Elements : \"+list.toString());
}
}
MyLinkedList.java
public class MyLinkedList extends MyAbstractList {
private Node head, tail;
/** Create a default list */
public MyLinkedList() {
}
/** Create a list from an array of objects */
public MyLinkedList(E[] objects) {
super(objects);
}
/** Return the head element in the list */
public E getFirst() {
if (size == 0) {
return null;
}
else {
return (E)head.element;
}
}
/** Return the last element in the list */
public E getLast() {
if (size == 0) {
return null;
}
else {
return (E)tail.element;
}
}
/** Add an element to the beginning of the list */
public void addFirst(E e) {
Node newNode = new Node(e); // Create a new node
newNode.next = head; // link the new node with the head
head = newNode; // head points to the new node
size++; // Increase list size
if (tail == null) // the new node is the only node in list
tail = head;
}
/** Add an element to the end of the list */
public void addLast(E e) {
Node newNode = new Node(e); // Create a new for element e
if (tail == null) {
head = tail = newNode; // The new node is the only node in list
}
else {
tail.next = newNode; // Link the new with the last node
tail = tail.next; // tail now points to the last node
}
size++; // Increase size
}
/** Add a new element at the specified index in this list
* The index of the head element is 0 */
public void add(int index, E e) {
if (index == 0) {
addFirst(e);
}
else if (index >= size) {
addLast(e);
}
else {
Node current = head;
for (int i = 1; i < index; i++) {
current = current.next;
}
Node temp = current.next;
current.next = new Node(e);
(current.next).next = temp;
size++;
}
}
/** Remove the head node and
* return the object that is contained in the removed node. */
public E removeFirst() {
if (size == 0) {
return null;
}
else {
Node temp = head;
head = head.next;
size--;
if (head == null) {
tail = null;
}
return (E)temp.element;
}
}
/** Remove all elements from list */
public void removeAll() {
while(true) {
if (size == 0) {
break;
}
else {
Node temp = head;
head =.
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.
Given below is the completed implementation of MyLinkedList class. O.pdf
Given below is the completed implementation of MyLinkedList class. Other classes are not
modified and remain same as in question - MyList, MyAbstractList, TestMyLinkedList.
The output of TestMyLinkedList is shown below. Please don\'t forget to rate the answer if it
helped. Thank you very much.
Since the MyList is not completely pasted in the question ... giving the complete class file below
MyList.java
public interface MyList> extends java.lang.Iterable
{
// Add a new element at the end of this list
public void add (E e);
// Add a new element at specified index in this list
public void add (int index, E e);
// Return true if this list contains the element
public boolean contains (E e);
// Return the element at the specified index
public E get (int index);
// Return the index of the first matching element
// Return -1 if no match.
public int indexOf (E e);
// Return the index of the last matching element
// Return -1 if no match.
public int lastIndexOf (E e);
E remove(int index);
void clear();
E set(int index, E e);
}
MyLinkedList.java
public class MyLinkedList> extends MyAbstractList
implements Comparable>
{
private Node head, tail; // head and tail pointers
// Create a default list
public MyLinkedList()
{
}
public int size()
{
return size;
}
// Need this for implementing Comparable
public int compareTo (MyLinkedList e)
{
return(size() - e.size());
}
// Create a list from an array of objects
public MyLinkedList (E[] objects)
{
super(objects); // Passes the array up to abstract parent
}
// Return the head element in the list
public E getFirst()
{
if (size == 0)
{
return null;
}
else
{
return head.element;
}
}
// Return the last element in the list
public E getLast()
{
if (size == 0)
{
return null;
}
else
{
return tail.element;
}
}
// Add an element to the beginning of the list
public void addFirst (E e)
{
// Create a new node for element e
Node newNode = new Node(e);
newNode.next = head; // link the new node with the head
head = newNode; // head points to the new node
size++; // Increase list size
if (tail == null) // new node is only node
{
tail = head;
}
}
// Add an element to the end of the list
public void addLast (E e)
{
// Create a new node for element e
Node newNode = new Node(e);
if (tail == null)
{
head = tail = newNode; // new node is only node
}
else
{
tail.next = newNode; // Link the new with the last node
tail = tail.next; // tail now points to the last node
}
size++; // Increase size
}
// Remove the head node and
// return the object from the removed node
public E removeFirst()
{
if (size == 0)
{
return null;
}
else
{
Node temp = head;
head = head.next;
size--;
if (head == null)
{
tail = null;
}
return temp.element;
}
}
// Remove the last node and return the object from it
public E removeLast()
{
if (size == 0)
{
return null;
}
else if (size == 1)
{
Node temp = head;
head = tail = null;
size = 0;
return temp.element;
}
else
{
Node current = head;
for (int i = 0; i < size - 2; i++)
{
current = current.next;
}
Node temp = tail;
tai.
package lab7 public class SetOperations public static.pdf
package lab7;
public class SetOperations {
public static int[] makeSet(int[] data) {
if (data == null) {
return null;
}
int[] result = new int[data.length];
int index = 0;
boolean found;
for (int i = 0; i < data.length; i++) {
found = false;
for (int j = 0; j < index; j++) {
if (data[i] == result[j]) {
found = true;
break;
}
}
if (!found) {
result[index++] = data[i];
}
}
int[] finalResult = new int[index];
System.arraycopy(result, 0, finalResult, 0, index);
return finalResult;
}
public static boolean isSet(int[] data) {
if (data == null) {
return false;
}
for (int i = 0; i < data.length; i++) {
for (int j = i + 1; j < data.length; j++) {
if (data[i] == data[j]) {
return false;
}
}
}
return true;
}
public static int[] union(int[] setA, int[] setB) {
if (!isSet(setA) || !isSet(setB)) {
throw new IllegalArgumentException("One of the input arrays is not a set");
}
int[] result = new int[setA.length + setB.length];
int index = 0;
for (int i = 0; i < setA.length; i++) {
result[index++] = setA[i];
}
boolean found;
for (int i = 0; i < setB.length; i++) {
found = false;
for (int j = 0; j < setA.length; j++) {
if (setB[i] == setA[j]) {
found = true;
break;
}
}
if (!found) {
result[index++] = setB[i];
}
}
int[] finalResult = new int[index];
System.arraycopy(result, 0, finalResult, 0, index);
return finalResult;
}
public static int[] intersection(int[] setA, int[] setB) {
if (!isSet(setA) || !isSet(setB)) {
throw new IllegalArgumentException("One of the input arrays is not a set");
}
int[] smallerSet, largerSet;
if (setA.length < setB.length) {
smallerSet = setA;
largerSet = setB;
} else {
smallerSet = setB;
largerSet = setA;
}
int[] result = new int[smallerSet.length];
int index = 0;
for (int i = 0; i < smallerSet.length; i++) {
for (int j = 0; j < largerSet.length; j++) {
if (smallerSet[i] == largerSet[j]) {
result[index++] = smallerSet[i];
break;
}
}
}
int[] finalResult = new int[index];
System.arraycopy(result, 0, finalResult, 0, index);
return finalResult;
}
public static int[] difference(int[] setA, int[] setB) {
if (!isSet(setA) || !isSet(setB)) {
throw new IllegalArgumentException("One of the input arrays is not a set");
}
int[] diff = new int[setA.length];
int index = 0;
for (int i = 0; i < setA.length; i++) {
boolean found = false;
for (int j = 0; j < setB.length; j++) {
if (setA[i] == setB[j]) {
found = true;
break;
}
}
if (!found) {
diff[index++] = setA[i];
}
}
int[] result = new int[index];
System.arraycopy(diff, 0, result, 0, index);
return result;
}
}
Lab 7: Set Operations with Arrays Grading and Submission You are to write a complete Java
program that meets the requirements outlined in the Lab 7 Tasks section. Push your code to
GitHub in the same way you've pushed previous Labs: - Your code should be in a class named
"SetOperations.java" and in a package named "lab7" - So, the path to your code should be:
"Labs/Lab07/src/lab7/SetOperations.java" There will be 6 points for this lab, broken down in the
following way: 1. makeSet is implement.
Please add-modify the following to the original code using C# 1- Delet.docx
Pick any employer in Canada and you should pick employers in your familiar area if possible.
1. Summarize the benefits offered by both organizations.
2. Summarise the employee eligibility for both packages.
3. Compare and contrast the benefit packages.
In your opinion, which benefit package is more attractive? Why?
.
JAVA Demonstrate the use of your APL in a PartB_Driver class by doing.docx
JAVA
Demonstrate the use of your APL in a PartB_Driver class by doing the following. Create a static method called removeConsecutiveDuplicates that removes any consecutive duplicate strings from an array positional list of Strings and returns the number of strings left after the removal. After calling the method, the positional list parameter should contain the same sequence of strings as before but with any consecutive duplicates removed. Illustrate your method using the following sets of strings and display the content of the list after executing the method.
NOTE: You MUST use a combination/variation of ALL the add and set methods (AddFirst, AddLast, AddBefore, AddAfter, and set) in creating one of the following original lists.
- harry ron tom tom tom hermione
- harry harry tom ron mary harry
- tom ron harry hermione mary
- mary mary tom james hermione hermione james harry harry harry
You MUST NOT use any other auxiliary data structure e.g., arrays in your implementation ofremoveConsecutiveDuplicates.
Sample Output (for last set of Strings)
Original positional list:
[0] mary [1] mary [2] tom [3] james [4] hermione [5] hermione [6] james [7] harry [8] harry [9] harry
APL.java
public class ArrayPositionalList<E> implements PositionalList<E> {
private static class ArrPos<E> implements Position<E> {
private int index;
private E element;
public ArrPos(E e, int i) {
index = i;
element = e;
}
public E getElement() throws IllegalStateException {
if (index == -1) {
throw new IllegalStateException("Position no longer valid");
}
return element;
}
public void setElement(E e) {
element = e;
}
public int getIndex() {
return index;
}
public void setIndex(int i) {
index = i;
}
}
public static final int CAPACITY = 16;
private ArrPos<E>[] data;
private int size = 0;
public ArrayPositionalList() {
this(CAPACITY);
}
public ArrayPositionalList(int capacity) {
data = (ArrPos<E>[]) new ArrPos[capacity];
}
@Override
public int size() {
return size;
}
@Override
public boolean isEmpty() {
return size == 0;
}
@Override
public Position first() {
if (!isEmpty())
return data[0];
return null;
}
@Override
public Position last() {
if (!isEmpty())
return data[size - 1];
return null;
}
@Override
public Position before(Position p) throws IllegalArgumentException {
if (p.getIndex() > 0 && p.getIndex() < size) {
return data[p.getIndex() - 1];
}
if (p.getIndex() == 0)
return null;
throw new IllegalArgumentException();
}
@Override
public Position after(Position p) throws IllegalArgumentException {
if (p.getIndex() >= 0 && p.getIndex() < size - 1) {
return data[p.getIndex() + 1];
}
if (p.getIndex() == size - 1)
return null;
throw new IllegalArgumentException();
}
@Override
public Position addFirst(E e) {
if (size < data.length) {
for (int i = size - 1; i >= 0; i--) {
data[i + 1] = data[i];
data[i + 1].setIndex(data[i + 1].getIndex() + 1);
}
data[0] = new ArrPos<E>(e, 0);
size++;
return data[0];
}
return null;
}
@Override
public Position addLast(E e) {
if (size < data.length) {
da.
The following stockholders equity accounts arranged alphabe.pdf
The following stockholders' equity accounts arranged alphabetically are in the ledger of Ivanhoe
Corporation at December 31,2022.itock tock it Stock Giodin Capital htal in Excess of Par-Prelerred
5 lock rital in Brcess of Stated Valuc Common Slock stal from Treasury Stodk 6000 ral Paid in
Capitarat Paid-in Capital in Capital eTextbook and Media Solution List of Accounts Attempts: 2 of
2 usedCompute the book value per share of the common stock. (Round answer to 2 decimal
places, e. 10.50.) Book value per share of the common stock.
You are considering a stock investment in one of two firms .pdf
You are considering a stock investment in one of two firms (AllDebt, Inc., and AllEquity, Inc.), both
of which operate in the same industry and have identical EBITDA of $16.4 million and operating
income of $9.0 million. AllDebt, Inc., finances its $50 million in assets with $49 million in debt (on
which it pays 10 percent interest annually) and $1 million in equity. AllEquity, Inc., finances its $50
million in assets with no debt and $50 million in equity. Both firms pay a tax rate of 21 percent on
their taxable income. Calculate the income available to pay the assetfunders investment(the debt
holders and stockholders) and resulting return on assets for the two firms. (Enter your dollar
answers in millions of dollars. Round all answers to 3 decimal places.).
More Related Content
Similar to output and explain There is Mylist There is MyArrayList pa.pdf
6. Generics. Collections. Streams
6.1 Generics
6.2 Коллекции
6.3 Функциональные интерфейсы
6.4 Stream API
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.
can you add a delete button and a add button to the below program. j.pdf
can you add a delete button and a add button to the below program. java fx
package nusoft;
public class Car {
private String make;
private String model;
private int year;
private String color;
public Car(String make, int year, String model, String color) {
this.make = make;
this.model = model;
this.year = year;
this.color = color;
}
public String getMake() {
return make;
}
public void setMake(String make) {
this.make = make;
}
public String getModel() {
return model;
}
public void setModel(String model) {
this.model = model;
}
public int getYear() {
return year;
}
public void setYear(int year) {
this.year = year;
}
public String getColor() {
return color;
}
public void setColor(String color) {
this.color = color;
}
@Override
public String toString() {
return year + " " + make + " " + model + " (" + color + ")";
}
}
package nusoft;
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.util.ArrayList;
import javafx.application.Application;
import javafx.geometry.Pos;
import javafx.scene.Scene;
import javafx.scene.control.Button;
import javafx.scene.control.Label;
import javafx.scene.layout.BorderPane;
import javafx.scene.layout.VBox;
import javafx.stage.Stage;
public class CarNavigator extends Application {
private ArrayList cars = new ArrayList<>();
private int currentIndex = 0;
@Override
public void start(Stage primaryStage) throws Exception {
readCarsFile();
Label carLabel = new Label();
carLabel.setAlignment(Pos.CENTER);
updateCarLabel(carLabel);
Button prevButton = new Button("Previous");
prevButton.setOnAction(e -> {
currentIndex--;
if (currentIndex < 0) {
currentIndex = cars.size() - 1;
}
updateCarLabel(carLabel);
});
Button nextButton = new Button("Next");
nextButton.setOnAction(e -> {
currentIndex++;
if (currentIndex >= cars.size()) {
currentIndex = 0;
}
updateCarLabel(carLabel);
});
VBox buttonBox = new VBox(10, prevButton, nextButton);
buttonBox.setAlignment(Pos.CENTER);
BorderPane root = new BorderPane(carLabel, null, null, buttonBox, null);
Scene scene = new Scene(root, 400, 200);
primaryStage.setScene(scene);
primaryStage.show();
}
private void readCarsFile() throws IOException {
BufferedReader reader = new BufferedReader(new FileReader("cars.txt"));
String line;
while ((line = reader.readLine()) != null) {
cars.add(line);
}
reader.close();
}
private void updateCarLabel(Label label) {
label.setText(cars.get(currentIndex));
}
public static void main(String[] args) {
launch(args);
}
}
package nusoft.utils;
import java.util.NoSuchElementException;
import nusoft.Car;
public class NuLinkedList {
private Node head;
private Node tail;
private int size;
private static class Node {
E element;
Node prev;
Node next;
Node(E element, Node prev, Node next) {
this.element = element;
this.prev = prev;
this.next = next;
}
}
public boolean contains(E e) {
return indexOf(e) != -1;
}
public E get(int index) {
if (index < 0 || index >= size) {
throw new IndexOutOfBoundsException();
}
return getNode(index).el.
Please use Java to solve the following So.pdf
Please use Java to solve the following :
Solution
import java.util.Arrays;
import java.util.NoSuchElementException;
public class TernaryPQ
{
private int heapSize;
private int[] heap;
public TernaryPQ ()
{
heapSize = 0;
heap = new int[10 + 1];
Arrays.fill(heap, -1);
}
public boolean isEmpty( )
{
return heapSize == 0;
}
public boolean isFull( )
{
return heapSize == heap.length;
}
public void clear( )
{
heapSize = 0;
}
public int parent(int i)
{
return (i - 1)/3;
}
public int kthChild(int i, int k)
{
return 3 * i + k;
}
/** Function to insert element */
public void insert(int x)
{
if (isFull( ) )
throw new NoSuchElementException(\"Overflow Exception\");
heap[heapSize++] = x;
heapifyUp(heapSize - 1);
}
public int findMax( )
{
if (isEmpty() )
throw new NoSuchElementException(\"Underflow Exception\");
return heap[0];
}
public int delete(int ind)
{
if (isEmpty() )
throw new NoSuchElementException(\"Underflow Exception\");
int keyItem = heap[ind];
heap[ind] = heap[heapSize - 1];
heapSize--;
heapifyDown(ind);
return keyItem;
}
/** Function heapifyUp **/
private void heapifyUp(int childInd)
{
int tmp = heap[childInd];
while (childInd > 0 && tmp > heap[parent(childInd)])
{
heap[childInd] = heap[ parent(childInd) ];
childInd = parent(childInd);
}
heap[childInd] = tmp;
}
/** Function heapifyDown **/
private void heapifyDown(int ind)
{
int child;
int tmp = heap[ ind ];
while (kthChild(ind, 1) < heapSize)
{
child = maxChild(ind);
if (heap[child] > tmp)
heap[ind] = heap[child];
else
break;
ind = child;
}
heap[ind] = tmp;
}
public int maxChild(int ind)
{
int bestChild = kthChild(ind, 1);
int k = 2;
int pos = kthChild(ind, k);
while ((k <= 3) && (pos < heapSize))
{
if (heap[pos] > heap[bestChild])
bestChild = pos;
pos = kthChild(ind, k++);
}
return bestChild;
}
public void printHeap()
{
System.out.print(\"\ Heap = \");
for (int i = 0; i < heapSize; i++)
System.out.print(heap[i] +\" \");
System.out.println();
}
public static void main(String[] args)
{
TernaryPQ myheap = new TernaryPQ( );
myheap.insert(1);
myheap.insert(2);
myheap.insert(3);
myheap.printHeap();
System.out.println(\"maximum element is \"+ myheap.findMax());
myheap.insert(4);
myheap.insert(5);
myheap.printHeap();
// extracting the maximam
myheap.delete(0);
myheap.printHeap();
System.out.println(\"maximum element is \"+ myheap.findMax());
}
}.
sumOfSquaresimport java.util.;public class Arraylistoperation.pdf
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.
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) .
import java-util-Iterator- import java-util-NoSuchElementException- im.pdf
import java.util.Iterator;
import java.util.NoSuchElementException;
import lab4.util.List;
public class SinglyLinkedList<E> implements List<E> {
@SuppressWarnings("hiding")
private class SinglyLinkedListIterator<E> implements Iterator<E>{
private Node<E> nextNode;
@SuppressWarnings("unchecked")
public SinglyLinkedListIterator() {
this.nextNode = (Node<E>) header.getNext();
}
@Override
public boolean hasNext() {
return nextNode != null;
}
@Override
public E next() {
if (this.hasNext()) {
E result = this.nextNode.getElement();
this.nextNode = this.nextNode.getNext();
return result;
}
else {
throw new NoSuchElementException();
}
}
}
private static class Node<E> {
private E element;
private Node<E> next;
public Node(E element, Node<E> next) {
super();
this.element = element;
this.next = next;
}
public Node() {
super();
}
public E getElement() {
return element;
}
public void setElement(E element) {
this.element = element;
}
public Node<E> getNext() {
return next;
}
public void setNext(Node<E> next) {
this.next = next;
}
}
private Node<E> header;
private int currentSize;
public SinglyLinkedList() {
this.header = new Node<>();
this.currentSize = 0;
}
@Override
public int size() {
return this.currentSize;
}
@Override
public boolean isEmpty() {
return this.size() == 0;
}
@Override
public boolean contains(E e) {
return this.firstIndexOf(e) >= 0;
}
@Override
public int firstIndexOf(E e) {
int i = 0;
for (Node<E> temp = this.header.getNext(); temp != null;
temp = temp.getNext(), ++i) {
if (temp.getElement().equals(e)) {
return i;
}
}
// not found
return -1;
}
@Override
public void add(E e) {
if (this.isEmpty()) {
this.header.setNext(new Node<E>(e, null));
this.currentSize++;
}
else {
Node<E>temp= this.header.getNext();
while (temp.getNext() != null) {
temp = temp.getNext();
}
Node<E> newNode = new Node<>(e, null);
temp.setNext(newNode);
this.currentSize++;
}
}
@Override
public void add(E e, int index) {
if ((index < 0) || (index > this.currentSize)) {
throw new IndexOutOfBoundsException();
}
if (index == this.currentSize) {
this.add(e);
}
else {
Node<E> temp = null;
if (index == 0) {
temp = this.header;
}
else {
temp = this.getPosition(index -1);
}
Node<E> newNode = new Node<>();
newNode.setElement(e);
newNode.setNext(temp.getNext());
temp.setNext(newNode);
this.currentSize++;
}
}
@Override
public E get(int position) {
if ((position < 0) || position >= this.currentSize) {
throw new IndexOutOfBoundsException();
}
Node<E> temp = this.getPosition(position);
return temp.getElement();
}
private Node<E> getPosition(int index){
int currentPosition=0;
Node<E> temp = this.header.getNext();
while(currentPosition != index) {
temp = temp.getNext();
currentPosition++;
}
return temp;
}
@Override
public boolean remove(int index) {
if ((index < 0) || (index >= this.currentSize)){
throw new IndexOutOfBoundsException();
}
else {
Node<E> temp = this.header;
int currentPosition =0;
Node<E> target = null;
while (currentPosition != index) {
temp = temp.getNext();
currentPosit.
Basic java, java collection Framework and Date Time API
Basic java, java collection Framework and Date Time API
Complete the class ArraySet1java which implements the SetA.pdf
Complete the class ArraySet-1.java which implements the SetADT.java interface. Implement only
the methods
public Set<E> union(Set<E> set)
public Set<E> intersection(Set<E> set)
ArraySet-1.java
public class ArraySet<E> implements Set<E>, Iterable<E> {
private static Random rand = new Random();
private final int DEFAULT_CAPACITY = 100;
private final int NOT_FOUND = -1;
private int count; // the current number of elements in the set
private E[] contents;
private int modCount;
public ArraySet() {
count = 0;
modCount = 0;
contents = (E[])(new Object[DEFAULT_CAPACITY]);
}
public ArraySet(int initialCapacity) {
count = 0;
contents = (E[])(new Object[initialCapacity]);
}
public boolean add(E element) {
boolean result = false;
if (!(contains(element))) {
if (size() == contents.length) {
expandCapacity();
}
contents[count] = element;
count += 1;
result = true;
}
modCount += 1;
return result;
}
public void addAll(Set<E> set) {
Iterator<E> scan = set.iterator();
while (scan.hasNext()) {
add (scan.next());
}
modCount += 1;
}
public E removeRandom() throws NoSuchElementException {
if (isEmpty()) {
throw new NoSuchElementException("ArraySet");
}
int choice = rand.nextInt(count);
E result = contents[choice];
contents[choice] = contents[count-1]; // fill the gap
contents[count-1] = null;
count--;
modCount += 1;
return result;
}
public E remove(E target) throws NoSuchElementException, NoSuchElementException {
int search = NOT_FOUND;
if (isEmpty()) {
throw new NoSuchElementException("ArraySet");
}
for (int index=0; index < count && search == NOT_FOUND; index += 1) {
if (contents[index].equals(target)) {
search = index;
}
}
if (search == NOT_FOUND) {
throw new NoSuchElementException();
}
E result = contents[search];
contents[search] = contents[count-1];
contents[count-1] = null;
count--;
modCount += 1;
return result;
}
public Set<E> union(Set<E> set) {
// Implement this method
return null; // Replace when implementinging this method
}
public Set<E> difference(Set<E> set) {
ArraySet<E> diff = new ArraySet<E>();
for (int index = 0; index < count; index += 1) {
if (!(set.contains(contents[index]))) {
diff.add (contents[index]);
}
}
return diff;
}
public Set<E> intersection(Set<E> set) {
// Implement this method
return null; // Replace when implmenting this method
}
public boolean contains (E target) {
int search = NOT_FOUND;
for (int index=0; index < count && search == NOT_FOUND; index += 1) {
if (contents[index].equals(target)) {
search = index;
}
}
return (search != NOT_FOUND);
}
public boolean equals(Set<E> set) {
boolean result = false;
ArraySet<E> temp1 = new ArraySet<E>();
ArraySet<E> temp2 = new ArraySet<E>();
E element;
if (size() == set.size()) {
temp1.addAll(this);
temp2.addAll(set);
Iterator<E> scan = set.iterator();
while (scan.hasNext()) {
element = scan.next();
if (temp1.contains(element)) {
temp1.remove(element);
temp2.remove(element);
}
}
result = (temp1.isEmpty() && temp2.isEmpty());
}
return result;
}
public boolean isEmpty() {
return (count == 0).
Kotlin for Android Developers - Victor Kropp - Codemotion Rome 2018
Kotlin is a programming language developed by JetBrains that targets multiple platforms including the JVM, JavaScript, and native binaries. A year ago it has been adopted as an officially supported language for Android development. Kotlin offers clean and concise syntax, interoperability, both object-oriented and functional code constructs, and a lot of other cool features with little or no overhead. Let's find out together why developers love this language and how it helps them to be productive and have fun!
Hi,I have added the methods and main class as per your requirement.pdf
Hi,
I have added the methods and main class as per your requirement. it is working fine now.
Highlighted the code changes.
MyLinkedListTest.java
public class MyLinkedListTest {
/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
MyLinkedList list = new MyLinkedList();
list.addFirst(\"AAAAA\");
list.add(\"1\");
list.add(\"2\");
list.add(\"3\");
list.addLast(\"ZZZZZ\");
System.out.println(\"Linked List Elements : \"+list.toString());
System.out.println(\"First element: \"+list.getFirst());
System.out.println(\"Second element: \"+list.getLast());
System.out.println(\"Removed First Element: \"+list.removeFirst());
System.out.println(\"Now Linked List Elements : \"+list.toString());
System.out.println(\"Removed Last Element: \"+list.removeLast());
System.out.println(\"Now Linked List Elements : \"+list.toString());
System.out.println(\"Removed all element: \");
list.removeAll();
System.out.println(\"Now Linked List Elements : \"+list.toString());
}
}
MyLinkedList.java
public class MyLinkedList extends MyAbstractList {
private Node head, tail;
/** Create a default list */
public MyLinkedList() {
}
/** Create a list from an array of objects */
public MyLinkedList(E[] objects) {
super(objects);
}
/** Return the head element in the list */
public E getFirst() {
if (size == 0) {
return null;
}
else {
return (E)head.element;
}
}
/** Return the last element in the list */
public E getLast() {
if (size == 0) {
return null;
}
else {
return (E)tail.element;
}
}
/** Add an element to the beginning of the list */
public void addFirst(E e) {
Node newNode = new Node(e); // Create a new node
newNode.next = head; // link the new node with the head
head = newNode; // head points to the new node
size++; // Increase list size
if (tail == null) // the new node is the only node in list
tail = head;
}
/** Add an element to the end of the list */
public void addLast(E e) {
Node newNode = new Node(e); // Create a new for element e
if (tail == null) {
head = tail = newNode; // The new node is the only node in list
}
else {
tail.next = newNode; // Link the new with the last node
tail = tail.next; // tail now points to the last node
}
size++; // Increase size
}
/** Add a new element at the specified index in this list
* The index of the head element is 0 */
public void add(int index, E e) {
if (index == 0) {
addFirst(e);
}
else if (index >= size) {
addLast(e);
}
else {
Node current = head;
for (int i = 1; i < index; i++) {
current = current.next;
}
Node temp = current.next;
current.next = new Node(e);
(current.next).next = temp;
size++;
}
}
/** Remove the head node and
* return the object that is contained in the removed node. */
public E removeFirst() {
if (size == 0) {
return null;
}
else {
Node temp = head;
head = head.next;
size--;
if (head == null) {
tail = null;
}
return (E)temp.element;
}
}
/** Remove all elements from list */
public void removeAll() {
while(true) {
if (size == 0) {
break;
}
else {
Node temp = head;
head =.
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.
Given below is the completed implementation of MyLinkedList class. O.pdf
Given below is the completed implementation of MyLinkedList class. Other classes are not
modified and remain same as in question - MyList, MyAbstractList, TestMyLinkedList.
The output of TestMyLinkedList is shown below. Please don\'t forget to rate the answer if it
helped. Thank you very much.
Since the MyList is not completely pasted in the question ... giving the complete class file below
MyList.java
public interface MyList> extends java.lang.Iterable
{
// Add a new element at the end of this list
public void add (E e);
// Add a new element at specified index in this list
public void add (int index, E e);
// Return true if this list contains the element
public boolean contains (E e);
// Return the element at the specified index
public E get (int index);
// Return the index of the first matching element
// Return -1 if no match.
public int indexOf (E e);
// Return the index of the last matching element
// Return -1 if no match.
public int lastIndexOf (E e);
E remove(int index);
void clear();
E set(int index, E e);
}
MyLinkedList.java
public class MyLinkedList> extends MyAbstractList
implements Comparable>
{
private Node head, tail; // head and tail pointers
// Create a default list
public MyLinkedList()
{
}
public int size()
{
return size;
}
// Need this for implementing Comparable
public int compareTo (MyLinkedList e)
{
return(size() - e.size());
}
// Create a list from an array of objects
public MyLinkedList (E[] objects)
{
super(objects); // Passes the array up to abstract parent
}
// Return the head element in the list
public E getFirst()
{
if (size == 0)
{
return null;
}
else
{
return head.element;
}
}
// Return the last element in the list
public E getLast()
{
if (size == 0)
{
return null;
}
else
{
return tail.element;
}
}
// Add an element to the beginning of the list
public void addFirst (E e)
{
// Create a new node for element e
Node newNode = new Node(e);
newNode.next = head; // link the new node with the head
head = newNode; // head points to the new node
size++; // Increase list size
if (tail == null) // new node is only node
{
tail = head;
}
}
// Add an element to the end of the list
public void addLast (E e)
{
// Create a new node for element e
Node newNode = new Node(e);
if (tail == null)
{
head = tail = newNode; // new node is only node
}
else
{
tail.next = newNode; // Link the new with the last node
tail = tail.next; // tail now points to the last node
}
size++; // Increase size
}
// Remove the head node and
// return the object from the removed node
public E removeFirst()
{
if (size == 0)
{
return null;
}
else
{
Node temp = head;
head = head.next;
size--;
if (head == null)
{
tail = null;
}
return temp.element;
}
}
// Remove the last node and return the object from it
public E removeLast()
{
if (size == 0)
{
return null;
}
else if (size == 1)
{
Node temp = head;
head = tail = null;
size = 0;
return temp.element;
}
else
{
Node current = head;
for (int i = 0; i < size - 2; i++)
{
current = current.next;
}
Node temp = tail;
tai.
package lab7 public class SetOperations public static.pdf
package lab7;
public class SetOperations {
public static int[] makeSet(int[] data) {
if (data == null) {
return null;
}
int[] result = new int[data.length];
int index = 0;
boolean found;
for (int i = 0; i < data.length; i++) {
found = false;
for (int j = 0; j < index; j++) {
if (data[i] == result[j]) {
found = true;
break;
}
}
if (!found) {
result[index++] = data[i];
}
}
int[] finalResult = new int[index];
System.arraycopy(result, 0, finalResult, 0, index);
return finalResult;
}
public static boolean isSet(int[] data) {
if (data == null) {
return false;
}
for (int i = 0; i < data.length; i++) {
for (int j = i + 1; j < data.length; j++) {
if (data[i] == data[j]) {
return false;
}
}
}
return true;
}
public static int[] union(int[] setA, int[] setB) {
if (!isSet(setA) || !isSet(setB)) {
throw new IllegalArgumentException("One of the input arrays is not a set");
}
int[] result = new int[setA.length + setB.length];
int index = 0;
for (int i = 0; i < setA.length; i++) {
result[index++] = setA[i];
}
boolean found;
for (int i = 0; i < setB.length; i++) {
found = false;
for (int j = 0; j < setA.length; j++) {
if (setB[i] == setA[j]) {
found = true;
break;
}
}
if (!found) {
result[index++] = setB[i];
}
}
int[] finalResult = new int[index];
System.arraycopy(result, 0, finalResult, 0, index);
return finalResult;
}
public static int[] intersection(int[] setA, int[] setB) {
if (!isSet(setA) || !isSet(setB)) {
throw new IllegalArgumentException("One of the input arrays is not a set");
}
int[] smallerSet, largerSet;
if (setA.length < setB.length) {
smallerSet = setA;
largerSet = setB;
} else {
smallerSet = setB;
largerSet = setA;
}
int[] result = new int[smallerSet.length];
int index = 0;
for (int i = 0; i < smallerSet.length; i++) {
for (int j = 0; j < largerSet.length; j++) {
if (smallerSet[i] == largerSet[j]) {
result[index++] = smallerSet[i];
break;
}
}
}
int[] finalResult = new int[index];
System.arraycopy(result, 0, finalResult, 0, index);
return finalResult;
}
public static int[] difference(int[] setA, int[] setB) {
if (!isSet(setA) || !isSet(setB)) {
throw new IllegalArgumentException("One of the input arrays is not a set");
}
int[] diff = new int[setA.length];
int index = 0;
for (int i = 0; i < setA.length; i++) {
boolean found = false;
for (int j = 0; j < setB.length; j++) {
if (setA[i] == setB[j]) {
found = true;
break;
}
}
if (!found) {
diff[index++] = setA[i];
}
}
int[] result = new int[index];
System.arraycopy(diff, 0, result, 0, index);
return result;
}
}
Lab 7: Set Operations with Arrays Grading and Submission You are to write a complete Java
program that meets the requirements outlined in the Lab 7 Tasks section. Push your code to
GitHub in the same way you've pushed previous Labs: - Your code should be in a class named
"SetOperations.java" and in a package named "lab7" - So, the path to your code should be:
"Labs/Lab07/src/lab7/SetOperations.java" There will be 6 points for this lab, broken down in the
following way: 1. makeSet is implement.
Please add-modify the following to the original code using C# 1- Delet.docx
Pick any employer in Canada and you should pick employers in your familiar area if possible.
1. Summarize the benefits offered by both organizations.
2. Summarise the employee eligibility for both packages.
3. Compare and contrast the benefit packages.
In your opinion, which benefit package is more attractive? Why?
.
JAVA Demonstrate the use of your APL in a PartB_Driver class by doing.docx
JAVA
Demonstrate the use of your APL in a PartB_Driver class by doing the following. Create a static method called removeConsecutiveDuplicates that removes any consecutive duplicate strings from an array positional list of Strings and returns the number of strings left after the removal. After calling the method, the positional list parameter should contain the same sequence of strings as before but with any consecutive duplicates removed. Illustrate your method using the following sets of strings and display the content of the list after executing the method.
NOTE: You MUST use a combination/variation of ALL the add and set methods (AddFirst, AddLast, AddBefore, AddAfter, and set) in creating one of the following original lists.
- harry ron tom tom tom hermione
- harry harry tom ron mary harry
- tom ron harry hermione mary
- mary mary tom james hermione hermione james harry harry harry
You MUST NOT use any other auxiliary data structure e.g., arrays in your implementation ofremoveConsecutiveDuplicates.
Sample Output (for last set of Strings)
Original positional list:
[0] mary [1] mary [2] tom [3] james [4] hermione [5] hermione [6] james [7] harry [8] harry [9] harry
APL.java
public class ArrayPositionalList<E> implements PositionalList<E> {
private static class ArrPos<E> implements Position<E> {
private int index;
private E element;
public ArrPos(E e, int i) {
index = i;
element = e;
}
public E getElement() throws IllegalStateException {
if (index == -1) {
throw new IllegalStateException("Position no longer valid");
}
return element;
}
public void setElement(E e) {
element = e;
}
public int getIndex() {
return index;
}
public void setIndex(int i) {
index = i;
}
}
public static final int CAPACITY = 16;
private ArrPos<E>[] data;
private int size = 0;
public ArrayPositionalList() {
this(CAPACITY);
}
public ArrayPositionalList(int capacity) {
data = (ArrPos<E>[]) new ArrPos[capacity];
}
@Override
public int size() {
return size;
}
@Override
public boolean isEmpty() {
return size == 0;
}
@Override
public Position first() {
if (!isEmpty())
return data[0];
return null;
}
@Override
public Position last() {
if (!isEmpty())
return data[size - 1];
return null;
}
@Override
public Position before(Position p) throws IllegalArgumentException {
if (p.getIndex() > 0 && p.getIndex() < size) {
return data[p.getIndex() - 1];
}
if (p.getIndex() == 0)
return null;
throw new IllegalArgumentException();
}
@Override
public Position after(Position p) throws IllegalArgumentException {
if (p.getIndex() >= 0 && p.getIndex() < size - 1) {
return data[p.getIndex() + 1];
}
if (p.getIndex() == size - 1)
return null;
throw new IllegalArgumentException();
}
@Override
public Position addFirst(E e) {
if (size < data.length) {
for (int i = size - 1; i >= 0; i--) {
data[i + 1] = data[i];
data[i + 1].setIndex(data[i + 1].getIndex() + 1);
}
data[0] = new ArrPos<E>(e, 0);
size++;
return data[0];
}
return null;
}
@Override
public Position addLast(E e) {
if (size < data.length) {
da.
Similar to output and explain There is Mylist There is MyArrayList pa.pdf (20)
can you add a delete button and a add button to the below program. j.pdf
can you add a delete button and a add button to the below program. j.pdf
sumOfSquaresimport java.util.;public class Arraylistoperation.pdf
sumOfSquaresimport java.util.;public class Arraylistoperation.pdf
OrderTest.javapublic class OrderTest { Get an arra.pdf
OrderTest.javapublic class OrderTest { Get an arra.pdf
import java-util-Iterator- import java-util-NoSuchElementException- im.pdf
import java-util-Iterator- import java-util-NoSuchElementException- im.pdf
Basic java, java collection Framework and Date Time API
Basic java, java collection Framework and Date Time API
Complete the class ArraySet1java which implements the SetA.pdf
Complete the class ArraySet1java which implements the SetA.pdf
collectionframework-141116005344-conversion-gate01.pptx
collectionframework-141116005344-conversion-gate01.pptx
Kotlin for Android Developers - Victor Kropp - Codemotion Rome 2018
Kotlin for Android Developers - Victor Kropp - Codemotion Rome 2018
Hi,I have added the methods and main class as per your requirement.pdf
Hi,I have added the methods and main class as per your requirement.pdf
Create a new java class called ListNode. Implement ListNode as a gen.pdf
Create a new java class called ListNode. Implement ListNode as a gen.pdf
Given below is the completed implementation of MyLinkedList class. O.pdf
Given below is the completed implementation of MyLinkedList class. O.pdf
package lab7 public class SetOperations public static.pdf
package lab7 public class SetOperations public static.pdf
Please add-modify the following to the original code using C# 1- Delet.docx
Please add-modify the following to the original code using C# 1- Delet.docx
JAVA Demonstrate the use of your APL in a PartB_Driver class by doing.docx
JAVA Demonstrate the use of your APL in a PartB_Driver class by doing.docx
More from access2future1
The following stockholders equity accounts arranged alphabe.pdf
The following stockholders' equity accounts arranged alphabetically are in the ledger of Ivanhoe
Corporation at December 31,2022.itock tock it Stock Giodin Capital htal in Excess of Par-Prelerred
5 lock rital in Brcess of Stated Valuc Common Slock stal from Treasury Stodk 6000 ral Paid in
Capitarat Paid-in Capital in Capital eTextbook and Media Solution List of Accounts Attempts: 2 of
2 usedCompute the book value per share of the common stock. (Round answer to 2 decimal
places, e. 10.50.) Book value per share of the common stock.
You are considering a stock investment in one of two firms .pdf
You are considering a stock investment in one of two firms (AllDebt, Inc., and AllEquity, Inc.), both
of which operate in the same industry and have identical EBITDA of $16.4 million and operating
income of $9.0 million. AllDebt, Inc., finances its $50 million in assets with $49 million in debt (on
which it pays 10 percent interest annually) and $1 million in equity. AllEquity, Inc., finances its $50
million in assets with no debt and $50 million in equity. Both firms pay a tax rate of 21 percent on
their taxable income. Calculate the income available to pay the assetfunders investment(the debt
holders and stockholders) and resulting return on assets for the two firms. (Enter your dollar
answers in millions of dollars. Round all answers to 3 decimal places.).
The Case of Sam Sawyer Sam Sawyer was a toprated operator i.pdf
The Case of Sam Sawyer Sam Sawyer was a top-rated operator in a building where a material wirl
caustic soda was processed. The five stages of the process were loeated on five separate floces.
Operators moved the material in open buggies from the firs stage to a chute in the floor and
dumped it onto equipment on the floor below, where the next stage began. Because of the
corrosive nature of the material, close-fitting goggles were provided. Until a year earlier, safety
rules had required that goggles be worn only when removing material from equipment, because
that was when the greates possibility of injury existed. Their use at other times was up to the
discretion of each operator. At two stages in the process, thotgh, the material was light and fluffy,
and occasional backdrafts through the chutes caused it to fly. After this had resulted in three cases
of Chapter 10 How w Obtain and Marage. Human Resourses and Diversity in Small Compumics
275 eye irritations, the rules were changed, and operators were required to wear goggles
whenever they were near exposed material. Dave Watts, supervisor of operaticns for two years,
had worked on all stages of the operation his first year out of engineering school. He had gotien
along well with the men, was grateful to them for teaching him the "tricks of the trade," and might
have been tempted to be lenient with them. Watts's boss, however, was very safety minded and
insisted that safety rules be followed to the letter. Sam Sawyer, who had worked on the operation
for 20 years, was an outstanding operator and was looked up to by his fellow workers. His safety
recond was one of the best in the plant, as he had had only one minor injury in all his years of
service. When the new safety rule went into effect. Dave was bothered because everyone went
along with it except Sam, who contended that it was unnecessary to wear goggles except when
unloading equipment. This caused problems for Dave. because the others followed Sam's
example. After much discussion, however. Sam agreed to go aloog with the rule. Dave had a
strong feeling that Sam was complying with the rule only while he was around. On half a dozen
occasions he thought Sam had put on the goggles just as he came on the floor. Before the rule
change, Sam had worn the goggles around his neckwhen they were not needed, but he had
recently started wearing them pushed up on his forehead. Dave's doubts were confirmed today
when he came on Sam unexpectedly and saw him bob his head to shift the goggles from his
forehead to his eyes. Questions 1. What does the case show about the need for management
emphasis on safety? 2. How can you explain the workers' lack of interest in their own sufety? 3.
What would you do if you were the supervisor? 4. How would you explain it to an OSHA
inspector? 5. What does this case illustrate about the role of informal leaders? Source: Prepared
by Bruce Gunn. Flonida State Univenity. Used with permisuion..
Second Republic Bank is a lending company that operates in t.pdf
Second Republic Bank is a lending company that operates in the Southeastern United States.
Current economic conditions have kept lending rates low, which limits the revenue potential for
Second Republic. The bank manager, Vivian Caldwell is concerned about understanding and then
controlling costs, and she decided to try out time-driven ABC. As a pilot, she decided to focus on
understanding the cost of taking a customer's loan application. Vivian knew that it took longer to
collect applicant information for a mortgage than it did for other types of loans, like auto loans or
unsecured loans, but did not know the cost differences, so she collected the following information
from a regional branch office. There are two loan application specialists, each earning $55,000 per
year. Vivian determined that fringe benefits average 30% of salary and that the office support
costs for an employee (computer, office space, etc) in that regional branch averaged $5,300 per
employee. Factoring in time off for vacations, time spent on training, and other required tasks,
each of the application specialists had 1,600 hours available to collect applicant information.
Required: 1. Determine the cost per minute avallable to collect loan applicant information: 2.
Determine the average TDABC cost of collecting applicant information for each of the three types
of loans. Complete this question by entering your answers in the tabs below. Determine the cost
per minute available to collect loan applicant information. (Round your answers to 4 decimat
piaces.)Second Republic Bank is a lending company that operates in the Southeastern United
States. Current economic conditions have kept lending rates low, which limits the revenue
potential for Second Republic. The bank manager, Vivian Caldwell is concerned about
understanding and then controlling costs, and she decided to try out time-driven ABC. As a pilot,
she decided to focus on understanding the cost of taking a customer's loan application. Vivian
knew that it took longer to collect applicant information for a mortgage than it did for other types of
loans, like auto loans or unsecured loans, but did not know the cost differences, so she collected
the following information from a regional branch office. There are two loan application specialists,
each earning $55,000 per year. Vivian determined that fringe benefits average 305 of salary and
that the office support costs for an employee (computer, office space, etc) in that regional branch
averaged $5,300 per employee. Factoring in time off for vacations, time spent on training, and
other required tasks, each of the application specialists had 1,600 hours avaliable to collect
applicant information. Required: 1. Determine the cost per minute available to collect loan
applicant information: 2. Determine the average TDABC cost of collecting applicant information for
each of the three types of loans., Complete this question by entering your answers in the tabs
below. Determine t.
Researchers found that a person in a particular country spen.pdf
Researchers found that a person in a particular country spent an average of 5.7 hours a day
watching TV in 2010. Assume the population standard deviation is 1.8 hours per day. A sample of
38 people averaged 6.4 hours of television viewing per day. Does this result support the findings
of the study? zx= (Round to two decimal places as needed.).
QUESTION 2 internal rate of return method 14 RETURN USE N.pdf
QUESTION 2 internal rate of return method 14% RETURN - USE NPV I RR PV=QPVoqoutFlows=
PVofoutflowDECISIONTRULE:IRRRPREQUIREDRETURN=YES15%>10%NPV=+
IRR<REQUIREDRETURN=NONPV = - IRR REQUIRED RETURN = YES PV OF INFLOWS =
$282,500 USE NPV=0 A%>10% REQUIRED RETURN IS THE MINIMUM RATE OF RETURN
THE PROJEC MUST GENERATE TO BE ACCEPTABLE. 1. USE A FINANCIAL CALCULATOR
2. TRIAL AND ERROR PV OF OUTFLOW =$282,500 PV OF INFLOWS =$368,468 USE 10%.
evaluate an investment project that has uncertain cash flows. rank investment projects in order of
preference..
Question 17 Which of the following contributes directly to t.pdf
Question 17 Which of the following contributes directly to the generation of a hypertonic medullary
interstitium in the kidney? Answers A - E A Active H2O reabsorption in the ascending limb of the
loop of Henle B Active Na transport into the lumen of the descending limb of the loop of Henlo C.
Water reabsorption in the cortical collecting duct D Active Na reabsorption in the distal convoluted
tubule E Urea reabsorption from the inner medullary collecting duct.
Proporcione ejemplos de cmo Chris y Alison participaron en .pdf
Proporcione ejemplos de cmo Chris y Alison participaron en cada uno de los ocho tipos de
desconexin moral.
Justificacin moral: enmarcar actos dainos o moralmente incorrectos al servicio de un bien mayor.
Etiquetado eufemstico: Usar un lenguaje agradable para renombrar actos dainos o ticamente
incorrectos para que parezcan ms benignos.
Comparacin ventajosa: utiliza el contraste entre un comportamiento y otro an ms reprobable para
hacer que el primero parezca inocuo.
Distorsin de las consecuencias: minimizar, ignorar o distorsionar la gravedad de los efectos de las
propias acciones.
Deshumanizacin: enmarcar a la vctima de las propias acciones como indigna o consideracin
moral y que no merece las consideraciones humanas bsicas.
Desplazamiento de la responsabilidad: atribuir la responsabilidad de las propias acciones a las
figuras de autoridad.
Atribucin de culpa: asignar la responsabilidad de las propias acciones a las propias vctimas.
Chris y Alison Weston (centro)
Chris y Alison Weston reconocen que su experiencia los ha cambiado permanentemente.
Perdieron los ahorros de toda su vida, su casa y casi todas sus pertenencias, excepto unas pocas
cajas. Sus hijas tuvieron que completar parte de la escuela secundaria sin sus padres, y
reconstruir su vida profesional con antecedentes penales no ha sido nada fcil. Al mismo tiempo,
los Weston creen que se les ha dado la oportunidad de reconstruir sus vidas. En esta parte final
del caso, Chris y Alison reflexionan sobre lo que ha significado esta experiencia para su
crecimiento personal, su matrimonio y su legado.
Chris : Cuando estaba en prisin le envi una carta a Alison pidindole el divorcio. Estaba enojado y
la culp por mucho de lo que pas. Pero durante el tiempo que estuve encarcelado , pas por mucha
introspeccin , e hice la llamada bastante pronto de que no importaba cunto tiempo estuviera all ,
mi camino no se cruzara de esta manera una vez ms . ain Y creo que esa experiencia , hablando
por m personalmente , me llev a un lugar donde reconoc que no ser completamente claros con
nosotros mismos y con los dems realmente condujo a muchos de los problemas . problemas que
tuvimos.
La forma en que puedo resumir esto es que era ms libre en una prisin federal que en el mundo
exterior . _ _ _ _ _ Hice un compromiso conmigo mismo de que iba a ser muy transparente ,
comenzando por m mismo . Decid que iba a compartir cosas sobre m que haba dudado en
compartir en mi vida . _ _ _ _ _ _ matrimonio y en mi vida familiar . _ _ Entonces , cuando salgo ,
nos sentamos y hablamos sobre el pasado . _ _ Le dije : " Est bien , despejemos el tablero y
asegurmonos de que entendemos todo sobre los dos ahora . Y , si estamos dispuestos a seguir
adelante con eso , maravilloso " . _ _ _ _ _ _ _ Si no , entonces tenemos que hacer un cambio .
Ahora ambos estamos comprometidos a vivir una vida autntica y transparente , a ser abiertos y
honestos en nuestra relacin y en todo lo que hacemos . hacer _
Los Weston reconocen que la mayora.
Please Use SWISH and write the code answer each part carefu.pdf
Please Use SWISH and write the code. answer each part carefully! DOnot copy from other
people's posts. please
A) Consider a hypothetical family tree from the file FamilyTree posted in this module (Module 4).
Create a simple database containing facts and inference rules. Include facts about family
members, such as male, female, parent. Then add rules such as sister, brother, sibling, father,
mother, and grandparent. Run queries that will answer the following questions about family
members: (a) Is Pete Marks parent? (b) Is Anne Jennys parent? (c) Who is Todds father? (d) Who
is Toms sibling? (e) Who is Lillys brother? (f) Who is Henrys grandparent? (g) Who is Alices
sister? (h) Is Frank Kates brother? (i) Who is Matts mother? (j) Is Mark Annes brother?
B) Write a Prolog program that finds the maximum of a list of numbers. Submission file should
include a screenshot with tracing a program execution when a list only has 2 members and
execution without tracing when a list has 8 elements..
PLEASE HELP ME Eric Christopher Associate Director for Glo.pdf
PLEASE HELP ME.
Eric Christopher. Associate Director for Global HR Development at Tex-Mark, was sitting in his car
in an early-morning traffic jam. He had thought that by leaving his home at 7:00 am he would have
been ahead of the heavy commuter traffic into San Antonio s city center. The explanation for the
long queue was announced by the radio traffic service. A large, portable crane, used to set up con
crete barriers around road works, had overturned, and inbound and outbound traffic would be at a
dead stop for at least an hour. Eric had ended up at Tex-Mark, a computer input-output
manufacturer and sup plier. through an indirect career route. Brought up in the Hill Country Village
district of San Antonio. Eric had graduated from Churchill High School and Baylor University in
Waco. Texas with a major in History and a minor in Spanish. His maternal grandmother lived in
Tennessee, but was bom and grew up in Edinburgh. Scotland and Eric had spent several
summers while in high school and at university backpacking around Europe. His facility for
languages was impressive and he had an excellent working use of Spanish. French. Italian and
German. He could converse in Cantonese, as the result of working in a noodle restaurant during
university and had started a tutor ial course in Mandarin last fall. Upon graduation, Eric
backpacked around Europe and South America until his money ran out. Returning to Dallas he
took a ticketing job with Southwest Airlines and was quickly moved to the training unit. After four
successful years at South West, he was contacted by a headhunter about a position as Global
Development Assistant with Tex-Mark. The promised combination of global travel, more money
and a re turn to San Antonio proved irresistible, and Eric had been with Tex-Mark for five years
now. His career progress to date was outstanding, despite the extra workload self-imposed by
undertaking MBA studies at University of Texas at San Antonio as a part-time student. Tex-Mark
had started out as a spin off firm from Dell Computers in the late 1970s. Patents combined with an
excellence in engineering, an outstanding insti tutional sales staff cost-sensitive production and
pricing, all combined to make Tex-Mark a major force in the printer and optical scanner industry.
Tex-Mark in herited a production facility in San Antonio from Dell, but the company also had
international production facilities operating in three countries: Monterrey, Mexico, I.eith, Scotland
and more recently in Jaipur, India. A major new facility was scheduled to stan production in Wuhu,
China late next year. Research and new product development activities were split between the
home offices in San Antonio, a printer center in Durham. North Carolina and an optical research
center of excellence' in Edinburgh, Scotland. Major sales, distribution and customer service
centers had recently expanded into Asia and are now located in Rheims in France; in Memphis.
Tennessee; in Sydney. Australia; .
please help with the fill in the blanks Fill in the followin.pdf
please help with the fill in the blanks
Fill in the following blanks to make the statements true. HPAT2,3, and 5 when prevented from
being transcribed prevent the formation of the Many of the lincRNAs appear to be associated with
infections from that are thought to be genetic parasites. lincRNA play a role in regulating they
themselves are encoded in the genome that is considered DNA. Probably the most well known
example of RNA regulating the expression of DNA is the production of the that coats one copy of
the X chromosome in a female forming the Centromeric DNA is known as and may be located in
several locations on the chromosome. If there is high variation in the primary centromere site, a
centromere may cause use of a site that may make a centromere. This may result in increased
risk of and.
Patient Documentation Analysis Due Date Sunday 1159 pm MT.pdf
Patient Documentation Analysis
Due Date
Sunday 11:59 p.m. MT (Try to make your first post by Wednesday.)
Instructions
(Required) Select the tabs to review the patient medical report. Detailed discussion questions
follow below.
Identify one or two medical terms in this report. Deconstruct the components of specific medical
terms to identify their meanings. In addition, please pay attention to the spelling and pronunciation
of the words.
Case Study #1
Discharge Summary
The patient, John Madison, is an 8-month old white male presenting a viral type syndrome.
Admission Diagnosis
Bronchiolitis with hyperpyrexia; history of premature delivery with one hospitalization for lung
immaturity at time of birth.
Discharge Diagnosis
Bronchiolitis with fever and poor fluid intake.
Summary
John Madison is an 8-month-old white male seen by Dr. White at the Lofty Pines Health Center for
a viral-type syndrome. The mother states that the baby had a temperature over the weekend,
going up to 103 and 104 the night prior to admission. The baby has progressively gotten more
worked up, more short of breath, and has had respiratory disease. The patient was hospitalized for
his respiratory distress and lower respiratory disease.
Positive physical exam on admission included both lung fields filled with rhonchi and occasional
rales. There were no signs of consolidation. The patient was put in a croup tent during his hospital
stay and was placed on Ampicillin four times a day for his two-day course. He tolerated the croup
tent well and the antibiotics. His lungs progressively cleared, and the patient was discharged on
02-11-2018. He was discharged on the instructions to force fluids, saline nose drops, and bulb
suction as needed, Amoxicillin 125 milligrams three times a day, and to return to the clinic in one
week to see Dr. Swisher.
Lab Data
White count was 10.7, hemoglobin was 12.2, hematocrit was 37.7, 13 segmented cells, 77
lymphocytes, 10 monocytes. Chest x-ray was within normal limits.
Discussion Questions
Question 1
Review the Inpatient Discharge Summary of John Madison (Case Study 1) and provide the
following in your post.
Conduct research on bronchiolitis, using available library resources and trustworthy medical
websites such as the Mayo Clinic. Post a one-paragraph summary on bronchiolitis, and cite your
source. Use the information youve gathered from your research to address the following questions
in b. and c. below.
What is bronchiolitis, and what are its symptoms and some risk factors for developing it? In the
discharge summary, the baby was seen for a "viral-type" syndrome. What is the likely name for
this virus, which causes most cases of bronchiolitis?
Differentiate between the terms "rhonchi" and "rales" that are referred to in the discharge
summary. What is a croup tent and why was Ampicillin given to the baby?.
Please fix the following C++ code to compile correctly in Vi.pdf
Please fix the following C++ code to compile correctly in Visual Studio
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
void menu_driven()
{
cout << "Press 1 to display the agesn";
cout << "Press 2 to change the age of Billionairen";
cout << "Press 3 to display the minimum age of all Billionairesn";
cout << "Press 4 to display the average ages of all Billionairesn";
cout << "Press 5 to display the ages sorted in ascending ordern";
cout << "Press 6 to Quitn";
}
void result(int choice)
{
int NUM_BILLIONAIRES = 2600;
int position;
int change_age;
int ages[NUM_BILLIONAIRES] =
{
50,58,73,66,91,49,48,77,66,64,59,80,82,68,37,73,
67,72,77,44,86,59,86,57,38,64,84,82,53,51,52,85,
84,50,64,57,93,75,94,64,82,86,73,71,68,68,76,83,
79,76,77,86,53,73,50,59,80,51,56,30,76,58,51,81,
89,40,79,57,82,66,72,60,83,64,60,91,55,59,55,77,
67,66,56,86,71,40,65,55,71,60,68,72,54,71,74,65,
61,76,63,66,75,81,64,54,82,54,86,64,35,58,69,89,
55,59,66,58,82,71,42,58,67,54,37,42,92,49,44,92,
63,64,66,64,64,58,70,49,82,57,73,56,67,81,54,89,
50,56,70,64,92,63,66,93,84,94,59,77,63,77,72,72,
57,56,98,52,74,93,40,73,37,68,62,61,42,69,54,69,
59,50,43,82,71,54,75,74,79,80,40,71,48,66,74,46,
65,80,56,72,70,40,79,56,69,79,52,89,66,46,77,76,
67,62,69,57,64,31,33,93,54,66,76,53,38,74,65,56,
53,70,73,54,75,64,75,54,78,71,63,88,83,55,90,76,
59,69,57,92,76,64,64,64,91,56,56,60,74,68,65,57,
57,58,71,58,64,72,70,80,59,72,54,41,84,74,46,43,
81,38,57,36,40,74,71,70,57,57,61,64,78,49,84,55,
57,61,63,65,78,49,73,87,64,51,74,60,65,71,65,64,
79,58,53,78,71,64,61,64,46,71,53,70,63,58,77,71,
81,69,51,68,80,67,60,67,69,78,80,93,74,67,93,85,
79,64,68,66,37,52,53,78,53,71,83,80,64,55,72,86,
71,55,67,82,64,89,77,61,80,87,88,68,52,48,91,67,
61,90,79,84,62,59,39,58,58,39,52,60,73,79,73,55,
60,51,65,78,54,62,55,36,52,34,61,60,40,75,52,76,
67,60,51,76,57,60,69,57,33,58,58,57,77,53,59,84,
95,72,45,58,77,31,55,57,67,59,70,74,60,64,61,80,
58,72,67,92,28,53,57,61,86,57,53,71,64,65,69,57,
58,70,58,50,73,82,70,50,84,70,80,76,74,75,88,84,
65,70,60,54,70,59,64,77,83,50,58,70,80,76,58,63,
84,78,64,49,60,65,62,64,80,45,87,46,66,78,95,80,
71,46,79,85,53,58,77,63,57,38,71,66,54,71,80,81,
87,90,44,76,77,56,48,59,65,51,64,61,92,67,60,54,
53,80,77,62,79,64,52,74,55,81,67,91,89,58,54,57,
79,76,78,69,64,73,55,64,73,71,72,47,48,66,75,63,
60,61,50,78,68,41,71,44,83,54,72,64,87,57,49,50,
58,55,64,42,81,76,63,54,65,54,62,59,59,66,64,53,
82,89,59,85,57,41,59,64,87,70,71,80,65,62,69,63,
82,68,90,54,51,55,66,79,71,56,77,63,61,49,67,69,
66,77,80,56,97,68,73,66,60,64,67,59,57,78,60,48,
79,55,60,96,59,70,80,68,62,28,56,58,64,67,82,80,
57,58,89,56,70,35,75,52,67,50,49,88,63,62,69,57,
70,65,93,49,81,80,64,61,81,77,61,40,61,77,55,64,
78,84,75,95,76,67,55,64,81,86,70,60,85,66,39,62,
81,63,66,74,54,63,56,67,94,51,82,63,52,57,89,91,
64,67,67,72,76,51,53,68,54,76,68,87,66,44,78,71,
92,40,81,80,42,58,53,88,78,61,69,66,72,59,72,72,
68,42,57,74,64,66,82,40,40,71,56,82,79,64,40,66,
59,67,64,54,8.
Name the hormones that influence the menstrual cycle Ident.pdf
Name the hormones that influence the menstrual cycle. Identify what specifically
produces or regulates the hormones that are being produced (example-
Hypothalamus) Describe the changes in the sonographic appearances of the
endometrium throughout the menstrual
cycle (make sure that you include what hormones are increased and/or decreased
during each phase: example- secretory phase) Describe the changes in the
sonographic appearances of the ovaries throughout the menstrual cycle (make
sure that you include what hormones are increased and/or decreased and what
physiological findings you may see with ultrasound: example- dominant follicle).
Mike and Carol Brady realized that their house was not big e.pdf
Mike and Carol Brady realized that their house was not big enough for them and their six children.
Greg kept complaining that he was too old to have to share a room with his brothers, Peter and
Bobby. The Bradys went house hunting and thought they found the ideal house. Mr. Rogers had a
wonderful 2,900 square foot house in a luxurious neighborhood. As Mike was walking through
Rogers house, he noticed some watermarks on the ceiling and asked about the roof. The Rogerss
agent informed the Bradys that the roof was in excellent condition and had recently been repaired.
The agent never informed the Bradys that the roof still was leaking nor that the repairs did not stop
the leaking. The Bradys bought the house for $325,000. Shortly after they moved in, there was a
terrible rain storm. The heavy rains caused some water to leak into the house. The Bradys sued
Rogers, claiming that he was liable for the damages. Decide the case..
Debugging C Console Program Debug the program to identify .pdf
Debugging C# Console Program. Debug the program to identify these errors and correct them to
be able to compile and run the program
Consider the following C# console program that contains four programming errors:
using System;
namespace DailyRate
{
class Program
{
static void Main(string[] args)
{
(new Program()).run();
}
void run()
{
double dailyRate = readDouble("Enter your daily rate: ");
int noOfDays = readInt("Enter the number of days: ");
writeFee(calculateFee(dailyRate, noOfDays));
}
private void writeFee(double p, int n)
{
Console.WriteLine("The consultant's fee is: {0}", p * 1.1);
}
private double calculateFee(double dailyRate, int noOfDays);
{
return dailyRate * noOfDays;
}
private double readInt(string p)
{
Console.Write(p);
string line = Console.ReadLine();
return int.Parse(line);
}
private double readDouble(int p)
{
Console.Write(p);
string line = Console.ReadLine();
return double.Parse(line);
}
}
}
Debug the program to identify these errors and correct them to be able to compile and run the
program. The corrected program should look like this:.
742 Example 743 Continued Suppose that we have iid Ber.pdf
7.4.2 (Example 7.4.3 Continued) Suppose that we have iid Bernoulli (p) random variables X1,,Xn
where 0<p<1 is an unknown parameter with n 3. Consider the parametric function r(p)=p2(1p).
Start with the estimator T=X1X2(1X3) which is unbiased for T(p) and then derive the
RaoBlackwellized version of T. {Hint: Proceed along the lines of the Example 7.4.3.}.
Holt Enterprises recently paid a dividend D0 of 275 It .pdf
Holt Enterprises recently paid a dividend, D0, of $2.75. It expects to have nonconstant growth of
16% for 2 years followed by a constant rate of 4% thereafter. The firm's required return is 20%. a.
How far away is the horizon date? I. The terminal, or horizon, date is the date when the growth
rate becomes constant. This occurs at the beginning of Year 2. II. The terminal, or horizon, date is
the date when the growth rate becomes constant. This occurs at the end of Year 2. III. The
terminal, or horizon, date is infinity since common stocks do not have a maturity date. IV. The
terminal, or horizon, date is Year 0 since the value of a common stock is the present value of all
future expected dividends at time zero. V. The terminal, or horizon, date is the date when the
growth rate becomes nonconstant. This occurs at time zero. b. What is the firm's horizon, or
continuing, value? Do not round intermediate calculations. Round your answer to the nearest cent.
$ c. What is the firm's intrinsic value today, P0 ? Do not round intermediate calculations. Round
your answer to the nearest cent. $.
i am trying to add the first four lines of a studenttxt int.pdf
i am trying to add the first four lines of a student.txt into an arraylist of type student and the next
few lines into an arraylist of type course. i have to do this for each student in the txt. However, i
keep running into errors.
Below is the students.txt
Michael West
900753
2003
TruE
Art Appreciation,1090,3,sync,T
Data Structures,2735,5,online,MWF
Calculus,1070,4,in-person,MTWF
Personal Finance,1070,3,online,TBD
Health Ethics,2080,3,async,TR
Festus Park
900846
2000
False
Art Appreciation,1090,3,sync,T
Intro to CS,1724,4,in-person,MWTF
Statistics,2010,3,Online,MWF
Personal Finance,1070,3,online,TBD
Africa and the World,2090,3,sync,WF
Ahmed Nord
900963
2004
true
Intro to Philosophy,1070,3,online,TR
Data Structures,2735,5,online,MWF
Intro to Tennis,1000,3,in-person,MWF
Personal Finance,1070,3,online,TBD
Health Ethics,2080,3,async,TR
Tasha Ohlder
900102
1994
true
Intro to Sociology,1010,3,async,MW
Data Structures,2735,5,online,MWF
Statistics,2020,4,online,MWRF
Personal Finance,1070,3,online,TBD
Intro to Theology,1080,3,async,WF
Earl Mint
900159
2003
false
Calculus,1070,4,online,MTWF
Intro to CS,1724,4,in-person,MWTF
Personal Finance,1070,3,online,TBD
Health Ethics,2080,3,async,TR
English Composition,2010,3,online,MWF
Katie Easton
900951
2000
false
Discrete Structs,2550,3,online,TR
Intro to CS,1724,4,in-person,MWTF
Intro to Karate,1040,3,in-person,MWF
Personal Finance,1070,3,online,TBD
Health Ethics,2080,3,async,TR
Kennedy Dotson
900237
1999
True
Intro to Philosophy,1070,3,online,TR
Data Structures,2735,5,online,MWF
Intro to Data Science,1070,4,in-person,MWF
Personal Finance,1070,3,online,TBD
Nick Peoples
900856
2001
False
Intro to Sociology,1010,3,online,MW
Intro to CS,1724,4,in-person,MWTF
Intro to Tennis,1000,3,in-person,MWF
Personal Finance,1070,3,online,TBD
Olivia Priest
900123
1999
True
Intro to Philosophy,1070,3,online,TR
Data Structures,2735,5,online,MWF
Intro to Data Science,1070,4,in-person,MWF
Macro Economics,2020,3,sync,TW
Personal Finance,1070,3,online,TBD
Rashad Black
900456
2001
False
Intro to Sociology,1010,3,online,MW
Intro to CS,1724,4,in-person,MWTF
Intro to Tennis,1000,3,in-person,MWF
Personal Finance,1070,3,online,TBD
How Things Work,1010,3,async,WF
Michael West
900753
2003
TruE
Art Appreciation,1090,3,sync,T
Data Structures,2735,5,online,MWF
Calculus,1070,4,in-person,MTWF
Personal Finance,1070,3,online,TBD
Health Ethics,2080,3,async,TR
Festus Park
900846
2000
False
Art Appreciation,1090,3,sync,T
Intro to CS,1724,4,in-person,MWTF
Statistics,2010,3,Online,MWF
Personal Finance,1070,3,online,TBD
Africa and the World,2090,3,sync,WF
Ahmed Nord
900963
2004
true
Intro to Philosophy,1070,3,online,TR
Data Structures,2735,5,online,MWF
Intro to Tennis,1000,3,in-person,MWF
Personal Finance,1070,3,online,TBD
Health Ethics,2080,3,async,TR
Tasha Ohlder
900102
1994
true
Intro to Sociology,1010,3,async,MW
Data Structures,2735,5,online,MWF
Statistics,2020,4,online,MWRF
Personal Finance,1070,3,online,TBD
Intro to Theology,1080,3,async,WF
Earl.
2 Use the information above to complete the Aging of Accoun.pdf
2) Use the information above to complete the Aging of Accounts Receivable Schedule below.
Create a formula for each age category, using the Excel IF and AND FUNCTIONS (fx) to
determine where each customer amount belongs. The IF statement may include the following
arguments: <,>,>=,<=, Excel AND FUNCTION (fx).4) Prepare the adjusting journal entry for
recording bad debt expense if the Allowance for Doubtful Accounts had the following unadjusted
balance:.
More from access2future1 (20)
The following stockholders equity accounts arranged alphabe.pdf
The following stockholders equity accounts arranged alphabe.pdf
You are considering a stock investment in one of two firms .pdf
You are considering a stock investment in one of two firms .pdf
The Case of Sam Sawyer Sam Sawyer was a toprated operator i.pdf
The Case of Sam Sawyer Sam Sawyer was a toprated operator i.pdf
Second Republic Bank is a lending company that operates in t.pdf
Second Republic Bank is a lending company that operates in t.pdf
Researchers found that a person in a particular country spen.pdf
Researchers found that a person in a particular country spen.pdf
QUESTION 2 internal rate of return method 14 RETURN USE N.pdf
QUESTION 2 internal rate of return method 14 RETURN USE N.pdf
Question 17 Which of the following contributes directly to t.pdf
Question 17 Which of the following contributes directly to t.pdf
Proporcione ejemplos de cmo Chris y Alison participaron en .pdf
Proporcione ejemplos de cmo Chris y Alison participaron en .pdf
Please Use SWISH and write the code answer each part carefu.pdf
Please Use SWISH and write the code answer each part carefu.pdf
PLEASE HELP ME Eric Christopher Associate Director for Glo.pdf
PLEASE HELP ME Eric Christopher Associate Director for Glo.pdf
please help with the fill in the blanks Fill in the followin.pdf
please help with the fill in the blanks Fill in the followin.pdf
Patient Documentation Analysis Due Date Sunday 1159 pm MT.pdf
Patient Documentation Analysis Due Date Sunday 1159 pm MT.pdf
Please fix the following C++ code to compile correctly in Vi.pdf
Please fix the following C++ code to compile correctly in Vi.pdf
Name the hormones that influence the menstrual cycle Ident.pdf
Name the hormones that influence the menstrual cycle Ident.pdf
Mike and Carol Brady realized that their house was not big e.pdf
Mike and Carol Brady realized that their house was not big e.pdf
Debugging C Console Program Debug the program to identify .pdf
Debugging C Console Program Debug the program to identify .pdf
742 Example 743 Continued Suppose that we have iid Ber.pdf
742 Example 743 Continued Suppose that we have iid Ber.pdf
Holt Enterprises recently paid a dividend D0 of 275 It .pdf
Holt Enterprises recently paid a dividend D0 of 275 It .pdf
i am trying to add the first four lines of a studenttxt int.pdf
i am trying to add the first four lines of a studenttxt int.pdf
2 Use the information above to complete the Aging of Accoun.pdf
2 Use the information above to complete the Aging of Accoun.pdf
Recently uploaded
special B.ed 2nd year old paper_20240531.pdf
Instagram:-
https://instagram.com/special_education_needs_01?igshid=YmMyMTA2M2Y=
WhatsApp:-
https://chat.whatsapp.com/JVakNIYlSV94x7bwunO3Dc
YouTube:-
https://youtube.com/@special_education_needs
Teligram :- https://t.me/special_education_needs
Slide Shere :-
https://www.slideshare.net/shabnambano20?utm_campaign=profiletracking&utm_medium=sssite&utm_source=ssslideview
Acetabularia Information For Class 9 .docx
Acetabularia acetabulum is a single-celled green alga that in its vegetative state is morphologically differentiated into a basal rhizoid and an axially elongated stalk, which bears whorls of branching hairs. The single diploid nucleus resides in the rhizoid.
June 3, 2024 Anti-Semitism Letter Sent to MIT President Kornbluth and MIT Cor...
Letter from the Congress of the United States regarding Anti-Semitism sent June 3rd to MIT President Sally Kornbluth, MIT Corp Chair, Mark Gorenberg
Dear Dr. Kornbluth and Mr. Gorenberg,
The US House of Representatives is deeply concerned by ongoing and pervasive acts of antisemitic
harassment and intimidation at the Massachusetts Institute of Technology (MIT). Failing to act decisively to ensure a safe learning environment for all students would be a grave dereliction of your responsibilities as President of MIT and Chair of the MIT Corporation.
This Congress will not stand idly by and allow an environment hostile to Jewish students to persist. The House believes that your institution is in violation of Title VI of the Civil Rights Act, and the inability or
unwillingness to rectify this violation through action requires accountability.
Postsecondary education is a unique opportunity for students to learn and have their ideas and beliefs challenged. However, universities receiving hundreds of millions of federal funds annually have denied
students that opportunity and have been hijacked to become venues for the promotion of terrorism, antisemitic harassment and intimidation, unlawful encampments, and in some cases, assaults and riots.
The House of Representatives will not countenance the use of federal funds to indoctrinate students into hateful, antisemitic, anti-American supporters of terrorism. Investigations into campus antisemitism by the Committee on Education and the Workforce and the Committee on Ways and Means have been expanded into a Congress-wide probe across all relevant jurisdictions to address this national crisis. The undersigned Committees will conduct oversight into the use of federal funds at MIT and its learning environment under authorities granted to each Committee.
• The Committee on Education and the Workforce has been investigating your institution since December 7, 2023. The Committee has broad jurisdiction over postsecondary education, including its compliance with Title VI of the Civil Rights Act, campus safety concerns over disruptions to the learning environment, and the awarding of federal student aid under the Higher Education Act.
• The Committee on Oversight and Accountability is investigating the sources of funding and other support flowing to groups espousing pro-Hamas propaganda and engaged in antisemitic harassment and intimidation of students. The Committee on Oversight and Accountability is the principal oversight committee of the US House of Representatives and has broad authority to investigate “any matter” at “any time” under House Rule X.
• The Committee on Ways and Means has been investigating several universities since November 15, 2023, when the Committee held a hearing entitled From Ivory Towers to Dark Corners: Investigating the Nexus Between Antisemitism, Tax-Exempt Universities, and Terror Financing. The Committee followed the hearing with letters to those institutions on January 10, 202
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.
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
Unit 2- Research Aptitude (UGC NET Paper I).pdf
This slide describes the research aptitude of unit 2 in the UGC NET paper I.
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.
TESDA TM1 REVIEWER FOR NATIONAL ASSESSMENT WRITTEN AND ORAL QUESTIONS WITH A...
TESDA TM1 REVIEWER FOR NATIONAL ASSESSMENT WRITTEN AND ORAL QUESTIONS WITH ANSWERS.
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.
Francesca Gottschalk - How can education support child empowerment.pptx
Francesca Gottschalk from the OECD’s Centre for Educational Research and Innovation presents at the Ask an Expert Webinar: How can education support child empowerment?
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.
Introduction to AI for Nonprofits with Tapp Network
Dive into the world of AI! Experts Jon Hill and Tareq Monaur will guide you through AI's role in enhancing nonprofit websites and basic marketing strategies, making it easy to understand and apply.
678020731-Sumas-y-Restas-Para-Colorear.pdf
KKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKK
Palestine last event orientationfvgnh .pptx
An EFL lesson about the current events in Palestine. It is intended to be for intermediate students who wish to increase their listening skills through a short lesson in power point.
Biological Screening of Herbal Drugs in detailed.
Biological screening of herbal drugs: Introduction and Need for
Phyto-Pharmacological Screening, New Strategies for evaluating
Natural Products, In vitro evaluation techniques for Antioxidants, Antimicrobial and Anticancer drugs. In vivo evaluation techniques
for Anti-inflammatory, Antiulcer, Anticancer, Wound healing, Antidiabetic, Hepatoprotective, Cardio protective, Diuretics and
Antifertility, Toxicity studies as per OECD guidelines
Honest Reviews of Tim Han LMA Course Program.pptx
Personal development courses are widely available today, with each one promising life-changing outcomes. Tim Han’s Life Mastery Achievers (LMA) Course has drawn a lot of interest. In addition to offering my frank assessment of Success Insider’s LMA Course, this piece examines the course’s effects via a variety of Tim Han LMA course reviews and Success Insider comments.
Recently uploaded (20)
June 3, 2024 Anti-Semitism Letter Sent to MIT President Kornbluth and MIT Cor...
June 3, 2024 Anti-Semitism Letter Sent to MIT President Kornbluth and MIT Cor...
The French Revolution Class 9 Study Material pdf free download
The French Revolution Class 9 Study Material pdf free download
TESDA TM1 REVIEWER FOR NATIONAL ASSESSMENT WRITTEN AND ORAL QUESTIONS WITH A...
TESDA TM1 REVIEWER FOR NATIONAL ASSESSMENT WRITTEN AND ORAL QUESTIONS WITH A...
Overview on Edible Vaccine: Pros & Cons with Mechanism
Overview on Edible Vaccine: Pros & Cons with Mechanism
Francesca Gottschalk - How can education support child empowerment.pptx
Francesca Gottschalk - How can education support child empowerment.pptx
1.4 modern child centered education - mahatma gandhi-2.pptx
1.4 modern child centered education - mahatma gandhi-2.pptx
Introduction to AI for Nonprofits with Tapp Network
Introduction to AI for Nonprofits with Tapp Network
output and explain There is Mylist There is MyArrayList pa.pdf
- 1. 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();
- 2. 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))
- 3. 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; }
- 4. 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; }
- 5. 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 MyArrayList<Integer>(); for(int i=0; i<10; i++) list.add(i+10); for(Iterator<Integer> it = list.iterator(); it.hasNext(); ) { System.out.println(it.next()); } for(int x: list) System.out.println(x); System.out.println(list); list.remove((Integer)10); System.out.println(list); } }