Hi, Please find my code##### Sequence.java ##############import.pdf
•
0 likes•2 views
Hi, Please find my code: ##### Sequence.java ############## import java.util.ArrayList; public class Sequence { private ArrayList values; public Sequence(){ values= new ArrayList(); } public void add(int n){ values.add(n); } // return copy of list public ArrayList getSequence(){ ArrayList copyList = new ArrayList<>(values.size()); for (Integer x : values) { copyList.add(x); } return copyList; } public String toString(){ return values.toString(); } public Sequence append(Sequence other){ Sequence res = new Sequence(); for(Integer x : values) res.add(x); for(Integer x:other.getSequence()) res.add(x); return res; } public Sequence merge(Sequence other){ int i=0, j=0; ArrayList otherList = other.getSequence(); Sequence mergeSeq = new Sequence(); while(i otherList = other.getSequence(); Sequence mergeSeq = new Sequence(); while(i otherList.get(j)){ mergeSeq.add(otherList.get(j)); j++; }else{ // both have same value mergeSeq.add(values.get(i)); i++; j++; } } while(i < values.size()){ mergeSeq.add(values.get(i)); i++; } while(j < otherList.size()){ mergeSeq.add(otherList.get(j)); j++; } return mergeSeq; } } ############ SequenceTest.java ############### public class SequenceTest { public static void main(String[] args) { Sequence s1 = new Sequence(); Sequence s2 = new Sequence(); s1.add(1); s1.add(4); s1.add(9); s1.add(16); s2.add(9); s2.add(7); s2.add(4); s2.add(9); s2.add(11); Sequence s3 = s1.merge(s2); System.out.println(\"S1: \"+s1.toString()); System.out.println(\"S2: \"+s2.toString()); System.out.println(\"S1+S2: \"+s3.toString()); Sequence s4 = new Sequence(); s4.add(4); s4.add(9); s4.add(14); s4.add(15); s4.add(16); s4.add(20); s4.add(22); Sequence s5 = s1.mergeNoDuplicates(s4); System.out.println(\"S4: \"+s4.toString()); System.out.println(\"S1+S4(no duplicate): \"+s5.toString()); } } /* Sample Output: S1: [1, 4, 9, 16] S2: [9, 7, 4, 9, 11] S1+S2: [1, 9, 4, 7, 9, 4, 16, 9, 11] S4: [4, 9, 14, 15, 16, 20, 22] S1+S4(no duplicate): [1, 4, 9, 14, 15, 16, 20, 22] */ Solution Hi, Please find my code: ##### Sequence.java ############## import java.util.ArrayList; public class Sequence { private ArrayList values; public Sequence(){ values= new ArrayList(); } public void add(int n){ values.add(n); } // return copy of list public ArrayList getSequence(){ ArrayList copyList = new ArrayList<>(values.size()); for (Integer x : values) { copyList.add(x); } return copyList; } public String toString(){ return values.toString(); } public Sequence append(Sequence other){ Sequence res = new Sequence(); for(Integer x : values) res.add(x); for(Integer x:other.getSequence()) res.add(x); return res; } public Sequence merge(Sequence other){ int i=0, j=0; ArrayList otherList = other.getSequence(); Sequence mergeSeq = new Sequence(); while(i otherList = other.getSequence(); Sequence mergeSeq = new Sequence(); while(i otherList.get(j)){ mergeSeq.add(otherList.get(j)); j++; }else{ // both have same value mergeSeq.add(values.get(i)); i++; j++; } } while(i < values.size(.
Report
Share
Report
Share
Download to read offline
![Sequence mergeSeq = new Sequence();
while(i otherList.get(j)){
mergeSeq.add(otherList.get(j));
j++;
}else{ // both have same value
mergeSeq.add(values.get(i));
i++;
j++;
}
}
while(i < values.size()){
mergeSeq.add(values.get(i));
i++;
}
while(j < otherList.size()){
mergeSeq.add(otherList.get(j));
j++;
}
return mergeSeq;
}
}
############ SequenceTest.java ###############
public class SequenceTest {
public static void main(String[] args) {
Sequence s1 = new Sequence();
Sequence s2 = new Sequence();
s1.add(1);
s1.add(4);
s1.add(9);
s1.add(16);](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.
How do you update an address according to this code- Currently- I fig.pdf
How do you update an address according to this code?
Currently, I figured out up to (the bolded line) How do I update address, display all entries and
quit.
Add a name (n)
Look up a name (l)
Update address (u)
Delete an entry (d)
Display all entries (a)
Quit (q)
-> n
import java.util.Scanner;
public class AddressBook {
public static void main(String[] args) {
Tablea addressBook = new Tablea();
Scanner scanner = new Scanner(System. in );
String key, value;
// Insert a new entry into the address book
System. out .print("Enter a name: ");
key = scanner.nextLine();
System. out .print("Enter a address: ");
value = scanner.nextLine();
addressBook.insert(key, value);
// Lookup an entry in the address book
System. out .print("Enter a name to look up: ");
key = scanner.nextLine();
String result = addressBook.lookUp(key);
if (result != null) {
System. out .println("address: " + result);
} else {
System. out .println("name not found");
}
// Delete an entry from the address book
System. out .print("Enter a name to delete: ");
key = scanner.nextLine();
boolean deleted = addressBook.delete(key);
if (deleted) {
System. out .println("address deleted");
} else {
System. out .println("name not found");
}
}
}
public class Node {
private String key;
private String value;
private Node next;
Node() {
// add here ..
}
Node(String key, String value) {
// add here ..
this.key = key;
this.value = value;
this.next = null;
}
public String getKey() {
// add here ..
return this.key;
}
public void setKey(String key) {
// add here ..
this.key = key;
}
public String getValue() {
// add here ..
return this.value;
}
public void setValue(String value) {
// add here ..
this.value = value;
}
public Node getNext() {
// add here ..
return this.next;
}
public void setNext(Node next) {
// add here ..
this.next = next;
}
}
import java.util.Scanner;
public class Tablea {
private Node mark;
public Node getMark() {
return this.mark;
}
public void setMark(Node mark) {
this.mark = mark;
}
public boolean insert(String key, String value) {
Node newNode= new Node(key,value);
if (this.mark== null) {
this.mark = newNode;
}else {
newNode.setNext(this.mark.getNext());
this.mark.setNext(newNode);
}
return true;
}
public String lookUp(String key) {
Node current = this.mark;
while(current!=null) {
if (current.getKey().equals(key)) {
return current.getValue();
}
current = current.getNext();
}
return null;
}
public boolean delete(String key) {
Node current = this.mark;
Node prev = null;
while (current!= null) {
if (current.getKey().equals(key)) {
if (prev == null) {
this.mark = current.getNext();
}else {
prev.setNext(current.getNext());
}
return true;
}
prev = current;
current = current.getNext();
}
return false;
}
public boolean update(String key, String newValue) {
Node current = this.mark;
while (current != null) {
if (current.getKey().equals(key)) {
current.setValue(newValue);
return true;
}
current = current.getNext();
}
return false;
}
public boolean markToStart() {
if (this.mark== null) {
retur.
There is something wrong with my program-- (once I do a for view all t.pdf
There is something wrong with my program.. (once I do a for view all this is the outcome in the
console...(carnea:Name: carnea, Address: 30 repeated..) why is this?
import java.util.Scanner;
public class AddressBook {
public static void main(String[] args) {
Tablea addressBook = new Tablea();
Scanner scanner = new Scanner(System.in);
String name, address;
String action = null;
boolean moreEntries = true;
while (moreEntries) {
System.out.println("/nMenu");
System.out.println("n.Add Entry");
System.out.println("d. Delete Entry");
System.out.println("u. Update Entry");
System.out.println("l. Search");
System.out.println("a. View All");
System.out.println("q. Exit");
action = scanner.nextLine();
// Insert a new entry into the address book
switch (action) {
case "n":
System.out.print("Enter a name: ");
name = scanner.nextLine();
System.out.print("Enter an address: ");
address = scanner.nextLine();
addressBook.insert(name, address);
System.out.println("New Contact has been added,");
break;
// Delete an entry from the address book
case "d":
System.out.println("Enter a name to delete: ");
name = scanner.nextLine();
boolean deleted = addressBook.delete(name);
if (deleted) {
System.out.println("Address deleted");
} else {
System.out.println("Name not found");
}
break;
// Update an entry in the address book
case "u":
System.out.print("Enter a name to update: ");
name = scanner.nextLine();
System.out.print("Enter a new address: ");
address = scanner.nextLine();
boolean updated = addressBook.update(name, address);
if (updated) {
System.out.println("Address updated");
} else {
System.out.println("Name not found");
}
break;
// Lookup an entry in the address book
case "l":
System.out.print("Enter a name to look up: ");
name = scanner.nextLine();
String result = addressBook.lookUp(name);
if (result != null) {
System.out.println("Address: " + result);
} else {
System.out.println("Name not found");
}
break;
// Display all entries in the address book
case "a":
System.out.println("All entries:");
addressBook.displayAll();
break;
// Quit the program
case"q":
System.out.println("Quitting...");
}
}
}
}
public class Node {
private String name;
private String address;
private Node next;
public Node(String name, String address) {
// add here ..
this.name = name;
this.address = address;
}
public String getName() {
// add here ..
return this.name;
}
public void setName(String name) {
// add here ..
this.name = name;
}
public String getAddress() {
// add here ..
return this.address;
}
public void setAddress(String address) {
// add here ..
this.address = address;
}
public Node getNext() {
// add here ..
return this.next;
}
public String toString() {
return "Name: "+ name +", Address:" +address;
}
public void setNext(Node node) {
// add here ..
this.next = next;
}
public void setAddress (Object newValue) {
this.address = address;
}
public void setName(Object newValue) {
this.name = name;
}
}
import java.util.Scanner;
public class Tablea {
private Node mark;
public Node get.
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.
Favor composition over inheritance
The document discusses favoring composition over inheritance when extending collection classes like HashSet. It shows how inheriting from HashSet to count element additions violates encapsulation and can cause errors. A better approach is to use composition by wrapping a Set in a new class that delegates method calls while also tracking additions. This InstrumentedSet class can work with any Set implementation rather than being tied to HashSet.
package singlylinkedlist; public class Node { public String valu.pdf
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.
6. Generics. Collections. Streams
This document discusses Java generics, collections, streams and related concepts. It provides code examples of:
- Defining generic classes and methods
- Using common collection interfaces like List, Set, Map and their implementations
- Working with streams to perform operations on data in a declarative way
- Using lambda expressions and functional interfaces with streams
How do I fix this error - Exception in thread -main- java-lang-NullPoi.pdf
How do I fix this error "
Exception in thread "main" java.lang.NullPointerException: Cannot invoke "String.hashCode()"
because "action" is null
at AddressBook.main(AddressBook.java:25)"
import java.util.Scanner;
public class AddressBook {
public static void main(String[] args) {
Tablea addressBook = new Tablea();
Scanner scanner = new Scanner(System.in);
String name, address;
String action = null;
boolean moreEntries = true;
while (moreEntries) {
System.out.println("/nMenu");
System.out.println("n.Add Entry");
System.out.println("d. Delete Entry");
System.out.println("u. Update Entry");
System.out.println("l. Search");
System.out.println("a. View All");
System.out.println("q. Exit");
// Insert a new entry into the address book
switch (action) {
case "n":
System.out.print("Enter a name: ");
name = scanner.nextLine();
System.out.print("Enter an address: ");
address = scanner.nextLine();
addressBook.insert(name, address);
System.out.println("New Contact has been added,");
System.out.print("Add another entry? (y/n): ");
String answer = scanner.nextLine().toLowerCase();
moreEntries = answer.equals("y") || answer.equals("yes");
break;
// Delete an entry from the address book
case "d":
System.out.println("Enter a name to delete: ");
name = scanner.nextLine();
boolean deleted = addressBook.delete(name);
if (deleted) {
System.out.println("Address deleted");
} else {
System.out.println("Name not found");
}
break;
// Update an entry in the address book
case "u":
System.out.print("Enter a name to update: ");
name = scanner.nextLine();
System.out.print("Enter a new address: ");
address = scanner.nextLine();
boolean updated = addressBook.update(name, address);
if (updated) {
System.out.println("Address updated");
} else {
System.out.println("Name not found");
}
break;
// Lookup an entry in the address book
case "l":
System.out.print("Enter a name to look up: ");
name = scanner.nextLine();
String result = addressBook.lookUp(name);
if (result != null) {
System.out.println("Address: " + result);
} else {
System.out.println("Name not found");
}
break;
// Display all entries in the address book
case "a":
System.out.println("All entries:");
addressBook.displayAll();
break;
// Quit the program
case"q":
System.out.println("Quitting...");
}
}
}
}
Other files that go with it
public class Node {
private String name;
private String address;
private Node next;
Node() {
// add here ..
}
Node(String name, String address) {
// add here ..
this.name = name;
this.address = address;
this.next = null;
}
public String getKey() {
// add here ..
return this.name;
}
public void setKey(String name) {
// add here ..
this.name = name;
}
public String getValue() {
// add here ..
return this.address;
}
public void setValue(String address) {
// add here ..
this.address = address;
}
public Node getNext() {
// add here ..
return this.next;
}
public void setNext(Node next) {
// add here ..
this.next = next;
}
}
import java.util.Scanner;
public class Tablea {
private Node mark;
public Node.
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.
How do you update an address according to this code- Currently- I fig.pdf
How do you update an address according to this code?
Currently, I figured out up to (the bolded line) How do I update address, display all entries and
quit.
Add a name (n)
Look up a name (l)
Update address (u)
Delete an entry (d)
Display all entries (a)
Quit (q)
-> n
import java.util.Scanner;
public class AddressBook {
public static void main(String[] args) {
Tablea addressBook = new Tablea();
Scanner scanner = new Scanner(System. in );
String key, value;
// Insert a new entry into the address book
System. out .print("Enter a name: ");
key = scanner.nextLine();
System. out .print("Enter a address: ");
value = scanner.nextLine();
addressBook.insert(key, value);
// Lookup an entry in the address book
System. out .print("Enter a name to look up: ");
key = scanner.nextLine();
String result = addressBook.lookUp(key);
if (result != null) {
System. out .println("address: " + result);
} else {
System. out .println("name not found");
}
// Delete an entry from the address book
System. out .print("Enter a name to delete: ");
key = scanner.nextLine();
boolean deleted = addressBook.delete(key);
if (deleted) {
System. out .println("address deleted");
} else {
System. out .println("name not found");
}
}
}
public class Node {
private String key;
private String value;
private Node next;
Node() {
// add here ..
}
Node(String key, String value) {
// add here ..
this.key = key;
this.value = value;
this.next = null;
}
public String getKey() {
// add here ..
return this.key;
}
public void setKey(String key) {
// add here ..
this.key = key;
}
public String getValue() {
// add here ..
return this.value;
}
public void setValue(String value) {
// add here ..
this.value = value;
}
public Node getNext() {
// add here ..
return this.next;
}
public void setNext(Node next) {
// add here ..
this.next = next;
}
}
import java.util.Scanner;
public class Tablea {
private Node mark;
public Node getMark() {
return this.mark;
}
public void setMark(Node mark) {
this.mark = mark;
}
public boolean insert(String key, String value) {
Node newNode= new Node(key,value);
if (this.mark== null) {
this.mark = newNode;
}else {
newNode.setNext(this.mark.getNext());
this.mark.setNext(newNode);
}
return true;
}
public String lookUp(String key) {
Node current = this.mark;
while(current!=null) {
if (current.getKey().equals(key)) {
return current.getValue();
}
current = current.getNext();
}
return null;
}
public boolean delete(String key) {
Node current = this.mark;
Node prev = null;
while (current!= null) {
if (current.getKey().equals(key)) {
if (prev == null) {
this.mark = current.getNext();
}else {
prev.setNext(current.getNext());
}
return true;
}
prev = current;
current = current.getNext();
}
return false;
}
public boolean update(String key, String newValue) {
Node current = this.mark;
while (current != null) {
if (current.getKey().equals(key)) {
current.setValue(newValue);
return true;
}
current = current.getNext();
}
return false;
}
public boolean markToStart() {
if (this.mark== null) {
retur.
There is something wrong with my program-- (once I do a for view all t.pdf
There is something wrong with my program.. (once I do a for view all this is the outcome in the
console...(carnea:Name: carnea, Address: 30 repeated..) why is this?
import java.util.Scanner;
public class AddressBook {
public static void main(String[] args) {
Tablea addressBook = new Tablea();
Scanner scanner = new Scanner(System.in);
String name, address;
String action = null;
boolean moreEntries = true;
while (moreEntries) {
System.out.println("/nMenu");
System.out.println("n.Add Entry");
System.out.println("d. Delete Entry");
System.out.println("u. Update Entry");
System.out.println("l. Search");
System.out.println("a. View All");
System.out.println("q. Exit");
action = scanner.nextLine();
// Insert a new entry into the address book
switch (action) {
case "n":
System.out.print("Enter a name: ");
name = scanner.nextLine();
System.out.print("Enter an address: ");
address = scanner.nextLine();
addressBook.insert(name, address);
System.out.println("New Contact has been added,");
break;
// Delete an entry from the address book
case "d":
System.out.println("Enter a name to delete: ");
name = scanner.nextLine();
boolean deleted = addressBook.delete(name);
if (deleted) {
System.out.println("Address deleted");
} else {
System.out.println("Name not found");
}
break;
// Update an entry in the address book
case "u":
System.out.print("Enter a name to update: ");
name = scanner.nextLine();
System.out.print("Enter a new address: ");
address = scanner.nextLine();
boolean updated = addressBook.update(name, address);
if (updated) {
System.out.println("Address updated");
} else {
System.out.println("Name not found");
}
break;
// Lookup an entry in the address book
case "l":
System.out.print("Enter a name to look up: ");
name = scanner.nextLine();
String result = addressBook.lookUp(name);
if (result != null) {
System.out.println("Address: " + result);
} else {
System.out.println("Name not found");
}
break;
// Display all entries in the address book
case "a":
System.out.println("All entries:");
addressBook.displayAll();
break;
// Quit the program
case"q":
System.out.println("Quitting...");
}
}
}
}
public class Node {
private String name;
private String address;
private Node next;
public Node(String name, String address) {
// add here ..
this.name = name;
this.address = address;
}
public String getName() {
// add here ..
return this.name;
}
public void setName(String name) {
// add here ..
this.name = name;
}
public String getAddress() {
// add here ..
return this.address;
}
public void setAddress(String address) {
// add here ..
this.address = address;
}
public Node getNext() {
// add here ..
return this.next;
}
public String toString() {
return "Name: "+ name +", Address:" +address;
}
public void setNext(Node node) {
// add here ..
this.next = next;
}
public void setAddress (Object newValue) {
this.address = address;
}
public void setName(Object newValue) {
this.name = name;
}
}
import java.util.Scanner;
public class Tablea {
private Node mark;
public Node get.
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.
Favor composition over inheritance
The document discusses favoring composition over inheritance when extending collection classes like HashSet. It shows how inheriting from HashSet to count element additions violates encapsulation and can cause errors. A better approach is to use composition by wrapping a Set in a new class that delegates method calls while also tracking additions. This InstrumentedSet class can work with any Set implementation rather than being tied to HashSet.
package singlylinkedlist; public class Node { public String valu.pdf
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.
6. Generics. Collections. Streams
This document discusses Java generics, collections, streams and related concepts. It provides code examples of:
- Defining generic classes and methods
- Using common collection interfaces like List, Set, Map and their implementations
- Working with streams to perform operations on data in a declarative way
- Using lambda expressions and functional interfaces with streams
How do I fix this error - Exception in thread -main- java-lang-NullPoi.pdf
How do I fix this error "
Exception in thread "main" java.lang.NullPointerException: Cannot invoke "String.hashCode()"
because "action" is null
at AddressBook.main(AddressBook.java:25)"
import java.util.Scanner;
public class AddressBook {
public static void main(String[] args) {
Tablea addressBook = new Tablea();
Scanner scanner = new Scanner(System.in);
String name, address;
String action = null;
boolean moreEntries = true;
while (moreEntries) {
System.out.println("/nMenu");
System.out.println("n.Add Entry");
System.out.println("d. Delete Entry");
System.out.println("u. Update Entry");
System.out.println("l. Search");
System.out.println("a. View All");
System.out.println("q. Exit");
// Insert a new entry into the address book
switch (action) {
case "n":
System.out.print("Enter a name: ");
name = scanner.nextLine();
System.out.print("Enter an address: ");
address = scanner.nextLine();
addressBook.insert(name, address);
System.out.println("New Contact has been added,");
System.out.print("Add another entry? (y/n): ");
String answer = scanner.nextLine().toLowerCase();
moreEntries = answer.equals("y") || answer.equals("yes");
break;
// Delete an entry from the address book
case "d":
System.out.println("Enter a name to delete: ");
name = scanner.nextLine();
boolean deleted = addressBook.delete(name);
if (deleted) {
System.out.println("Address deleted");
} else {
System.out.println("Name not found");
}
break;
// Update an entry in the address book
case "u":
System.out.print("Enter a name to update: ");
name = scanner.nextLine();
System.out.print("Enter a new address: ");
address = scanner.nextLine();
boolean updated = addressBook.update(name, address);
if (updated) {
System.out.println("Address updated");
} else {
System.out.println("Name not found");
}
break;
// Lookup an entry in the address book
case "l":
System.out.print("Enter a name to look up: ");
name = scanner.nextLine();
String result = addressBook.lookUp(name);
if (result != null) {
System.out.println("Address: " + result);
} else {
System.out.println("Name not found");
}
break;
// Display all entries in the address book
case "a":
System.out.println("All entries:");
addressBook.displayAll();
break;
// Quit the program
case"q":
System.out.println("Quitting...");
}
}
}
}
Other files that go with it
public class Node {
private String name;
private String address;
private Node next;
Node() {
// add here ..
}
Node(String name, String address) {
// add here ..
this.name = name;
this.address = address;
this.next = null;
}
public String getKey() {
// add here ..
return this.name;
}
public void setKey(String name) {
// add here ..
this.name = name;
}
public String getValue() {
// add here ..
return this.address;
}
public void setValue(String address) {
// add here ..
this.address = address;
}
public Node getNext() {
// add here ..
return this.next;
}
public void setNext(Node next) {
// add here ..
this.next = next;
}
}
import java.util.Scanner;
public class Tablea {
private Node mark;
public Node.
How to fix this error- Exception in thread -main- q- Exit java-lang-.pdf
How to fix this error:
Exception in thread "main" q. Exit
java.lang.NullPointerException: Cannot invoke "String.hashCode()" because "action" is null
at AddressBook.main(AddressBook.java:23)
import java.util.Scanner;
public class AddressBook {
public static void main(String[] args) {
Tablea addressBook = new Tablea();
Scanner scanner = new Scanner(System.in);
String name, address;
String action = null;
boolean moreEntries = true;
while (moreEntries) {
System.out.println("/nMenu");
System.out.println("n.Add Entry");
System.out.println("d. Delete Entry");
System.out.println("u. Update Entry");
System.out.println("l. Search");
System.out.println("a. View All");
System.out.println("q. Exit");
// Insert a new entry into the address book
switch (action) {
case "n":
System.out.print("Enter a name: ");
name = scanner.nextLine();
System.out.print("Enter an address: ");
address = scanner.nextLine();
addressBook.insert(name, address);
System.out.println("New Contact has been added,");
System.out.print("Add another entry? (y/n): ");
String answer = scanner.nextLine().toLowerCase();
moreEntries = answer.equals("y") || answer.equals("yes");
break;
// Delete an entry from the address book
case "d":
System.out.println("Enter a name to delete: ");
name = scanner.nextLine();
boolean deleted = addressBook.delete(name);
if (deleted) {
System.out.println("Address deleted");
} else {
System.out.println("Name not found");
}
break;
// Update an entry in the address book
case "u":
System.out.print("Enter a name to update: ");
name = scanner.nextLine();
System.out.print("Enter a new address: ");
address = scanner.nextLine();
boolean updated = addressBook.update(name, address);
if (updated) {
System.out.println("Address updated");
} else {
System.out.println("Name not found");
}
break;
// Lookup an entry in the address book
case "l":
System.out.print("Enter a name to look up: ");
name = scanner.nextLine();
String result = addressBook.lookUp(name);
if (result != null) {
System.out.println("Address: " + result);
} else {
System.out.println("Name not found");
}
break;
// Display all entries in the address book
case "a":
System.out.println("All entries:");
addressBook.displayAll();
break;
// Quit the program
case"q":
System.out.println("Quitting...");
}
}
}
}
OTHER FILES THAT GO WITH THIS
public class Node {
private String name;
private String address;
private Node next;
Node() {
// add here ..
}
Node(String name, String address) {
// add here ..
this.name = name;
this.address = address;
this.next = null;
}
public String getKey() {
// add here ..
return this.name;
}
public void setKey(String name) {
// add here ..
this.name = name;
}
public String getValue() {
// add here ..
return this.address;
}
public void setValue(String address) {
// add here ..
this.address = address;
}
public Node getNext() {
// add here ..
return this.next;
}
public void setNext(Node next) {
// add here ..
this.next = next;
}
}
import java.util.Scanner;
public class Tablea {
private Node mark;
publi.
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.
Labprogram.javaLinkedList.javaimport java.util.NoSuchElementEx.pdf
Labprogram.java
LinkedList.java
import java.util.NoSuchElementException;
public class LinkedList {
private class Node {
private T data;
private Node next;
private Node prev;
public Node(T data) {
this.data = data;
this.next = null;
this.prev = null;
}
}
private int length;
private Node first;
private Node last;
private Node iterator;
/**** CONSTRUCTORS ****/
public LinkedList() {
first = null;
last = null;
iterator = null;
length = 0;
}
/**
* Converts the given array into a LinkedList
*
* @param array the array of values to insert into this LinkedList
* @postcondition
*/
public LinkedList(T[] array) {
}
/**
* Instantiates a new LinkedList by copying another List
*
* @param original the LinkedList to copy
* @postcondition a new List object, which is an identical,
* but separate, copy of the LinkedList original
*/
public LinkedList(LinkedList original) {
}
public T getFirst() throws NoSuchElementException {
if (isEmpty()) {
throw new NoSuchElementException("The list is empty");
}
return first.data;
}
public T getLast() throws NoSuchElementException {
if (isEmpty()) {
throw new NoSuchElementException("The list is empty");
}
return last.data;
}
public T getIterator() throws NullPointerException {
if (iterator != null) {
return iterator.data;
} else {
throw new NullPointerException("Iterator is off the end opf the list.");
}
}
public int getLength() {
return length;
}
public boolean isEmpty() {
return length == 0;
}
public boolean offEnd() {
return iterator == null;
}
public void addFirst(T data) {
Node newNode = new Node(data);
if (isEmpty()) {
first = newNode;
last = newNode;
} else {
newNode.next = first;
first.prev = newNode;
first = newNode;
}
length++;
}
public void addLast(T data) {
Node newNode = new Node(data);
if (isEmpty()) {
first = newNode;
last = newNode;
} else {
last.next = newNode;
newNode.prev = last;
last = newNode;
}
length++;
}
public void addIterator(T data) throws NullPointerException {
if (offEnd()) {
throw new NullPointerException("addIterator Iterator is off end.");
}
if (iterator == last) {
addLast(data);
} else {
Node newNode = new Node(data);
Node next = iterator.next;
newNode.next = next;
newNode.prev = iterator;
iterator.next = newNode;
next.prev = newNode;
length++;
}
}
public void removeFirst() throws NoSuchElementException {
if (isEmpty()) {
throw new NoSuchElementException("The list is empty");
}
if (length == 1) {
first = null;
last = null;
iterator = null;
} else {
if (iterator == first) {
iterator = null;
}
first = first.next;
first.prev = null;
}
length--;
}
public void removeLast() throws NoSuchElementException {
if (isEmpty()) {
throw new NoSuchElementException("The list is empty");
}
if (length == 1) {
first = null;
last = null;
iterator = null;
} else {
if (iterator == last) {
iterator = null;
}
last = last.prev;
last.next = null;
}
length--;
}
public void removeIterator() throws NullPointerException {
if (offEnd()) {
throw new NullPointerException("Iterator is off the end opf the list.");
}
if (iterator .
output and explain There is Mylist There is MyArrayList pa.pdf
output and explain
There is Mylist;
There is MyArrayList:
package com.mycompany.myarraylist;
import java.util.*;
public class MyArrayList<E> implements MyList<E> {
private class ArrayListIterator implements Iterator<E> {
private int index;
public ArrayListIterator() {
index=0;
}
public boolean hasNext() {
return index < size();
}
public E next() {
index++;
return arr[index-1];
}
public void remove() {
throw new UnsupportedOperationException();
}
}
private E[] arr;
private int logicalLength;
public MyArrayList(int initCapacity) {
arr = (E[]) new Object[initCapacity];
logicalLength = 0;
}
public MyArrayList() {
this(4);
}
public boolean add(E e) {
if(isFull())
grow();
arr[logicalLength] = e;
logicalLength++;
return true;
}
public void add(int index, E element) {
if(isOutOfBounds(index))
throw new IndexOutOfBoundsException(index + " doesn't exist");
if(isFull())
grow();
for(int i=size()-1; i>=index; i--)
arr[i+1] = arr[i];
arr[index] = element;
logicalLength++;
}
public void clear() {
logicalLength = 0;
}
public boolean contains(Object obj) {
return indexOf(obj) != -1;
}
public boolean equals(Object obj) {
if(!(obj instanceof MyArrayList))
return false;
MyArrayList<E> another = (MyArrayList<E>)obj;
if(size() != another.size())
return false;
for(int i=0; i<size(); i++)
if(! (arr[i].equals(another.arr[i])))
return false;
return true;
}
public E get(int index) {
if(isOutOfBounds(index))
throw new IndexOutOfBoundsException(index + " doesn't exist");
return arr[index];
}
public E set(int index, E element) {
if(isOutOfBounds(index))
throw new IndexOutOfBoundsException(index + " doesn't exist");
E answer = arr[index];
arr[index] = element;
return answer;
}
public int indexOf(Object obj) {
for(int i=0; i<size(); i++)
if(arr[i].equals(obj))
return i;
return -1;
}
public boolean isEmpty() {
return size()==0;
}
public int size() {
return logicalLength;
}
public Iterator<E> iterator() {
return new ArrayListIterator();
}
public int lastIndexOf(Object obj) {
for(int i=size()-1; i>=0; i--)
if(arr[i].equals(obj))
return i;
return -1;
}
public E remove(int index) {
if(isOutOfBounds(index))
throw new IndexOutOfBoundsException(index + " doesn't exist");
E data = arr[index];
for(int i=index+1; i<size(); i++)
arr[i-1] = arr[i];
logicalLength--;
return data;
}
public boolean remove(Object obj) {
int index = indexOf(obj);
if(index==-1)
return false;
remove(index);
return true;
}
public String toString() {
StringBuilder sb = new StringBuilder("[ ");
for(int i=0; i<logicalLength; i++) {
sb.append(arr[i]);
if(i < logicalLength-1)
sb.append(", ");
}
sb.append("]");
return sb.toString();
}
private void grow() {
int newCapacity = 2 * arr.length;
E[] temp = (E[]) new Object[newCapacity];
for(int i=0; i<logicalLength; i++)
temp[i] = arr[i];
arr = temp;
}
private boolean isFull() {
return logicalLength == arr.length;
}
private boolean isOutOfBounds(int index) {
return index<0 || index>=logicalLength;
}
public static void main(String[] args) {
MyArrayList<Integer> list = new My.
collectionframework-141116005344-conversion-gate01.pptx
The document discusses the Java Collections Framework which provides a unified architecture for representing and manipulating collections of objects. It defines several core collection interfaces like Collection, Set, List, and Map. It also describes common collection implementations like ArrayList, LinkedList, HashSet, TreeSet, HashMap, and TreeMap. Each collection implementation has specific characteristics regarding ordering, sorting, indexing, and allowing duplicates.
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.
public class EllipsoidList { private String list- private Array.pdf
public class EllipsoidList {
private String list;
private ArrayList<Ellipsoid> ellipsoidList;
private ArrayList<Ellipsoid> ellipsoids = new ArrayList<Ellipsoid>();
public ArrayList<Ellipsoid> readFile(String filename) throws FileNotFoundException {
Scanner input = new Scanner(new File(filename));
ArrayList<Ellipsoid> list = new ArrayList<Ellipsoid>();
while (input.hasNextLine()) {
String line = input.nextLine();
String[] parts = line.split(",");
String label = parts[0];
double a = Double.parseDouble(parts[1]);
double b = Double.parseDouble(parts[2]);
double c = Double.parseDouble(parts[3]);
list.add(new Ellipsoid(label, a, b, c));
}
input.close();
ellipsoidList = new ArrayList<Ellipsoid>();
return list;
}
public void addEllipsoid(String name, double a, double b, double c) {
Ellipsoid e = new Ellipsoid(name, a, b, c);
ellipsoids.add(e);
}
public Ellipsoid findEllipsoid(String name) {
for (Ellipsoid e : ellipsoids) {
if (e.getName().equalsIgnoreCase(name)) {
return e;
}
}
return null;
}
public Ellipsoid deleteEllipsoid(String name) {
for (int i = 0; i < ellipsoids.size(); i++) {
Ellipsoid e = ellipsoids.get(i);
if (e.getName().equalsIgnoreCase(name)) {
ellipsoids.remove(i);
return e;
}
}
return null;
}
public Ellipsoid editEllipsoid(String name, double a, double b, double c) {
for (int i = 0; i < ellipsoids.size(); i++) {
Ellipsoid e = ellipsoids.get(i);
if (e.getName().equalsIgnoreCase(name)) {
return e;
}
}
return null;
}
public ArrayList<Ellipsoid> getList() {
return ellipsoidList;
}
/**
* Create a EllipsoidList object.
* @param listIn for listName
* @param ellipsoidListIn for ellipsoidList
*/
public EllipsoidList(String listIn, ArrayList<Ellipsoid> ellipsoidListIn) {
list = listIn;
ellipsoidList = new ArrayList<Ellipsoid>();
for (Ellipsoid e : ellipsoidListIn) {
ellipsoidList.add(e);
}
}
//methods
/**
* @return the list name
*/
public String getName() {
return list;
}
/**
* @return the list name
*/
public int numberOfEllipsoids() {
return ellipsoidList.size();
}
/**
* @return the list name
*/
public double totalVolume() {
double total = 0;
//use for each loop
for (Ellipsoid e : ellipsoidList) {
if (e != null) {
total += (e.volume());
}
}
// return the total volume
return total;
}
/**
* counts the total.
*
* @return totalSurfaceArea
*/
public double totalSurfaceArea() {
double total = 0;
//use for each loop
for (Ellipsoid e : ellipsoidList) {
if (e != null) {
total += (e.surfaceArea());
}
}
return total;
}
/**
* finds.
*
* @return averageVolume
*/
public double averageVolume() {
if (this.numberOfEllipsoids() == 0) {
return 0;
}
else {
return this.totalVolume() / this.numberOfEllipsoids();
}
}
/**
* finds.
*
* @return averageSurfaceArea
*/
public double averageSurfaceArea() {
if (this.numberOfEllipsoids() == 0) {
return 0;
}
else {
return this.totalSurfaceArea() / this.numberOfEllipsoids();
}
}
/**
* gets a summary of the ellipsoid in the list.
*
* @return summaryInfo
*/
public String toString() {
String result = getName() + "\n";
int index =.
07 java collection
The Java Collection Framework provides interfaces and implementations for commonly used data structures like lists, sets, maps and queues. Some key interfaces include Collection, Set, List, Map and SortedSet. Common implementations are ArrayList, LinkedList, HashSet, TreeSet, HashMap and TreeMap. The framework also includes iterators for traversing collections and algorithms for sorting. Generic types were introduced in Java 5 for type-safe collections.
can you add a delete button and a add button to the below program. j.pdf
The document describes a Java program that implements a linked list of Car objects. It includes classes for the Car object with attributes like make, model, year, and color, and a NuLinkedList class that implements basic linked list functionality for adding, removing, and accessing Car elements. The program reads a file of cars into an ArrayList and provides buttons to navigate between cars, displaying the current car details. The request is to add delete and add buttons to allow removing and adding cars to the linked list from the GUI.
Given an ArrayList, write a Java method that returns a new ArrayList.pdf
Given an ArrayList, write a Java method that returns a new ArrayList which
contains only the non-duplicate elements from the original list.
import java.util.ArrayList;
public class Exercise1 {
public static void main(String[] args) {
ArrayList list = new ArrayList();
list.add(14);
list.add(24);
list.add(14);
list.add(42);
list.add(25);
ArrayList newList = removeDuplicates(list);
System.out.print(newList);
}
public static ArrayList removeDuplicates(ArrayList list) {
// Your code here!
}
Solution
HI, Please find my implementation.
Please let me know in case of any issue.
import java.util.ArrayList;
public class Exercise1 {
public static void main(String[] args) {
ArrayList list = new ArrayList();
list.add(14);
list.add(24);
list.add(14);
list.add(42);
list.add(25);
ArrayList newList = removeDuplicates(list);
System.out.print(newList);
}
public static ArrayList removeDuplicates(ArrayList list) {
ArrayList noDupList = new ArrayList<>();
// iterating over list
for(E e : list){
if(! noDupList.contains(e)) // if \'e\' is not in noDupList then add it
noDupList.add(e);
}
return noDupList;
}
}
/*
Sample run:
[14, 24, 42, 25]
*/.
Please add-modify the following to the original code using C# 1- Delet.docx
The document requests adding or modifying code to an existing C# class that implements an array list to include the following methods: DeleteFirst, DeleteLast, DeleteValue(value), Delete(index), and Reverse. It provides the starting code for the MyList class and requests adding meaningful comments and returning an upvote.
ReverseList.javaimport java.util.ArrayList;public class Rever.pdf
This Java program defines a ReverseList class containing a static reverse method that takes an ArrayList and size as parameters. It reverses the order of elements in the list by swapping the first and last elements, second and second to last, and so on. The main method creates a sample list, prints it, calls reverse on the list, and prints the reversed list.
I have created a class hasdhedDictionary that implements the Diction.pdf
I have created a class hasdhedDictionary that implements the DictionaryInterface.java that
should count the collisions when reading a txt file
Write an application WordFrequency that will be using the Dictionary ADT to study the
number of collisions that occur with different hash table length, use 1361, 1637 and 2011 it
should not return zero but a value. for the txt file plz us the US constitution, if my collision
counter is wrong (public V add(K key, V value) please rework it)
do not add new adt or implementations like nodes, linked list or array or methods like setNext or
getNext
HASHEDDICTIONARY
import java.util.Iterator;
import java.util.NoSuchElementException;
public class HashedDictionary implements DictionaryInterface
{
// The dictionary:
private int numberOfEntries;
private static final int DEFAULT_CAPACITY = 5; // Must be prime
private static final int MAX_CAPACITY = 10000;
// The hash table:
private Entry[] hashTable;
private int tableSize; // Must be prime
private static final int MAX_SIZE = 2 * MAX_CAPACITY;
private boolean integrityOK = false;
private static final double MAX_LOAD_FACTOR = 0.5; // Fraction of
// hash table that can be filled
private int collisionCount;
protected final Entry AVAILABLE = new Entry<>(null, null);
// Counter to keep track of collisions
public HashedDictionary()
{
this(DEFAULT_CAPACITY); // Call next constructor
} // end default constructor
public HashedDictionary(int initialCapacity)
{
initialCapacity = checkCapacity(initialCapacity);
numberOfEntries = 0; // Dictionary is empty
// Set up hash table:
// Initial size of hash table is same as initialCapacity if it is prime;
// otherwise increase it until it is prime size
tableSize = getNextPrime(initialCapacity);
checkSize(tableSize); // Check that size is not too large
// The cast is safe because the new array contains null entries
@SuppressWarnings("unchecked")
Entry[] temp = (Entry[])new Entry[tableSize];
hashTable = temp;
integrityOK = true;
collisionCount = 0;
} // end constructor
/* Implementations of methods in DictionaryInterface are here. . . .*/
public V add(K key, V value) {
int index = getHashIndex(key);
V oldValue = null;
if (key == null || value == null) {
throw new NoSuchElementException("Cannot add null key or value.");
}
// If the index is empty or has an AVAILABLE entry, add the new entry.
if (hashTable[index] == null || hashTable[index] == AVAILABLE) {
hashTable[index] = new Entry<>(key, value);
numberOfEntries++;
}
// If the index has the same key as the new entry, update the value.
else if (hashTable[index].getKey().equals(key)) {
oldValue = hashTable[index].getValue();
hashTable[index].setValue(value);
}
// Otherwise, there is a collision.
else {
int startIndex = index;
index = (index + 1) % hashTable.length;
// Keep probing until an empty or AVAILABLE index is found.
while (index != startIndex && hashTable[index] != null && hashTable[index] != AVAILABLE)
{
index = (index + 1) % hashTable.length;
}
// If an empty index is found, ad.
For this micro assignment, you must implement two Linked List functi.docx
For this micro assignment, you must implement two Linked List functions. We will use the following
example Linked List:
2 0 -1 5 7
getElementAt(index)
This function should return the element (i.e. value) of the Nth item inside the linked list. For example,
on the Linked List above, getElementAt(0) should return 2; getElementAt(3) should return 5.
addElementAt(value, location)
This function should insert a new value at the given location. Note that the location supplied must be
within bounds of the LinkedList. For example, we cannot call addElementAt(4, 11) on the above Linked
List because 11 is beyond the size of the Linked List.
Here are some examples. If we call addElementAt(0, 1), the above Linked List would now look like:
1 2 0 -1 5 7
If we again call addElementAt(2, 123), we would get:
1 2 123 0 -1 5 7
Grading
Your submission will be graded based on the following:
1. [7] Your solution does not cause any runtime issues and your file passes all test cases
2. [3] Your code contains good style. For example,
You provide meaningful variable names
You provide sufficient and meaningful comments
Your code is well structured
@@@@@@@@@@@@@@@@@@@@@@@@
#ifndef LINKED_LIST_H
#define LINKED_LIST_H
#include
#include
#include "LinkedListNode.h"
#include
using namespace std;
template
class LinkedList
{
private:
//points to the front of the linked list
LinkedListNode *_front = nullptr;
//keeping track of size in a variable eliminates need to continually
//count LL boxes.
int _size = 0;
protected:
//creates a new LinkedListNode for us
virtual LinkedListNode *createNode(T value)
{
return new LinkedListNode < T > { value };
}
public:
//default constructor
LinkedList()
{
_front = nullptr;
}
//copy constructor
LinkedList(const LinkedList &other)
{
for (int i = 0; i < other.getSize(); i++)
{
addElement(other.getElementAt(i));
}
}
//move constructor
LinkedList(LinkedList &&other)
{
//take other's data
_front = other._front;
_size = other._size;
//reset other's pointers
other._front = nullptr;
}
//initializer list constructor
LinkedList(initializer_list values)
{
for (auto item : values)
{
addElement(item);
}
}
//Always remember to clean up pointers in destructor!
virtual ~LinkedList()
{
LinkedListNode *current = _front;
while (current != nullptr)
{
LinkedListNode *temp = current->getNext();
delete current;
current = temp;
}
}
//will return true if the LL is empty.
virtual bool isEmpty() const
{
return _size == 0;
}
//returns the size of the LL.
virtual int getSize() const
{
return _size;
}
.
2 a networkflow
This Java code implements the Ford-Fulkerson algorithm to find the maximum flow and minimum cut set in a network flow problem. It takes a graph as input with a specified source and sink node, runs BFS to find augmenting paths, and calculates the residual graph after sending flow along each path to find the maximum flow. It then uses BFS again to separate the graph into reachable and unreachable nodes from the source to determine the minimum cut set.
Scala vs Java 8 in a Java 8 World
Scala is becoming the language of choice for many development teams. This talk highlights how Scala excels in the world of multi-core processing and explores how it compares to Java 8.
Video Presentation: http://youtu.be/8vxTowBXJSg
JDK 8
The document discusses new features in JDK8 including lambdas and functional interfaces, default methods, static interface methods, method references, repeating annotations, extended annotations, Optional, Streams, Date/Time API improvements, Nashorn JavaScript engine, Base64 encoding, jjs and jdepts tools, and Metaspace. Key changes include lambda expressions to write anonymous functions more concisely, default methods to add new methods to interfaces without breaking existing implementations, and functional interfaces to allow lambda expressions to be treated as objects.
package edu-ser222-m03_02- --- - A binary search tree based impleme.docx
package edu.ser222.m03_02;
/**
* A binary search tree based implementation of a symbol table.
*
* Completion time: (your completion time)
*
* @author (your name), Sedgewick, Acuna
* @version (version)
*/
import java.util.Collections;
import java.util.LinkedList;
import java.util.NoSuchElementException;
import java.util.Queue;
public class CompletedBST<Key extends Comparable<Key>, Value> implements BST<Key, Value> {
private Node<Key, Value> root;
@Override
public int size() {
return size(root);
}
private int size(Node x) {
if (x == null)
return 0;
else
return x.N;
}
@Override
public Value get(Key key) {
Node<Key, Value> iter = root;
while(iter != null) {
int cmp = key.compareTo(iter.key);
if (cmp < 0)
iter = iter.left;
else if (cmp > 0)
iter = iter.right;
else
return iter.val;
}
return null;
}
private Value get(Node<Key, Value> x, Key key) {
// Return value associated with key in the subtree rooted at x;
// return null if key not present in subtree rooted at x.
if (x == null) return null;
int cmp = key.compareTo(x.key);
if (cmp < 0) return get(x.left, key);
else if (cmp > 0) return get(x.right, key);
else return x.val;
}
@Override
public void put(Key key, Value val) {
root = put(root, key, val);
}
private Node put(Node<Key, Value> x, Key key, Value val) {
if (x == null)
return new Node(key, val, 1);
int cmp = key.compareTo(x.key);
if (cmp < 0)
x.left = put(x.left, key, val);
else if (cmp > 0)
x.right = put(x.right, key, val);
else
x.val = val;
x.N = size(x.left) + size(x.right) + 1;
return x;
}
@Override
public Key min() {
if(root == null)
throw new NoSuchElementException();
return min(root).key;
}
private Node<Key, Value> min(Node x) {
if (x.left == null)
return x;
return min(x.left);
}
@Override
public Key max() {
if(root == null)
throw new NoSuchElementException();
return max(root).key;
}
private Node<Key, Value> max(Node x) {
if (x.right == null) return x;
return max(x.right);
}
@Override
public Key floor(Key key) {
if(root == null)
throw new NoSuchElementException();
Node<Key, Value> x = floor(root, key);
if (x == null)
return null;
return x.key;
}
private Node<Key, Value> floor(Node<Key, Value> x, Key key) {
if (x == null)
return null;
int cmp = key.compareTo(x.key);
if (cmp == 0) return x;
if (cmp < 0) return floor(x.left, key);
Node<Key, Value> t = floor(x.right, key);
if (t != null) return t;
else return x;
}
@Override
public Key select(int k) {
return select(root, k).key;
}
private Node<Key, Value> select(Node x, int k) {
if (x == null) return null;
int t = size(x.left);
if (t > k) return select(x.left, k);
else if (t < k) return select(x.right, k-t-1);
else return x;
}
@Override
public int rank(Key key) {
return rank(key, root);
}
private int rank(Key key, Node<Key, Value> x) {
// Return number of keys less than x.key in the subtree rooted at x.
if (x == null) return 0;
int cmp = key.compareTo(x.key);
if (cmp < 0) return rank(key, x.left);
else if (cmp > 0) return 1 + size(x.left) + rank(key, x.right);
else return size(x.left);
}
@O.
How can I add multiple names and addresses- To the following code- Tab.pdf
How can I add multiple names and addresses? To the following code?
Tablea addressBook = new Tablea();
Scanner scanner = new Scanner(System.in);
String key, value;
// Insert a new entry into the address book
System.out.print("Enter a name: ");
key = scanner.nextLine();
System.out.print("Enter an address: ");
value = scanner.nextLine();
addressBook.insert(key, value);
// Lookup an entry in the address book
System.out.print("Enter a name to look up: ");
key = scanner.nextLine();
String result = addressBook.lookUp(key);
if (result != null) {
System.out.println("Address: " + result);
} else {
System.out.println("Name not found");
}
// Delete an entry from the address book
System.out.print("Enter a name to delete: ");
key = scanner.nextLine();
boolean deleted = addressBook.delete(key);
if (deleted) {
System.out.println("Address deleted");
} else {
System.out.println("Name not found");
}
// Update an entry in the address book
System.out.print("Enter a name to update: ");
key = scanner.nextLine();
System.out.print("Enter a new address: ");
value = scanner.nextLine();
boolean updated = addressBook.update(key, value);
if (updated) {
System.out.println("Address updated");
} else {
System.out.println("Name not found");
}
// Display all entries in the address book
System.out.println("All entries:");
addressBook.displayAll();
// Quit the program
System.out.println("Quitting...");
}
public class Node {
private String key;
private String value;
private Node next;
Node() {
// add here ..
}
Node(String key, String value) {
// add here ..
this.key = key;
this.value = value;
this.next = null;
}
public String getKey() {
// add here ..
return this.key;
}
public void setKey(String key) {
// add here ..
this.key = key;
}
public String getValue() {
// add here ..
return this.value;
}
public void setValue(String value) {
// add here ..
this.value = value;
}
public Node getNext() {
// add here ..
return this.next;
}
public void setNext(Node next) {
// add here ..
this.next = next;
}
}
import java.util.Scanner;
public class Tablea {
private Node mark;
public Node getMark() {
return this.mark;
}
public void setMark(Node mark) {
this.mark = mark;
}
public boolean insert(String key, String value) {
Node newNode= new Node(key,value);
if (this.mark== null) {
this.mark = newNode;
}else {
newNode.setNext(this.mark.getNext());
this.mark.setNext(newNode);
}
return true;
}
public String lookUp(String key) {
Node current = this.mark;
while(current!=null) {
if (current.getKey().equals(key)) {
return current.getValue();
}
current = current.getNext();
}
return null;
}
public boolean delete(String key) {
Node current = this.mark;
Node prev = null;
while (current!= null) {
if (current.getKey().equals(key)) {
if (prev == null) {
this.mark = current.getNext();
}else {
prev.setNext(current.getNext());
}
return true;
}
prev = current;
current = current.getNext();
}
return false;
}
public boolean update(String key, String newValue) {
Node current = this.mark;
while (current != null) {
if (c.
practical 9.docx
This Java code defines a LinkedHashSet of Strings, adds elements to it including duplicates, prints the set, removes an element, prints the updated set, and then iterates through the set using an iterator to print each remaining element.
8. Reflexive. as the hormone is releases in response to an external .pdf
8. Reflexive. as the hormone is releases in response to an external stimulus.
9. Trophic response .
10.Anbolic.
11.C.
12.D.
Solution
8. Reflexive. as the hormone is releases in response to an external stimulus.
9. Trophic response .
10.Anbolic.
11.C.
12.D..
3(s) + HClSolution3(s) + HCl.pdf
This chemical reaction involves reacting metallic sodium (3(s)) with hydrochloric acid (HCl) to form a solution. Metallic sodium reacts with hydrochloric acid, dissolving into solution. The unbalanced chemical equation shows metallic sodium (3(s)) reacting with hydrochloric acid (HCl).
More Related Content
Similar to Hi, Please find my code##### Sequence.java ##############import.pdf
How to fix this error- Exception in thread -main- q- Exit java-lang-.pdf
How to fix this error:
Exception in thread "main" q. Exit
java.lang.NullPointerException: Cannot invoke "String.hashCode()" because "action" is null
at AddressBook.main(AddressBook.java:23)
import java.util.Scanner;
public class AddressBook {
public static void main(String[] args) {
Tablea addressBook = new Tablea();
Scanner scanner = new Scanner(System.in);
String name, address;
String action = null;
boolean moreEntries = true;
while (moreEntries) {
System.out.println("/nMenu");
System.out.println("n.Add Entry");
System.out.println("d. Delete Entry");
System.out.println("u. Update Entry");
System.out.println("l. Search");
System.out.println("a. View All");
System.out.println("q. Exit");
// Insert a new entry into the address book
switch (action) {
case "n":
System.out.print("Enter a name: ");
name = scanner.nextLine();
System.out.print("Enter an address: ");
address = scanner.nextLine();
addressBook.insert(name, address);
System.out.println("New Contact has been added,");
System.out.print("Add another entry? (y/n): ");
String answer = scanner.nextLine().toLowerCase();
moreEntries = answer.equals("y") || answer.equals("yes");
break;
// Delete an entry from the address book
case "d":
System.out.println("Enter a name to delete: ");
name = scanner.nextLine();
boolean deleted = addressBook.delete(name);
if (deleted) {
System.out.println("Address deleted");
} else {
System.out.println("Name not found");
}
break;
// Update an entry in the address book
case "u":
System.out.print("Enter a name to update: ");
name = scanner.nextLine();
System.out.print("Enter a new address: ");
address = scanner.nextLine();
boolean updated = addressBook.update(name, address);
if (updated) {
System.out.println("Address updated");
} else {
System.out.println("Name not found");
}
break;
// Lookup an entry in the address book
case "l":
System.out.print("Enter a name to look up: ");
name = scanner.nextLine();
String result = addressBook.lookUp(name);
if (result != null) {
System.out.println("Address: " + result);
} else {
System.out.println("Name not found");
}
break;
// Display all entries in the address book
case "a":
System.out.println("All entries:");
addressBook.displayAll();
break;
// Quit the program
case"q":
System.out.println("Quitting...");
}
}
}
}
OTHER FILES THAT GO WITH THIS
public class Node {
private String name;
private String address;
private Node next;
Node() {
// add here ..
}
Node(String name, String address) {
// add here ..
this.name = name;
this.address = address;
this.next = null;
}
public String getKey() {
// add here ..
return this.name;
}
public void setKey(String name) {
// add here ..
this.name = name;
}
public String getValue() {
// add here ..
return this.address;
}
public void setValue(String address) {
// add here ..
this.address = address;
}
public Node getNext() {
// add here ..
return this.next;
}
public void setNext(Node next) {
// add here ..
this.next = next;
}
}
import java.util.Scanner;
public class Tablea {
private Node mark;
publi.
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.
Labprogram.javaLinkedList.javaimport java.util.NoSuchElementEx.pdf
Labprogram.java
LinkedList.java
import java.util.NoSuchElementException;
public class LinkedList {
private class Node {
private T data;
private Node next;
private Node prev;
public Node(T data) {
this.data = data;
this.next = null;
this.prev = null;
}
}
private int length;
private Node first;
private Node last;
private Node iterator;
/**** CONSTRUCTORS ****/
public LinkedList() {
first = null;
last = null;
iterator = null;
length = 0;
}
/**
* Converts the given array into a LinkedList
*
* @param array the array of values to insert into this LinkedList
* @postcondition
*/
public LinkedList(T[] array) {
}
/**
* Instantiates a new LinkedList by copying another List
*
* @param original the LinkedList to copy
* @postcondition a new List object, which is an identical,
* but separate, copy of the LinkedList original
*/
public LinkedList(LinkedList original) {
}
public T getFirst() throws NoSuchElementException {
if (isEmpty()) {
throw new NoSuchElementException("The list is empty");
}
return first.data;
}
public T getLast() throws NoSuchElementException {
if (isEmpty()) {
throw new NoSuchElementException("The list is empty");
}
return last.data;
}
public T getIterator() throws NullPointerException {
if (iterator != null) {
return iterator.data;
} else {
throw new NullPointerException("Iterator is off the end opf the list.");
}
}
public int getLength() {
return length;
}
public boolean isEmpty() {
return length == 0;
}
public boolean offEnd() {
return iterator == null;
}
public void addFirst(T data) {
Node newNode = new Node(data);
if (isEmpty()) {
first = newNode;
last = newNode;
} else {
newNode.next = first;
first.prev = newNode;
first = newNode;
}
length++;
}
public void addLast(T data) {
Node newNode = new Node(data);
if (isEmpty()) {
first = newNode;
last = newNode;
} else {
last.next = newNode;
newNode.prev = last;
last = newNode;
}
length++;
}
public void addIterator(T data) throws NullPointerException {
if (offEnd()) {
throw new NullPointerException("addIterator Iterator is off end.");
}
if (iterator == last) {
addLast(data);
} else {
Node newNode = new Node(data);
Node next = iterator.next;
newNode.next = next;
newNode.prev = iterator;
iterator.next = newNode;
next.prev = newNode;
length++;
}
}
public void removeFirst() throws NoSuchElementException {
if (isEmpty()) {
throw new NoSuchElementException("The list is empty");
}
if (length == 1) {
first = null;
last = null;
iterator = null;
} else {
if (iterator == first) {
iterator = null;
}
first = first.next;
first.prev = null;
}
length--;
}
public void removeLast() throws NoSuchElementException {
if (isEmpty()) {
throw new NoSuchElementException("The list is empty");
}
if (length == 1) {
first = null;
last = null;
iterator = null;
} else {
if (iterator == last) {
iterator = null;
}
last = last.prev;
last.next = null;
}
length--;
}
public void removeIterator() throws NullPointerException {
if (offEnd()) {
throw new NullPointerException("Iterator is off the end opf the list.");
}
if (iterator .
output and explain There is Mylist There is MyArrayList pa.pdf
output and explain
There is Mylist;
There is MyArrayList:
package com.mycompany.myarraylist;
import java.util.*;
public class MyArrayList<E> implements MyList<E> {
private class ArrayListIterator implements Iterator<E> {
private int index;
public ArrayListIterator() {
index=0;
}
public boolean hasNext() {
return index < size();
}
public E next() {
index++;
return arr[index-1];
}
public void remove() {
throw new UnsupportedOperationException();
}
}
private E[] arr;
private int logicalLength;
public MyArrayList(int initCapacity) {
arr = (E[]) new Object[initCapacity];
logicalLength = 0;
}
public MyArrayList() {
this(4);
}
public boolean add(E e) {
if(isFull())
grow();
arr[logicalLength] = e;
logicalLength++;
return true;
}
public void add(int index, E element) {
if(isOutOfBounds(index))
throw new IndexOutOfBoundsException(index + " doesn't exist");
if(isFull())
grow();
for(int i=size()-1; i>=index; i--)
arr[i+1] = arr[i];
arr[index] = element;
logicalLength++;
}
public void clear() {
logicalLength = 0;
}
public boolean contains(Object obj) {
return indexOf(obj) != -1;
}
public boolean equals(Object obj) {
if(!(obj instanceof MyArrayList))
return false;
MyArrayList<E> another = (MyArrayList<E>)obj;
if(size() != another.size())
return false;
for(int i=0; i<size(); i++)
if(! (arr[i].equals(another.arr[i])))
return false;
return true;
}
public E get(int index) {
if(isOutOfBounds(index))
throw new IndexOutOfBoundsException(index + " doesn't exist");
return arr[index];
}
public E set(int index, E element) {
if(isOutOfBounds(index))
throw new IndexOutOfBoundsException(index + " doesn't exist");
E answer = arr[index];
arr[index] = element;
return answer;
}
public int indexOf(Object obj) {
for(int i=0; i<size(); i++)
if(arr[i].equals(obj))
return i;
return -1;
}
public boolean isEmpty() {
return size()==0;
}
public int size() {
return logicalLength;
}
public Iterator<E> iterator() {
return new ArrayListIterator();
}
public int lastIndexOf(Object obj) {
for(int i=size()-1; i>=0; i--)
if(arr[i].equals(obj))
return i;
return -1;
}
public E remove(int index) {
if(isOutOfBounds(index))
throw new IndexOutOfBoundsException(index + " doesn't exist");
E data = arr[index];
for(int i=index+1; i<size(); i++)
arr[i-1] = arr[i];
logicalLength--;
return data;
}
public boolean remove(Object obj) {
int index = indexOf(obj);
if(index==-1)
return false;
remove(index);
return true;
}
public String toString() {
StringBuilder sb = new StringBuilder("[ ");
for(int i=0; i<logicalLength; i++) {
sb.append(arr[i]);
if(i < logicalLength-1)
sb.append(", ");
}
sb.append("]");
return sb.toString();
}
private void grow() {
int newCapacity = 2 * arr.length;
E[] temp = (E[]) new Object[newCapacity];
for(int i=0; i<logicalLength; i++)
temp[i] = arr[i];
arr = temp;
}
private boolean isFull() {
return logicalLength == arr.length;
}
private boolean isOutOfBounds(int index) {
return index<0 || index>=logicalLength;
}
public static void main(String[] args) {
MyArrayList<Integer> list = new My.
collectionframework-141116005344-conversion-gate01.pptx
The document discusses the Java Collections Framework which provides a unified architecture for representing and manipulating collections of objects. It defines several core collection interfaces like Collection, Set, List, and Map. It also describes common collection implementations like ArrayList, LinkedList, HashSet, TreeSet, HashMap, and TreeMap. Each collection implementation has specific characteristics regarding ordering, sorting, indexing, and allowing duplicates.
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.
public class EllipsoidList { private String list- private Array.pdf
public class EllipsoidList {
private String list;
private ArrayList<Ellipsoid> ellipsoidList;
private ArrayList<Ellipsoid> ellipsoids = new ArrayList<Ellipsoid>();
public ArrayList<Ellipsoid> readFile(String filename) throws FileNotFoundException {
Scanner input = new Scanner(new File(filename));
ArrayList<Ellipsoid> list = new ArrayList<Ellipsoid>();
while (input.hasNextLine()) {
String line = input.nextLine();
String[] parts = line.split(",");
String label = parts[0];
double a = Double.parseDouble(parts[1]);
double b = Double.parseDouble(parts[2]);
double c = Double.parseDouble(parts[3]);
list.add(new Ellipsoid(label, a, b, c));
}
input.close();
ellipsoidList = new ArrayList<Ellipsoid>();
return list;
}
public void addEllipsoid(String name, double a, double b, double c) {
Ellipsoid e = new Ellipsoid(name, a, b, c);
ellipsoids.add(e);
}
public Ellipsoid findEllipsoid(String name) {
for (Ellipsoid e : ellipsoids) {
if (e.getName().equalsIgnoreCase(name)) {
return e;
}
}
return null;
}
public Ellipsoid deleteEllipsoid(String name) {
for (int i = 0; i < ellipsoids.size(); i++) {
Ellipsoid e = ellipsoids.get(i);
if (e.getName().equalsIgnoreCase(name)) {
ellipsoids.remove(i);
return e;
}
}
return null;
}
public Ellipsoid editEllipsoid(String name, double a, double b, double c) {
for (int i = 0; i < ellipsoids.size(); i++) {
Ellipsoid e = ellipsoids.get(i);
if (e.getName().equalsIgnoreCase(name)) {
return e;
}
}
return null;
}
public ArrayList<Ellipsoid> getList() {
return ellipsoidList;
}
/**
* Create a EllipsoidList object.
* @param listIn for listName
* @param ellipsoidListIn for ellipsoidList
*/
public EllipsoidList(String listIn, ArrayList<Ellipsoid> ellipsoidListIn) {
list = listIn;
ellipsoidList = new ArrayList<Ellipsoid>();
for (Ellipsoid e : ellipsoidListIn) {
ellipsoidList.add(e);
}
}
//methods
/**
* @return the list name
*/
public String getName() {
return list;
}
/**
* @return the list name
*/
public int numberOfEllipsoids() {
return ellipsoidList.size();
}
/**
* @return the list name
*/
public double totalVolume() {
double total = 0;
//use for each loop
for (Ellipsoid e : ellipsoidList) {
if (e != null) {
total += (e.volume());
}
}
// return the total volume
return total;
}
/**
* counts the total.
*
* @return totalSurfaceArea
*/
public double totalSurfaceArea() {
double total = 0;
//use for each loop
for (Ellipsoid e : ellipsoidList) {
if (e != null) {
total += (e.surfaceArea());
}
}
return total;
}
/**
* finds.
*
* @return averageVolume
*/
public double averageVolume() {
if (this.numberOfEllipsoids() == 0) {
return 0;
}
else {
return this.totalVolume() / this.numberOfEllipsoids();
}
}
/**
* finds.
*
* @return averageSurfaceArea
*/
public double averageSurfaceArea() {
if (this.numberOfEllipsoids() == 0) {
return 0;
}
else {
return this.totalSurfaceArea() / this.numberOfEllipsoids();
}
}
/**
* gets a summary of the ellipsoid in the list.
*
* @return summaryInfo
*/
public String toString() {
String result = getName() + "\n";
int index =.
07 java collection
The Java Collection Framework provides interfaces and implementations for commonly used data structures like lists, sets, maps and queues. Some key interfaces include Collection, Set, List, Map and SortedSet. Common implementations are ArrayList, LinkedList, HashSet, TreeSet, HashMap and TreeMap. The framework also includes iterators for traversing collections and algorithms for sorting. Generic types were introduced in Java 5 for type-safe collections.
can you add a delete button and a add button to the below program. j.pdf
The document describes a Java program that implements a linked list of Car objects. It includes classes for the Car object with attributes like make, model, year, and color, and a NuLinkedList class that implements basic linked list functionality for adding, removing, and accessing Car elements. The program reads a file of cars into an ArrayList and provides buttons to navigate between cars, displaying the current car details. The request is to add delete and add buttons to allow removing and adding cars to the linked list from the GUI.
Given an ArrayList, write a Java method that returns a new ArrayList.pdf
Given an ArrayList, write a Java method that returns a new ArrayList which
contains only the non-duplicate elements from the original list.
import java.util.ArrayList;
public class Exercise1 {
public static void main(String[] args) {
ArrayList list = new ArrayList();
list.add(14);
list.add(24);
list.add(14);
list.add(42);
list.add(25);
ArrayList newList = removeDuplicates(list);
System.out.print(newList);
}
public static ArrayList removeDuplicates(ArrayList list) {
// Your code here!
}
Solution
HI, Please find my implementation.
Please let me know in case of any issue.
import java.util.ArrayList;
public class Exercise1 {
public static void main(String[] args) {
ArrayList list = new ArrayList();
list.add(14);
list.add(24);
list.add(14);
list.add(42);
list.add(25);
ArrayList newList = removeDuplicates(list);
System.out.print(newList);
}
public static ArrayList removeDuplicates(ArrayList list) {
ArrayList noDupList = new ArrayList<>();
// iterating over list
for(E e : list){
if(! noDupList.contains(e)) // if \'e\' is not in noDupList then add it
noDupList.add(e);
}
return noDupList;
}
}
/*
Sample run:
[14, 24, 42, 25]
*/.
Please add-modify the following to the original code using C# 1- Delet.docx
The document requests adding or modifying code to an existing C# class that implements an array list to include the following methods: DeleteFirst, DeleteLast, DeleteValue(value), Delete(index), and Reverse. It provides the starting code for the MyList class and requests adding meaningful comments and returning an upvote.
ReverseList.javaimport java.util.ArrayList;public class Rever.pdf
This Java program defines a ReverseList class containing a static reverse method that takes an ArrayList and size as parameters. It reverses the order of elements in the list by swapping the first and last elements, second and second to last, and so on. The main method creates a sample list, prints it, calls reverse on the list, and prints the reversed list.
I have created a class hasdhedDictionary that implements the Diction.pdf
I have created a class hasdhedDictionary that implements the DictionaryInterface.java that
should count the collisions when reading a txt file
Write an application WordFrequency that will be using the Dictionary ADT to study the
number of collisions that occur with different hash table length, use 1361, 1637 and 2011 it
should not return zero but a value. for the txt file plz us the US constitution, if my collision
counter is wrong (public V add(K key, V value) please rework it)
do not add new adt or implementations like nodes, linked list or array or methods like setNext or
getNext
HASHEDDICTIONARY
import java.util.Iterator;
import java.util.NoSuchElementException;
public class HashedDictionary implements DictionaryInterface
{
// The dictionary:
private int numberOfEntries;
private static final int DEFAULT_CAPACITY = 5; // Must be prime
private static final int MAX_CAPACITY = 10000;
// The hash table:
private Entry[] hashTable;
private int tableSize; // Must be prime
private static final int MAX_SIZE = 2 * MAX_CAPACITY;
private boolean integrityOK = false;
private static final double MAX_LOAD_FACTOR = 0.5; // Fraction of
// hash table that can be filled
private int collisionCount;
protected final Entry AVAILABLE = new Entry<>(null, null);
// Counter to keep track of collisions
public HashedDictionary()
{
this(DEFAULT_CAPACITY); // Call next constructor
} // end default constructor
public HashedDictionary(int initialCapacity)
{
initialCapacity = checkCapacity(initialCapacity);
numberOfEntries = 0; // Dictionary is empty
// Set up hash table:
// Initial size of hash table is same as initialCapacity if it is prime;
// otherwise increase it until it is prime size
tableSize = getNextPrime(initialCapacity);
checkSize(tableSize); // Check that size is not too large
// The cast is safe because the new array contains null entries
@SuppressWarnings("unchecked")
Entry[] temp = (Entry[])new Entry[tableSize];
hashTable = temp;
integrityOK = true;
collisionCount = 0;
} // end constructor
/* Implementations of methods in DictionaryInterface are here. . . .*/
public V add(K key, V value) {
int index = getHashIndex(key);
V oldValue = null;
if (key == null || value == null) {
throw new NoSuchElementException("Cannot add null key or value.");
}
// If the index is empty or has an AVAILABLE entry, add the new entry.
if (hashTable[index] == null || hashTable[index] == AVAILABLE) {
hashTable[index] = new Entry<>(key, value);
numberOfEntries++;
}
// If the index has the same key as the new entry, update the value.
else if (hashTable[index].getKey().equals(key)) {
oldValue = hashTable[index].getValue();
hashTable[index].setValue(value);
}
// Otherwise, there is a collision.
else {
int startIndex = index;
index = (index + 1) % hashTable.length;
// Keep probing until an empty or AVAILABLE index is found.
while (index != startIndex && hashTable[index] != null && hashTable[index] != AVAILABLE)
{
index = (index + 1) % hashTable.length;
}
// If an empty index is found, ad.
For this micro assignment, you must implement two Linked List functi.docx
For this micro assignment, you must implement two Linked List functions. We will use the following
example Linked List:
2 0 -1 5 7
getElementAt(index)
This function should return the element (i.e. value) of the Nth item inside the linked list. For example,
on the Linked List above, getElementAt(0) should return 2; getElementAt(3) should return 5.
addElementAt(value, location)
This function should insert a new value at the given location. Note that the location supplied must be
within bounds of the LinkedList. For example, we cannot call addElementAt(4, 11) on the above Linked
List because 11 is beyond the size of the Linked List.
Here are some examples. If we call addElementAt(0, 1), the above Linked List would now look like:
1 2 0 -1 5 7
If we again call addElementAt(2, 123), we would get:
1 2 123 0 -1 5 7
Grading
Your submission will be graded based on the following:
1. [7] Your solution does not cause any runtime issues and your file passes all test cases
2. [3] Your code contains good style. For example,
You provide meaningful variable names
You provide sufficient and meaningful comments
Your code is well structured
@@@@@@@@@@@@@@@@@@@@@@@@
#ifndef LINKED_LIST_H
#define LINKED_LIST_H
#include
#include
#include "LinkedListNode.h"
#include
using namespace std;
template
class LinkedList
{
private:
//points to the front of the linked list
LinkedListNode *_front = nullptr;
//keeping track of size in a variable eliminates need to continually
//count LL boxes.
int _size = 0;
protected:
//creates a new LinkedListNode for us
virtual LinkedListNode *createNode(T value)
{
return new LinkedListNode < T > { value };
}
public:
//default constructor
LinkedList()
{
_front = nullptr;
}
//copy constructor
LinkedList(const LinkedList &other)
{
for (int i = 0; i < other.getSize(); i++)
{
addElement(other.getElementAt(i));
}
}
//move constructor
LinkedList(LinkedList &&other)
{
//take other's data
_front = other._front;
_size = other._size;
//reset other's pointers
other._front = nullptr;
}
//initializer list constructor
LinkedList(initializer_list values)
{
for (auto item : values)
{
addElement(item);
}
}
//Always remember to clean up pointers in destructor!
virtual ~LinkedList()
{
LinkedListNode *current = _front;
while (current != nullptr)
{
LinkedListNode *temp = current->getNext();
delete current;
current = temp;
}
}
//will return true if the LL is empty.
virtual bool isEmpty() const
{
return _size == 0;
}
//returns the size of the LL.
virtual int getSize() const
{
return _size;
}
.
2 a networkflow
This Java code implements the Ford-Fulkerson algorithm to find the maximum flow and minimum cut set in a network flow problem. It takes a graph as input with a specified source and sink node, runs BFS to find augmenting paths, and calculates the residual graph after sending flow along each path to find the maximum flow. It then uses BFS again to separate the graph into reachable and unreachable nodes from the source to determine the minimum cut set.
Scala vs Java 8 in a Java 8 World
Scala is becoming the language of choice for many development teams. This talk highlights how Scala excels in the world of multi-core processing and explores how it compares to Java 8.
Video Presentation: http://youtu.be/8vxTowBXJSg
JDK 8
The document discusses new features in JDK8 including lambdas and functional interfaces, default methods, static interface methods, method references, repeating annotations, extended annotations, Optional, Streams, Date/Time API improvements, Nashorn JavaScript engine, Base64 encoding, jjs and jdepts tools, and Metaspace. Key changes include lambda expressions to write anonymous functions more concisely, default methods to add new methods to interfaces without breaking existing implementations, and functional interfaces to allow lambda expressions to be treated as objects.
package edu-ser222-m03_02- --- - A binary search tree based impleme.docx
package edu.ser222.m03_02;
/**
* A binary search tree based implementation of a symbol table.
*
* Completion time: (your completion time)
*
* @author (your name), Sedgewick, Acuna
* @version (version)
*/
import java.util.Collections;
import java.util.LinkedList;
import java.util.NoSuchElementException;
import java.util.Queue;
public class CompletedBST<Key extends Comparable<Key>, Value> implements BST<Key, Value> {
private Node<Key, Value> root;
@Override
public int size() {
return size(root);
}
private int size(Node x) {
if (x == null)
return 0;
else
return x.N;
}
@Override
public Value get(Key key) {
Node<Key, Value> iter = root;
while(iter != null) {
int cmp = key.compareTo(iter.key);
if (cmp < 0)
iter = iter.left;
else if (cmp > 0)
iter = iter.right;
else
return iter.val;
}
return null;
}
private Value get(Node<Key, Value> x, Key key) {
// Return value associated with key in the subtree rooted at x;
// return null if key not present in subtree rooted at x.
if (x == null) return null;
int cmp = key.compareTo(x.key);
if (cmp < 0) return get(x.left, key);
else if (cmp > 0) return get(x.right, key);
else return x.val;
}
@Override
public void put(Key key, Value val) {
root = put(root, key, val);
}
private Node put(Node<Key, Value> x, Key key, Value val) {
if (x == null)
return new Node(key, val, 1);
int cmp = key.compareTo(x.key);
if (cmp < 0)
x.left = put(x.left, key, val);
else if (cmp > 0)
x.right = put(x.right, key, val);
else
x.val = val;
x.N = size(x.left) + size(x.right) + 1;
return x;
}
@Override
public Key min() {
if(root == null)
throw new NoSuchElementException();
return min(root).key;
}
private Node<Key, Value> min(Node x) {
if (x.left == null)
return x;
return min(x.left);
}
@Override
public Key max() {
if(root == null)
throw new NoSuchElementException();
return max(root).key;
}
private Node<Key, Value> max(Node x) {
if (x.right == null) return x;
return max(x.right);
}
@Override
public Key floor(Key key) {
if(root == null)
throw new NoSuchElementException();
Node<Key, Value> x = floor(root, key);
if (x == null)
return null;
return x.key;
}
private Node<Key, Value> floor(Node<Key, Value> x, Key key) {
if (x == null)
return null;
int cmp = key.compareTo(x.key);
if (cmp == 0) return x;
if (cmp < 0) return floor(x.left, key);
Node<Key, Value> t = floor(x.right, key);
if (t != null) return t;
else return x;
}
@Override
public Key select(int k) {
return select(root, k).key;
}
private Node<Key, Value> select(Node x, int k) {
if (x == null) return null;
int t = size(x.left);
if (t > k) return select(x.left, k);
else if (t < k) return select(x.right, k-t-1);
else return x;
}
@Override
public int rank(Key key) {
return rank(key, root);
}
private int rank(Key key, Node<Key, Value> x) {
// Return number of keys less than x.key in the subtree rooted at x.
if (x == null) return 0;
int cmp = key.compareTo(x.key);
if (cmp < 0) return rank(key, x.left);
else if (cmp > 0) return 1 + size(x.left) + rank(key, x.right);
else return size(x.left);
}
@O.
How can I add multiple names and addresses- To the following code- Tab.pdf
How can I add multiple names and addresses? To the following code?
Tablea addressBook = new Tablea();
Scanner scanner = new Scanner(System.in);
String key, value;
// Insert a new entry into the address book
System.out.print("Enter a name: ");
key = scanner.nextLine();
System.out.print("Enter an address: ");
value = scanner.nextLine();
addressBook.insert(key, value);
// Lookup an entry in the address book
System.out.print("Enter a name to look up: ");
key = scanner.nextLine();
String result = addressBook.lookUp(key);
if (result != null) {
System.out.println("Address: " + result);
} else {
System.out.println("Name not found");
}
// Delete an entry from the address book
System.out.print("Enter a name to delete: ");
key = scanner.nextLine();
boolean deleted = addressBook.delete(key);
if (deleted) {
System.out.println("Address deleted");
} else {
System.out.println("Name not found");
}
// Update an entry in the address book
System.out.print("Enter a name to update: ");
key = scanner.nextLine();
System.out.print("Enter a new address: ");
value = scanner.nextLine();
boolean updated = addressBook.update(key, value);
if (updated) {
System.out.println("Address updated");
} else {
System.out.println("Name not found");
}
// Display all entries in the address book
System.out.println("All entries:");
addressBook.displayAll();
// Quit the program
System.out.println("Quitting...");
}
public class Node {
private String key;
private String value;
private Node next;
Node() {
// add here ..
}
Node(String key, String value) {
// add here ..
this.key = key;
this.value = value;
this.next = null;
}
public String getKey() {
// add here ..
return this.key;
}
public void setKey(String key) {
// add here ..
this.key = key;
}
public String getValue() {
// add here ..
return this.value;
}
public void setValue(String value) {
// add here ..
this.value = value;
}
public Node getNext() {
// add here ..
return this.next;
}
public void setNext(Node next) {
// add here ..
this.next = next;
}
}
import java.util.Scanner;
public class Tablea {
private Node mark;
public Node getMark() {
return this.mark;
}
public void setMark(Node mark) {
this.mark = mark;
}
public boolean insert(String key, String value) {
Node newNode= new Node(key,value);
if (this.mark== null) {
this.mark = newNode;
}else {
newNode.setNext(this.mark.getNext());
this.mark.setNext(newNode);
}
return true;
}
public String lookUp(String key) {
Node current = this.mark;
while(current!=null) {
if (current.getKey().equals(key)) {
return current.getValue();
}
current = current.getNext();
}
return null;
}
public boolean delete(String key) {
Node current = this.mark;
Node prev = null;
while (current!= null) {
if (current.getKey().equals(key)) {
if (prev == null) {
this.mark = current.getNext();
}else {
prev.setNext(current.getNext());
}
return true;
}
prev = current;
current = current.getNext();
}
return false;
}
public boolean update(String key, String newValue) {
Node current = this.mark;
while (current != null) {
if (c.
practical 9.docx
This Java code defines a LinkedHashSet of Strings, adds elements to it including duplicates, prints the set, removes an element, prints the updated set, and then iterates through the set using an iterator to print each remaining element.
Similar to Hi, Please find my code##### Sequence.java ##############import.pdf (20)
How to fix this error- Exception in thread -main- q- Exit java-lang-.pdf
How to fix this error- Exception in thread -main- q- Exit java-lang-.pdf
import java-util-Iterator- import java-util-NoSuchElementException- im.pdf
import java-util-Iterator- import java-util-NoSuchElementException- im.pdf
Labprogram.javaLinkedList.javaimport java.util.NoSuchElementEx.pdf
Labprogram.javaLinkedList.javaimport java.util.NoSuchElementEx.pdf
output and explain There is Mylist There is MyArrayList pa.pdf
output and explain There is Mylist There is MyArrayList pa.pdf
collectionframework-141116005344-conversion-gate01.pptx
collectionframework-141116005344-conversion-gate01.pptx
sumOfSquaresimport java.util.;public class Arraylistoperation.pdf
sumOfSquaresimport java.util.;public class Arraylistoperation.pdf
public class EllipsoidList { private String list- private Array.pdf
public class EllipsoidList { private String list- private Array.pdf
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
Given an ArrayList, write a Java method that returns a new ArrayList.pdf
Given an ArrayList, write a Java method that returns a new ArrayList.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
ReverseList.javaimport java.util.ArrayList;public class Rever.pdf
ReverseList.javaimport java.util.ArrayList;public class Rever.pdf
I have created a class hasdhedDictionary that implements the Diction.pdf
I have created a class hasdhedDictionary that implements the Diction.pdf
For this micro assignment, you must implement two Linked List functi.docx
For this micro assignment, you must implement two Linked List functi.docx
package edu-ser222-m03_02- --- - A binary search tree based impleme.docx
package edu-ser222-m03_02- --- - A binary search tree based impleme.docx
How can I add multiple names and addresses- To the following code- Tab.pdf
How can I add multiple names and addresses- To the following code- Tab.pdf
More from anandmobile
8. Reflexive. as the hormone is releases in response to an external .pdf
8. Reflexive. as the hormone is releases in response to an external stimulus.
9. Trophic response .
10.Anbolic.
11.C.
12.D.
Solution
8. Reflexive. as the hormone is releases in response to an external stimulus.
9. Trophic response .
10.Anbolic.
11.C.
12.D..
3(s) + HClSolution3(s) + HCl.pdf
This chemical reaction involves reacting metallic sodium (3(s)) with hydrochloric acid (HCl) to form a solution. Metallic sodium reacts with hydrochloric acid, dissolving into solution. The unbalanced chemical equation shows metallic sodium (3(s)) reacting with hydrochloric acid (HCl).
#include iostream #include deque #include stdio.h scan.pdf
#include
#include
#include //scanf,printf
#include
#include //istringstream
using namespace std;
//maps
#include \"MapGeneric.h\"
#include \"MapTriple.h\"
#include \"MapAbsoluteValue.h\"
#include \"MapSquare.h\"
//filters
#include \"FilterGeneric.h\"
#include \"filterEven.h\"
#include \"filterPositive.h\"
#include \"filterPositiveTwoDigit.h\"
//reduce
#include \"ReduceGeneric.h\"
#include \"ReduceMinimum.h\"
#include \"ReduceGCD.h\"
int main()
{
deque L,L1,L2;
int i;
string line;
getline(cin,line);
if(line.size() == 0)
return 0;
line.erase(remove(line.begin(), line.end(), \',\'), line.end());
istringstream s(line);
while(s>>i)
{
L.push_back(i);
}
if(L.size() != 20)
return 0;
//converting L -> 3*|L| aka L1
MapTriple triple; MapAbsoluteValue abs;
L1 = triple.map(abs.map(L));
//converting L1 -> positive two digit integers -> even intergers aka L2
filterEven even; filterPositiveTwoDigit p2;
L2 = p2.filter(L1);
if(L2.size() <2)
return 0;
L2 = even.filter(L2);
if(L2.size() <2)
return 0;
//finding the minimum and GCD from L2 respectively
ReduceMinimum min; ReduceGCD gcd;
printf(\"%d %d\ \",min.reduce(L2),gcd.reduce(L2));
}
FilterGeneric.cpp
#include
#include
#include \"FilterGeneric.h\"
using namespace std;
deque FilterGeneric::filter(deque deq)
{
//calling recursive function with deq and its length
select(deq,deq.size()-1);
return filterDeq;
}
//int i is the index that will start from the length of deque till 0
void FilterGeneric::select(deque deq, int i)
{
if(i == 0)
{
bool val = f(deq[i]);
if(val)
filterDeq.push_front(deq[i]);
return;
}
bool val = f(deq[i]);
if(val)
filterDeq.push_front(deq[i]);
return select(deq,i-1);
}
FilterGeneric.h
#ifndef FILTERGENERIC_H
#define FILTERGENERIC_H
#include
class FilterGeneric
{
public:
std::deque filter(std::deque);
void select(std::deque,int);
protected:
//this deque will store the integers after filtration.
std::deque filterDeq;
private:
virtual bool f(int)=0;
};
#endif
MapAbsoluteValue.cpp
#include
#include
#include
#include \"MapGeneric.h\" //base
#include \"MapAbsoluteValue.h\"
using namespace std;
int MapAbsoluteValue::f(int num)
{
return abs(num);
}
MapAbsoluteValue.h
#ifndef MAPABSOLUTEVALUE_H
#define MAPABSOLUTEVALUE_H
#include
//this class will map a given input N, using the function map(input), to |N|
class MapAbsoluteValue: public MapGeneric
{
public:
//overwriting pure virtual function making N -> |N|
int f(int);
private:
};
#endif
MapGeneric.cpp
#include
#include
#include \"MapGeneric.h\"
using namespace std;
deque MapGeneric::map(deque deq)
{
//calling recursive function with deq and its length
calculate(deq,deq.size()-1);
return mapDeq;
}
//int i is the index that will start from the length of deque till 0
void MapGeneric::calculate(deque deq, int i)
{
if(i == 0)
{
int val = f(deq[i]);
mapDeq.push_front(val);
return;
}
int val = f(deq[i]);
mapDeq.push_front(val);
return calculate(deq,i-1);
}
MapGeneric.h
#ifndef MAPGENERIC_H
#define MAPGENERIC_H
#include
class MapGeneric
{
public:
std::deque ma.
This is a great question. The radial velocity met.pdf
This is a great question. The radial velocity method uses Doppler spectroscopy to
detect extrasolar planets, similar to the doppler radar used to track weather! It assumes stars
move a little as a planet orbits them causing a shift in the light spectrum the star produces. B is
true because as the planet orbits it pulls the star toward the observer casing the light to be blue
shifted. C is also true because light gets slightly red shifted. The answer is E.
Solution
This is a great question. The radial velocity method uses Doppler spectroscopy to
detect extrasolar planets, similar to the doppler radar used to track weather! It assumes stars
move a little as a planet orbits them causing a shift in the light spectrum the star produces. B is
true because as the planet orbits it pulls the star toward the observer casing the light to be blue
shifted. C is also true because light gets slightly red shifted. The answer is E..
Viruses are intracellular obligate parasites whic.pdf
Viruses are intracellular obligate parasites which means that they cannot replicate or
express their genes without the help of a living cell. A single virus particle (virion) is in and of
itself essentially inert. It lacks needed components that cells have to reproduce. When a virus
infects a cell, it marshals the cell\'s ribosomes, enzymes and much of the cellular machinery to
replicate. Unlike what we have seen in cellular replication processes such as mitosis and meiosis,
viral replication produces many progeny, that when complete, leave the host cell to infect other
cells in the organism. Viruses may contain double-stranded DNA, double-stranded RNA, single-
stranded DNA or single-stranded RNA. The type of genetic material found in a particular virus
depends on the nature and function of the specific virus. The exact nature of what happens after a
host is infected varies depending on the nature of the virus. The process for double-stranded
DNA, single-stranded DNA, double-stranded RNA and single-stranded RNA viral replication
will differ. For example, double-stranded DNA viruses typically must enter the host cell\'s
nucleus before they can replicate. Single-stranded RNA viruses however, replicate mainly in the
host cell\'s cytoplasm. Once a virus infects its host and the viral progeny components are
produced by the host\'s cellular machinery, the assembly of the viral capsid is a non-enzymatic
process. It is usually spontaneous. Viruses typically can only infect a limited number of hosts
(also known as host range). The \"lock and key\" mechanism is the most common explanation for
this range. Certain proteins on the virus particle must fit certain receptor sites on the particular
host\'s cell surface.
Solution
Viruses are intracellular obligate parasites which means that they cannot replicate or
express their genes without the help of a living cell. A single virus particle (virion) is in and of
itself essentially inert. It lacks needed components that cells have to reproduce. When a virus
infects a cell, it marshals the cell\'s ribosomes, enzymes and much of the cellular machinery to
replicate. Unlike what we have seen in cellular replication processes such as mitosis and meiosis,
viral replication produces many progeny, that when complete, leave the host cell to infect other
cells in the organism. Viruses may contain double-stranded DNA, double-stranded RNA, single-
stranded DNA or single-stranded RNA. The type of genetic material found in a particular virus
depends on the nature and function of the specific virus. The exact nature of what happens after a
host is infected varies depending on the nature of the virus. The process for double-stranded
DNA, single-stranded DNA, double-stranded RNA and single-stranded RNA viral replication
will differ. For example, double-stranded DNA viruses typically must enter the host cell\'s
nucleus before they can replicate. Single-stranded RNA viruses however, replicate mainly in the
host cell\'s cytoplas.
Step1 Na is a more reactive metal than Fe ; so it.pdf
Step1 Na is a more reactive metal than Fe ; so it can displace iron from its salts.But
iron can not displace sodium from its salts .thus there will be no reaction.
Solution
Step1 Na is a more reactive metal than Fe ; so it can displace iron from its salts.But
iron can not displace sodium from its salts .thus there will be no reaction..
Second ionization is compared to removing electro.pdf
Second ionization is compared to removing electron from the atom second time. If
the atom has reach noble gas configuration after first ionization, then it will be very difficult to
remove electrons from it. You can see that Na after removal of one electron obtains the noble
gas configuration. Hence, Na has the greatest second ionization table. My text contained chart of
ratio comparing second/first ionization. If you look at that chart you can see your answer clearly.
Hope this helps!
Solution
Second ionization is compared to removing electron from the atom second time. If
the atom has reach noble gas configuration after first ionization, then it will be very difficult to
remove electrons from it. You can see that Na after removal of one electron obtains the noble
gas configuration. Hence, Na has the greatest second ionization table. My text contained chart of
ratio comparing second/first ionization. If you look at that chart you can see your answer clearly.
Hope this helps!.
oxidizing reagent CuCl2 reducing reagent Fe not.pdf
oxidizing reagent: CuCl2 reducing reagent: Fe note: the oxidation state of Cu in
CuCl2 is +2 , while that in Cu is zero the OS of Fe in Fe is zero, the OS of Fe in FeCl2 is +2.
Solution
oxidizing reagent: CuCl2 reducing reagent: Fe note: the oxidation state of Cu in
CuCl2 is +2 , while that in Cu is zero the OS of Fe in Fe is zero, the OS of Fe in FeCl2 is +2..
On the following organic compounds,CH3CH2NH2 andC.pdf
On the following organic compounds,CH3CH2NH2 andCH3CONH2 is base. Both
of them got thetendency to attract H+ ions to form -NH3+ compound. CH3COOH is the acid. It
will release H+ ionsto form CH3COO- ions. While CH3CHOdoesnt have the tendency to attract
or release H+ions. Most acidic, CH3COOH. Compare CH3CH2NH2 andCH3CONH2. Oxygen
in theCH3CONH2 will attract the electrons towardoxygen molecule. This reduce the negativity
of compound. Therefore,it got less ability to attract H+ ions.CH3CH2NH2 is more basic
toCH3CONH2. So, the least acidic isCH3CH2NH2 (which is most basicamong 4)
Solution
On the following organic compounds,CH3CH2NH2 andCH3CONH2 is base. Both
of them got thetendency to attract H+ ions to form -NH3+ compound. CH3COOH is the acid. It
will release H+ ionsto form CH3COO- ions. While CH3CHOdoesnt have the tendency to attract
or release H+ions. Most acidic, CH3COOH. Compare CH3CH2NH2 andCH3CONH2. Oxygen
in theCH3CONH2 will attract the electrons towardoxygen molecule. This reduce the negativity
of compound. Therefore,it got less ability to attract H+ ions.CH3CH2NH2 is more basic
toCH3CONH2. So, the least acidic isCH3CH2NH2 (which is most basicamong 4).
Moseley showed that there were gaps in the atomic.pdf
Moseley showed that there were gaps in the atomic number sequence at numbers
43, 61, 72, and 75. These spaces are now known, respectively, to be the places of the radioactive
synthetic elements technetium and promethium, and also the last two quite rare naturally-
occurring stable elements hafnium (discovered 1923) and rhenium (discovered 1925). Nothing
about these four elements was known of in Moseley\'s lifetime, not even their very existence.
Based on the intuition of a very experienced chemist, Dimitri Mendeleev had predicted the
existence of a missing element in the Periodic Table, which was later found to be filled by
technetium, and Bohuslav Brauner had predicted the existence of another missing element in this
Table, which was later found to be filled by promethium. Henry Moseley\'s experiments
confirmed these predictions, by showing exactly what the missing atomic numbers were, 43 and
61. In addition, Moseley predicted the two more undiscovered elements, those with the atomic
numbers 72 and 75, and he gave very strong evidence that there were no other gaps in the
Periodic Table between the elements aluminium (atomic number 13) and gold (atomic number
79).
Solution
Moseley showed that there were gaps in the atomic number sequence at numbers
43, 61, 72, and 75. These spaces are now known, respectively, to be the places of the radioactive
synthetic elements technetium and promethium, and also the last two quite rare naturally-
occurring stable elements hafnium (discovered 1923) and rhenium (discovered 1925). Nothing
about these four elements was known of in Moseley\'s lifetime, not even their very existence.
Based on the intuition of a very experienced chemist, Dimitri Mendeleev had predicted the
existence of a missing element in the Periodic Table, which was later found to be filled by
technetium, and Bohuslav Brauner had predicted the existence of another missing element in this
Table, which was later found to be filled by promethium. Henry Moseley\'s experiments
confirmed these predictions, by showing exactly what the missing atomic numbers were, 43 and
61. In addition, Moseley predicted the two more undiscovered elements, those with the atomic
numbers 72 and 75, and he gave very strong evidence that there were no other gaps in the
Periodic Table between the elements aluminium (atomic number 13) and gold (atomic number
79)..
Lewis Structures A structural formula in which el.pdf
Lewis Structures A structural formula in which electrons are represented by dots;
two dots between atoms represent a covalent bond. Also known as electron-dot formula or Lewis
formula. Covalent Bond A chemical bond formed by the sharing of one or more electrons,
especially pairs of electrons, between atoms. Ionic Bond A chemical bond between two ions
with opposite charges, characteristic of salts. Also called electrovalent bond. Resonance The
property of a compound having simultaneously the characteristics of two or more structural
forms that differ only in the distribution of electrons. Such compounds are highly stable and
cannot be properly represented by a single structural formula. Polarity Tendency of a molecule,
or compound, to be attracted or repelled by electrical charges because of an asymmetrical
arrangement of atoms around the nucleus. Dipole Moment A dipole moment is the development
of an electronic charge in a molecule by virtue of it structure and components. Bond Energy The
average value of specific bond dissociation energies that have been measured from different
molecules of a given type Valence shell electron pair repulsion (VSEPR) theory is a model in
chemistry used to predict the shape of individual molecules based upon the extent of electron-
pair electrostatic repulsion.It is also named Gillespie–Nyholm theory after its two main
developers The premise of VSEPR is that the valence electron pairs surrounding an atom
mutually repel each other, and will therefore adopt an arrangement that minimizes this repulsion,
thus determining the molecular geometry. The number of electron pairs surrounding an atom,
both bonding and nonbonding, is called its steric number.
Solution
Lewis Structures A structural formula in which electrons are represented by dots;
two dots between atoms represent a covalent bond. Also known as electron-dot formula or Lewis
formula. Covalent Bond A chemical bond formed by the sharing of one or more electrons,
especially pairs of electrons, between atoms. Ionic Bond A chemical bond between two ions
with opposite charges, characteristic of salts. Also called electrovalent bond. Resonance The
property of a compound having simultaneously the characteristics of two or more structural
forms that differ only in the distribution of electrons. Such compounds are highly stable and
cannot be properly represented by a single structural formula. Polarity Tendency of a molecule,
or compound, to be attracted or repelled by electrical charges because of an asymmetrical
arrangement of atoms around the nucleus. Dipole Moment A dipole moment is the development
of an electronic charge in a molecule by virtue of it structure and components. Bond Energy The
average value of specific bond dissociation energies that have been measured from different
molecules of a given type Valence shell electron pair repulsion (VSEPR) theory is a model in
chemistry used to predict the shape of individual molecules based upon the extent of electr.
fluorine , oxygen , chlorine , sulphor ,phophorus.pdf
fluorine , oxygen , chlorine , sulphor ,phophorus
Solution
fluorine , oxygen , chlorine , sulphor ,phophorus.
CuS is insoluble. NaCl stays in solution. so cor.pdf
CuS is insoluble. NaCl stays in solution. so correct answer is C
Solution
CuS is insoluble. NaCl stays in solution. so correct answer is C.
When you have an acidic solution like you do, (because the H+ and th.pdf
When you have an acidic solution like you do, (because the H+ and the F- dissociate very
readily), there is an abundance of H and F on the product side. However, with the addition of
more F- the solution is the forced back to the left to reach the same equilibrium that was found
before. (Also take note that you have a 0.1M solution) Like so:
HF --> H+ + F-
in a aqueous solution there are H3O+ molecules and OH-.
Even though HF has a high level of dissociation it will not dissociate completely.
so when F is added the solution runs to the left because it has been added on the right.
The reason that it reacts with the H3O is because it is more basic than the H and the F reacts with
the most basic.
Hope this helps.
Solution
When you have an acidic solution like you do, (because the H+ and the F- dissociate very
readily), there is an abundance of H and F on the product side. However, with the addition of
more F- the solution is the forced back to the left to reach the same equilibrium that was found
before. (Also take note that you have a 0.1M solution) Like so:
HF --> H+ + F-
in a aqueous solution there are H3O+ molecules and OH-.
Even though HF has a high level of dissociation it will not dissociate completely.
so when F is added the solution runs to the left because it has been added on the right.
The reason that it reacts with the H3O is because it is more basic than the H and the F reacts with
the most basic.
Hope this helps..
Type III secretion system- Complex structure helps the bacteria to e.pdf
Type III secretion system- Complex structure helps the bacteria to escape the host immune
system.
Solution
Type III secretion system- Complex structure helps the bacteria to escape the host immune
system..
The OECD has produced a considerable amount of analytical work addre.pdf
The OECD has produced a considerable amount of analytical work addressing the issue of
incentives for attracting foreign direct investment (FDI). This list, compiled in the context of a
2002 project undertaken by the Investment Committee, provides an overview of this work which
is indicative, rather than exhaustive, of the large body of work undertaken by several OECD
bodies in this area.
The Economics of International Investment Incentives , 2001
This paper, prepared by Professor Magnus Blomstr
Solution
The OECD has produced a considerable amount of analytical work addressing the issue of
incentives for attracting foreign direct investment (FDI). This list, compiled in the context of a
2002 project undertaken by the Investment Committee, provides an overview of this work which
is indicative, rather than exhaustive, of the large body of work undertaken by several OECD
bodies in this area.
The Economics of International Investment Incentives , 2001
This paper, prepared by Professor Magnus Blomstr.
Q2. RAM holds the running configuration.Q4. The startup configurat.pdf
Q2. RAM holds the running configuration.
Q4. The startup configuration file is stored in NVRAM/ROM.
Q7. There are three elements of communication: the message sender, the feedback, and the
message receiver.
Q8. From the privileged exec mode of the router named ITT330, save the configuration to
NVRAM, prompt ___ command ___. What is the short version of this command.
Solution
Q2. RAM holds the running configuration.
Q4. The startup configuration file is stored in NVRAM/ROM.
Q7. There are three elements of communication: the message sender, the feedback, and the
message receiver.
Q8. From the privileged exec mode of the router named ITT330, save the configuration to
NVRAM, prompt ___ command ___. What is the short version of this command..
AnswerIn population 1, only homozygous dominant population is pre.pdf
Answer:
In population 1, only homozygous dominant population is present.
In population 2, only heterozygous dominant population is present.
Solution
Answer:
In population 1, only homozygous dominant population is present.
In population 2, only heterozygous dominant population is present..
P=VI=(10)(2)=20W absorbed+ve power means absorbed -ve power means .pdf
P=VI=(10)(2)=20W absorbed
+ve power means absorbed -ve power means supplied.
Solution
P=VI=(10)(2)=20W absorbed
+ve power means absorbed -ve power means supplied..
Option D is the answerSolutionOption D is the answer.pdf
Option D is the answer. The document states that Option D is the correct answer to an unknown question. It then repeats that Option D is the answer.
More from anandmobile (20)
8. Reflexive. as the hormone is releases in response to an external .pdf
8. Reflexive. as the hormone is releases in response to an external .pdf
#include iostream #include deque #include stdio.h scan.pdf
#include iostream #include deque #include stdio.h scan.pdf
This is a great question. The radial velocity met.pdf
This is a great question. The radial velocity met.pdf
Viruses are intracellular obligate parasites whic.pdf
Viruses are intracellular obligate parasites whic.pdf
Step1 Na is a more reactive metal than Fe ; so it.pdf
Step1 Na is a more reactive metal than Fe ; so it.pdf
Second ionization is compared to removing electro.pdf
Second ionization is compared to removing electro.pdf
oxidizing reagent CuCl2 reducing reagent Fe not.pdf
oxidizing reagent CuCl2 reducing reagent Fe not.pdf
On the following organic compounds,CH3CH2NH2 andC.pdf
On the following organic compounds,CH3CH2NH2 andC.pdf
Moseley showed that there were gaps in the atomic.pdf
Moseley showed that there were gaps in the atomic.pdf
Lewis Structures A structural formula in which el.pdf
Lewis Structures A structural formula in which el.pdf
fluorine , oxygen , chlorine , sulphor ,phophorus.pdf
fluorine , oxygen , chlorine , sulphor ,phophorus.pdf
CuS is insoluble. NaCl stays in solution. so cor.pdf
CuS is insoluble. NaCl stays in solution. so cor.pdf
When you have an acidic solution like you do, (because the H+ and th.pdf
When you have an acidic solution like you do, (because the H+ and th.pdf
Type III secretion system- Complex structure helps the bacteria to e.pdf
Type III secretion system- Complex structure helps the bacteria to e.pdf
The OECD has produced a considerable amount of analytical work addre.pdf
The OECD has produced a considerable amount of analytical work addre.pdf
Q2. RAM holds the running configuration.Q4. The startup configurat.pdf
Q2. RAM holds the running configuration.Q4. The startup configurat.pdf
AnswerIn population 1, only homozygous dominant population is pre.pdf
AnswerIn population 1, only homozygous dominant population is pre.pdf
P=VI=(10)(2)=20W absorbed+ve power means absorbed -ve power means .pdf
P=VI=(10)(2)=20W absorbed+ve power means absorbed -ve power means .pdf
Option D is the answerSolutionOption D is the answer.pdf
Option D is the answerSolutionOption D is the answer.pdf
Recently uploaded
How to deliver Powerpoint Presentations.pptx
"How to make and deliver dynamic presentations by making it more interactive to captivate your audience attention"
Chapter wise All Notes of First year Basic Civil Engineering.pptx
Chapter wise All Notes of First year Basic Civil Engineering
Syllabus
Chapter-1
Introduction to objective, scope and outcome the subject
Chapter 2
Introduction: Scope and Specialization of Civil Engineering, Role of civil Engineer in Society, Impact of infrastructural development on economy of country.
Chapter 3
Surveying: Object Principles & Types of Surveying; Site Plans, Plans & Maps; Scales & Unit of different Measurements.
Linear Measurements: Instruments used. Linear Measurement by Tape, Ranging out Survey Lines and overcoming Obstructions; Measurements on sloping ground; Tape corrections, conventional symbols. Angular Measurements: Instruments used; Introduction to Compass Surveying, Bearings and Longitude & Latitude of a Line, Introduction to total station.
Levelling: Instrument used Object of levelling, Methods of levelling in brief, and Contour maps.
Chapter 4
Buildings: Selection of site for Buildings, Layout of Building Plan, Types of buildings, Plinth area, carpet area, floor space index, Introduction to building byelaws, concept of sun light & ventilation. Components of Buildings & their functions, Basic concept of R.C.C., Introduction to types of foundation
Chapter 5
Transportation: Introduction to Transportation Engineering; Traffic and Road Safety: Types and Characteristics of Various Modes of Transportation; Various Road Traffic Signs, Causes of Accidents and Road Safety Measures.
Chapter 6
Environmental Engineering: Environmental Pollution, Environmental Acts and Regulations, Functional Concepts of Ecology, Basics of Species, Biodiversity, Ecosystem, Hydrological Cycle; Chemical Cycles: Carbon, Nitrogen & Phosphorus; Energy Flow in Ecosystems.
Water Pollution: Water Quality standards, Introduction to Treatment & Disposal of Waste Water. Reuse and Saving of Water, Rain Water Harvesting. Solid Waste Management: Classification of Solid Waste, Collection, Transportation and Disposal of Solid. Recycling of Solid Waste: Energy Recovery, Sanitary Landfill, On-Site Sanitation. Air & Noise Pollution: Primary and Secondary air pollutants, Harmful effects of Air Pollution, Control of Air Pollution. . Noise Pollution Harmful Effects of noise pollution, control of noise pollution, Global warming & Climate Change, Ozone depletion, Greenhouse effect
Text Books:
1. Palancharmy, Basic Civil Engineering, McGraw Hill publishers.
2. Satheesh Gopi, Basic Civil Engineering, Pearson Publishers.
3. Ketki Rangwala Dalal, Essentials of Civil Engineering, Charotar Publishing House.
4. BCP, Surveying volume 1
BÀI TẬP BỔ TRỢ TIẾNG ANH LỚP 9 CẢ NĂM - GLOBAL SUCCESS - NĂM HỌC 2024-2025 - ...
BÀI TẬP BỔ TRỢ TIẾNG ANH LỚP 9 CẢ NĂM - GLOBAL SUCCESS - NĂM HỌC 2024-2025 - ...Nguyen Thanh Tu Collection
https://app.box.com/s/tacvl9ekroe9hqupdnjruiypvm9rdaneWhat is Digital Literacy? A guest blog from Andy McLaughlin, University of Ab...
What is Digital Literacy? A guest blog from Andy McLaughlin, University of Aberdeen
Gender and Mental Health - Counselling and Family Therapy Applications and In...
A proprietary approach developed by bringing together the best of learning theories from Psychology, design principles from the world of visualization, and pedagogical methods from over a decade of training experience, that enables you to: Learn better, faster!
Philippine Edukasyong Pantahanan at Pangkabuhayan (EPP) Curriculum
(𝐓𝐋𝐄 𝟏𝟎𝟎) (𝐋𝐞𝐬𝐬𝐨𝐧 𝟏)-𝐏𝐫𝐞𝐥𝐢𝐦𝐬
𝐃𝐢𝐬𝐜𝐮𝐬𝐬 𝐭𝐡𝐞 𝐄𝐏𝐏 𝐂𝐮𝐫𝐫𝐢𝐜𝐮𝐥𝐮𝐦 𝐢𝐧 𝐭𝐡𝐞 𝐏𝐡𝐢𝐥𝐢𝐩𝐩𝐢𝐧𝐞𝐬:
- Understand the goals and objectives of the Edukasyong Pantahanan at Pangkabuhayan (EPP) curriculum, recognizing its importance in fostering practical life skills and values among students. Students will also be able to identify the key components and subjects covered, such as agriculture, home economics, industrial arts, and information and communication technology.
𝐄𝐱𝐩𝐥𝐚𝐢𝐧 𝐭𝐡𝐞 𝐍𝐚𝐭𝐮𝐫𝐞 𝐚𝐧𝐝 𝐒𝐜𝐨𝐩𝐞 𝐨𝐟 𝐚𝐧 𝐄𝐧𝐭𝐫𝐞𝐩𝐫𝐞𝐧𝐞𝐮𝐫:
-Define entrepreneurship, distinguishing it from general business activities by emphasizing its focus on innovation, risk-taking, and value creation. Students will describe the characteristics and traits of successful entrepreneurs, including their roles and responsibilities, and discuss the broader economic and social impacts of entrepreneurial activities on both local and global scales.
LAND USE LAND COVER AND NDVI OF MIRZAPUR DISTRICT, UP
This Dissertation explores the particular circumstances of Mirzapur, a region located in the
core of India. Mirzapur, with its varied terrains and abundant biodiversity, offers an optimal
environment for investigating the changes in vegetation cover dynamics. Our study utilizes
advanced technologies such as GIS (Geographic Information Systems) and Remote sensing to
analyze the transformations that have taken place over the course of a decade.
The complex relationship between human activities and the environment has been the focus
of extensive research and worry. As the global community grapples with swift urbanization,
population expansion, and economic progress, the effects on natural ecosystems are becoming
more evident. A crucial element of this impact is the alteration of vegetation cover, which plays a
significant role in maintaining the ecological equilibrium of our planet.Land serves as the foundation for all human activities and provides the necessary materials for
these activities. As the most crucial natural resource, its utilization by humans results in different
'Land uses,' which are determined by both human activities and the physical characteristics of the
land.
The utilization of land is impacted by human needs and environmental factors. In countries
like India, rapid population growth and the emphasis on extensive resource exploitation can lead
to significant land degradation, adversely affecting the region's land cover.
Therefore, human intervention has significantly influenced land use patterns over many
centuries, evolving its structure over time and space. In the present era, these changes have
accelerated due to factors such as agriculture and urbanization. Information regarding land use and
cover is essential for various planning and management tasks related to the Earth's surface,
providing crucial environmental data for scientific, resource management, policy purposes, and
diverse human activities.
Accurate understanding of land use and cover is imperative for the development planning
of any area. Consequently, a wide range of professionals, including earth system scientists, land
and water managers, and urban planners, are interested in obtaining data on land use and cover
changes, conversion trends, and other related patterns. The spatial dimensions of land use and
cover support policymakers and scientists in making well-informed decisions, as alterations in
these patterns indicate shifts in economic and social conditions. Monitoring such changes with the
help of Advanced technologies like Remote Sensing and Geographic Information Systems is
crucial for coordinated efforts across different administrative levels. Advanced technologies like
Remote Sensing and Geographic Information Systems
9
Changes in vegetation cover refer to variations in the distribution, composition, and overall
structure of plant communities across different temporal and spatial scales. These changes can
occur natural.
Advanced Java[Extra Concepts, Not Difficult].docx
This is part 2 of my Java Learning Journey. This contains Hashing, ArrayList, LinkedList, Date and Time Classes, Calendar Class and more.
Temple of Asclepius in Thrace. Excavation results
The temple and the sanctuary around were dedicated to Asklepios Zmidrenus. This name has been known since 1875 when an inscription dedicated to him was discovered in Rome. The inscription is dated in 227 AD and was left by soldiers originating from the city of Philippopolis (modern Plovdiv).
Your Skill Boost Masterclass: Strategies for Effective Upskilling
Your Skill Boost Masterclass: Strategies for Effective UpskillingExcellence Foundation for South Sudan
Strategies for Effective Upskilling is a presentation by Chinwendu Peace in a Your Skill Boost Masterclass organisation by the Excellence Foundation for South Sudan on 08th and 09th June 2024 from 1 PM to 3 PM on each day.How to Create a More Engaging and Human Online Learning Experience
How to Create a More Engaging and Human Online Learning Experience Wahiba Chair Training & Consulting
Wahiba Chair's Talk at the 2024 Learning Ideas Conference. Recently uploaded (20)
NEWSPAPERS - QUESTION 1 - REVISION POWERPOINT.pptx
NEWSPAPERS - QUESTION 1 - REVISION POWERPOINT.pptx
IGCSE Biology Chapter 14- Reproduction in Plants.pdf
IGCSE Biology Chapter 14- Reproduction in Plants.pdf
B. Ed Syllabus for babasaheb ambedkar education university.pdf
B. Ed Syllabus for babasaheb ambedkar education university.pdf
Chapter wise All Notes of First year Basic Civil Engineering.pptx
Chapter wise All Notes of First year Basic Civil Engineering.pptx
Film vocab for eal 3 students: Australia the movie
Film vocab for eal 3 students: Australia the movie
BÀI TẬP BỔ TRỢ TIẾNG ANH LỚP 9 CẢ NĂM - GLOBAL SUCCESS - NĂM HỌC 2024-2025 - ...
BÀI TẬP BỔ TRỢ TIẾNG ANH LỚP 9 CẢ NĂM - GLOBAL SUCCESS - NĂM HỌC 2024-2025 - ...
What is Digital Literacy? A guest blog from Andy McLaughlin, University of Ab...
What is Digital Literacy? A guest blog from Andy McLaughlin, University of Ab...
Gender and Mental Health - Counselling and Family Therapy Applications and In...
Gender and Mental Health - Counselling and Family Therapy Applications and In...
Philippine Edukasyong Pantahanan at Pangkabuhayan (EPP) Curriculum
Philippine Edukasyong Pantahanan at Pangkabuhayan (EPP) Curriculum
LAND USE LAND COVER AND NDVI OF MIRZAPUR DISTRICT, UP
LAND USE LAND COVER AND NDVI OF MIRZAPUR DISTRICT, UP
Your Skill Boost Masterclass: Strategies for Effective Upskilling
Your Skill Boost Masterclass: Strategies for Effective Upskilling
How to Create a More Engaging and Human Online Learning Experience
How to Create a More Engaging and Human Online Learning Experience
Hi, Please find my code##### Sequence.java ##############import.pdf
- 1. Hi, Please find my code: ##### Sequence.java ############## import java.util.ArrayList; public class Sequence { private ArrayList values; public Sequence(){ values= new ArrayList(); } public void add(int n){ values.add(n); } // return copy of list public ArrayList getSequence(){ ArrayList copyList = new ArrayList<>(values.size()); for (Integer x : values) { copyList.add(x); } return copyList; } public String toString(){ return values.toString(); } public Sequence append(Sequence other){ Sequence res = new Sequence(); for(Integer x : values) res.add(x); for(Integer x:other.getSequence()) res.add(x); return res; } public Sequence merge(Sequence other){ int i=0, j=0; ArrayList otherList = other.getSequence(); Sequence mergeSeq = new Sequence(); while(i otherList = other.getSequence();
- 2. Sequence mergeSeq = new Sequence(); while(i otherList.get(j)){ mergeSeq.add(otherList.get(j)); j++; }else{ // both have same value mergeSeq.add(values.get(i)); i++; j++; } } while(i < values.size()){ mergeSeq.add(values.get(i)); i++; } while(j < otherList.size()){ mergeSeq.add(otherList.get(j)); j++; } return mergeSeq; } } ############ SequenceTest.java ############### public class SequenceTest { public static void main(String[] args) { Sequence s1 = new Sequence(); Sequence s2 = new Sequence(); s1.add(1); s1.add(4); s1.add(9); s1.add(16);
- 3. s2.add(9); s2.add(7); s2.add(4); s2.add(9); s2.add(11); Sequence s3 = s1.merge(s2); System.out.println("S1: "+s1.toString()); System.out.println("S2: "+s2.toString()); System.out.println("S1+S2: "+s3.toString()); Sequence s4 = new Sequence(); s4.add(4); s4.add(9); s4.add(14); s4.add(15); s4.add(16); s4.add(20); s4.add(22); Sequence s5 = s1.mergeNoDuplicates(s4); System.out.println("S4: "+s4.toString()); System.out.println("S1+S4(no duplicate): "+s5.toString()); } } /* Sample Output: S1: [1, 4, 9, 16] S2: [9, 7, 4, 9, 11] S1+S2: [1, 9, 4, 7, 9, 4, 16, 9, 11] S4: [4, 9, 14, 15, 16, 20, 22] S1+S4(no duplicate): [1, 4, 9, 14, 15, 16, 20, 22] */
- 4. Solution Hi, Please find my code: ##### Sequence.java ############## import java.util.ArrayList; public class Sequence { private ArrayList values; public Sequence(){ values= new ArrayList(); } public void add(int n){ values.add(n); } // return copy of list public ArrayList getSequence(){ ArrayList copyList = new ArrayList<>(values.size()); for (Integer x : values) { copyList.add(x); } return copyList; } public String toString(){ return values.toString(); } public Sequence append(Sequence other){ Sequence res = new Sequence(); for(Integer x : values) res.add(x); for(Integer x:other.getSequence()) res.add(x); return res; } public Sequence merge(Sequence other){ int i=0, j=0; ArrayList otherList = other.getSequence();
- 5. Sequence mergeSeq = new Sequence(); while(i otherList = other.getSequence(); Sequence mergeSeq = new Sequence(); while(i otherList.get(j)){ mergeSeq.add(otherList.get(j)); j++; }else{ // both have same value mergeSeq.add(values.get(i)); i++; j++; } } while(i < values.size()){ mergeSeq.add(values.get(i)); i++; } while(j < otherList.size()){ mergeSeq.add(otherList.get(j)); j++; } return mergeSeq; } } ############ SequenceTest.java ############### public class SequenceTest { public static void main(String[] args) { Sequence s1 = new Sequence(); Sequence s2 = new Sequence(); s1.add(1); s1.add(4); s1.add(9);
- 6. s1.add(16); s2.add(9); s2.add(7); s2.add(4); s2.add(9); s2.add(11); Sequence s3 = s1.merge(s2); System.out.println("S1: "+s1.toString()); System.out.println("S2: "+s2.toString()); System.out.println("S1+S2: "+s3.toString()); Sequence s4 = new Sequence(); s4.add(4); s4.add(9); s4.add(14); s4.add(15); s4.add(16); s4.add(20); s4.add(22); Sequence s5 = s1.mergeNoDuplicates(s4); System.out.println("S4: "+s4.toString()); System.out.println("S1+S4(no duplicate): "+s5.toString()); } } /* Sample Output: S1: [1, 4, 9, 16] S2: [9, 7, 4, 9, 11] S1+S2: [1, 9, 4, 7, 9, 4, 16, 9, 11] S4: [4, 9, 14, 15, 16, 20, 22]
- 7. S1+S4(no duplicate): [1, 4, 9, 14, 15, 16, 20, 22] */