In java this manages a list of flower names public class Flo.pdf

•

0 likes•3 views

In java this manages a list of flower names public class FlowerList { private static final int LISTLEN = 6; private String[] list = new String[LISTLEN]; public FlowerList() { list[0] = "daisy"; list[1] = "rose"; list[2] = "lily"; list[3] = "dandelion"; list[4] = "thistle"; list[5] = "sunflower"; } public String getFlowerAtPosition(int pos) { } public String listAllTheFlowers() { } public String listFirstCharacters() { } public String listBackwardsCapitalized() { } } This class has one instance variable which is an array of strings named list. It also has a constructor which initializes the values in the list. 1. Fill in the method public String getFlowerAtPosition(int pos) that returns the String at a given position. If the position is out of bounds, it should return an empty strings. 2. Fill in the method public String listAllTheFlowers() which should return a string consisting of all of the flower names concatenated together. 3. Fill in the method public String listFirstCharacters() Which should return the string consisting of just the first characters of each flower name, separated by newlines. 4. Fill in the method public String listBackwardsCapitalized() This should return the string consisting of the flower names in reverse order and in all capital letters. In java this manages a list of flower names public class FlowerList { private static final int LISTLEN = 6; private String[] list = new String[LISTLEN]; public FlowerList() { list[0] = "daisy"; list[1] = "rose"; list[2] = "lily"; list[3] = "dandelion"; list[4] = "thistle"; list[5] = "sunflower"; } public String getFlowerAtPosition(int pos) { } public String listAllTheFlowers() { } public String listFirstCharacters() { } public String listBackwardsCapitalized() { } } This class has one instance variable which is an array of strings named list. It also has a constructor which initializes the values in the list. 1. Fill in the method public String getFlowerAtPosition(int pos) that returns the String at a given position. If the position is out of bounds, it should return an empty strings. 2. Fill in the method public String listAllTheFlowers() which should return a string consisting of all of the flower names concatenated together. 3. Fill in the method public String listFirstCharacters() Which should return the string consisting of just the first characters of each flower name, separated by newlines. 4. Fill in the method public String listBackwardsCapitalized() This should return the string consisting of the flower names in reverse order and in all capital letters..

Education

3. Fill in the method
public String listFirstCharacters()
Which should return the string consisting of just the first characters of each flower
name, separated by newlines.
4. Fill in the method
public String listBackwardsCapitalized()
This should return the string consisting of the flower names in reverse order and in
all capital letters.
In java this manages a list of flower names
public class FlowerList {
private static final int LISTLEN = 6;
private String[] list = new String[LISTLEN];
public FlowerList() {
list[0] = "daisy";
list[1] = "rose";
list[2] = "lily";
list[3] = "dandelion";
list[4] = "thistle";
list[5] = "sunflower";
}
public String getFlowerAtPosition(int pos) {
}
public String listAllTheFlowers() {
}
public String listFirstCharacters() {

}
public String listBackwardsCapitalized() {
}
}
This class has
one instance variable which is an array of strings named list. It also has a
constructor which initializes the values in the list.
1. Fill in the method
public String getFlowerAtPosition(int pos)
that returns the String at a given position. If the position is out of bounds, it should
return an empty strings.
2. Fill in the method
public String listAllTheFlowers()
which should return a string consisting of all of the flower names concatenated
together.
3. Fill in the method
public String listFirstCharacters()
Which should return the string consisting of just the first characters of each flower
name, separated by newlines.
4. Fill in the method
public String listBackwardsCapitalized()

This should return the string consisting of the flower names in reverse order and in
all capital letters.

Similar to In java this manages a list of flower names public class Flo.pdf

Write a java class \"LIST\" that outputs: //main: public class AssignmentThree { public static void main(String[] args) { List myList = new List(15); // Cause List Empty Message myList.removeFront(); myList.removeRear(); myList.removeItem(\"a\"); // Cause Not found message myList.addToFront(\"x\"); myList.removeItem(\"y\"); myList.removeItem(\"x\"); myList.addAfterItem(\"x\", \"z\"); myList.addBeforeItem(\"x\", \"z\"); // Normal behavior myList.addToFront(\"not.\"); myList.addToFront(\"or\"); myList.addToRear(\"is\"); myList.addToRear(\"try.\"); myList.addAfterItem(\"is\", \"no\"); myList.addBeforeItem(\"is\", \"There\"); myList.addToFront(\"Do\"); myList.addAfterItem(\"or\", \"do\"); myList.print(\"Original list\"); myList.printSorted(\"Sorted Original List\"); sop(\"\ Front is \" + myList.getFront()); sop(\"Rear is \" + myList.getRear()); sop(\"Count is \" + myList.askCount()); sop(\"Is There present? \" + myList.isPresent(\"There\")); sop(\"Is Dog present? \" + myList.isPresent(\"Dog\")); myList.addToFront(\"junk\"); myList.addToRear(\"morejunk\"); myList.addAfterItem(\"or\", \"moremorejunk\"); myList.print(\"List with junk\"); sop(\"Count is \" + myList.askCount()); myList.removeFront(); myList.removeRear(); myList.removeItem(\"moremorejunk\"); myList.print(\"List with junk removed\"); sop(\"Count is \" + myList.askCount()); sop(\"\"); // Cause List Full message for(int ii = 0; ii < 10; ++ii) { myList.addToFront(DUMMY); } myList.addToRear(DUMMY); myList.addBeforeItem(\"no\", DUMMY); myList.addAfterItem(\"There\", DUMMY); myList.print(\"After filling List\"); sop(\"Count is \" + myList.askCount()); while(myList.isPresent(DUMMY)) myList.removeItem(DUMMY); myList.print(\"After removing \" + DUMMY ); sop(\"Count is \" + myList.askCount()); } private static void sop(String s) { System.out.println(s); } private static final String DUMMY = \"dummy\"; } //Class List: public class List { public List(int size) { } public void addToFront(java.lang.String item) { } public void addToRear(java.lang.String item) { } public void addBeforeItem(java.lang.String beforeItem, java.lang.String item) { } public void addAfterItem(java.lang.String afterItem, java.lang.String item) { } public java.lang.String getFront() { } public java.lang.String getRear() { } public boolean isPresent(java.lang.String item) { } public int askCount() { } public void removeFront() { } public void removeRear() { } public void removeItem(java.lang.String item) { } public void print(java.lang.String title) { } public void printSorted(java.lang.String title) { } } Solution The List is the base interface for all list types, and the ArrayList and LinkedList classes are two common List’s implementations. Besides ArrayList and LinkedList, Vector class is a legacy collection and later was retrofitted to implement the Listinterface. Vector is thread-safe, but ArrayList and LinkedList are not. The following class diagram depicts the inheritance tree of the List collections. It’s a good practi.

Write a java class LIST that outputsmainpublic class Ass.pdf

ebrahimbadushata00

public class EllipsoidList { private String list; private ArrayList<Ellipsoid> ellipsoidList; private ArrayList<Ellipsoid> ellipsoids = new ArrayList<Ellipsoid>(); public ArrayList<Ellipsoid> readFile(String filename) throws FileNotFoundException { Scanner input = new Scanner(new File(filename)); ArrayList<Ellipsoid> list = new ArrayList<Ellipsoid>(); while (input.hasNextLine()) { String line = input.nextLine(); String[] parts = line.split(","); String label = parts[0]; double a = Double.parseDouble(parts[1]); double b = Double.parseDouble(parts[2]); double c = Double.parseDouble(parts[3]); list.add(new Ellipsoid(label, a, b, c)); } input.close(); ellipsoidList = new ArrayList<Ellipsoid>(); return list; } public void addEllipsoid(String name, double a, double b, double c) { Ellipsoid e = new Ellipsoid(name, a, b, c); ellipsoids.add(e); } public Ellipsoid findEllipsoid(String name) { for (Ellipsoid e : ellipsoids) { if (e.getName().equalsIgnoreCase(name)) { return e; } } return null; } public Ellipsoid deleteEllipsoid(String name) { for (int i = 0; i < ellipsoids.size(); i++) { Ellipsoid e = ellipsoids.get(i); if (e.getName().equalsIgnoreCase(name)) { ellipsoids.remove(i); return e; } } return null; } public Ellipsoid editEllipsoid(String name, double a, double b, double c) { for (int i = 0; i < ellipsoids.size(); i++) { Ellipsoid e = ellipsoids.get(i); if (e.getName().equalsIgnoreCase(name)) { return e; } } return null; } public ArrayList<Ellipsoid> getList() { return ellipsoidList; } /** * Create a EllipsoidList object. * @param listIn for listName * @param ellipsoidListIn for ellipsoidList */ public EllipsoidList(String listIn, ArrayList<Ellipsoid> ellipsoidListIn) { list = listIn; ellipsoidList = new ArrayList<Ellipsoid>(); for (Ellipsoid e : ellipsoidListIn) { ellipsoidList.add(e); } } //methods /** * @return the list name */ public String getName() { return list; } /** * @return the list name */ public int numberOfEllipsoids() { return ellipsoidList.size(); } /** * @return the list name */ public double totalVolume() { double total = 0; //use for each loop for (Ellipsoid e : ellipsoidList) { if (e != null) { total += (e.volume()); } } // return the total volume return total; } /** * counts the total. * * @return totalSurfaceArea */ public double totalSurfaceArea() { double total = 0; //use for each loop for (Ellipsoid e : ellipsoidList) { if (e != null) { total += (e.surfaceArea()); } } return total; } /** * finds. * * @return averageVolume */ public double averageVolume() { if (this.numberOfEllipsoids() == 0) { return 0; } else { return this.totalVolume() / this.numberOfEllipsoids(); } } /** * finds. * * @return averageSurfaceArea */ public double averageSurfaceArea() { if (this.numberOfEllipsoids() == 0) { return 0; } else { return this.totalSurfaceArea() / this.numberOfEllipsoids(); } } /** * gets a summary of the ellipsoid in the list. * * @return summaryInfo */ public String toString() { String result = getName() + "\n"; int index =.

public class EllipsoidList { private String list- private Array.pdf

3rdeyesolutions

// ReverseList.java import java.util.ArrayList; public class ReverseList { // function to reverse arrylist public static void reverse(ArrayList list, int size) { for (int i = 0; i < size/2 ;i++ ) { Double temp = list.get(i); list.set(i, list.get(size-i-1)); list.set(size-i-1,temp); } } public static void main(String args[]){ ArrayList list = new ArrayList(); list.add(4.8); list.add(5.1); list.add(9.1); list.add(1.5); list.add(0.8); list.add(11.8); list.add(5.0); list.add(3.8); int size = list.size(); System.out.println(\"Original list:\"); for(Double number: list){ System.out.print (number + \" \"); } // reverse list reverse(list,size); System.out.println(\"\ \ After reversing the list:\"); for(Double number: list){ System.out.print (number + \" \"); } } } /* output: Original list: 4.8 5.1 9.1 1.5 0.8 11.8 5.0 3.8 After reversing the list: 3.8 5.0 11.8 0.8 1.5 9.1 5.1 4.8 */ Solution // ReverseList.java import java.util.ArrayList; public class ReverseList { // function to reverse arrylist public static void reverse(ArrayList list, int size) { for (int i = 0; i < size/2 ;i++ ) { Double temp = list.get(i); list.set(i, list.get(size-i-1)); list.set(size-i-1,temp); } } public static void main(String args[]){ ArrayList list = new ArrayList(); list.add(4.8); list.add(5.1); list.add(9.1); list.add(1.5); list.add(0.8); list.add(11.8); list.add(5.0); list.add(3.8); int size = list.size(); System.out.println(\"Original list:\"); for(Double number: list){ System.out.print (number + \" \"); } // reverse list reverse(list,size); System.out.println(\"\ \ After reversing the list:\"); for(Double number: list){ System.out.print (number + \" \"); } } } /* output: Original list: 4.8 5.1 9.1 1.5 0.8 11.8 5.0 3.8 After reversing the list: 3.8 5.0 11.8 0.8 1.5 9.1 5.1 4.8 */.

ReverseList.javaimport java.util.ArrayList;public class Rever.pdf

aryan9007

Java Assignment Using the ListNode.java file below Write methods called min and max that return the smallest and largest values in the linked list. These methods will be added to your ListNode class. For example if a variable called list stores {11, -7, 3, 42, 0, 14], the call of list.min() should return -7 and the call of list.max() should return 42. If the list is empty, return -1. Print the returned value. Write a method called insertNode that inserts a new node anywhere in your linked list. Display your linked list with new value. Write a program to test these methods to ensure accuracy and successful implementation. Upload your modified version of the ListNode java file only. Note: Original code should still be included. You will make additions and slight modifications where necessary. Throw exceptions where you think is necessary. // Listlode is a class for storing a single node of a linked // list. This node class is for a list of integer values. public class Listlode \{ public int data; //data stored in this node public Listliode front;//points to head node public Listliode next; /f link to next node in the list // post: constructs a node with data and null link public Listlode() \{ 3. // post: constructs a node with given data and null link: public Listlode(int data) \{ this(data, null); 3 // post: constructs a node with given data and given link. public Listlode(int data, Listliode next) \{ this.data = data; this. next = next; 3 public String toString() \{ if (front = null) : \} else \{ String result = " ["+ front data; Listliode current = front. next; while (current != null) \{ result +=m,m+ current data, current = current. next; 3 result += " ]n - return result; 3. }// post: appends the given value to the end of the list public void add(int value) \& puolic void aod if (front = nult) \{. front = new Listlode (value); 3 else \{ Listlode current = front; whistiode current = front; while (current next I= null) \{ current = current. next; 3 current. next = new Listliode (value ); 3. 3 J// post : returns the position of the first occurrence of the given /l value (-1 if not found ) public void remove (int index) \{ if ( index =){ \} else \{ Listiode current = nodeAt ( index - 1); current. next = current. next. next, 3 3 3// pre : <=i< size() // post: returns a reference to the node at the given index public Listlode nodeAt (int index) : List Node current = front; for (int i=0;i< index; i++) \{ current = current. next. \}. return current; 3.

Java AssignmentUsing the ListNode.java file below Write method.pdf

ambersushil

Turn the linked list implementation into a circular list: Have the previous pointer of the first node point to the last node, and the next pointer of the last node point to the first node. Then remove the last pointer in the List class because the value can now be obtained as first->previous. Reimplement the member functions so that they have the same effect as before. Original LIST.H #ifndef LIST_H #define LIST_H #include <string> using namespace std; class List; class Iterator; class Node { public: Node(string element); private: string data; Node* previous; Node* next; friend class List; friend class Iterator; }; class List { public: List(); void push_back(string element); void insert(Iterator iter, string element); Iterator erase(Iterator iter); Iterator begin(); Iterator end(); private: Node* first; Node* last; friend class Iterator; }; class Iterator { public: Iterator(); string get() const; void next(); void previous(); bool equals(Iterator other) const; private: Node* position; List* container; friend class List; }; #endif Original LIST.CPP #include <string> #include "list.h" using namespace std; Node::Node(string element) { data = element; previous = nullptr; next = nullptr; } List::List() { first = nullptr; last = nullptr; } void List::push_back(string element) { Node* new_node = new Node(element); if (last == nullptr) // List is empty { first = new_node; last = new_node; } else { new_node->previous = last; last->next = new_node; last = new_node; } } void List::insert(Iterator iter, string element) { if (iter.position == nullptr) { push_back(element); return; } Node* after = iter.position; Node* before = after->previous; Node* new_node = new Node(element); new_node->previous = before; new_node->next = after; after->previous = new_node; if (before == nullptr) // Insert at beginning { first = new_node; } else { before->next = new_node; } } Iterator List::erase(Iterator iter) { Node* remove = iter.position; Node* before = remove->previous; Node* after = remove->next; if (remove == first) { first = after; } else { before->next = after; } if (remove == last) { last = before; } else { after->previous = before; } delete remove; Iterator r; r.position = after; r.container = this; return r; } Iterator List::begin() { Iterator iter; iter.position = first; iter.container = this; return iter; } Iterator List::end() { Iterator iter; iter.position = nullptr; iter.container = this; return iter; } Iterator::Iterator() { position = nullptr; container = nullptr; } string Iterator::get() const { return position->data; } void Iterator::next() { position = position->next; } void Iterator::previous() { if (position == nullptr) { position = container->last; } else { position = position->previous; } } bool Iterator::equals(Iterator other) const { return position == other.position; }.

Turn the linked list implementation into a circular list Ha.pdf

ajayadinathcomputers

Labprogram.javaLinkedList.javaimport java.util.NoSuchElementEx.pdf

freddysarabia1

*/ public static List tokenify(String string) come back list; } /** * Initializes the list of editing rules. * * param replacements * the synchronic linguistics holding the replacement rules */ non-public void initReplacements(Grammar replacements) catch (IndexOutOfBoundsException e) currentReplacements.add(currentSubstitution); } Iterator it = reps.entrySet().iterator(); symbolToReplacements = new TreeMap(); List[] emptyListArray = new List[0]; while (it.hasNext()) } /** * Returns the list of symbols for the axiom. * * return the list of symbols for the axiom */ public List getAxiom() come axiom; } /** * Returns the array of replacements for an emblem. * * param image * the image to induce the replacements for * return AN array of lists, wherever every list could be a list of the strings; the * array are empty if there are not any replacements */ public List[] getReplacements(String symbol) come back toReturn == null ? EMPTY_LIST : toReturn; } /** * Returns the symbols that there ar replacements. * * return the set of symbols that have replacements during this L-system */ public Set getSymbolsWithReplacements() come symbolToReplacements.keySet(); } /** * Returns a mapping of names of parameters for the L-system to their * individual values * * return the map of names of parameters to the parameters themselves */ public Map getValues() come values; } /** * Returns whether or not the l-system is nondeterministic, i.e., if there ar any * symbols that would lead to AN ambiguous outcome (a variety of stochiastic * thing). * * return if the l-system is nondeterministic */ public mathematician nondeterministic() come nondeterministic; } /** The synchronic linguistics holding the replacement rules. */ non-public Map symbolToReplacements; /** The mapping of keys to values. */ non-public Map values; /** The axiom. */ non-public List axiom; /** whether or not or not the L-system has stochiastic properties. */ non-public mathematician nondeterministic = false; /** AN empty list array. */ non-public static final List[] EMPTY_LIST = new List[0]; } Solution */ public static List tokenify(String string) come back list; } /** * Initializes the list of editing rules. * * param replacements * the synchronic linguistics holding the replacement rules */ non-public void initReplacements(Grammar replacements) catch (IndexOutOfBoundsException e) currentReplacements.add(currentSubstitution); } Iterator it = reps.entrySet().iterator(); symbolToReplacements = new TreeMap(); List[] emptyListArray = new List[0]; while (it.hasNext()) } /** * Returns the list of symbols for the axiom. * * return the list of symbols for the axiom */ public List getAxiom() come axiom; } /** * Returns the array of replacements for an emblem. * * param image * the image to induce the replacements for * return AN array of lists, wherever every list could be a list of the strings; the * array are empty if there are not any replacements */ public List[] getReplacements(String symbol) come back t.

public static List tokenify(String string) come back list;.pdf

angelnxcom

Step 1 The Pair Class Many times in writing software we come across problems that require us of values. For to store a pair example, a coordinate system would require an x, y value pair or a hash key value pair Your task on this assignment is table as a data, one type but to create a simple template pair class called Pair that has two type parameters. You should call these parameters F and s. Functionality Constructor You should create a working constructor that takes two type parameters one for each of the pair values. get First This is an accessor method that will return the first of the pair values. get second This is an accessor method that will return the second of the pair values. set First This is a mutator method that will set the first pair value setsecond This is a mutator method that will set the second pair value Solution Pair.java public class Pair { private F first; //first member of pair private S second; //second member of pair public Pair(F first, S second) { this.first = first; this.second = second; } public void setFirst(F first) { this.first = first; } public void setSecond(S second) { this.second = second; } public F getFirst() { return first; } public S getSecond() { return second; } } LinkedList.java template class Node { private T data; //the object information private Node* next; //pointer to the next node element public void setData(T val) { this.data = val; } public void setNextNull() { this.next = NULL; } public void setNext(Node *tmp) { this.next = tmp; } public Node* getNext() { return this.next; } }; template class LinkedList extends Node { private Node *head = new Node; private Node *tail = new Node; public LinkedList() { head = NULL; tail = NULL; } public ~LinkedList() { } //Method adds info to the end of the list public void append(T info) { if(head == NULL) //if our list is currently empty { head = new Node; //Create new node of type T head->setData(info); tail = head; } else //if not empty add to the end and move the tail { Node* temp = new Node; temp->setData(info); temp->setNextNull(); tail->setNext(temp); tail = tail->getNext(); } } public void addFront(T info) { if(head == NULL) //if our list is currently empty { head = new Node; //Create new node of type T head->setData(info); tail = head; } else //if not empty add to the end and move the tail { Node* temp = new Node; temp->setData(info); temp->setNext(head); head = temp; } } //insert after given node public void insert(Node *node,T info) { Node *temp = new Node; temp->setData(info); temp->setNext(node->getNext()); node->setNext(temp); } public void delete(Node *node) { Node *temp = new Node; temp = head; while(temp->getNext() != node && temp->getNext() ) { temp = temp->getNext(); } if(temp) { temp->setNext(node->getNext()); delete node; } } public Integer size(Node *head) { int sz=0; Node * temp = new Node; temp = head; while(temp) { sz++; temp = temp->getNext(); } return sz; } } PairList.java public class PairList< E, F > extends LinkedList< Pair< E,.

Step 1 The Pair Class Many times in writing software we come across p.pdf

formaxekochi

Please create the appropriate JUnit test cases to thoroughly unit test the following program: IntegerSet.java import java.util.*; public class IntegerSet{ private ArrayList<Integer> list= new ArrayList<>(); public IntegerSet(ArrayList list) { this.list=list; } // clears the all representation of class public void clear() { list.clear(); } // returns the length of set public int length() { return list.size(); } // return true if 2 lists are equal public boolean equals(IntegerSet b) { ArrayList<Integer> list2=b.list; if(list.size()!=list2.size()) { return false; } ArrayList<Integer> temp1=list; ArrayList<Integer> temp2=list2; Collections.sort(temp1); Collections.sort(temp2); for(int i=0;i<temp1.size();i++) { if(temp1.get(i)!=temp2.get(i)) { return false; } } return true; } // returns a largest item and throw exception if list is empty public int largest() throws IntegerSetException { if(list.size()==0) { IntegerSetException e= new IntegerSetException(); throw e; } int max=0; for(int i=0;i<list.size();i++) { if(list.get(i)>max) { max=list.get(i); } } return max; } // returns a largest item and throw exception if list is empty public int smallest() throws IntegerSetException { if(list.size()==0) { IntegerSetException e= new IntegerSetException(); throw e; } int min=Integer.MAX_VALUE; for(int i=0;i<list.size();i++) { if(list.get(i)<min) { min=list.get(i); } } return min; } // add item if already not exist in list public void addItem(int item ) { boolean exist=false; for(int i=0;i<list.size();i++) { if(list.get(i)==item) { exist=true; } } if(exist==false) { list.add(item); } } // remove item if already not exist in list public void removeItem(int item ) { for(int i=0;i<list.size();i++) { if(list.get(i)==item) { list.remove(i); } } } // return union of of 2 sets public IntegerSet union(IntegerSet list2) { ArrayList<Integer> temp=list2.getlist(); Set<Integer> set = new HashSet<>(); set.addAll(list); set.addAll(temp); ArrayList<Integer> list3= new ArrayList<>(set); IntegerSet list4= new IntegerSet(list3); return list4; } // return intersection of of 2 sets public IntegerSet intersection(IntegerSet list2) { ArrayList<Integer> temp=list2.getlist(); list.retainAll(temp); IntegerSet list4= new IntegerSet(list); return list4; } // returns difference of 2 sets public IntegerSet difference (IntegerSet list2) { ArrayList<Integer> temp=list2.getlist(); // Remove all elements in list2 from list list.removeAll(temp); IntegerSet list4= new IntegerSet(list); return list4; } public ArrayList<Integer> getlist(){ return list; } } IntegerSetException.java class IntegerSetException extends Exception { Driver.java import java.util.*; public class Driver { public static void main(String[] args) throws IntegerSetException { ArrayList<Integer> list1= new ArrayList<>(); ArrayList<Integer> list2= new ArrayList<>(); // make 2 instance of integerset class for implementation IntegerSet set1= new IntegerSet(list1); IntegerSet set2= new IntegerSet(list2); set1.addItem(1); set1.ad.

Please create the appropriate JUnit test cases to thoroughly.pdf

kitty811

2.(Sorted list: array implementation)This sorted list ADT discussed in class should be extended by the addition of two new methods: //Interface: ArrayListADT //works for int public interface ArrayListADT { public boolean isEmpty(); //Method to determine whether the list is empty. public boolean isFull(); //Method to determine whether the list is full. public int listSize(); //Method to return the number of elements in the list. public int maxListSize(); //Method to return the maximum size of the list. public void print(); //Method to output the elements of the list. public boolean isItemAtEqual(int location, int item); //Method to determine whether item is the same as the item in the list at location. public void insertAt(int location, int insertItem); //Method to insert insertItem in the list at the position public void insertEnd(int insertItem); //Method to insert insertItem at the end of the list. public void removeAt(int location); //Method to remove the item from the list at location. public int retrieveAt(int location); //Method to retrieve the element from the list at location. public void replaceAt(int location, int repItem); //Method to replace the element in the list at location with repItem. public void clearList(); //Method to remove all the elements from the list. public int search(int searchItem); //Method to determine whether searchItem is in the list. public void remove(int removeItem); //Method to remove an item from the list. } //Class: ArrayListClass implements //Interface: ArrayListADT public abstract class ArrayListClass implements ArrayListADT { protected int length; //to store the length of the list protected int maxSize; //to store the maximum size of the list protected int[] list; //array to hold the list elements //Default constructor public ArrayListClass() { maxSize = 100; length = 0; list = new int[maxSize]; } //Alternate Constructor public ArrayListClass(int size) { if(size <= 0) { System.err.println(\"The array size must be positive. Creating an array of size 100.\"); maxSize = 100; } else maxSize = size; length = 0; list = new int[maxSize]; } public boolean isEmpty() { return (length == 0); } public boolean isFull() { return (length == maxSize); } public int listSize() { return length; } public int maxListSize() { return maxSize; } public void print() { for (int i = 0; i < length; i++) System.out.print(list[i] + \" \"); System.out.println(); } public boolean isItemAtEqual(int location, int item) { if (location < 0 || location >= length) { System.err.println(\"The location of the item to be compared is out of range.\"); return false; } return list[location]== item; } public void clearList() { for (int i = 0; i < length; i++) list[i] = 0; length = 0; System.gc(); //invoke the Java garbage collector } public void removeAt(int location) { if (location < 0 || location >= length) System.err.println(\"The location of the item to be removed is out of range.\"); else { for(int i = location; i < length - 1; i++) list[i] .

2.(Sorted list array implementation)This sorted list ADT discussed .pdf

arshin9

Kotlin 101 Workshop

Pedro Vicente

package singlylinkedlist; public class Node { public String value; public Node next; public Node(String value) { this.value = value; } @Override public String toString() { return value; } } SingleyLinkedList.java : package singlylinkedlist; import java.io.*; import java.util.*; /** * Defines the interface for a singly-linked list. * */ public interface SinglyLinkedList { /** * @return Reference to the first node. If the list is empty, this method * returns null. */ public Node getFirst(); /** * @return Reference to the last node . If the list is empty, this method * returns null. */ public Node getLast(); /** * @return Number of nodes in the list */ public int size(); /** * @return true if the list has no nodes; false otherwise */ public boolean isEmpty(); /** * Removes all nodes in the list. */ public void clear(); /** * Inserts a new node with the given value after cursor. * * @param cursor * The node to insert after. Set this to null to insert value as the * new first Node. * @param value * The value to insert * @return a reference to the newly inserted Node */ public Node insert(Node cursor, String value); /** * Inserts a new node with the given value at the "end" of the list. * * @param value * @return a reference to the newly inserted Node */ public Node append(String value); /** * Removes the node after the specified Node (cursor) from the list. * * @param cursor * A reference to the Node to remove. */ public void removeAfter(Node cursor); /** * Returns a reference to the first Node containing the key, starting from the * given Node. * * @param start * @param key * @return a reference to the first Node containing the key */ public Node find(Node start, String key); /** * Prints the values of all the items in a list */ public void printWholeList(); } SinglyLinkedTester.java: package sbccunittest; import static java.lang.Math.*; import static java.lang.System.*; import static org.apache.commons.lang3.StringUtils.*; import static org.junit.Assert.*; import static sbcc.Core.*; import java.io.*; import java.lang.reflect.*; import java.nio.file.*; import java.util.*; import java.util.stream.*; import org.apache.commons.lang3.*; import org.junit.*; import org.w3c.dom.ranges.*; import sbcc.*; import singlylinkedlist.*; /** * 09/16/2021 * * @author sstrenn * */ public class SinglyLinkedListTester { public static String newline = System.getProperty("line.separator"); public static int totalScore = 0; public static int extraCredit = 0; public static boolean isZeroScore = false; public static String scorePreamble = ""; @BeforeClass public static void beforeTesting() { totalScore = 0; extraCredit = 0; } @AfterClass public static void afterTesting() { if (isZeroScore) { totalScore = 0; extraCredit = 0; } println(scorePreamble + "Estimated score (w/o late penalties, etc.) is: " + totalScore + " out of 25."); // If the project follows the naming convention, save the results in a folder on // the desktop. (Alex Kohanim) try { String directory = substri.

package singlylinkedlist; public class Node { public String valu.pdf

amazing2001

Implement a singly linked list as a functional data structure in Kotlin. As discussed in the class, the list should be a sealed class with enclosed classes to construct a list, including construction of an empty list. The following methods should be available for a singly linked list: 1. modifyListHead() method to replace the head of the list with a different element. This function accepts an input list and an input variable, and returns a list where the head of the input list has been replaced with the input variable. For example, calling modifyListHead(exList, 10) where exList = (1,2,3,4,5) would return (10,2,3,4,5). 2. dropFromList() method to drop the first n elements from the list. This function accepts an input list and a value for n, and returns a list with the first n elements dropped. For example, calling dropFromList(exList,1) where exList = (1,2,3,4,5) would return (2,3,4,5). 3. sumTwoLists() method that accepts two lists and adds corresponding elements of each list. This function accepts two input lists and returns their sum as illustrated in the example below. For two input lists (1,2,3) and (4,5,6), this function returns (5,7,9) 4. multiplyTwoLists() method that accepts two lists and multiplies corresponding elements in the same way sumTwoLists() adds elements of two arrays..

Implement a singly linked list as a functional data structure in Ko.pdf

alankritaecobags

Implement a minimum spanning tree using Boruvka\'s algorithm. Implement a minimum spanning tree using Boruvka\'s algorithm. Solution The psuedo code is as follows: 1 Graph input = /* read input */; 2 UnionFind uf (input.getNodes ()); 3 Workset ws = input.getNodes(); 4 foreach (Node n : ws) { 5 Edge e = minWeight (input.getOutEdges (n)); 6 Node rep1 = uf.find (e.src); 7 Node rep2 = uf.find (e.dst); 8 if (rep1 != rep2) { 9 e.markInMST(); 10 Node rep = uf.union (rep1, rep2); 11 ws.add (rep) 12 } 13 }.

Implement the additional 5 methods as indicated in the LinkedList fi.pdf

footstatus

The Big Data ecosystem has matured. Idioms such as eventual-consistency, immutability, CAP theorem and many more have been researched and successfully implemented in various Big Data tools and systems. In recent years, characteristics of Big Data systems started infiltrating the lower levels of design, all the way down to the choice of language. In this light, Scala - the Object Oriented, Strongly-Typed, Functional language - started to shine as a perfect fit for this environment, with tools like Apache Spark attesting to its benefits. In this talk I'll try to share my view of why Scala is THE language for Big Data processing, with some real-world examples of the advantages this combination creates. Full version (with animations): https://docs.google.com/presentation/d/1m4_BBXQKbkaGWImFRwa33HFVEuTcOdwa4kY80dVpvAg

Scala - THE language for Big Data

Tzach Zohar

import java.util.ArrayList; import java.util.Collections; import java.util.List; import static java.lang.System.out; public class homework { public static void main(String[] args) { List<Integer> list = new ArrayList<>(); for (int i = 0; i < 10; i++) list.add(int) (Math.random()* 10) + 1); Collections.sort(list); System.out.println("The list id : " + list); int index =linearSearch(list, 10); if (index >+ 0) System.out.println("Linear search: the number 5 was found at index " + index); else System.out.println("Linear search: the number 5 is not found "); List<String> names = new ArrayList<>(); names.add("Tyson"); names.add("John"); names.add("Edgar"); names.add("LouLou"); Collections.sort(list); System.out.println("The names are : " + names); index = linearSearch(names, "JOhn"); if (index >= 0) System.out.println("Linear search: Edgar was found at index " + names); else System.out.println("Linear search: Edgar is not found" + names); } public static <E> int linearSearch(List<E> lsit, E data) { for (int i = 0; i < list.size(); i++) if (list.get(i).equals(data)) return i; return -1; } } Chapter 14 - Linear Search and Binary Search - Assignment Due Wednesday by 11:59pm P Points 100 Submitting a text entry box or a file upload Allowed Attempts 1 Available until Mar 1 at 11:59pm Modify the binarySearch method shown in the video lecture so that it's generic. Test it with at least two types to make sure it works. Hint 1: Examine the review problem and its solution, which modifies the linear search algorithm in the same way. Hint 2: Your binarySearch method signature should be: "private static < E extends Comparable > boolean binarySearch(List list, E data): Turn in the following, - The source files (no zip file, just the individual java files). - A screen shot of your program in action. It should show the result of the test run. .

import java-util-ArrayList- import java-util-Collections- import java-.pdf

adhityalapcare

Similar to In java this manages a list of flower names public class Flo.pdf (16)