How can I add multiple names and addresses- To the following code- Tab.pdf
•
0 likes•2 views
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.
Report
Share
Report
Share
Download to read offline
Recommended
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.
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.
Note Given Code modified as required and required met.pdf
Note:
Given Code modified as required and required methods added.
Code:
// class node
class Node
{
// declare the required variable
String data;
Node next;
// constructor
Node(){}
// constructor with arguments
Node(String data)
{
this.data = data;
next = null;
}
// method to get the data
public String getData()
{
return data;
}
// method to set the data
public void setData(String data)
{
this.data = data;
}
// method to get the next data
public Node getNext()
{
return next;
}
// method to set the next data
public void setNext(Node next)
{
this.next = next;
}
}
// class for a linked list
class MyLInkedList
{
Node head;alue into a list
// method to add the v
public void add(String num)
{
if (head == null)
{
head = new Node(num);
}
else{
Node temp = new Node(num);
Node current = head;
if (current != null) {
while (current.getNext() != null) {
current = current.getNext();
}
current.setNext(temp);
}
}
}
// method to search a value from a list
public void search(String num)
{
Node current = head;
boolean flag=true;
if (current != null)
{
while (current != null)
{
if(current.getData() == num)
{
System.out.println(\"Search value \"+
current.getData()+\" is available\");
flag=false;
}
current = current.getNext();
}
if (flag==true)
{
System.out.println(\"Search value \"+
current.getData()+\" is not available\");
}
}
else
{
System.out.println(\"Linked list is empty\");
}
}
// method to delete a value from a list
public void delete(String num)
{
//Node current = head;
boolean flag=true;
if (head == null)
{
System.out.println(\"Can\'t Delete, Linked list is
empty\");
return;
}
if(head.getData() == num)
{
head=head.getNext();
return;
}
Node temp = new Node(num);
Node cr = head;
Node prev=null;
while ((cr != null) && !(cr.getData() == num))
{
prev=cr;
cr = cr.getNext();
}
prev.setNext(cr.getNext());
}
// method to print the list
public void print()
{
Node current = head;
if (current != null) {
while (current != null) {
System.out.println(current.getData());
current = current.getNext();
}
}
}
}
// method to test the class
public class MyLInkedListTester
{
// main method to perform the linked list operatrions
public static void main(String args[])
{
MyLInkedList llist = new MyLInkedList();
// insert the values into list
llist.add(\"1\");
llist.add(\"2\");
llist.add(\"3\");
llist.add(\"4\");
// print the list values
llist.print();
// sear the values in a list
llist.search(\"1\");
llist.print();
// delete the value from a list
llist.delete(\"4\");
System.out.println(\"List after deletion:\");
llist.print();
}
}
Result:
1
2
3
4
Search value 1 is available
1
2
3
4
List after deletion:
1
2
3
Solution
Note:
Given Code modified as required and required methods added.
Code:
// class node
class Node
{
// declare the required variable
String data;
Node next;
// constructor
Node(){}
// constructor with arguments
Node(String data)
{
this.data = data;
next = null;
}
// method to get the data
public String getData()
{
return data;
}
// method to set the data
public void se.
why will it not display all of the entries-- output -nMenu n-Add Entr.pdf
why will it not display all of the entries??
output
/nMenu
n.Add Entry
d. Delete Entry
u. Update Entry
l. Search
a. View All
q. Exit
/nMenu
n.Add Entry
d. Delete Entry
u. Update Entry
l. Search
a. View All
q. Exit
n
Enter a name: carnea
Enter an address: 30 carrollton
New Contact has been added,
/nMenu
n.Add Entry
d. Delete Entry
u. Update Entry
l. Search
a. View All
q. Exit
n
Enter a name: Tesia
Enter an address: 1010 hancover
New Contact has been added,
/nMenu
n.Add Entry
d. Delete Entry
u. Update Entry
l. Search
a. View All
q. Exit
n.Add Entry
d. Delete Entry
u. Update Entry
l. Search
a. View All
q. Exit
a
All entries:
carnea:30 carrollton
THE CODE:
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) {
this.name = name;
this.address = address;
}
public String getName() {
return this.name;
}
public void setName(String name) {
this.name = name;
}
public String getAddress() {
return this.address;
}
public void setAddress(String address) {
this.address = addr.
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.
could you implement this function please, im having issues with it..pdf
could you implement this function please, im having issues with it.
void makeList (const ListNode::value_type [],const size_t& count)
class ListNode
{
public:
typedef int value_type;
ListNode (value_type d = value_type(), ListNode* n = NULL) { datum = d; next = n; }
//Assessor
value_type getDatum () const { return datum; }
ListNode const* getNext () const { return next; }
//Mutator
void setDatum (const value_type& d) {datum = d; }
ListNode* getNext () { return next; }
void setNext (ListNode* new_link) {next = new_link; }
private:
value_type datum;
ListNode* next;
};
class LinkedList
{
public:
LinkedList ();
virtual ~LinkedList ();
void insertItem (ListNode::value_type);
void makeList (const ListNode::value_type [],const size_t& count);
void deleteList ();
//The following friend function is implemented in lablinklist.cpp
friend std::ostream& operator<<(std::ostream&, const LinkedList&);
private:
ListNode* head;
};
This is the pseudocode, but i still have a hard time undertanding it.
Creating a List (makeList(const ListNode::value_type [],const size_t& count)) This function
receives an array in the order that we want to add it to the linkedlist. Index 0 will be the head
node, index n will be the last node.
First, create a node initialized with a data value and a NULL pointer. Set the \"head\" to point to
the first node. Set up a current-pointer to the first node (or \"head\"). Get a data value for the next
node. While more nodes to add { Create a new node initialized with the data value and a NULL
pointer. Set the current-pointer link member (\"next\") to the new node. Set the current-pointer to
point to the new node. Get a data value for the next node. }
Thanks.
Solution
//linkedList.h
#ifndef LINKEDLIST_H
#define LINKEDLIST_H
#include
#include
class ListNode
{
public:
typedef int value_type;
ListNode(value_type d = value_type(), ListNode* n = NULL) { datum = d; next = n; }
//Assessor
value_type getDatum() const { return datum; }
ListNode const* getNext() const { return next; }
//Mutator
void setDatum(const value_type& d) { datum = d; }
ListNode* getNext() { return next; }
void setNext(ListNode* new_link) { next = new_link; }
private:
value_type datum;
ListNode* next;
};
class LinkedList
{
public:
LinkedList();
virtual ~LinkedList();
void insertItem(ListNode::value_type);
void makeList(const ListNode::value_type[], const size_t& count);
void deleteList();
//The following friend function is implemented in lablinklist.cpp
friend std::ostream& operator<<(std::ostream&, const LinkedList&);
private:
ListNode* head;
};
#endif
-------------------------------------------------------------
//linkedList.cpp
#include \"linkedlist.h\"
LinkedList::LinkedList()
{
head = NULL;
}
LinkedList::~LinkedList()
{
ListNode *tmp = head;
while (tmp != NULL)
{
head = head->getNext();
delete tmp;
tmp = head;
}
}
void LinkedList::insertItem(ListNode::value_type item)
{
ListNode *newNode,*cur = head;
newNode = new ListNode;
newNode->setDatum(item);
newNode->setNext(NULL);.
Recommended
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.
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.
Note Given Code modified as required and required met.pdf
Note:
Given Code modified as required and required methods added.
Code:
// class node
class Node
{
// declare the required variable
String data;
Node next;
// constructor
Node(){}
// constructor with arguments
Node(String data)
{
this.data = data;
next = null;
}
// method to get the data
public String getData()
{
return data;
}
// method to set the data
public void setData(String data)
{
this.data = data;
}
// method to get the next data
public Node getNext()
{
return next;
}
// method to set the next data
public void setNext(Node next)
{
this.next = next;
}
}
// class for a linked list
class MyLInkedList
{
Node head;alue into a list
// method to add the v
public void add(String num)
{
if (head == null)
{
head = new Node(num);
}
else{
Node temp = new Node(num);
Node current = head;
if (current != null) {
while (current.getNext() != null) {
current = current.getNext();
}
current.setNext(temp);
}
}
}
// method to search a value from a list
public void search(String num)
{
Node current = head;
boolean flag=true;
if (current != null)
{
while (current != null)
{
if(current.getData() == num)
{
System.out.println(\"Search value \"+
current.getData()+\" is available\");
flag=false;
}
current = current.getNext();
}
if (flag==true)
{
System.out.println(\"Search value \"+
current.getData()+\" is not available\");
}
}
else
{
System.out.println(\"Linked list is empty\");
}
}
// method to delete a value from a list
public void delete(String num)
{
//Node current = head;
boolean flag=true;
if (head == null)
{
System.out.println(\"Can\'t Delete, Linked list is
empty\");
return;
}
if(head.getData() == num)
{
head=head.getNext();
return;
}
Node temp = new Node(num);
Node cr = head;
Node prev=null;
while ((cr != null) && !(cr.getData() == num))
{
prev=cr;
cr = cr.getNext();
}
prev.setNext(cr.getNext());
}
// method to print the list
public void print()
{
Node current = head;
if (current != null) {
while (current != null) {
System.out.println(current.getData());
current = current.getNext();
}
}
}
}
// method to test the class
public class MyLInkedListTester
{
// main method to perform the linked list operatrions
public static void main(String args[])
{
MyLInkedList llist = new MyLInkedList();
// insert the values into list
llist.add(\"1\");
llist.add(\"2\");
llist.add(\"3\");
llist.add(\"4\");
// print the list values
llist.print();
// sear the values in a list
llist.search(\"1\");
llist.print();
// delete the value from a list
llist.delete(\"4\");
System.out.println(\"List after deletion:\");
llist.print();
}
}
Result:
1
2
3
4
Search value 1 is available
1
2
3
4
List after deletion:
1
2
3
Solution
Note:
Given Code modified as required and required methods added.
Code:
// class node
class Node
{
// declare the required variable
String data;
Node next;
// constructor
Node(){}
// constructor with arguments
Node(String data)
{
this.data = data;
next = null;
}
// method to get the data
public String getData()
{
return data;
}
// method to set the data
public void se.
why will it not display all of the entries-- output -nMenu n-Add Entr.pdf
why will it not display all of the entries??
output
/nMenu
n.Add Entry
d. Delete Entry
u. Update Entry
l. Search
a. View All
q. Exit
/nMenu
n.Add Entry
d. Delete Entry
u. Update Entry
l. Search
a. View All
q. Exit
n
Enter a name: carnea
Enter an address: 30 carrollton
New Contact has been added,
/nMenu
n.Add Entry
d. Delete Entry
u. Update Entry
l. Search
a. View All
q. Exit
n
Enter a name: Tesia
Enter an address: 1010 hancover
New Contact has been added,
/nMenu
n.Add Entry
d. Delete Entry
u. Update Entry
l. Search
a. View All
q. Exit
n.Add Entry
d. Delete Entry
u. Update Entry
l. Search
a. View All
q. Exit
a
All entries:
carnea:30 carrollton
THE CODE:
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) {
this.name = name;
this.address = address;
}
public String getName() {
return this.name;
}
public void setName(String name) {
this.name = name;
}
public String getAddress() {
return this.address;
}
public void setAddress(String address) {
this.address = addr.
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.
could you implement this function please, im having issues with it..pdf
could you implement this function please, im having issues with it.
void makeList (const ListNode::value_type [],const size_t& count)
class ListNode
{
public:
typedef int value_type;
ListNode (value_type d = value_type(), ListNode* n = NULL) { datum = d; next = n; }
//Assessor
value_type getDatum () const { return datum; }
ListNode const* getNext () const { return next; }
//Mutator
void setDatum (const value_type& d) {datum = d; }
ListNode* getNext () { return next; }
void setNext (ListNode* new_link) {next = new_link; }
private:
value_type datum;
ListNode* next;
};
class LinkedList
{
public:
LinkedList ();
virtual ~LinkedList ();
void insertItem (ListNode::value_type);
void makeList (const ListNode::value_type [],const size_t& count);
void deleteList ();
//The following friend function is implemented in lablinklist.cpp
friend std::ostream& operator<<(std::ostream&, const LinkedList&);
private:
ListNode* head;
};
This is the pseudocode, but i still have a hard time undertanding it.
Creating a List (makeList(const ListNode::value_type [],const size_t& count)) This function
receives an array in the order that we want to add it to the linkedlist. Index 0 will be the head
node, index n will be the last node.
First, create a node initialized with a data value and a NULL pointer. Set the \"head\" to point to
the first node. Set up a current-pointer to the first node (or \"head\"). Get a data value for the next
node. While more nodes to add { Create a new node initialized with the data value and a NULL
pointer. Set the current-pointer link member (\"next\") to the new node. Set the current-pointer to
point to the new node. Get a data value for the next node. }
Thanks.
Solution
//linkedList.h
#ifndef LINKEDLIST_H
#define LINKEDLIST_H
#include
#include
class ListNode
{
public:
typedef int value_type;
ListNode(value_type d = value_type(), ListNode* n = NULL) { datum = d; next = n; }
//Assessor
value_type getDatum() const { return datum; }
ListNode const* getNext() const { return next; }
//Mutator
void setDatum(const value_type& d) { datum = d; }
ListNode* getNext() { return next; }
void setNext(ListNode* new_link) { next = new_link; }
private:
value_type datum;
ListNode* next;
};
class LinkedList
{
public:
LinkedList();
virtual ~LinkedList();
void insertItem(ListNode::value_type);
void makeList(const ListNode::value_type[], const size_t& count);
void deleteList();
//The following friend function is implemented in lablinklist.cpp
friend std::ostream& operator<<(std::ostream&, const LinkedList&);
private:
ListNode* head;
};
#endif
-------------------------------------------------------------
//linkedList.cpp
#include \"linkedlist.h\"
LinkedList::LinkedList()
{
head = NULL;
}
LinkedList::~LinkedList()
{
ListNode *tmp = head;
while (tmp != NULL)
{
head = head->getNext();
delete tmp;
tmp = head;
}
}
void LinkedList::insertItem(ListNode::value_type item)
{
ListNode *newNode,*cur = head;
newNode = new ListNode;
newNode->setDatum(item);
newNode->setNext(NULL);.
mainpublic class AssignmentThree { public static void ma.pdf
// main
public class AssignmentThree
{
public static void main(String[] args)
{
List myList = new List(15);
// Cause List Empty Message
myList.removeFront();
myList.removeRear();
myList.removeItem(\"a\");
// Cause Not found message
myList.addToFront(\"x\");
myList.removeItem(\"y\");
myList.removeItem(\"x\");
myList.addAfterItem(\"x\", \"z\");
myList.addBeforeItem(\"x\", \"z\");
// Normal behavior
myList.addToFront(\"not.\");
myList.addToFront(\"or\");
myList.addToRear(\"is\");
myList.addToRear(\"try.\");
myList.addAfterItem(\"is\", \"no\");
myList.addBeforeItem(\"is\", \"There\");
myList.addToFront(\"Do\");
myList.addAfterItem(\"or\", \"do\");
myList.print(\"Original list\");
myList.printSorted(\"Sorted Original List\");
sop(\"\ Front is \" + myList.getFront());
sop(\"Rear is \" + myList.getRear());
sop(\"Count is \" + myList.askCount());
sop(\"Is There present? \" + myList.isPresent(\"There\"));
sop(\"Is Dog present? \" + myList.isPresent(\"Dog\"));
myList.addToFront(\"junk\");
myList.addToRear(\"morejunk\");
myList.addAfterItem(\"or\", \"moremorejunk\");
myList.print(\"List with junk\");
sop(\"Count is \" + myList.askCount());
myList.removeFront();
myList.removeRear();
myList.removeItem(\"moremorejunk\");
myList.print(\"List with junk removed\");
sop(\"Count is \" + myList.askCount());
sop(\"\");
// Cause List Full message
for(int ii = 0; ii < 10; ++ii)
{
myList.addToFront(DUMMY);
}
myList.addToRear(DUMMY);
myList.addBeforeItem(\"no\", DUMMY);
myList.addAfterItem(\"There\", DUMMY);
myList.print(\"After filling List\");
sop(\"Count is \" + myList.askCount());
while(myList.isPresent(DUMMY)) myList.removeItem(DUMMY);
myList.print(\"After removing \" + DUMMY );
sop(\"Count is \" + myList.askCount());
}
private static void sop(String s)
{
System.out.println(s);
}
private static final String DUMMY = \"dummy\";
}
Solution
Following is MyList implementation for your output as:
Java Code:
import java.util.Comparator;
public class MyList {
private Node start;
private Node end;
private int size;
private int capacity;
public MyList(int capacity) {
start = null;
end = null;
size = 0;
this.capacity = capacity;
}
/* Function to check if list is empty */
public boolean isEmpty() {
return start == null;
}
public void removeFront() {
if (isEmpty()) {
System.out.println(\"List Empty\");
return;
} else {
start = start.next;
size--;
return;
}
}
public void removeRear() {
if (size == 0) {
System.out.println(\"List Empty\");
return;
}
if (start.next == null) {
start=null;
end=null;
size=0;
}
Node node = start.next;
while (node.next != null) {
node = node.next;
}
node.next = null;
end = node;
size--;
}
public void removeItem(String key) {
if (size == 0) {
System.out.println(\"List Empty\");
return;
}
if (start.next == null) {
if (start.key.equals(key)) {
start=null;
end=null;
size=0;
} else {
System.out.println(\"\");
}
return;
}
Node node = start;
Node nodeNext = node.next;
while (nodeNext.next != null) {
if (nodeNext.key.equals(key)) {
node.next=nodeNext.next;
}.
can you add a delete button and a add button to the below program. j.pdf
can you add a delete button and a add button to the below program. java fx
package nusoft;
public class Car {
private String make;
private String model;
private int year;
private String color;
public Car(String make, int year, String model, String color) {
this.make = make;
this.model = model;
this.year = year;
this.color = color;
}
public String getMake() {
return make;
}
public void setMake(String make) {
this.make = make;
}
public String getModel() {
return model;
}
public void setModel(String model) {
this.model = model;
}
public int getYear() {
return year;
}
public void setYear(int year) {
this.year = year;
}
public String getColor() {
return color;
}
public void setColor(String color) {
this.color = color;
}
@Override
public String toString() {
return year + " " + make + " " + model + " (" + color + ")";
}
}
package nusoft;
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.util.ArrayList;
import javafx.application.Application;
import javafx.geometry.Pos;
import javafx.scene.Scene;
import javafx.scene.control.Button;
import javafx.scene.control.Label;
import javafx.scene.layout.BorderPane;
import javafx.scene.layout.VBox;
import javafx.stage.Stage;
public class CarNavigator extends Application {
private ArrayList cars = new ArrayList<>();
private int currentIndex = 0;
@Override
public void start(Stage primaryStage) throws Exception {
readCarsFile();
Label carLabel = new Label();
carLabel.setAlignment(Pos.CENTER);
updateCarLabel(carLabel);
Button prevButton = new Button("Previous");
prevButton.setOnAction(e -> {
currentIndex--;
if (currentIndex < 0) {
currentIndex = cars.size() - 1;
}
updateCarLabel(carLabel);
});
Button nextButton = new Button("Next");
nextButton.setOnAction(e -> {
currentIndex++;
if (currentIndex >= cars.size()) {
currentIndex = 0;
}
updateCarLabel(carLabel);
});
VBox buttonBox = new VBox(10, prevButton, nextButton);
buttonBox.setAlignment(Pos.CENTER);
BorderPane root = new BorderPane(carLabel, null, null, buttonBox, null);
Scene scene = new Scene(root, 400, 200);
primaryStage.setScene(scene);
primaryStage.show();
}
private void readCarsFile() throws IOException {
BufferedReader reader = new BufferedReader(new FileReader("cars.txt"));
String line;
while ((line = reader.readLine()) != null) {
cars.add(line);
}
reader.close();
}
private void updateCarLabel(Label label) {
label.setText(cars.get(currentIndex));
}
public static void main(String[] args) {
launch(args);
}
}
package nusoft.utils;
import java.util.NoSuchElementException;
import nusoft.Car;
public class NuLinkedList {
private Node head;
private Node tail;
private int size;
private static class Node {
E element;
Node prev;
Node next;
Node(E element, Node prev, Node next) {
this.element = element;
this.prev = prev;
this.next = next;
}
}
public boolean contains(E e) {
return indexOf(e) != -1;
}
public E get(int index) {
if (index < 0 || index >= size) {
throw new IndexOutOfBoundsException();
}
return getNode(index).el.
in this assignment you are asked to write a simple driver program an.pdf
in this assignment you are asked to write a simple driver program and set of functions (maybein
a library) that can be performed on a binary search tree.
Your program should allow user to insert/delete integer values into the binary search tree along
with several other operations on the binary search tree. You can use the code given in slides. But
this time your key will be int! Specifically, your program will ask user to enter a command and
related parameters (if any) in a loop, and then perform the given commands. Here is the list of
commands that your program must implement:
* insert
*find\'
*delete
*list inorder
*list preorder
*list postorder
*list levelorder
* max
* min
* height
*count
* sum
*quit
As always, make sure you release (free) the dynamically allocated memories if you allocate any
memory in your programs. So, before submitting your program, run it with valgrind to see if
there is any memory leakage
//my proggram in C
struct tree_node {
int data;
struct tree_node *left, *right;
}
typedef struct nodeT {
int key;
struct nodeT *left, *right;
} nodeT, *treeT;
int main(){
while (TRUE) {
printf(\"> \");
line = GetLine();
ch = toupper(line[0]);
switch (ch) {
case \'I\': insert(); break;
case \'F\': find(); break;
case \'D\': delete(); break;
case \'LI\': listInorder; break;
case \'LPR\': listPreorder(); break;
case \'LPO\': listPostorder(); break;
case \'MAX\': max(); break;
case \'min\': min(); break;
case \'H\': height(); break;
case \'C\': count(); break;
case \'S\': sum(); break;
case \'Q\': exit(0);
default:printf(\"Illegal command\ \"); break;
}
}
}
nodeT *FindNode(nodeT *t, int key){
while(t !=NULL) {
if (key == t->key) return t;
if (key < t->key) {
t = t->left;
} else {
t = t->right;
}
return NULL;
}
void delete(nodeT **p){
nodeT
*target;
target=*p;
if (target->left==NULL && target->right==NULL) {
*p=NULL;
} else if (target->left == NULL) {
*p=target->right;
} else
if (target->right == NULL) {
*p=target->left;
} else {
/* target has two children, see next slide */
}
free(target);
}
void listInorder(nodeT *T){
if (t != NULL) {
DisplayTree(t->left);
printf(“%d “, t->key);
DisplayTree(t->right);
}
}
void listPreorder(nodeT *t) {
if (t != NULL) {
printf(“%d “, t->key);
DisplayTree(t->left);
DisplayTree(t->right);
}
}
void listPostOrder(nodeT *t){
if (t != NULL) {
DisplayTree(t->left);
DisplayTree(t->right);
printf(“%d “, t->key);
}
}
void intsert(nodeT **tptr, int key){
nodeT*t, *tmp;
t=*tptr;
if (t == NULL) {
tmp=New(nodeT*);
tmp->key = key;
tmp->left=tmp->right=NULL;
*tptr=tmp;
return;
}
if (key < t->key) {
InsertNode
(&t->left, key);
} else {
InsertNode(&t->right, key);
}
}
int height(nodeT *t){
if (t == NULL)
return 0;
else
return (1 + maximumof(
height(t->left),
height(t->right)) );
}
int sum(struct tree_node *p){
if (p == NULL)
return 0;
else
return (p->data +
sum(p->left) +
sum(p->right) );
}
Solution
1. /*
2. * Java Program to Implement Binary Search Tree
3. */
4.
5. import java.util.Scanner;
6.
7. /* Class BSTNode */
8. cl.
Javai have to make a method that takes a linked list and then retu.pdf
Java
i have to make a method that takes a linked list and then returns a new linked list that is the
reverse of the original
this is the starting code
/**
* LinkedList lab.
* @author Emma Cheney
* @version 10/2/23
*/
public class LinkedList {
/**
* Internal Node class used for the linked list.
*/
public class Node {
String key;
int value;
Node next;
/**
* Node Constructor.
* @param key The Key
* @param value The Value
*/
public Node(String key, int value) {
this.key = key;
this.value = value;
}
}
private Node head;
private Node tail;
/**
* The default constructor.
*/
public LinkedList() {
head = null;
tail = null;
}
/**
* Add the key, value pair to the head of the linkedlist.
* @param key The Key
* @param val The Value
*
*/
public void addHead(String key, int val) {
Node n = new Node(key, val);
if (head == null) {
head = n;
tail = n;
} else {
n.next = head;
head = n;
}
}
/**
* Add the key, val pair to the tail of the linkedlist.
* @param key The Key
* @param val The Value
*/
public void addTail(String key, int val) {
Node n = new Node(key, val);
if (tail == null) {
head = n;
tail = n;
} else {
tail.next = n;
tail = n;
}
}
/**
* Returns the String format of the linkedlist.
* @return String The String format.
*/
public String toString() {
String ret = "";
Node curr = head;
while (curr != null) {
if (curr.next != null) {
ret += curr.key + ":" + curr.value + ", ";
} else {
ret += curr.key + ":" + curr.value;
}
curr = curr.next;
}
return ret;
}
/**
* Locate the Node in the linkedlist with the given key.
* @param key The key to find in the LinkedList
* @return Node Returns the Node with the given key or null if non-existent.
*/
private Node find(String key) {
Node curr = head;
while (curr != null) {
if (curr.key.equals(key)) {
return curr;
}
curr = curr.next;
}
return null;
} A static method called reversed that takes a LinkedList as a parameter and returns a new
LinkedList that is reversed. f; traverse through the input list (starting at the head). In order to
reverse the ordering, you need to add the current node's key and value onto the head of the new
list (addHead method). Do not change the input list or any values in it. Example (result in red)
//assumelistcontainsthesekeysandvalues://ie:6,bi:48,bi:73,bi:63LinkedList.reversed(list);bi:63,bi:
73,bi:48,ie:6.
Here is the editable codeSolutionimport java.util.NoSuchEleme.pdf
Here is the editable code:
Solution
import java.util.NoSuchElementException;
public class DoublyLinkedListImpl {
private Node head;
private Node tail;
private int size;
public DoublyLinkedListImpl() {
size = 0;
}
private class Node {
E element;
Node next;
Node prev;
public Node(E element, Node next, Node prev) {
this.element = element;
this.next = next;
this.prev = prev;
}
}
public int size() { return size; }
public boolean isEmpty() { return size == 0; }
public void addFirst(E element) {
Node tmp = new Node(element, head, null);
if(head != null ) {head.prev = tmp;}
head = tmp;
if(tail == null) { tail = tmp;}
size++;
System.out.println(\"adding: \"+element);
}
/**
* adds element at the end of the linked list
* @param element
*/
public void addLast(E element) {
Node tmp = new Node(element, null, tail);
if(tail != null) {tail.next = tmp;}
tail = tmp;
if(head == null) { head = tmp;}
size++;
System.out.println(\"adding: \"+element);
}
public void iterateForward(){
System.out.println(\"iterating forward..\");
Node tmp = head;
while(tmp != null){
System.out.println(tmp.element);
tmp = tmp.next;
}
}
/**
* this method walks backward through the linked list
*/
public void iterateBackward(){
System.out.println(\"iterating backword..\");
Node tmp = tail;
while(tmp != null){
System.out.println(tmp.element);
tmp = tmp.prev;
}
}
public E removeFirst() {
if (size == 0) throw new NoSuchElementException();
Node tmp = head;
head = head.next;
head.prev = null;
size--;
System.out.println(\"deleted: \"+tmp.element);
return tmp.element;
}
public E removeLast() {
if (size == 0) throw new NoSuchElementException();
Node tmp = tail;
tail = tail.prev;
tail.next = null;
size--;
System.out.println(\"deleted: \"+tmp.element);
return tmp.element;
}
public static void main(String a[]){
DoublyLinkedListImpl dll = new DoublyLinkedListImpl();
dll.addFirst(10);
dll.addFirst(34);
dll.addLast(56);
dll.addLast(364);
dll.iterateForward();
dll.removeFirst();
dll.removeLast();
dll.iterateBackward();
}
}
import java.util.Scanner;
/* Class Node */
class Node
{
protected int data;
protected Node next, prev;
/* Constructor */
public Node()
{
next = null;
prev = null;
data = 0;
}
/* Constructor */
public Node(int d, Node n, Node p)
{
data = d;
next = n;
prev = p;
}
/* Function to set link to next node */
public void setLinkNext(Node n)
{
next = n;
}
/* Function to set link to previous node */
public void setLinkPrev(Node p)
{
prev = p;
}
/* Funtion to get link to next node */
public Node getLinkNext()
{
return next;
}
/* Function to get link to previous node */
public Node getLinkPrev()
{
return prev;
}
/* Function to set data to node */
public void setData(int d)
{
data = d;
}
/* Function to get data from node */
public int getData()
{
return data;
}
}
/* Class linkedList */
class linkedList
{
protected Node start;
protected Node end ;
public int size;
/* Constructor */
public linkedList()
{
start = null;
end = null;
size = 0;
}
/* Function to check if list is empty */
public boolean isE.
Sorted number list implementation with linked listsStep 1 Inspec.pdf
Sorted number list implementation with linked lists
Step 1: Inspect the Node.java file
Inspect the class declaration for a doubly-linked list node in Node.java. Access Node.java by
clicking on the orange arrow next to LabProgram.java at the top of the coding window. The
Node class has three fields:
a double data value,
a reference to the next node, and
a reference to the previous node.
Each field is protected. So code outside of the class must use the provided getter and setter
methods to get or set a field.
Node.java is read only, since no changes are required.
Step 2: Implement the insert() method
A class for a sorted, doubly-linked list is declared in SortedNumberList.java. Implement the
SortedNumberList class's insert() method. The method must create a new node with the
parameter value, then insert the node into the proper sorted position in the linked list. Ex:
Suppose a SortedNumberList's current list is 23 47.25 86, then insert(33.5) is called. A new
node with data value 33.5 is created and inserted between 23 and 47.25, thus preserving the list's
sorted order and yielding: 23 35.5 47.25 86
Step 3: Test in develop mode
Code in main() takes a space-separated list of numbers and inserts each into a SortedNumberList.
The list is displayed after each insertion. Ex: If input is
then output is:
Try various program inputs, ensuring that each outputs a sorted list.
Step 4: Implement the remove() method
Implement the SortedNumberList class's remove() method. The method takes a parameter for the
number to be removed from the list. If the number does not exist in the list, the list is not
changed and false is returned. Otherwise, the first instance of the number is removed from the
list and true is returned.
Uncomment the commented-out part in main() that reads a second input line and removes
numbers from the list. Test in develop mode to ensure that insertion and removal both work
properly, then submit code for grading. Ex: If input is
then output is:
Given templates:
LabProgram.java
import java.util.Scanner;
import java.io.PrintWriter;
public class LabProgram {
// Prints the SortedNumberList's contents, in order from head to tail
public static void printList(SortedNumberList list) {
Node node = list.head;
while (null != node) {
System.out.print(node.getData() + " ");
node = node.getNext();
}
System.out.println();
}
public static void main(String[] args) {
Scanner scnr = new Scanner(System.in);
String inputLine;
// Read the line of input numbers
inputLine = scnr.nextLine();
// Split on space character
String[] terms = inputLine.split(" ");
// Insert each value and show the sorted list's contents after each insertion
SortedNumberList list = new SortedNumberList();
for (Object term : terms) {
double number = Double.parseDouble(term.toString());
System.out.println("List after inserting " + number + ": ");
list.insert(number);
printList(list);
}
/*
// Read the input line with numbers to remove
inputLine = scnr.nextLine();
terms = inputLine.split(" ".
Given the following codepackage data1;import java.util.;p.pdf
Given the following code
package data1;
import java.util.*;
/*public class BST> implementing a set ADT and containing the following:
* private inner class BinaryNode representing a node with a (possibly) left child and a (possibly)
right child
** instance fields BinaryNode root, int size
* contains/insert/remove method - w/ O(height) complexity
** size O(1), isEmpty O(1), clear O(1),
*** findMin, findMax, findHeight methods - w/ O(height) complexity
**** toString() method printing set (in-order traversal) and the tree (BFS traversal)
**
*/
publicclass BST> {
private BinaryNode root;
privateint size;
//Search opertion of Set ADT
publicboolean contains(E value) {
return contains(root, value);
}
//Insert opertion of Set ADT
publicvoid insert(E value) {
root = insert(root, value);
size++;
}
//Remove operation of Set ADT
publicvoid remove(E value){
root = remove(root, value);
size--;
}
publicint size(){
return size;
}
publicboolean isEmpty(){
return root == null;
}
publicvoid clear(){
root = null;
size = 0;
}
public E findMin(){
return findMin(root);
}
public E findMax(){
return findMax(root);
}
publicint findHeight(){
return root.height();
}
public String toString(){
if(root == null)
return "set {} stored in an empty tree.\n";
String elements = root.inOrder().toString();
return "set {" + elements.substring(1,elements.length()-1) + "} stored in tree \n" + root;
}
private E findMin(BinaryNode node){
if(node == null)
returnnull;
if(node.left == null)
return node.element;
return findMin(node.left);
}
private E findMax(BinaryNode node){
if(node == null)
returnnull;
if(node.right == null)
return node.element;
return findMax(node.right);
}
privateboolean contains(BinaryNode node, E value) {
if (node == null)//node represents an empty substree
returnfalse;
int comparisonResult = value.compareTo(node.element);
if(comparisonResult < 0)//if value is less than root's value
return contains(node.left, value);
if(comparisonResult > 0)//if value is greater than root's value
return contains(node.right, value);
returntrue;//successful search
}
private BinaryNode insert(BinaryNode node, E value) {
if (node == null)//base case: empty tree
returnnew BinaryNode<>(value);
if (value.compareTo(node.element) < 0)
node.left = insert(node.left, value);//insert recursively to left-subtree
elseif (value.compareTo(node.element) > 0)
node.right = insert(node.right, value);//insert recursively to right-subtree
else {//duplicate value cannot be inserted in a BST implementing the Set ADT
size--;//insertion failed!
//System.out.print("BST.insert: Warning: " + value + " is already stored in the tree \n" + node);
}
return node;
}
private BinaryNode remove(BinaryNode node, E value) {
if (node == null) {//base case: empty tree
System.out.println("BST.remove: Warning: " + value + " doesn't exist in the tree.");
size++;//removal failed!
return node;
}
if (value.compareTo(node.element) < 0)
node.left = remove(node.left, value);
elseif (value.compareTo(node.element) > 0)
node.right = remov.
import java.util.Scanner;class BinaryNode{ BinaryNode left.pdf
import java.util.Scanner;
class BinaryNode
{
BinaryNode left, right;
int data;
public BinaryNode()
{
left = null;
right = null;
data = 0;
}
public BinaryNode(int n)
{
left = null;
right = null;
data = n;
}
public void setLeft(BinaryNode n)
{
left = n;
}
public void setRight(BinaryNode n)
{
right = n;
}
public BinaryNode getLeft()
{
return left;
}
public BinaryNode getRight()
{
return right;
}
public void setData(int d)
{
data = d;
}
public int getData()
{
return data;
}
}
class Binary
{
private BinaryNode root;
public Binary()
{
root = null;
}
public boolean isEmpty()
{
return root == null;
}
public void insert(int data)
{
root = insert(root, data);
}
private BinaryNode insert(BinaryNode node, int data)
{
if (node == null)
node = new BinaryNode(data);
else
{
if (data <= node.getData())
node.left = insert(node.left, data);
else
node.right = insert(node.right, data);
}
return node;
}
public void delete(int k)
{
if (isEmpty())
System.out.println(\"Tree Empty\");
else if (search(k) == false)
System.out.println(\"Sorry \"+ k +\" is not present\");
else
{
root = delete(root, k);
System.out.println(k+ \" deleted from the tree\");
}
}
private BinaryNode delete(BinaryNode root, int k)
{
BinaryNode p, p2, n;
if (root.getData() == k)
{
BinaryNode lt, rt;
lt = root.getLeft();
rt = root.getRight();
if (lt == null && rt == null)
return null;
else if (lt == null)
{
p = rt;
return p;
}
else if (rt == null)
{
p = lt;
return p;
}
else
{
p2 = rt;
p = rt;
while (p.getLeft() != null)
p = p.getLeft();
p.setLeft(lt);
return p2;
}
}
if (k < root.getData())
{
n = delete(root.getLeft(), k);
root.setLeft(n);
}
else
{
n = delete(root.getRight(), k);
root.setRight(n);
}
return root;
}
public boolean search(int val)
{
return search(root, val);
}
private boolean search(BinaryNode r, int val)
{
boolean found = false;
while ((r != null) && !found)
{
int rval = r.getData();
if (val < rval)
r = r.getLeft();
else if (val > rval)
r = r.getRight();
else
{
found = true;
break;
}
found = search(r, val);
}
return found;
}
public void inorder()
{
inorder(root);
}
private void inorder(BinaryNode r)
{
if (r != null)
{
inorder(r.getLeft());
System.out.print(r.getData() +\" \");
inorder(r.getRight());
}
}
public void preorder()
{
preorder(root);
}
private void preorder(BinaryNode r)
{
if (r != null)
{
System.out.print(r.getData() +\" \");
preorder(r.getLeft());
preorder(r.getRight());
}
}
public void postorder()
{
postorder(root);
}
private void postorder(BinaryNode r)
{
if (r != null)
{
postorder(r.getLeft());
postorder(r.getRight());
System.out.print(r.getData() +\" \");
}
}
}
public class BinarySearchTree
{
public static void main(String[] args)
{
Scanner scan = new Scanner(System.in);
Binary Binary = new Binary();
System.out.println(\"Binary Search Tree Test\ \");
char ch;
do
{
System.out.println(\"\ Binary Search Tree Operations\ \");
System.out.println(\"1. insert \");
System.out.println(\"2. delete\");
System.out.println(\"3. search\");
System.out.println(\"4. check empty\");
int .
This is to test a balanced tree. I need help testing an unbalanced t.pdf
this is business analytics question. (using gurobi) The days-off scheduling problem must be
solved routinely by businesses that operate 6 or 7 days a week. Examples include hospitals,
airlines, municipal transportation companies, and the postal service. The most common example
is the (5,7)-cyclic staffing problem. The objective of it is to minimize the cost of assigning
workers to a 7-day cyclic schedule so that 1) Sufficient workers are available every day. 2) Each
person works 5 consecutive days and is idle to the remaining 2 days. Here is the table showing
the cost of having an employee for each day and the number of employees required for each day.
For example, the pattern that one works from Sunday to Thursday costs 90+604=330. Formulate
and solve an integer programming problem to represent this problem. How many employees
work Monday-Friday?.
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.
6. Generics. Collections. Streams
6.1 Generics
6.2 Коллекции
6.3 Функциональные интерфейсы
6.4 Stream API
tested on eclipseDoublyLinkedList class.pdf
//tested on eclipse
/*************DoublyLinkedList class*******************/
public class DoublyLinkedList {
/*Data member variable declaration*/
private Node head;
private int count;
/**default constructor*/
public DoublyLinkedList() {
/*Initializing variable*/
head=null;
count =0;
}
/*Insert at beginning in doubly linked list*/
public void insertBeginning(String name){
/*checking head is null then we will add node at head*/
if(head==null){
head=new Node(name, null, null);
count++;
}else{
/*else create temp node and setting next to head
* and then making temp to head*/
Node temp=new Node(name,null,null);
temp.setNext(head);
head.setPrev(temp);
head=temp;
count++;
}
}
public void printList(){
Node temp=head;
/*Printing element of doubly list*/
while(temp!=null){
System.out.println(temp.getData());
temp=temp.getNext();
}
}
/*Returning count from doubly linked list*/
public int count(){
return count;
}
/*deleting specific node from doubly linked list*/
public void delete(String name){
Node current=head,previous=head;
/*if it is head node to be deleted*/
if(head.getData().equals(name)){
current=head.getNext();
current.setPrev(null);
head=current;
previous=head;
}else{
/*If node in middle of list*/
while(current.getNext()!=null){
if(current.getData().equals(name)){
current.getNext().setPrev(previous);
previous.setNext(current.getNext());
count--;
break;
}
previous=current;
current=current.getNext();
}
/*If node is at last*/
if(current.getNext()==null){
if(current.getData().equals(name)){
previous.setNext(null);
count--;
}
}
}
}
/*deleting all nodes from list by assigning head to null
* and memory releasing take care by garbage collector*/
public void clear(){
head=null;
count=0;
}
/*Inserting element in alphabetic order*/
public void insertAlpha(String name){
Node current=head,previous=head;
/*creating new node*/
Node newNode=new Node(name,null,null);
/*if head node is null*/
if(head==null){
head=newNode;
count++;
}else{
/*please read about compareTo() method about returning value*/
if(head.getData().compareTo(name)>0){
newNode.setNext(head);
head=newNode;
count++;
}else{
/*condition for getting position of node to be inserted*/
while(current!=null&¤t.getData().compareTo(name)<=0){
previous=current;
current=current.getNext();
}
/*if node need to be inserted at last*/
if(current==null){
previous=newNode;
}else{
/*If node need to inserted in middle*/
newNode.setNext(current);
previous.setNext(newNode);
current.setPrev(newNode);
newNode.setPrev(previous);
}
count++;
}
}
}
/*Main method start*/
public static void main(String args[]){
/*creating object of doubly linked list*/
DoublyLinkedList doublyLinkedList=new DoublyLinkedList();
doublyLinkedList.insertBeginning(\"sunita\");
doublyLinkedList.insertBeginning(\"lalchand\");
/*calling alphabetic order method*/
doublyLinkedList.insertAlpha(\"ramsingh\");
doublyLinkedList.insertBeginning(\"Lokesh\");
doublyLinkedList.insertBeginning(\"Pritam\");
/*****printing list********/
doublyLinkedList.printL.
I dont know what is wrong with this roulette program I cant seem.pdf
I don\'t know what is wrong with this roulette program I can\'t seem to get it to run.
Game Class:
public class Game {
public static void main(String[] args) {
Table table = new Table();
BinBuilder bb = new BinBuilder();
Outcome black = new Outcome(\"Black\", 35);
Bet bet = new Bet(10, black);
table.placeBet(bet);
Bin bin = bb.wheel.get(8);
System.out.println(bin.toString());
System.out.println(table.bets.toString());
System.out.println(black.toString());
ListIterator i = table.bets.listIterator();
Iterator b = bin.outcomes.iterator();
while(i.hasNext()) {
System.out.println(i.next().outcome.name.toString());
while(b.hasNext()){
System.out.println(b.next().name.toString());
if(i.next().outcome.equals(b.next())){
System.out.println(\"Win!\");
}
else{
System.out.println(\"Win :/\");
}
}
}
}
}
Player Class
public class Player {
public Table table;
public Outcome black;
public Bet bet;
public Player(Table table) {
table = new Table();
black = new Outcome(\"Black\", 1);
}
void placeBets() {
Bet bet = new Bet(100, black);
table.placeBet(bet);
}
void win(Bet bet) {
System.out.println(\"You\'ve won: \" + bet.winAmount());
}
void lose(Bet bet) {
System.out.println(\"You lost!\" + bet.loseAmount() + \":/\");
}
}
Outcome class
public class Outcome implements Comparable {
public String name;
public int odds;
public Outcome(String name, int odds){
this.name = name;
this.odds = odds;
}
public int winAmount(int amount){
return amount*this.odds;
}
public boolean equals(Outcome other){
return (this.name.equals(other.name));
}
public String toString() {
Object[] values= { name, new Integer(odds) };
String msgTempl= \"{0} ({1}:1)\";
return MessageFormat.format( msgTempl, values );
}
@Override
public int compareTo(E arg0) {
if(this.equals(arg0)){
return 0;
}
return 1;
}
}
Table Class
public class Table {
public int limit = 1000;
public LinkedList bets;
public Table() {
bets = new LinkedList();
}
public boolean isValid(Bet bet) {
int sum = 0;
for(Bet bett: bets) {
sum += bett.amountBet;
}
return (sum>limit);
}
public void placeBet(Bet bet) {
bets.add(bet);
}
ListIterator iterator() {
return bets.listIterator();
}
}
Wheel Class
public class Wheel extends TreeSet {
Vector bins;
NonRandom rng;
Set all_outcomes;
Wheel(NonRandom rng){
this.rng = rng;
rng = new NonRandom();
all_outcomes = new TreeSet();
bins = new Vector(38);
for (int i=0; i<38; i++){
bins.add(i, new Bin());
}
}
Bin next(){
int rand = rng.next(38);
return bins.elementAt(rand);
}
Bin get(int bin){
return bins.elementAt(bin);
}
public Outcome getOutcome( String name ){
TreeSet result= new TreeSet();
for( Iterator i = all_outcomes.iterator(); i.hasNext(); ) {
Outcome oc= i.next();
if( oc.name.contains(name) ) {result.add( oc );}
}
return result.first();
}
public void addOutcome(int bin, Outcome outcome) {
all_outcomes.add(outcome);
this.bins.elementAt(bin).add(outcome);
}
}
Bet Class
public class Bet {
public int amountBet;
public Outcome outcome;
public Bet(int amount, Outcome outcome) {
this.outcome = o.
PLEASE MAKE SURE THE PROGRAM IS ASKING FOR INPUT FROM USER TO ADD OR.pdf
PLEASE MAKE SURE THE PROGRAM IS ASKING FOR INPUT FROM USER TO ADD
OR REMOVE NAME. DO NOT HARD CODE NAME. AGAIN MAKE SURE THE
PROGRAM IS ASKING FOR INPUT FROM USER TO ADD OR REMOVE NAME. PLEASE
MAKE SURE THE CODE RUNS WITHOUT ANY ERRORS.
Write a class that maintains the scores for a game application. Implement the addition and
removal function to update the database. The gamescore.txt contains player’ name and score data
record fields separated by comma. For Removal function, uses the name field to select record to
remove the game score record.
Use the List.java, LList.java, Dlink.java, GameEntry.java and gamescore.txt found below
Read gamescore.txt to initialize the Linked list in sorted order by score.
Ask the user to add or remove users to update the sorted linked list.
Display “Name exist” when add an exist name to the list.
Display “Name does not exist” when remove a name not on the list.
List.java File:
/** Source code example for \"A Practical Introduction to Data
Structures and Algorithm Analysis, 3rd Edition (Java)\"
by Clifford A. Shaffer
Copyright 2008-2011 by Clifford A. Shaffer
*/
/** List ADT */
public interface List
{
/**
* Remove all contents from the list, so it is once again empty. Client is
* responsible for reclaiming storage used by the list elements.
*/
public void clear();
/**
* Insert an element at the current location. The client must ensure that
* the list\'s capacity is not exceeded.
*
* @param item
* The element to be inserted.
*/
public void insert(E item);
/**
* Append an element at the end of the list. The client must ensure that
* the list\'s capacity is not exceeded.
*
* @param item
* The element to be appended.
*/
public void append(E item);
/**
* Remove and return the current element.
*
* @return The element that was removed.
*/
public E remove();
/** Set the current position to the start of the list */
public void moveToStart();
/** Set the current position to the end of the list */
public void moveToEnd();
/**
* Move the current position one step left. No change if already at
* beginning.
*/
public void prev();
/**
* Move the current position one step right. No change if already at end.
*/
public void next();
/** @return The number of elements in the list. */
public int length();
/** @return The position of the current element. */
public int currPos();
/**
* Set current position.
*
* @param pos
* The position to make current.
*/
public void moveToPos(int pos);
/** @return The current element. */
public E getValue();
}
LList.java File:
/**
* Source code example for \"A Practical Introduction to Data Structures and
* Algorithm Analysis, 3rd Edition (Java)\" by Clifford A. Shaffer Copyright
* 2008-2011 by Clifford A. Shaffer
*/
// Doubly linked list implementation
class LList implements List
{
private DLink head; // Pointer to list header
private DLink tail; // Pointer to last element in list
protected DLink curr; // Pointer ahead of current element
int cnt; // Size of list
// Constructors
LList(int size)
{
th.
Inspect the class declaration for a doubly-linked list node in Node-h-.pdf
Inspect the class declaration for a doubly-linked list node in Node.h. Access Node.h by clicking
on the orange arrow next to main.cpp at the top of the coding window. The Node class has three
member variables: a double data value, a pointer to the next node, and a pointer to the previous
node. Each member variable is protected. So code outside of the class must use the provided
getter and setter member functions to get or set a member variable. Node.h is read only, since no
changes are required. Step 2: Implement the Insert() member function A class for a sorted,
doubly-linked list is declared in SortedNumberList.h. Implement the SortedNumberList class's
Insert() member function. The function must create a new node with the parameter value, then
insert the node into the proper sorted position in the linked list. Ex: Suppose a
SortedNumberList's current list is 23 47.25 86, then Insert(33.5) is called. A new node with data
value 33.5 is created and inserted between 23 and 47.25, thus preserving the list's sorted order
and yielding: 23 35.5 47.25 86 Step 3: Test in develop mode Code in main() takes a space-
separated list of numbers and inserts each into a SortedNumberList. The list is displayed after
each insertion. Ex: If input is 77 15 -42 63.5 then output is: List after inserting 77: 77 List after
inserting 15: 15 77 List after inserting -42: -42 15 77 List after inserting 63.5: -42 15 63.5 77 Try
various program inputs, ensuring that each outputs a sorted list. Step 4: Implement the Remove()
member function Implement the SortedNumberList class's Remove() member function. The
function takes a parameter for the number to be removed from the list. If the number does not
exist in the list, the list is not changed and false is returned. Otherwise, the first instance of the
number is removed from the list and true is returned. Uncomment the commented-out part in
main() that reads a second input line and removes numbers from the list. Test in develop mode to
ensure that insertion and removal both work properly, then submit code for grading. Ex: If input
is 84 72 19 61 19 84 then output is: List after inserting 84: 84 List after inserting 72: 72 84 List
after inserting 19: 19 72 84 List after inserting 61: 19 61 72 84 List after removing 19: 61 72 84
List after removing 84: 61 72
main.cpp
#include
#include
#include
#include "Node.h"
#include "SortedNumberList.h"
using namespace std; void PrintList(SortedNumberList& list); vector SpaceSplit(string source);
int main(int argc, char *argv[]) { // Read the line of input numbers string inputLine; getline(cin,
inputLine); // Split on space character vector terms = SpaceSplit(inputLine); // Insert each value
and show the sorted list's contents after each insertion SortedNumberList list; for (auto term :
terms) { double number = stod(term); cout << "List after inserting " << number << ": " << endl;
list.Insert(number); PrintList(list); } /* // Read the input line with numbers to remove getline(cin,
inputLi.
import java.util.Random;defines the Stock class public class S.pdf
import java.util.Random;
//defines the Stock class
public class Stock {
private String symbol;
private String name;
private double nextPrice;
private double currentPrice;
private double priceChange;
private double priceChangePercentage;
public Stock(String s, String n, double CP, double NP) {
symbol = s;
name = n;
nextPrice = NP;
currentPrice = CP;
}
public Stock() {
name = \"Microsoft\";
symbol = \"MSFT\";
nextPrice = 46.87;
currentPrice = 46.87;
}
public void setNextPrice(double nextPrice) {
if (nextPrice > 0)
this.nextPrice = nextPrice;
else
this.nextPrice = 0;
}
public void setCurrentPrice(double cPrice) {
if (currentPrice > 0) {
currentPrice = cPrice;
} else {
currentPrice = 0;
}
}
public double getCurrentPrice() {
return currentPrice;
}
public String getName() {
return name;
}
public void setName(String n) {
name = n;
}
public double getNextPrice() {
Random rand = new Random();
nextPrice = rand.nextDouble();
return nextPrice;
}
public String getSymbol() {
return symbol;
}
public void setSymbol(String s) {
symbol = s;
}
public double getChange() {
// formula : (current - next) / next * 100
priceChange = (currentPrice - nextPrice) / nextPrice * 100;
return priceChange;
}
public double SimulatePrice() {
Random rand = new Random();
priceChangePercentage = rand.nextInt(10) + 1;
if (priceChangePercentage % 2 == 0)
currentPrice += (currentPrice * (priceChangePercentage / 100.0));
else
currentPrice -= (currentPrice * (priceChangePercentage / 100.0));
return priceChangePercentage;
}
/*
* (non-Javadoc)
*
* @see java.lang.Object#toString()
*/
@Override
public String toString() {
return \"Stock [getCurrentPrice()=\" + getCurrentPrice() + \", getName()=\"
+ getName() + \", getNextPrice()=\" + getNextPrice()
+ \", getSymbol()=\" + getSymbol() + \", getChange()=\"
+ getChange() + \"]\";
}
}
import java.util.Scanner;
public class StockPriceSimulator {
public static void main(String[] args) {
Scanner input = new Scanner(System.in);
String symbol;
String name;
double nextPrice;
double currentPrice;
System.out.print(\"Please enter the name of the stock:\");
name = input.nextLine();
System.out.print(\"Please enter the symbol of the stock: \");
symbol = input.nextLine();
System.out.print(\"Please enter Current price of \" + name + \":\");
currentPrice = input.nextDouble();
System.out.print(\"Please enter next price of \" + name + \":\");
nextPrice = input.nextDouble();
Stock stock;
if (name.equals(\"NONE\") || symbol.equals(\"NA\") || currentPrice == 0.0
|| nextPrice == 0.0)
stock = new Stock();
else
stock = new Stock(symbol, name, currentPrice, nextPrice);
for (int i = 0; i < 30; i++) {
stock.SimulatePrice();
System.out.println(stock);
}
input.close();
}
}
OUTPUT:
Please enter the name of the stock:NONE
Please enter the symbol of the stock: DD
Please enter Current price of NONE:99
Please enter next price of NONE:98
Stock [getCurrentPrice()=51.556999999999995, getName()=Microsoft,
getNextPrice()=0.22684389480238243, getSymbol()=MSFT,
getChange()=22627.96455.
1 OverviewFor this lab, you will implement the insert method and t.pdf
1 Overview
For this lab, you will implement the insert method and toString method of
a PointList class. The main method creates a PointList object, then prompt
the user for pairs of x and y (integer) values in a continuous (innite) loop.
Each unique pair the user enters should be inserted into the correct position in
the list according to its distance from the origin (0; 0). By constructing the list
one point at a time, we have the opportunity to easily keep it sorted without
having to sort it separately later. This technique is similar to insertion sort. Be
sure to use the appropriate overloaded add method in the ArrayList class. If
the user enters a duplicate point, it should be ignored (think about how can you
tell if it\'s a duplicate). Whenever a new point is added to the list, the contents
of the list should be printed, along with the point\'s distance from the origin.
2 Sample Output
Enter x, y values (type 0 0 to exit): 2 3
(2, 3); distance to origin: 3.61
Enter x, y values (type 0 0 to exit): 4 2
(2, 3); distance to origin: 3.61
(4, 2); distance to origin: 4.47
Enter x, y values (type 0 0 to exit): 2 3
Enter x, y values (type 0 0 to exit): 1 2
(1, 2); distance to origin: 2.24
(2, 3); distance to origin: 3.61
(4, 2); distance to origin: 4.47
Enter x, y values (type 0 0 to exit): 0 0
-------------------------------------------------------------------------------------
import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;
public class ArrayList {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
PointList lst = new PointList();
while(true) {
System.out.print(\"Enter x, y values (type 0 0 to exit): \");
int x = in.nextInt();
int y = in.nextInt();
if (x == 0 && y == 0) {
break;
}
in.nextLine();
if(lst.insert(x, y)) {
System.out.println(lst);
}
}
in.close();
}
}
class PointList {
private List points = new ArrayList<>();
boolean insert(int x, int y) {
// TODO
}
@Override
public String toString() {
// TODO
}
}
class Point {
private int x, y;
private static Point zero = new Point(0, 0);
Point(int x, int y) {
this.x = x;
this.y = y;
}
double distance(Point that) {
return Math.sqrt(Math.pow(this.x - that.x, 2) + Math.pow(this.y - that.y, 2));
}
double distanceToOrigin() {
return distance(zero);
}
boolean equals(Point that) {
return this.x == that.x && this.y == that.y;
}
public String toString() { return String.format(\"(%d, %d)\", x, y); }
}
Solution
ArrayList1.java
import java.text.DecimalFormat;
import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;
public class ArrayList1 {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
PointList lst = new PointList();
while(true) {
System.out.print(\"Enter x, y values (type 0 0 to exit): \");
int x = in.nextInt();
int y = in.nextInt();
if (x == 0 && y == 0) {
break;
}
in.nextLine();
if(lst.insert(x, y)) {
System.out.println(lst);
}
}
in.close();
}
}
class PointList {
private List points = new ArrayList().
JAVA...With N.E.T_B.E.A.N.S___________________________________.pdf
JAVA...W\'i\'t\'h
N.E.T_B.E.A.N.S_______________________________________________________________
_____________________________________________________________________________
_____________________________________________________________________________
____________________________________________________
***********Product*********************
package rooster.nest;
import java.text.NumberFormat;
public class Product {
private long id;
private String code;
private String description;
private double price;
public long getId() {
return id;
}
public void setId(long id) {
this.id = id;
}
public String getCode() {
return code;
}
public void setCode(String code) {
this.code = code;
}
public String getDescription() {
return description;
}
public void setDescription(String name) {
this.description = name;
}
public double getPrice() {
return price;
}
public void setPrice(double price) {
this.price = price;
}
public String getPriceFormatted() {
NumberFormat currencyFormatter =
NumberFormat.getCurrencyInstance();
return currencyFormatter.format(getPrice());
}
}
********DBException************
package crows.foot;
/*
* This is just a wrapper class so we can throw a common exception for
* the UI to catch without tightly coupling the UI to the database layer.
*/
public class DBException extends Exception {
DBException() {}
DBException(Exception e) {
super(e);
}
}
*******DBUtil************
package crows.foot;
import java.sql.Connection;
import java.sql.DriverManager;
import java.sql.SQLException;
public class DBUtil {
private static Connection connection;
private DBUtil() {}
public static synchronized Connection getConnection() throws DBException {
if (connection != null) {
return connection;
}
else {
try {
// set the db url, username, and password
String url = \"jdbc:mysql://localhost:3306/mma\";
String username = \"mma_user\";
String password = \"sesame\";
// get and return connection
connection = DriverManager.getConnection(
url, username, password);
return connection;
} catch (SQLException e) {
throw new DBException(e);
}
}
}
public static synchronized void closeConnection() throws DBException {
if (connection != null) {
try {
connection.close();
} catch (SQLException e) {
throw new DBException(e);
} finally {
connection = null;
}
}
}
}
*************ProductDB**************
package crows.foot;
import java.sql.Connection;
import java.sql.PreparedStatement;
import java.sql.ResultSet;
import java.sql.SQLException;
import java.util.ArrayList;
import java.util.List;
import rooster.nest.Product;
public class ProductDB {
private static Product getProductFromRow(ResultSet rs) throws SQLException {
int productID = rs.getInt(1);
String code = rs.getString(2);
String description = rs.getString(3);
double price = rs.getDouble(4);
String note = rs.getString(5);
Product p = new Product();
p.setId(productID);
p.setCode(code);
p.setDescription(description);
p.setPrice(price);
return p;
}
public static List getAll() throws DBException {
String sql = \"SELECT * FROM Product.
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;
}
.
How would you define a community- The beginning of government's major.pdf
How would you define a community? The beginning of government's major involvement in
social issues, including health, was marked by: A) the Social Security Act of 1935. B) the
establishment of Medicare in 1965. C) U.S, involvement in World War II. D) the Hill-Burton
Act in 1946. Actions that society takes collectively to ensure that the conditions in which people
can be healthy can occur is termed: A) public health. B) community health. C) health. D)
population health. Twenty-first century community health concerns include: A) lifestyle
diseases. B) environmental problems. C) healthcare delivery. D) All of these are correct. What
was the goal of the Hill-Burton Act in 1946 ?.
How would you transform an organisation into a learning organisation u.pdf
How would you transform an organisation into a learning organisation used the 5 learning
disciplines, focus on activities or initiatives you can implement to facilitate the adoption of each
of the learning disciplines (10 mark) Marking guidelines for question two (2) 2 marks are
allocated for at least two activities/initiative suggested to be implemented to improve or adopt
each of the learning disciplines an organisation to make it a learning organisation..
More Related Content
Similar to How can I add multiple names and addresses- To the following code- Tab.pdf
mainpublic class AssignmentThree { public static void ma.pdf
// main
public class AssignmentThree
{
public static void main(String[] args)
{
List myList = new List(15);
// Cause List Empty Message
myList.removeFront();
myList.removeRear();
myList.removeItem(\"a\");
// Cause Not found message
myList.addToFront(\"x\");
myList.removeItem(\"y\");
myList.removeItem(\"x\");
myList.addAfterItem(\"x\", \"z\");
myList.addBeforeItem(\"x\", \"z\");
// Normal behavior
myList.addToFront(\"not.\");
myList.addToFront(\"or\");
myList.addToRear(\"is\");
myList.addToRear(\"try.\");
myList.addAfterItem(\"is\", \"no\");
myList.addBeforeItem(\"is\", \"There\");
myList.addToFront(\"Do\");
myList.addAfterItem(\"or\", \"do\");
myList.print(\"Original list\");
myList.printSorted(\"Sorted Original List\");
sop(\"\ Front is \" + myList.getFront());
sop(\"Rear is \" + myList.getRear());
sop(\"Count is \" + myList.askCount());
sop(\"Is There present? \" + myList.isPresent(\"There\"));
sop(\"Is Dog present? \" + myList.isPresent(\"Dog\"));
myList.addToFront(\"junk\");
myList.addToRear(\"morejunk\");
myList.addAfterItem(\"or\", \"moremorejunk\");
myList.print(\"List with junk\");
sop(\"Count is \" + myList.askCount());
myList.removeFront();
myList.removeRear();
myList.removeItem(\"moremorejunk\");
myList.print(\"List with junk removed\");
sop(\"Count is \" + myList.askCount());
sop(\"\");
// Cause List Full message
for(int ii = 0; ii < 10; ++ii)
{
myList.addToFront(DUMMY);
}
myList.addToRear(DUMMY);
myList.addBeforeItem(\"no\", DUMMY);
myList.addAfterItem(\"There\", DUMMY);
myList.print(\"After filling List\");
sop(\"Count is \" + myList.askCount());
while(myList.isPresent(DUMMY)) myList.removeItem(DUMMY);
myList.print(\"After removing \" + DUMMY );
sop(\"Count is \" + myList.askCount());
}
private static void sop(String s)
{
System.out.println(s);
}
private static final String DUMMY = \"dummy\";
}
Solution
Following is MyList implementation for your output as:
Java Code:
import java.util.Comparator;
public class MyList {
private Node start;
private Node end;
private int size;
private int capacity;
public MyList(int capacity) {
start = null;
end = null;
size = 0;
this.capacity = capacity;
}
/* Function to check if list is empty */
public boolean isEmpty() {
return start == null;
}
public void removeFront() {
if (isEmpty()) {
System.out.println(\"List Empty\");
return;
} else {
start = start.next;
size--;
return;
}
}
public void removeRear() {
if (size == 0) {
System.out.println(\"List Empty\");
return;
}
if (start.next == null) {
start=null;
end=null;
size=0;
}
Node node = start.next;
while (node.next != null) {
node = node.next;
}
node.next = null;
end = node;
size--;
}
public void removeItem(String key) {
if (size == 0) {
System.out.println(\"List Empty\");
return;
}
if (start.next == null) {
if (start.key.equals(key)) {
start=null;
end=null;
size=0;
} else {
System.out.println(\"\");
}
return;
}
Node node = start;
Node nodeNext = node.next;
while (nodeNext.next != null) {
if (nodeNext.key.equals(key)) {
node.next=nodeNext.next;
}.
can you add a delete button and a add button to the below program. j.pdf
can you add a delete button and a add button to the below program. java fx
package nusoft;
public class Car {
private String make;
private String model;
private int year;
private String color;
public Car(String make, int year, String model, String color) {
this.make = make;
this.model = model;
this.year = year;
this.color = color;
}
public String getMake() {
return make;
}
public void setMake(String make) {
this.make = make;
}
public String getModel() {
return model;
}
public void setModel(String model) {
this.model = model;
}
public int getYear() {
return year;
}
public void setYear(int year) {
this.year = year;
}
public String getColor() {
return color;
}
public void setColor(String color) {
this.color = color;
}
@Override
public String toString() {
return year + " " + make + " " + model + " (" + color + ")";
}
}
package nusoft;
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.util.ArrayList;
import javafx.application.Application;
import javafx.geometry.Pos;
import javafx.scene.Scene;
import javafx.scene.control.Button;
import javafx.scene.control.Label;
import javafx.scene.layout.BorderPane;
import javafx.scene.layout.VBox;
import javafx.stage.Stage;
public class CarNavigator extends Application {
private ArrayList cars = new ArrayList<>();
private int currentIndex = 0;
@Override
public void start(Stage primaryStage) throws Exception {
readCarsFile();
Label carLabel = new Label();
carLabel.setAlignment(Pos.CENTER);
updateCarLabel(carLabel);
Button prevButton = new Button("Previous");
prevButton.setOnAction(e -> {
currentIndex--;
if (currentIndex < 0) {
currentIndex = cars.size() - 1;
}
updateCarLabel(carLabel);
});
Button nextButton = new Button("Next");
nextButton.setOnAction(e -> {
currentIndex++;
if (currentIndex >= cars.size()) {
currentIndex = 0;
}
updateCarLabel(carLabel);
});
VBox buttonBox = new VBox(10, prevButton, nextButton);
buttonBox.setAlignment(Pos.CENTER);
BorderPane root = new BorderPane(carLabel, null, null, buttonBox, null);
Scene scene = new Scene(root, 400, 200);
primaryStage.setScene(scene);
primaryStage.show();
}
private void readCarsFile() throws IOException {
BufferedReader reader = new BufferedReader(new FileReader("cars.txt"));
String line;
while ((line = reader.readLine()) != null) {
cars.add(line);
}
reader.close();
}
private void updateCarLabel(Label label) {
label.setText(cars.get(currentIndex));
}
public static void main(String[] args) {
launch(args);
}
}
package nusoft.utils;
import java.util.NoSuchElementException;
import nusoft.Car;
public class NuLinkedList {
private Node head;
private Node tail;
private int size;
private static class Node {
E element;
Node prev;
Node next;
Node(E element, Node prev, Node next) {
this.element = element;
this.prev = prev;
this.next = next;
}
}
public boolean contains(E e) {
return indexOf(e) != -1;
}
public E get(int index) {
if (index < 0 || index >= size) {
throw new IndexOutOfBoundsException();
}
return getNode(index).el.
in this assignment you are asked to write a simple driver program an.pdf
in this assignment you are asked to write a simple driver program and set of functions (maybein
a library) that can be performed on a binary search tree.
Your program should allow user to insert/delete integer values into the binary search tree along
with several other operations on the binary search tree. You can use the code given in slides. But
this time your key will be int! Specifically, your program will ask user to enter a command and
related parameters (if any) in a loop, and then perform the given commands. Here is the list of
commands that your program must implement:
* insert
*find\'
*delete
*list inorder
*list preorder
*list postorder
*list levelorder
* max
* min
* height
*count
* sum
*quit
As always, make sure you release (free) the dynamically allocated memories if you allocate any
memory in your programs. So, before submitting your program, run it with valgrind to see if
there is any memory leakage
//my proggram in C
struct tree_node {
int data;
struct tree_node *left, *right;
}
typedef struct nodeT {
int key;
struct nodeT *left, *right;
} nodeT, *treeT;
int main(){
while (TRUE) {
printf(\"> \");
line = GetLine();
ch = toupper(line[0]);
switch (ch) {
case \'I\': insert(); break;
case \'F\': find(); break;
case \'D\': delete(); break;
case \'LI\': listInorder; break;
case \'LPR\': listPreorder(); break;
case \'LPO\': listPostorder(); break;
case \'MAX\': max(); break;
case \'min\': min(); break;
case \'H\': height(); break;
case \'C\': count(); break;
case \'S\': sum(); break;
case \'Q\': exit(0);
default:printf(\"Illegal command\ \"); break;
}
}
}
nodeT *FindNode(nodeT *t, int key){
while(t !=NULL) {
if (key == t->key) return t;
if (key < t->key) {
t = t->left;
} else {
t = t->right;
}
return NULL;
}
void delete(nodeT **p){
nodeT
*target;
target=*p;
if (target->left==NULL && target->right==NULL) {
*p=NULL;
} else if (target->left == NULL) {
*p=target->right;
} else
if (target->right == NULL) {
*p=target->left;
} else {
/* target has two children, see next slide */
}
free(target);
}
void listInorder(nodeT *T){
if (t != NULL) {
DisplayTree(t->left);
printf(“%d “, t->key);
DisplayTree(t->right);
}
}
void listPreorder(nodeT *t) {
if (t != NULL) {
printf(“%d “, t->key);
DisplayTree(t->left);
DisplayTree(t->right);
}
}
void listPostOrder(nodeT *t){
if (t != NULL) {
DisplayTree(t->left);
DisplayTree(t->right);
printf(“%d “, t->key);
}
}
void intsert(nodeT **tptr, int key){
nodeT*t, *tmp;
t=*tptr;
if (t == NULL) {
tmp=New(nodeT*);
tmp->key = key;
tmp->left=tmp->right=NULL;
*tptr=tmp;
return;
}
if (key < t->key) {
InsertNode
(&t->left, key);
} else {
InsertNode(&t->right, key);
}
}
int height(nodeT *t){
if (t == NULL)
return 0;
else
return (1 + maximumof(
height(t->left),
height(t->right)) );
}
int sum(struct tree_node *p){
if (p == NULL)
return 0;
else
return (p->data +
sum(p->left) +
sum(p->right) );
}
Solution
1. /*
2. * Java Program to Implement Binary Search Tree
3. */
4.
5. import java.util.Scanner;
6.
7. /* Class BSTNode */
8. cl.
Javai have to make a method that takes a linked list and then retu.pdf
Java
i have to make a method that takes a linked list and then returns a new linked list that is the
reverse of the original
this is the starting code
/**
* LinkedList lab.
* @author Emma Cheney
* @version 10/2/23
*/
public class LinkedList {
/**
* Internal Node class used for the linked list.
*/
public class Node {
String key;
int value;
Node next;
/**
* Node Constructor.
* @param key The Key
* @param value The Value
*/
public Node(String key, int value) {
this.key = key;
this.value = value;
}
}
private Node head;
private Node tail;
/**
* The default constructor.
*/
public LinkedList() {
head = null;
tail = null;
}
/**
* Add the key, value pair to the head of the linkedlist.
* @param key The Key
* @param val The Value
*
*/
public void addHead(String key, int val) {
Node n = new Node(key, val);
if (head == null) {
head = n;
tail = n;
} else {
n.next = head;
head = n;
}
}
/**
* Add the key, val pair to the tail of the linkedlist.
* @param key The Key
* @param val The Value
*/
public void addTail(String key, int val) {
Node n = new Node(key, val);
if (tail == null) {
head = n;
tail = n;
} else {
tail.next = n;
tail = n;
}
}
/**
* Returns the String format of the linkedlist.
* @return String The String format.
*/
public String toString() {
String ret = "";
Node curr = head;
while (curr != null) {
if (curr.next != null) {
ret += curr.key + ":" + curr.value + ", ";
} else {
ret += curr.key + ":" + curr.value;
}
curr = curr.next;
}
return ret;
}
/**
* Locate the Node in the linkedlist with the given key.
* @param key The key to find in the LinkedList
* @return Node Returns the Node with the given key or null if non-existent.
*/
private Node find(String key) {
Node curr = head;
while (curr != null) {
if (curr.key.equals(key)) {
return curr;
}
curr = curr.next;
}
return null;
} A static method called reversed that takes a LinkedList as a parameter and returns a new
LinkedList that is reversed. f; traverse through the input list (starting at the head). In order to
reverse the ordering, you need to add the current node's key and value onto the head of the new
list (addHead method). Do not change the input list or any values in it. Example (result in red)
//assumelistcontainsthesekeysandvalues://ie:6,bi:48,bi:73,bi:63LinkedList.reversed(list);bi:63,bi:
73,bi:48,ie:6.
Here is the editable codeSolutionimport java.util.NoSuchEleme.pdf
Here is the editable code:
Solution
import java.util.NoSuchElementException;
public class DoublyLinkedListImpl {
private Node head;
private Node tail;
private int size;
public DoublyLinkedListImpl() {
size = 0;
}
private class Node {
E element;
Node next;
Node prev;
public Node(E element, Node next, Node prev) {
this.element = element;
this.next = next;
this.prev = prev;
}
}
public int size() { return size; }
public boolean isEmpty() { return size == 0; }
public void addFirst(E element) {
Node tmp = new Node(element, head, null);
if(head != null ) {head.prev = tmp;}
head = tmp;
if(tail == null) { tail = tmp;}
size++;
System.out.println(\"adding: \"+element);
}
/**
* adds element at the end of the linked list
* @param element
*/
public void addLast(E element) {
Node tmp = new Node(element, null, tail);
if(tail != null) {tail.next = tmp;}
tail = tmp;
if(head == null) { head = tmp;}
size++;
System.out.println(\"adding: \"+element);
}
public void iterateForward(){
System.out.println(\"iterating forward..\");
Node tmp = head;
while(tmp != null){
System.out.println(tmp.element);
tmp = tmp.next;
}
}
/**
* this method walks backward through the linked list
*/
public void iterateBackward(){
System.out.println(\"iterating backword..\");
Node tmp = tail;
while(tmp != null){
System.out.println(tmp.element);
tmp = tmp.prev;
}
}
public E removeFirst() {
if (size == 0) throw new NoSuchElementException();
Node tmp = head;
head = head.next;
head.prev = null;
size--;
System.out.println(\"deleted: \"+tmp.element);
return tmp.element;
}
public E removeLast() {
if (size == 0) throw new NoSuchElementException();
Node tmp = tail;
tail = tail.prev;
tail.next = null;
size--;
System.out.println(\"deleted: \"+tmp.element);
return tmp.element;
}
public static void main(String a[]){
DoublyLinkedListImpl dll = new DoublyLinkedListImpl();
dll.addFirst(10);
dll.addFirst(34);
dll.addLast(56);
dll.addLast(364);
dll.iterateForward();
dll.removeFirst();
dll.removeLast();
dll.iterateBackward();
}
}
import java.util.Scanner;
/* Class Node */
class Node
{
protected int data;
protected Node next, prev;
/* Constructor */
public Node()
{
next = null;
prev = null;
data = 0;
}
/* Constructor */
public Node(int d, Node n, Node p)
{
data = d;
next = n;
prev = p;
}
/* Function to set link to next node */
public void setLinkNext(Node n)
{
next = n;
}
/* Function to set link to previous node */
public void setLinkPrev(Node p)
{
prev = p;
}
/* Funtion to get link to next node */
public Node getLinkNext()
{
return next;
}
/* Function to get link to previous node */
public Node getLinkPrev()
{
return prev;
}
/* Function to set data to node */
public void setData(int d)
{
data = d;
}
/* Function to get data from node */
public int getData()
{
return data;
}
}
/* Class linkedList */
class linkedList
{
protected Node start;
protected Node end ;
public int size;
/* Constructor */
public linkedList()
{
start = null;
end = null;
size = 0;
}
/* Function to check if list is empty */
public boolean isE.
Sorted number list implementation with linked listsStep 1 Inspec.pdf
Sorted number list implementation with linked lists
Step 1: Inspect the Node.java file
Inspect the class declaration for a doubly-linked list node in Node.java. Access Node.java by
clicking on the orange arrow next to LabProgram.java at the top of the coding window. The
Node class has three fields:
a double data value,
a reference to the next node, and
a reference to the previous node.
Each field is protected. So code outside of the class must use the provided getter and setter
methods to get or set a field.
Node.java is read only, since no changes are required.
Step 2: Implement the insert() method
A class for a sorted, doubly-linked list is declared in SortedNumberList.java. Implement the
SortedNumberList class's insert() method. The method must create a new node with the
parameter value, then insert the node into the proper sorted position in the linked list. Ex:
Suppose a SortedNumberList's current list is 23 47.25 86, then insert(33.5) is called. A new
node with data value 33.5 is created and inserted between 23 and 47.25, thus preserving the list's
sorted order and yielding: 23 35.5 47.25 86
Step 3: Test in develop mode
Code in main() takes a space-separated list of numbers and inserts each into a SortedNumberList.
The list is displayed after each insertion. Ex: If input is
then output is:
Try various program inputs, ensuring that each outputs a sorted list.
Step 4: Implement the remove() method
Implement the SortedNumberList class's remove() method. The method takes a parameter for the
number to be removed from the list. If the number does not exist in the list, the list is not
changed and false is returned. Otherwise, the first instance of the number is removed from the
list and true is returned.
Uncomment the commented-out part in main() that reads a second input line and removes
numbers from the list. Test in develop mode to ensure that insertion and removal both work
properly, then submit code for grading. Ex: If input is
then output is:
Given templates:
LabProgram.java
import java.util.Scanner;
import java.io.PrintWriter;
public class LabProgram {
// Prints the SortedNumberList's contents, in order from head to tail
public static void printList(SortedNumberList list) {
Node node = list.head;
while (null != node) {
System.out.print(node.getData() + " ");
node = node.getNext();
}
System.out.println();
}
public static void main(String[] args) {
Scanner scnr = new Scanner(System.in);
String inputLine;
// Read the line of input numbers
inputLine = scnr.nextLine();
// Split on space character
String[] terms = inputLine.split(" ");
// Insert each value and show the sorted list's contents after each insertion
SortedNumberList list = new SortedNumberList();
for (Object term : terms) {
double number = Double.parseDouble(term.toString());
System.out.println("List after inserting " + number + ": ");
list.insert(number);
printList(list);
}
/*
// Read the input line with numbers to remove
inputLine = scnr.nextLine();
terms = inputLine.split(" ".
Given the following codepackage data1;import java.util.;p.pdf
Given the following code
package data1;
import java.util.*;
/*public class BST> implementing a set ADT and containing the following:
* private inner class BinaryNode representing a node with a (possibly) left child and a (possibly)
right child
** instance fields BinaryNode root, int size
* contains/insert/remove method - w/ O(height) complexity
** size O(1), isEmpty O(1), clear O(1),
*** findMin, findMax, findHeight methods - w/ O(height) complexity
**** toString() method printing set (in-order traversal) and the tree (BFS traversal)
**
*/
publicclass BST> {
private BinaryNode root;
privateint size;
//Search opertion of Set ADT
publicboolean contains(E value) {
return contains(root, value);
}
//Insert opertion of Set ADT
publicvoid insert(E value) {
root = insert(root, value);
size++;
}
//Remove operation of Set ADT
publicvoid remove(E value){
root = remove(root, value);
size--;
}
publicint size(){
return size;
}
publicboolean isEmpty(){
return root == null;
}
publicvoid clear(){
root = null;
size = 0;
}
public E findMin(){
return findMin(root);
}
public E findMax(){
return findMax(root);
}
publicint findHeight(){
return root.height();
}
public String toString(){
if(root == null)
return "set {} stored in an empty tree.\n";
String elements = root.inOrder().toString();
return "set {" + elements.substring(1,elements.length()-1) + "} stored in tree \n" + root;
}
private E findMin(BinaryNode node){
if(node == null)
returnnull;
if(node.left == null)
return node.element;
return findMin(node.left);
}
private E findMax(BinaryNode node){
if(node == null)
returnnull;
if(node.right == null)
return node.element;
return findMax(node.right);
}
privateboolean contains(BinaryNode node, E value) {
if (node == null)//node represents an empty substree
returnfalse;
int comparisonResult = value.compareTo(node.element);
if(comparisonResult < 0)//if value is less than root's value
return contains(node.left, value);
if(comparisonResult > 0)//if value is greater than root's value
return contains(node.right, value);
returntrue;//successful search
}
private BinaryNode insert(BinaryNode node, E value) {
if (node == null)//base case: empty tree
returnnew BinaryNode<>(value);
if (value.compareTo(node.element) < 0)
node.left = insert(node.left, value);//insert recursively to left-subtree
elseif (value.compareTo(node.element) > 0)
node.right = insert(node.right, value);//insert recursively to right-subtree
else {//duplicate value cannot be inserted in a BST implementing the Set ADT
size--;//insertion failed!
//System.out.print("BST.insert: Warning: " + value + " is already stored in the tree \n" + node);
}
return node;
}
private BinaryNode remove(BinaryNode node, E value) {
if (node == null) {//base case: empty tree
System.out.println("BST.remove: Warning: " + value + " doesn't exist in the tree.");
size++;//removal failed!
return node;
}
if (value.compareTo(node.element) < 0)
node.left = remove(node.left, value);
elseif (value.compareTo(node.element) > 0)
node.right = remov.
import java.util.Scanner;class BinaryNode{ BinaryNode left.pdf
import java.util.Scanner;
class BinaryNode
{
BinaryNode left, right;
int data;
public BinaryNode()
{
left = null;
right = null;
data = 0;
}
public BinaryNode(int n)
{
left = null;
right = null;
data = n;
}
public void setLeft(BinaryNode n)
{
left = n;
}
public void setRight(BinaryNode n)
{
right = n;
}
public BinaryNode getLeft()
{
return left;
}
public BinaryNode getRight()
{
return right;
}
public void setData(int d)
{
data = d;
}
public int getData()
{
return data;
}
}
class Binary
{
private BinaryNode root;
public Binary()
{
root = null;
}
public boolean isEmpty()
{
return root == null;
}
public void insert(int data)
{
root = insert(root, data);
}
private BinaryNode insert(BinaryNode node, int data)
{
if (node == null)
node = new BinaryNode(data);
else
{
if (data <= node.getData())
node.left = insert(node.left, data);
else
node.right = insert(node.right, data);
}
return node;
}
public void delete(int k)
{
if (isEmpty())
System.out.println(\"Tree Empty\");
else if (search(k) == false)
System.out.println(\"Sorry \"+ k +\" is not present\");
else
{
root = delete(root, k);
System.out.println(k+ \" deleted from the tree\");
}
}
private BinaryNode delete(BinaryNode root, int k)
{
BinaryNode p, p2, n;
if (root.getData() == k)
{
BinaryNode lt, rt;
lt = root.getLeft();
rt = root.getRight();
if (lt == null && rt == null)
return null;
else if (lt == null)
{
p = rt;
return p;
}
else if (rt == null)
{
p = lt;
return p;
}
else
{
p2 = rt;
p = rt;
while (p.getLeft() != null)
p = p.getLeft();
p.setLeft(lt);
return p2;
}
}
if (k < root.getData())
{
n = delete(root.getLeft(), k);
root.setLeft(n);
}
else
{
n = delete(root.getRight(), k);
root.setRight(n);
}
return root;
}
public boolean search(int val)
{
return search(root, val);
}
private boolean search(BinaryNode r, int val)
{
boolean found = false;
while ((r != null) && !found)
{
int rval = r.getData();
if (val < rval)
r = r.getLeft();
else if (val > rval)
r = r.getRight();
else
{
found = true;
break;
}
found = search(r, val);
}
return found;
}
public void inorder()
{
inorder(root);
}
private void inorder(BinaryNode r)
{
if (r != null)
{
inorder(r.getLeft());
System.out.print(r.getData() +\" \");
inorder(r.getRight());
}
}
public void preorder()
{
preorder(root);
}
private void preorder(BinaryNode r)
{
if (r != null)
{
System.out.print(r.getData() +\" \");
preorder(r.getLeft());
preorder(r.getRight());
}
}
public void postorder()
{
postorder(root);
}
private void postorder(BinaryNode r)
{
if (r != null)
{
postorder(r.getLeft());
postorder(r.getRight());
System.out.print(r.getData() +\" \");
}
}
}
public class BinarySearchTree
{
public static void main(String[] args)
{
Scanner scan = new Scanner(System.in);
Binary Binary = new Binary();
System.out.println(\"Binary Search Tree Test\ \");
char ch;
do
{
System.out.println(\"\ Binary Search Tree Operations\ \");
System.out.println(\"1. insert \");
System.out.println(\"2. delete\");
System.out.println(\"3. search\");
System.out.println(\"4. check empty\");
int .
This is to test a balanced tree. I need help testing an unbalanced t.pdf
this is business analytics question. (using gurobi) The days-off scheduling problem must be
solved routinely by businesses that operate 6 or 7 days a week. Examples include hospitals,
airlines, municipal transportation companies, and the postal service. The most common example
is the (5,7)-cyclic staffing problem. The objective of it is to minimize the cost of assigning
workers to a 7-day cyclic schedule so that 1) Sufficient workers are available every day. 2) Each
person works 5 consecutive days and is idle to the remaining 2 days. Here is the table showing
the cost of having an employee for each day and the number of employees required for each day.
For example, the pattern that one works from Sunday to Thursday costs 90+604=330. Formulate
and solve an integer programming problem to represent this problem. How many employees
work Monday-Friday?.
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.
6. Generics. Collections. Streams
6.1 Generics
6.2 Коллекции
6.3 Функциональные интерфейсы
6.4 Stream API
tested on eclipseDoublyLinkedList class.pdf
//tested on eclipse
/*************DoublyLinkedList class*******************/
public class DoublyLinkedList {
/*Data member variable declaration*/
private Node head;
private int count;
/**default constructor*/
public DoublyLinkedList() {
/*Initializing variable*/
head=null;
count =0;
}
/*Insert at beginning in doubly linked list*/
public void insertBeginning(String name){
/*checking head is null then we will add node at head*/
if(head==null){
head=new Node(name, null, null);
count++;
}else{
/*else create temp node and setting next to head
* and then making temp to head*/
Node temp=new Node(name,null,null);
temp.setNext(head);
head.setPrev(temp);
head=temp;
count++;
}
}
public void printList(){
Node temp=head;
/*Printing element of doubly list*/
while(temp!=null){
System.out.println(temp.getData());
temp=temp.getNext();
}
}
/*Returning count from doubly linked list*/
public int count(){
return count;
}
/*deleting specific node from doubly linked list*/
public void delete(String name){
Node current=head,previous=head;
/*if it is head node to be deleted*/
if(head.getData().equals(name)){
current=head.getNext();
current.setPrev(null);
head=current;
previous=head;
}else{
/*If node in middle of list*/
while(current.getNext()!=null){
if(current.getData().equals(name)){
current.getNext().setPrev(previous);
previous.setNext(current.getNext());
count--;
break;
}
previous=current;
current=current.getNext();
}
/*If node is at last*/
if(current.getNext()==null){
if(current.getData().equals(name)){
previous.setNext(null);
count--;
}
}
}
}
/*deleting all nodes from list by assigning head to null
* and memory releasing take care by garbage collector*/
public void clear(){
head=null;
count=0;
}
/*Inserting element in alphabetic order*/
public void insertAlpha(String name){
Node current=head,previous=head;
/*creating new node*/
Node newNode=new Node(name,null,null);
/*if head node is null*/
if(head==null){
head=newNode;
count++;
}else{
/*please read about compareTo() method about returning value*/
if(head.getData().compareTo(name)>0){
newNode.setNext(head);
head=newNode;
count++;
}else{
/*condition for getting position of node to be inserted*/
while(current!=null&¤t.getData().compareTo(name)<=0){
previous=current;
current=current.getNext();
}
/*if node need to be inserted at last*/
if(current==null){
previous=newNode;
}else{
/*If node need to inserted in middle*/
newNode.setNext(current);
previous.setNext(newNode);
current.setPrev(newNode);
newNode.setPrev(previous);
}
count++;
}
}
}
/*Main method start*/
public static void main(String args[]){
/*creating object of doubly linked list*/
DoublyLinkedList doublyLinkedList=new DoublyLinkedList();
doublyLinkedList.insertBeginning(\"sunita\");
doublyLinkedList.insertBeginning(\"lalchand\");
/*calling alphabetic order method*/
doublyLinkedList.insertAlpha(\"ramsingh\");
doublyLinkedList.insertBeginning(\"Lokesh\");
doublyLinkedList.insertBeginning(\"Pritam\");
/*****printing list********/
doublyLinkedList.printL.
I dont know what is wrong with this roulette program I cant seem.pdf
I don\'t know what is wrong with this roulette program I can\'t seem to get it to run.
Game Class:
public class Game {
public static void main(String[] args) {
Table table = new Table();
BinBuilder bb = new BinBuilder();
Outcome black = new Outcome(\"Black\", 35);
Bet bet = new Bet(10, black);
table.placeBet(bet);
Bin bin = bb.wheel.get(8);
System.out.println(bin.toString());
System.out.println(table.bets.toString());
System.out.println(black.toString());
ListIterator i = table.bets.listIterator();
Iterator b = bin.outcomes.iterator();
while(i.hasNext()) {
System.out.println(i.next().outcome.name.toString());
while(b.hasNext()){
System.out.println(b.next().name.toString());
if(i.next().outcome.equals(b.next())){
System.out.println(\"Win!\");
}
else{
System.out.println(\"Win :/\");
}
}
}
}
}
Player Class
public class Player {
public Table table;
public Outcome black;
public Bet bet;
public Player(Table table) {
table = new Table();
black = new Outcome(\"Black\", 1);
}
void placeBets() {
Bet bet = new Bet(100, black);
table.placeBet(bet);
}
void win(Bet bet) {
System.out.println(\"You\'ve won: \" + bet.winAmount());
}
void lose(Bet bet) {
System.out.println(\"You lost!\" + bet.loseAmount() + \":/\");
}
}
Outcome class
public class Outcome implements Comparable {
public String name;
public int odds;
public Outcome(String name, int odds){
this.name = name;
this.odds = odds;
}
public int winAmount(int amount){
return amount*this.odds;
}
public boolean equals(Outcome other){
return (this.name.equals(other.name));
}
public String toString() {
Object[] values= { name, new Integer(odds) };
String msgTempl= \"{0} ({1}:1)\";
return MessageFormat.format( msgTempl, values );
}
@Override
public int compareTo(E arg0) {
if(this.equals(arg0)){
return 0;
}
return 1;
}
}
Table Class
public class Table {
public int limit = 1000;
public LinkedList bets;
public Table() {
bets = new LinkedList();
}
public boolean isValid(Bet bet) {
int sum = 0;
for(Bet bett: bets) {
sum += bett.amountBet;
}
return (sum>limit);
}
public void placeBet(Bet bet) {
bets.add(bet);
}
ListIterator iterator() {
return bets.listIterator();
}
}
Wheel Class
public class Wheel extends TreeSet {
Vector bins;
NonRandom rng;
Set all_outcomes;
Wheel(NonRandom rng){
this.rng = rng;
rng = new NonRandom();
all_outcomes = new TreeSet();
bins = new Vector(38);
for (int i=0; i<38; i++){
bins.add(i, new Bin());
}
}
Bin next(){
int rand = rng.next(38);
return bins.elementAt(rand);
}
Bin get(int bin){
return bins.elementAt(bin);
}
public Outcome getOutcome( String name ){
TreeSet result= new TreeSet();
for( Iterator i = all_outcomes.iterator(); i.hasNext(); ) {
Outcome oc= i.next();
if( oc.name.contains(name) ) {result.add( oc );}
}
return result.first();
}
public void addOutcome(int bin, Outcome outcome) {
all_outcomes.add(outcome);
this.bins.elementAt(bin).add(outcome);
}
}
Bet Class
public class Bet {
public int amountBet;
public Outcome outcome;
public Bet(int amount, Outcome outcome) {
this.outcome = o.
PLEASE MAKE SURE THE PROGRAM IS ASKING FOR INPUT FROM USER TO ADD OR.pdf
PLEASE MAKE SURE THE PROGRAM IS ASKING FOR INPUT FROM USER TO ADD
OR REMOVE NAME. DO NOT HARD CODE NAME. AGAIN MAKE SURE THE
PROGRAM IS ASKING FOR INPUT FROM USER TO ADD OR REMOVE NAME. PLEASE
MAKE SURE THE CODE RUNS WITHOUT ANY ERRORS.
Write a class that maintains the scores for a game application. Implement the addition and
removal function to update the database. The gamescore.txt contains player’ name and score data
record fields separated by comma. For Removal function, uses the name field to select record to
remove the game score record.
Use the List.java, LList.java, Dlink.java, GameEntry.java and gamescore.txt found below
Read gamescore.txt to initialize the Linked list in sorted order by score.
Ask the user to add or remove users to update the sorted linked list.
Display “Name exist” when add an exist name to the list.
Display “Name does not exist” when remove a name not on the list.
List.java File:
/** Source code example for \"A Practical Introduction to Data
Structures and Algorithm Analysis, 3rd Edition (Java)\"
by Clifford A. Shaffer
Copyright 2008-2011 by Clifford A. Shaffer
*/
/** List ADT */
public interface List
{
/**
* Remove all contents from the list, so it is once again empty. Client is
* responsible for reclaiming storage used by the list elements.
*/
public void clear();
/**
* Insert an element at the current location. The client must ensure that
* the list\'s capacity is not exceeded.
*
* @param item
* The element to be inserted.
*/
public void insert(E item);
/**
* Append an element at the end of the list. The client must ensure that
* the list\'s capacity is not exceeded.
*
* @param item
* The element to be appended.
*/
public void append(E item);
/**
* Remove and return the current element.
*
* @return The element that was removed.
*/
public E remove();
/** Set the current position to the start of the list */
public void moveToStart();
/** Set the current position to the end of the list */
public void moveToEnd();
/**
* Move the current position one step left. No change if already at
* beginning.
*/
public void prev();
/**
* Move the current position one step right. No change if already at end.
*/
public void next();
/** @return The number of elements in the list. */
public int length();
/** @return The position of the current element. */
public int currPos();
/**
* Set current position.
*
* @param pos
* The position to make current.
*/
public void moveToPos(int pos);
/** @return The current element. */
public E getValue();
}
LList.java File:
/**
* Source code example for \"A Practical Introduction to Data Structures and
* Algorithm Analysis, 3rd Edition (Java)\" by Clifford A. Shaffer Copyright
* 2008-2011 by Clifford A. Shaffer
*/
// Doubly linked list implementation
class LList implements List
{
private DLink head; // Pointer to list header
private DLink tail; // Pointer to last element in list
protected DLink curr; // Pointer ahead of current element
int cnt; // Size of list
// Constructors
LList(int size)
{
th.
Inspect the class declaration for a doubly-linked list node in Node-h-.pdf
Inspect the class declaration for a doubly-linked list node in Node.h. Access Node.h by clicking
on the orange arrow next to main.cpp at the top of the coding window. The Node class has three
member variables: a double data value, a pointer to the next node, and a pointer to the previous
node. Each member variable is protected. So code outside of the class must use the provided
getter and setter member functions to get or set a member variable. Node.h is read only, since no
changes are required. Step 2: Implement the Insert() member function A class for a sorted,
doubly-linked list is declared in SortedNumberList.h. Implement the SortedNumberList class's
Insert() member function. The function must create a new node with the parameter value, then
insert the node into the proper sorted position in the linked list. Ex: Suppose a
SortedNumberList's current list is 23 47.25 86, then Insert(33.5) is called. A new node with data
value 33.5 is created and inserted between 23 and 47.25, thus preserving the list's sorted order
and yielding: 23 35.5 47.25 86 Step 3: Test in develop mode Code in main() takes a space-
separated list of numbers and inserts each into a SortedNumberList. The list is displayed after
each insertion. Ex: If input is 77 15 -42 63.5 then output is: List after inserting 77: 77 List after
inserting 15: 15 77 List after inserting -42: -42 15 77 List after inserting 63.5: -42 15 63.5 77 Try
various program inputs, ensuring that each outputs a sorted list. Step 4: Implement the Remove()
member function Implement the SortedNumberList class's Remove() member function. The
function takes a parameter for the number to be removed from the list. If the number does not
exist in the list, the list is not changed and false is returned. Otherwise, the first instance of the
number is removed from the list and true is returned. Uncomment the commented-out part in
main() that reads a second input line and removes numbers from the list. Test in develop mode to
ensure that insertion and removal both work properly, then submit code for grading. Ex: If input
is 84 72 19 61 19 84 then output is: List after inserting 84: 84 List after inserting 72: 72 84 List
after inserting 19: 19 72 84 List after inserting 61: 19 61 72 84 List after removing 19: 61 72 84
List after removing 84: 61 72
main.cpp
#include
#include
#include
#include "Node.h"
#include "SortedNumberList.h"
using namespace std; void PrintList(SortedNumberList& list); vector SpaceSplit(string source);
int main(int argc, char *argv[]) { // Read the line of input numbers string inputLine; getline(cin,
inputLine); // Split on space character vector terms = SpaceSplit(inputLine); // Insert each value
and show the sorted list's contents after each insertion SortedNumberList list; for (auto term :
terms) { double number = stod(term); cout << "List after inserting " << number << ": " << endl;
list.Insert(number); PrintList(list); } /* // Read the input line with numbers to remove getline(cin,
inputLi.
import java.util.Random;defines the Stock class public class S.pdf
import java.util.Random;
//defines the Stock class
public class Stock {
private String symbol;
private String name;
private double nextPrice;
private double currentPrice;
private double priceChange;
private double priceChangePercentage;
public Stock(String s, String n, double CP, double NP) {
symbol = s;
name = n;
nextPrice = NP;
currentPrice = CP;
}
public Stock() {
name = \"Microsoft\";
symbol = \"MSFT\";
nextPrice = 46.87;
currentPrice = 46.87;
}
public void setNextPrice(double nextPrice) {
if (nextPrice > 0)
this.nextPrice = nextPrice;
else
this.nextPrice = 0;
}
public void setCurrentPrice(double cPrice) {
if (currentPrice > 0) {
currentPrice = cPrice;
} else {
currentPrice = 0;
}
}
public double getCurrentPrice() {
return currentPrice;
}
public String getName() {
return name;
}
public void setName(String n) {
name = n;
}
public double getNextPrice() {
Random rand = new Random();
nextPrice = rand.nextDouble();
return nextPrice;
}
public String getSymbol() {
return symbol;
}
public void setSymbol(String s) {
symbol = s;
}
public double getChange() {
// formula : (current - next) / next * 100
priceChange = (currentPrice - nextPrice) / nextPrice * 100;
return priceChange;
}
public double SimulatePrice() {
Random rand = new Random();
priceChangePercentage = rand.nextInt(10) + 1;
if (priceChangePercentage % 2 == 0)
currentPrice += (currentPrice * (priceChangePercentage / 100.0));
else
currentPrice -= (currentPrice * (priceChangePercentage / 100.0));
return priceChangePercentage;
}
/*
* (non-Javadoc)
*
* @see java.lang.Object#toString()
*/
@Override
public String toString() {
return \"Stock [getCurrentPrice()=\" + getCurrentPrice() + \", getName()=\"
+ getName() + \", getNextPrice()=\" + getNextPrice()
+ \", getSymbol()=\" + getSymbol() + \", getChange()=\"
+ getChange() + \"]\";
}
}
import java.util.Scanner;
public class StockPriceSimulator {
public static void main(String[] args) {
Scanner input = new Scanner(System.in);
String symbol;
String name;
double nextPrice;
double currentPrice;
System.out.print(\"Please enter the name of the stock:\");
name = input.nextLine();
System.out.print(\"Please enter the symbol of the stock: \");
symbol = input.nextLine();
System.out.print(\"Please enter Current price of \" + name + \":\");
currentPrice = input.nextDouble();
System.out.print(\"Please enter next price of \" + name + \":\");
nextPrice = input.nextDouble();
Stock stock;
if (name.equals(\"NONE\") || symbol.equals(\"NA\") || currentPrice == 0.0
|| nextPrice == 0.0)
stock = new Stock();
else
stock = new Stock(symbol, name, currentPrice, nextPrice);
for (int i = 0; i < 30; i++) {
stock.SimulatePrice();
System.out.println(stock);
}
input.close();
}
}
OUTPUT:
Please enter the name of the stock:NONE
Please enter the symbol of the stock: DD
Please enter Current price of NONE:99
Please enter next price of NONE:98
Stock [getCurrentPrice()=51.556999999999995, getName()=Microsoft,
getNextPrice()=0.22684389480238243, getSymbol()=MSFT,
getChange()=22627.96455.
1 OverviewFor this lab, you will implement the insert method and t.pdf
1 Overview
For this lab, you will implement the insert method and toString method of
a PointList class. The main method creates a PointList object, then prompt
the user for pairs of x and y (integer) values in a continuous (innite) loop.
Each unique pair the user enters should be inserted into the correct position in
the list according to its distance from the origin (0; 0). By constructing the list
one point at a time, we have the opportunity to easily keep it sorted without
having to sort it separately later. This technique is similar to insertion sort. Be
sure to use the appropriate overloaded add method in the ArrayList class. If
the user enters a duplicate point, it should be ignored (think about how can you
tell if it\'s a duplicate). Whenever a new point is added to the list, the contents
of the list should be printed, along with the point\'s distance from the origin.
2 Sample Output
Enter x, y values (type 0 0 to exit): 2 3
(2, 3); distance to origin: 3.61
Enter x, y values (type 0 0 to exit): 4 2
(2, 3); distance to origin: 3.61
(4, 2); distance to origin: 4.47
Enter x, y values (type 0 0 to exit): 2 3
Enter x, y values (type 0 0 to exit): 1 2
(1, 2); distance to origin: 2.24
(2, 3); distance to origin: 3.61
(4, 2); distance to origin: 4.47
Enter x, y values (type 0 0 to exit): 0 0
-------------------------------------------------------------------------------------
import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;
public class ArrayList {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
PointList lst = new PointList();
while(true) {
System.out.print(\"Enter x, y values (type 0 0 to exit): \");
int x = in.nextInt();
int y = in.nextInt();
if (x == 0 && y == 0) {
break;
}
in.nextLine();
if(lst.insert(x, y)) {
System.out.println(lst);
}
}
in.close();
}
}
class PointList {
private List points = new ArrayList<>();
boolean insert(int x, int y) {
// TODO
}
@Override
public String toString() {
// TODO
}
}
class Point {
private int x, y;
private static Point zero = new Point(0, 0);
Point(int x, int y) {
this.x = x;
this.y = y;
}
double distance(Point that) {
return Math.sqrt(Math.pow(this.x - that.x, 2) + Math.pow(this.y - that.y, 2));
}
double distanceToOrigin() {
return distance(zero);
}
boolean equals(Point that) {
return this.x == that.x && this.y == that.y;
}
public String toString() { return String.format(\"(%d, %d)\", x, y); }
}
Solution
ArrayList1.java
import java.text.DecimalFormat;
import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;
public class ArrayList1 {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
PointList lst = new PointList();
while(true) {
System.out.print(\"Enter x, y values (type 0 0 to exit): \");
int x = in.nextInt();
int y = in.nextInt();
if (x == 0 && y == 0) {
break;
}
in.nextLine();
if(lst.insert(x, y)) {
System.out.println(lst);
}
}
in.close();
}
}
class PointList {
private List points = new ArrayList().
JAVA...With N.E.T_B.E.A.N.S___________________________________.pdf
JAVA...W\'i\'t\'h
N.E.T_B.E.A.N.S_______________________________________________________________
_____________________________________________________________________________
_____________________________________________________________________________
____________________________________________________
***********Product*********************
package rooster.nest;
import java.text.NumberFormat;
public class Product {
private long id;
private String code;
private String description;
private double price;
public long getId() {
return id;
}
public void setId(long id) {
this.id = id;
}
public String getCode() {
return code;
}
public void setCode(String code) {
this.code = code;
}
public String getDescription() {
return description;
}
public void setDescription(String name) {
this.description = name;
}
public double getPrice() {
return price;
}
public void setPrice(double price) {
this.price = price;
}
public String getPriceFormatted() {
NumberFormat currencyFormatter =
NumberFormat.getCurrencyInstance();
return currencyFormatter.format(getPrice());
}
}
********DBException************
package crows.foot;
/*
* This is just a wrapper class so we can throw a common exception for
* the UI to catch without tightly coupling the UI to the database layer.
*/
public class DBException extends Exception {
DBException() {}
DBException(Exception e) {
super(e);
}
}
*******DBUtil************
package crows.foot;
import java.sql.Connection;
import java.sql.DriverManager;
import java.sql.SQLException;
public class DBUtil {
private static Connection connection;
private DBUtil() {}
public static synchronized Connection getConnection() throws DBException {
if (connection != null) {
return connection;
}
else {
try {
// set the db url, username, and password
String url = \"jdbc:mysql://localhost:3306/mma\";
String username = \"mma_user\";
String password = \"sesame\";
// get and return connection
connection = DriverManager.getConnection(
url, username, password);
return connection;
} catch (SQLException e) {
throw new DBException(e);
}
}
}
public static synchronized void closeConnection() throws DBException {
if (connection != null) {
try {
connection.close();
} catch (SQLException e) {
throw new DBException(e);
} finally {
connection = null;
}
}
}
}
*************ProductDB**************
package crows.foot;
import java.sql.Connection;
import java.sql.PreparedStatement;
import java.sql.ResultSet;
import java.sql.SQLException;
import java.util.ArrayList;
import java.util.List;
import rooster.nest.Product;
public class ProductDB {
private static Product getProductFromRow(ResultSet rs) throws SQLException {
int productID = rs.getInt(1);
String code = rs.getString(2);
String description = rs.getString(3);
double price = rs.getDouble(4);
String note = rs.getString(5);
Product p = new Product();
p.setId(productID);
p.setCode(code);
p.setDescription(description);
p.setPrice(price);
return p;
}
public static List getAll() throws DBException {
String sql = \"SELECT * FROM Product.
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;
}
.
Similar to How can I add multiple names and addresses- To the following code- Tab.pdf (20)
mainpublic class AssignmentThree { public static void ma.pdf
mainpublic class AssignmentThree { public static void ma.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
in this assignment you are asked to write a simple driver program an.pdf
in this assignment you are asked to write a simple driver program an.pdf
Javai have to make a method that takes a linked list and then retu.pdf
Javai have to make a method that takes a linked list and then retu.pdf
Here is the editable codeSolutionimport java.util.NoSuchEleme.pdf
Here is the editable codeSolutionimport java.util.NoSuchEleme.pdf
Sorted number list implementation with linked listsStep 1 Inspec.pdf
Sorted number list implementation with linked listsStep 1 Inspec.pdf
Given the following codepackage data1;import java.util.;p.pdf
Given the following codepackage data1;import java.util.;p.pdf
import java.util.Scanner;class BinaryNode{ BinaryNode left.pdf
import java.util.Scanner;class BinaryNode{ BinaryNode left.pdf
This is to test a balanced tree. I need help testing an unbalanced t.pdf
This is to test a balanced tree. I need help testing an unbalanced t.pdf
import java-util--- public class MyLinkedList{ public static void.pdf
import java-util--- public class MyLinkedList{ public static void.pdf
I dont know what is wrong with this roulette program I cant seem.pdf
I dont know what is wrong with this roulette program I cant seem.pdf
PLEASE MAKE SURE THE PROGRAM IS ASKING FOR INPUT FROM USER TO ADD OR.pdf
PLEASE MAKE SURE THE PROGRAM IS ASKING FOR INPUT FROM USER TO ADD OR.pdf
Inspect the class declaration for a doubly-linked list node in Node-h-.pdf
Inspect the class declaration for a doubly-linked list node in Node-h-.pdf
import java.util.Random;defines the Stock class public class S.pdf
import java.util.Random;defines the Stock class public class S.pdf
1 OverviewFor this lab, you will implement the insert method and t.pdf
1 OverviewFor this lab, you will implement the insert method and t.pdf
JAVA...With N.E.T_B.E.A.N.S___________________________________.pdf
JAVA...With N.E.T_B.E.A.N.S___________________________________.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
More from ThomasXUMParsonsx
How would you define a community- The beginning of government's major.pdf
How would you define a community? The beginning of government's major involvement in
social issues, including health, was marked by: A) the Social Security Act of 1935. B) the
establishment of Medicare in 1965. C) U.S, involvement in World War II. D) the Hill-Burton
Act in 1946. Actions that society takes collectively to ensure that the conditions in which people
can be healthy can occur is termed: A) public health. B) community health. C) health. D)
population health. Twenty-first century community health concerns include: A) lifestyle
diseases. B) environmental problems. C) healthcare delivery. D) All of these are correct. What
was the goal of the Hill-Burton Act in 1946 ?.
How would you transform an organisation into a learning organisation u.pdf
How would you transform an organisation into a learning organisation used the 5 learning
disciplines, focus on activities or initiatives you can implement to facilitate the adoption of each
of the learning disciplines (10 mark) Marking guidelines for question two (2) 2 marks are
allocated for at least two activities/initiative suggested to be implemented to improve or adopt
each of the learning disciplines an organisation to make it a learning organisation..
How to fixed these provide listsort-asm assembly code as same as the l.pdf
How to fixed these provide listsort.asm assembly code as same as the listsort.c code with the
provide listmian.asm
1. Here is the listsort.asm I have now:
.globl recurSelectionSort
recurSelectionSort:
#struct Node* recurSelectionSort(struct Node* head) {
addi sp, sp, -16 # allocate space for the return address and saved registers
sw ra, 0(sp) # save the return address
sw s0, 4(sp) # save s0
sw s1, 8(sp) # save s1
# if (head->next == NULL)
lw t0, 0(a0) # Load head->next
beqz t0, endif1 # if (head->next == NULL)
# return head;
mv s0, a0 # save head to s0
addi sp, sp, 16 # deallocate space before returning
jr ra # return
endif1:
# struct Node* min = head;
mv s1, a0
# struct Node* beforeMin = NULL;
mv s0, x0
# struct Node* ptr;
mv t0, a0
# for (ptr = head; ptr->next != NULL; ptr = ptr->next) {
forinit:
lw t1, 4(t0) # Load ptr->next
beqz t1, endfor # for (ptr->next != NULL)
lw t2, 4(t1) # Load ptr->next->studentid
lw t3, 4(s1) # Load min->studentid
bge t3, t2, forloop # if (ptr->next->studentid < min->studentid )
mv s1, t1 # min = ptr->next;
mv s0, t0 # beforeMin = ptr;
forloop:
lw t0, 4(t0) # ptr = ptr->next;
lw t1, 0(t0) # Load ptr->next
bnez t1, forinit # for (ptr->next != NULL)
# if (ptr->next->studentid < min->studentid ) {
ifmin:
# min = ptr->next;
mv s1, t1
# beforeMin = ptr;
mv s0, t0
endifmin:
# }
endfor:
# }
if2:
# if (min != head)
bne s1, a0, if2
# swapNodes(&head, head, min, beforeMin);
jal swapNodes
lw t0, 0(a0) # Load head->next
endif2:
# head->next = recurSelectionSort(head->next);
jal recurSelectionSort
sw s0, 0(a0) # beforeMin->next = min->next (no need to swap if min is already at the head)
sw s1, 4(t0) # min->next = ptr
# return head;
mv s0, a0 # s0 = head
addi sp, sp, 16 # deallocate space before returning
jr ra # return
2. Here is the listmain.asm:
.text
.globl main
main:
addi sp,sp,-16
# studentlist = createList(studentArr, SIZE);
li a1,10
la a0, studentArr
jal createList
sw a0,12(sp)
# sort(&studentlist);
addi a0,sp,12
jal sort
# printList(studentlist);
lw a0,12(sp)
jal printList
# return
li a7, 10
ecall
.globl addStudent
# asm is nutty as the struct was passed in the registers.
addStudent:
addi sp,sp,-16
sw ra,12(sp)
sw s0,8(sp)
sw s1,4(sp)
mv s1,a0
mv s0,a1
li a0,20
jal malloc
lw a2,0(s0)
lw a3,4(s0)
lw a4,8(s0)
lw a5,12(s0)
sw a2,0(a0)
sw a3,4(a0)
sw a4,8(a0)
sw a5,12(a0)
sw s1,16(a0)
lw ra,12(sp)
lw s0,8(sp)
lw s1,4(sp)
addi sp,sp,16
jr ra
.globl createList
createList:
blez a1,endcreateList
addi sp,sp,-48
sw ra,44(sp)
sw s0,40(sp)
sw s1,36(sp)
mv s0,a0
slli s1,a1,2
add s1,s1,a1
slli s1,s1,2
add s1,a0,s1
li a0,0
cloop:
lw a1,0(s0)
lw a2,4(s0)
lw a3,8(s0)
lw a4,12(s0)
lw a5,16(s0)
sw a1,0(sp)
sw a2,4(sp)
sw a3,8(sp)
sw a4,12(sp)
sw a5,16(sp)
mv a1,sp
jal addStudent
addi s0,s0,20
bne s0,s1,cloop
lw ra,44(sp)
lw s0,40(sp)
lw s1,36(sp)
addi sp,sp,48
jr ra
endcreateList:
li a0,0
ret
.globl printList
printList:
beqz a0,endprintList
addi sp,sp,-16
sw ra,12(sp)
sw s0,8(sp)
mv s0,a0
lw a0,8(s0)
jal printint
li a0, 0x20
jal printch.
How to measure effectiveness using 1- The goal approach2- The human-ba.pdf
How to measure effectiveness using
1. The goal approach
2. The human-based approach
3. The internal process approach
4. The strategic constituents approach
How to measure effectiveness using
1. The goal approach
2. The human-based approach
3. The internal process approach
4. The strategic constituents approach.
How should a company evaluate a society's level of interdependence exp.pdf
How should a company evaluate a society's level of interdependence expressed between people?
Collectivism Femininity Uncertainty avoidance Long-term orientation Select the best response to
the following questions. The dimension of is present in a culture that believes individuals should
focus on their own gain. femininity individualism uncertainty avoidance long-term orientation
Select the best response to the following questions. What term refers to a society that promotes
assertiveness and a competitive spirit? Uncertainty avoidance Long-term orientation
Individualism Masculinity.
How much would the force of gravity at the surface of the Earth differ.pdf
How much would the force of gravity at the surface of the Earth differ if Earth's volume were
increased 64 times and its mass was increased 4 times? (Hint: Volume is proportional to the cube
of a sphere's radius.) A. 1/16 as much C. 1/4 as much B. 4 times larger D. no change.
How is the human population changing globally- What general difference.pdf
How is the human population changing globally? What general differences are seen
betwene developed and developing countries in regards to the phases of the
demographic tramission model and explain why..
How many different groups of two students can be formed out of 4 stud.pdf
How many different groups of two students can be formed out
of 4 students?.
How might environment might influence the total phenotypic variance in.pdf
How might environment might influence the total phenotypic variance in a population for a
quantitative trait? Describe each component of phenotypic variance affected by environment and
explain your terms. Imagine you collected trait value data for several genotypes, each grown in
several in different environments. For a trait with little effect of environment, what might the
reaction norms for these genotypes look like? What might the reaction norms look like for a trait
that IS affected by environment?.
How long will it take $100 to grow to $400 if invested at 4-5- compoun.pdf
How long will it take $100 to grow to $400 if invested at 4.5% compounded quarterly? (round to
the nearest year) It will take years.
How many samples should we collect for the following scenario- We want.pdf
How many samples should we collect for the following scenario? We want to know the
proportion of students who were sick at least one time during the semester with the level of
precision (4%) and 95 percent confidence level (i.e., the corresponding z=1.96) assuming the
estimated proportion is 0.5. Round up your answer to the integer..
How is of_type modeled- Not modeled into any relationship Relation and.pdf
How is of_type modeled? Not modeled into any relationship Relation and n foreign keys Foreign
key (or "relationship" relation) Relation Set of simple component attributes Relation and foreign
key with single attribute value Relation and two foreign keys Relation with owning entity
primacy key participating in primary key One Atomic Attribute.
How is Plane_service modeled- Relation and foreign key with single att.pdf
How is Plane_service modeled? Relation and foreign key with single attribute value Relation
with owning entity primary key participating in primary key Foreign key for "relationship"
relation) Relation Relation and two foreign keys Not modeled Into any relationship One Atomic
Attribute Relation and in foreign keys Set of simple component artributes.
How has the Internet created a new marketing model- What are the main.pdf
How has the Internet created a new marketing model ? What are the main implications for
marketing organizations ? Why is advertising considered to be a tax that marketers pay for
being unremarkable?
Why is the marketing effort not finished once the sale has been made?
Differentiate between pull and push promotional strategies. When might a marketing
organization choose to favor one over the other?
Why is it important for the marketing department to develop good relationships with other
functional areas in the organization?.
How have human diseases changed from pre-1950 to the present- and how.pdf
How have human diseases changed from pre-1950 to the present, and how does this
relate to public health improvementd, societal awareness abd risk management of
toxibs, verus exposure to some toxicants
How have human diseases changed from pre-1950 to the present, and how does this relate to
public health improvementd, societal awareness abd risk management of toxibs, verus exposure
to some toxicants.
How frequently are incidents of violence and-or corruption in policing.pdf
• How frequently are incidents of violence and/or corruption in policing represented in the
media?.
How does myosin II differ from myosin V- Myosin II assembles into bipo.pdf
How does myosin II differ from myosin V? Myosin II assembles into bipolar thick filaments to
contract anti-parallel actin filaments whereas myosin V binds a membrane vesicle cargo with its
tail and carries the cargo toward the plus end of a single actin filament. Myosin II walks on
microtubules whereas myosin V walks on tubulin dimers. Myosin II walks on F -actin whereas
myosin walks on g -actin. Myosin II assembles into bipolar thick filaments to contract anti-
parallel microtubules whereas myosin V binds a membrane vesicle cargo with its tail and carries
the cargo toward the plus end of a single microtubule. Question 5 1 pts GTP-rho activates:
WASP which then binds and activates ARP2,3, which nucleates a branched network of F -actin,
which pushes the plasma membrane forward by a thermal ratchet mechanism: Binding of
importins to NLS (nuclear localization signal). Formins which nucleate straight actin filaments
and rho kinase which activates myosin II by phosphorylating myosin regulatory light chain.
Contraction of branched microtubule networks..
How does Fogel justify using only one year of data in his social savin.pdf
How does Fogel justify using only one year of data in his social savings analysis?
Group of answer choices
The year was the only time where there was data available after the railroad but before cars
The year was pretty similar to previous years, and therefore he could use it to match other years
There were no data available before the year he chose, so he was working with the best he could
The data came after the railroads were already established, meaning that if the effect was small
that year, it must have been even smaller in previous years.
How Effective Managers Use Information Systems Advances in computer-ba.pdf
How Effective Managers Use Information Systems Advances in computer-based information
technology in recent years have led to a wide variety of systems that managers are now using to
make and implement decisions. Largely, these systems have been developed from scratch for
specific purposes and differ significantly from standard electronic data processing systems. Too
often, unfortunately, managers have little say in the development of these decision support
systems at the same time, nonmanagers who do develop them have a limited view of how they
can be used. Moreover, the difference between success and failure is the extent to which
managers can use the system to increase their effectiveness within their organizations.
QUESTION 1
1.1 Critically discuss why Information Systems are important to an organisation. (20 Marks)
1.2 Explain the Five resources that support information systems. (10 Marks).
How does bias affect human resource function How does bias affect huma.pdf
How does bias affect human resource function
How does bias affect human resource function.
More from ThomasXUMParsonsx (20)
How would you define a community- The beginning of government's major.pdf
How would you define a community- The beginning of government's major.pdf
How would you transform an organisation into a learning organisation u.pdf
How would you transform an organisation into a learning organisation u.pdf
How to fixed these provide listsort-asm assembly code as same as the l.pdf
How to fixed these provide listsort-asm assembly code as same as the l.pdf
How to measure effectiveness using 1- The goal approach2- The human-ba.pdf
How to measure effectiveness using 1- The goal approach2- The human-ba.pdf
How should a company evaluate a society's level of interdependence exp.pdf
How should a company evaluate a society's level of interdependence exp.pdf
How much would the force of gravity at the surface of the Earth differ.pdf
How much would the force of gravity at the surface of the Earth differ.pdf
How is the human population changing globally- What general difference.pdf
How is the human population changing globally- What general difference.pdf
How many different groups of two students can be formed out of 4 stud.pdf
How many different groups of two students can be formed out of 4 stud.pdf
How might environment might influence the total phenotypic variance in.pdf
How might environment might influence the total phenotypic variance in.pdf
How long will it take $100 to grow to $400 if invested at 4-5- compoun.pdf
How long will it take $100 to grow to $400 if invested at 4-5- compoun.pdf
How many samples should we collect for the following scenario- We want.pdf
How many samples should we collect for the following scenario- We want.pdf
How is of_type modeled- Not modeled into any relationship Relation and.pdf
How is of_type modeled- Not modeled into any relationship Relation and.pdf
How is Plane_service modeled- Relation and foreign key with single att.pdf
How is Plane_service modeled- Relation and foreign key with single att.pdf
How has the Internet created a new marketing model- What are the main.pdf
How has the Internet created a new marketing model- What are the main.pdf
How have human diseases changed from pre-1950 to the present- and how.pdf
How have human diseases changed from pre-1950 to the present- and how.pdf
How frequently are incidents of violence and-or corruption in policing.pdf
How frequently are incidents of violence and-or corruption in policing.pdf
How does myosin II differ from myosin V- Myosin II assembles into bipo.pdf
How does myosin II differ from myosin V- Myosin II assembles into bipo.pdf
How does Fogel justify using only one year of data in his social savin.pdf
How does Fogel justify using only one year of data in his social savin.pdf
How Effective Managers Use Information Systems Advances in computer-ba.pdf
How Effective Managers Use Information Systems Advances in computer-ba.pdf
How does bias affect human resource function How does bias affect huma.pdf
How does bias affect human resource function How does bias affect huma.pdf
Recently uploaded
RPMS TEMPLATE FOR SCHOOL YEAR 2023-2024 FOR TEACHER 1 TO TEACHER 3
RPMS Template 2023-2024 by: Irene S. Rueco
Introduction to AI for Nonprofits with Tapp Network
Dive into the world of AI! Experts Jon Hill and Tareq Monaur will guide you through AI's role in enhancing nonprofit websites and basic marketing strategies, making it easy to understand and apply.
Digital Artifact 1 - 10VCD Environments Unit
Digital Artifact 1 - 10VCD Environments Unit - NGV Pavilion Concept Design
How to Build a Module in Odoo 17 Using the Scaffold Method
Odoo provides an option for creating a module by using a single line command. By using this command the user can make a whole structure of a module. It is very easy for a beginner to make a module. There is no need to make each file manually. This slide will show how to create a module using the scaffold method.
ANATOMY AND BIOMECHANICS OF HIP JOINT.pdf
it describes the bony anatomy including the femoral head , acetabulum, labrum . also discusses the capsule , ligaments . muscle that act on the hip joint and the range of motion are outlined. factors affecting hip joint stability and weight transmission through the joint are summarized.
Thesis Statement for students diagnonsed withADHD.ppt
Presentation required for the master in Education.
Azure Interview Questions and Answers PDF By ScholarHat
Azure Interview Questions and Answers PDF By ScholarHat
Advantages and Disadvantages of CMS from an SEO Perspective
Advantages and Disadvantages of CMS from an SEO Perspective
The simplified electron and muon model, Oscillating Spacetime: The Foundation...
Discover the Simplified Electron and Muon Model: A New Wave-Based Approach to Understanding Particles delves into a groundbreaking theory that presents electrons and muons as rotating soliton waves within oscillating spacetime. Geared towards students, researchers, and science buffs, this book breaks down complex ideas into simple explanations. It covers topics such as electron waves, temporal dynamics, and the implications of this model on particle physics. With clear illustrations and easy-to-follow explanations, readers will gain a new outlook on the universe's fundamental nature.
Best Digital Marketing Institute In NOIDA
Safalta Digital marketing institute in Noida, provide complete applications that encompass a huge range of virtual advertising and marketing additives, which includes search engine optimization, virtual communication advertising, pay-per-click on marketing, content material advertising, internet analytics, and greater. These university courses are designed for students who possess a comprehensive understanding of virtual marketing strategies and attributes.Safalta Digital Marketing Institute in Noida is a first choice for young individuals or students who are looking to start their careers in the field of digital advertising. The institute gives specialized courses designed and certification.
for beginners, providing thorough training in areas such as SEO, digital communication marketing, and PPC training in Noida. After finishing the program, students receive the certifications recognised by top different universitie, setting a strong foundation for a successful career in digital marketing.
TESDA TM1 REVIEWER FOR NATIONAL ASSESSMENT WRITTEN AND ORAL QUESTIONS WITH A...
TESDA TM1 REVIEWER FOR NATIONAL ASSESSMENT WRITTEN AND ORAL QUESTIONS WITH ANSWERS.
MASS MEDIA STUDIES-835-CLASS XI Resource Material.pdf
mass media studies
CBSE
Full Book
for class 11th
PCOS corelations and management through Ayurveda.
This presentation includes basic of PCOS their pathology and treatment and also Ayurveda correlation of PCOS and Ayurvedic line of treatment mentioned in classics.
Top five deadliest dog breeds in America
Thinking of getting a dog? Be aware that breeds like Pit Bulls, Rottweilers, and German Shepherds can be loyal and dangerous. Proper training and socialization are crucial to preventing aggressive behaviors. Ensure safety by understanding their needs and always supervising interactions. Stay safe, and enjoy your furry friends!
Recently uploaded (20)
Digital Artefact 1 - Tiny Home Environmental Design
Digital Artefact 1 - Tiny Home Environmental Design
RPMS TEMPLATE FOR SCHOOL YEAR 2023-2024 FOR TEACHER 1 TO TEACHER 3
RPMS TEMPLATE FOR SCHOOL YEAR 2023-2024 FOR TEACHER 1 TO TEACHER 3
Introduction to AI for Nonprofits with Tapp Network
Introduction to AI for Nonprofits with Tapp Network
How to Build a Module in Odoo 17 Using the Scaffold Method
How to Build a Module in Odoo 17 Using the Scaffold Method
Pride Month Slides 2024 David Douglas School District
Pride Month Slides 2024 David Douglas School District
Thesis Statement for students diagnonsed withADHD.ppt
Thesis Statement for students diagnonsed withADHD.ppt
Azure Interview Questions and Answers PDF By ScholarHat
Azure Interview Questions and Answers PDF By ScholarHat
Advantages and Disadvantages of CMS from an SEO Perspective
Advantages and Disadvantages of CMS from an SEO Perspective
The simplified electron and muon model, Oscillating Spacetime: The Foundation...
The simplified electron and muon model, Oscillating Spacetime: The Foundation...
TESDA TM1 REVIEWER FOR NATIONAL ASSESSMENT WRITTEN AND ORAL QUESTIONS WITH A...
TESDA TM1 REVIEWER FOR NATIONAL ASSESSMENT WRITTEN AND ORAL QUESTIONS WITH A...
MASS MEDIA STUDIES-835-CLASS XI Resource Material.pdf
MASS MEDIA STUDIES-835-CLASS XI Resource Material.pdf
How can I add multiple names and addresses- To the following code- Tab.pdf
- 1. 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);
- 2. 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;
- 3. 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; } }
- 4. 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()); }
- 5. 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) { return false; } this.mark = null; return true; } public boolean advanceMark() { if (this.mark== null) { return false; } this.mark = this.mark.getNext(); return true; } public String keyAtMark() { if (this.mark== null) { return null; } return this.mark.getKey(); }
- 6. public String valueAtMark() { if (this.mark== null) { return null; } return this.mark.getValue(); } public int displayAll() { Node current = this.mark; int count = 0; while (current != null) { System.out.println(current.getKey()+":"+ current); } return count; } }