MIS 4310-01 Final Take Home Exam (100 points) DUE Thursd.docx
•Download as DOCX, PDF•
0 likes•3 views
MIS 4310-01 Final Take Home Exam (100 points) DUE: Thursday, December 14th, 2017 by 11:59 PM Use the code provided on Blackboard as your template. Fill in your own code where prompted. When finished, upload to Blackboard a file called “treasure_hunt.java”. Change the block comment to include your own name. This is an individual assignment! Code that you write that you cannot explain will result in an automatic zero. Create a Java application that simulates a treasure hunt with a 2D array. Your output should match the output below with similar input. Do NOT alter the code provided. Fill in code in the SEVEN (7) locations under each comment // YOUR CODE HERE. Sample Output: import java.util.Random; import java.util.Scanner; /* * First Last * MIS 4310 Fall 2017 * FINAL TAKE HOME EXAM */ public class treasure_hunt { public static void main(String[] args) { boolean found = false; // is true if the treasure is found int dug = 0; // holds the number of times user digs Random gen = new Random(9); Scanner scan = new Scanner(System.in); int locationRow; // stores the row where the treasure is int locationCol; // stores the column where the treasure is /* * Generates a String array that looks like * undug grass when printed to represent the backyard. */ String[][] backyard = new String[5][5]; for (int row = 0; row < backyard.length; row++) { for (int col = 0; col < backyard[row].length; col++) { backyard[row][col] = "^"; System.out.print(backyard[row][col] + " "); } // end inner loop System.out.println(); } // end outer loop /* * Generate a random number for both the row and column * location of the treasure. Store the results in * locationRow and locationCol, respectively. * The random numbers should be within the array dimensions. */ //************************** // YOUR CODE HERE (1 OF 7) //************************** /* * A while loop that runs as long as the treasure * is not found. */ while (found == false) { /* * Declare two integer variables, guessRow and guessCol * and set them both to -1. * Increment the variable dug to represent a dig. */ //************************** // YOUR CODE HERE (2 OF 7) //************************** /* * Ask the user which row they want to dig. * Use a while loop to validate the input. * Run the while loop as long as the guessRow * value is outside the bounds of the array. */ //************************** // YOUR CODE HERE (3 OF 7) //************************** /* * Ask the user which column they want to dig. * Use a while loop to validate the input. * Run the while loop as long as the guessCol * value is outside the bounds of the array. */ ...
Report
Share
Report
Share
![import java.util.Scanner;
/*
* First Last
* MIS 4310 Fall 2017
* FINAL TAKE HOME EXAM
*/
public class treasure_hunt {
public static void main(String[] args) {
boolean found = false; // is true if the treasure is
found
int dug = 0; // holds the number of times user digs
Random gen = new Random(9);
Scanner scan = new Scanner(System.in);](data:image/gif;base64,R0lGODlhAQABAIAAAAAAAP///yH5BAEAAAAALAAAAAABAAEAAAIBRAA7)
Recommended
StackInterface An interface for the ADT stack. Do not modif.pdf
StackInterface
/**
An interface for the ADT stack.
Do not modify this file
*/
package PJ2;
public interface StackInterface
{
/** Gets the current number of data in this stack.
@return the integer number of entries currently in the stack*/
public int size();
/** Adds a new data to the top of this stack.
@param aData an object to be added to the stack */
public void push(T aData);
/** Removes and returns this stack\'s top data.
@return either the object at the top of the stack or,
if the stack is empty before the operation, null */
public T pop();
/** Retrieves this stack\'s top data.
@return either the data at the top of the stack or
null if the stack is empty */
public T peek();
/** Detects whether this stack is empty.
@return true if the stack is empty */
public boolean empty();
/** Removes all data from this stack */
public void clear();
} // end StackInterface
SimpleLinkedStack.java
/**
A class of stacks whose entries are stored in a chain of nodes.
Implement all methods in SimpleLinkedStack class using
the inner Node class.
Main Reference : text book or class notes
Do not change or add data fields
Do not add new methods
You may access Node object fields directly, i.e. data and next
*/
package PJ2;
public class SimpleLinkedStack implements StackInterface
{
// Data fields
private Node topNode; // references the first node in the chain
private int count; // number of data in this stack
public SimpleLinkedStack()
{
// add stataments
} // end default constructor
public void push(T newData)
{
// add stataments
} // end push
public T peek()
{
// add stataments
return null;
} // end peek
public T pop()
{
// add stataments
return null;
} // end pop
public boolean empty()
{
// add stataments
return false;
} // end empty
public int size()
{
// add stataments
return -1;
} // end isEmpty
public void clear()
{
// add stataments
} // end clear
public String toString()
{
// add stataments
// note: data class in stack must implement toString() method
// return a list of data in Stack, separate them with \',\'
return \"\";
}
/****************************************************
private inner node class
Do not modify this class!!
you may access data and next directly
***************************************************/
private class Node
{
private T data; // entry in list
private Node next; // link to next node
private Node (T dataPortion)
{
data = dataPortion;
next = null; // set next to NULL
} // end constructor
private Node (T dataPortion, Node nextNode)
{
data = dataPortion;
next = nextNode; // set next to refer to nextNode
} // end constructor
} // end Node
/****************************************************
Do not modify: Stack test
****************************************************/
public static void main (String args[])
{
System.out.println(\"\ \"+
\"*******************************************************\ \"+
\"Sample Expected output:\ \"+
\"\ \"+
\"OK: stack is empty\ \"+
\"Push 3 data: 10, 30, 50\ \"+
\"Print stack [50,30,10,]\ \"+
\"OK: sta.
PLEASE complete in java codes A program that pops open an .pdf
PLEASE complete in java codes
A program that pops open an interactive map.
*/
public class App extends PApplet {
/****************************************************************/
/* BEGIN - DON'T MODIFY THIS CODE */
/****************************************************************/
UnfoldingMap map; // will be a reference to the actual map
String mapTitle; // will hold the title of the map
final float SCALE_FACTOR = 0.0002f; // a factor used to scale pedestrian counts to calculate a
reasonable radius for a bubble marker on the map
final int DEFAULT_ZOOM_LEVEL = 11;
final Location DEFAULT_LOCATION = new Location(40.7286683f, -73.997895f); // a hard-coded
NYC location to start with
String[][] data; // will hold data extracted from the CSV data file
/****************************************************************/
/* END - DON'T MODIFY THIS CODE */
/****************************************************************/
/**
* This method is automatically called every time the user presses a key while viewing the map.
* The `key` variable (type char) is automatically is assigned the value of the key that was pressed.
* Complete the functions called from here, such that:
* - when the user presses the `1` key, the code calls the showMay2021MorningCounts method to
show the morning counts in May 2021, with blue bubble markers on the map.
* - when the user presses the `2` key, the code calls the showMay2021EveningCounts method to
show the evening counts in May 2021, with blue bubble markers on the map.
* - when the user presses the `3` key, the code calls the
showMay2021EveningMorningCountsDifferencemethod to show the difference between the
evening and morning counts in May 2021. If the evening count is greater, the marker should be a
green bubble, otherwise, the marker should be a red bubble.
* - when the user presses the `4` key, the code calls the showMay2021VersusMay2019Counts
method to show the difference between the average of the evening and morning counts in May
2021 and the average of the evening and morning counts in May 2019. If the counts for 2021 are
greater, the marker should be a green bubble, otherwise, the marker should be a red bubble.
* - when the user presses the `5` key, the code calls the customVisualization1 method to show
data of your choosing, visualized with marker types of your choosing.
* - when the user presses the `6` key, the code calls the customVisualization2 method to show
data of your choosing, visualized with marker types of your choosing.
*/
public void keyPressed() {
// System.out.println("Key pressed: " + key);
// complete this method
}
/**
* Adds markers to the map for the morning pedestrian counts in May 2021.
* These counts are in the second-to-last field in the CSV data file. So we look at the second-to-last
array element in our data array for these values.
*
* @param data A two-dimensional String array, containing the data returned by the
getDataFromLines method.
*/
public void showMay2021MorningCounts(String[][.
The Morse code (see Table 6.10 in book) is a common code that is use.pdf
The Morse code (see Table 6.10 in book) is a common code that is used to encode messages
consisted of letters and digits. Each letter consists of a series of dots and dashes; for example, the
code for the letter a is *- and the code for the letter b is -***. Store each letter of the alphabet in a
node of a binary tree of level 5. The root node is at level 1 and stores no letter. The left node at
level 2 stores the letter e (code is *), and the right node stores letter t (code is -). The 4 nodes at
level 3 store the letters with codes (**, *-, -*, --). To build the tree (see Figure 6.38 in book),
read a file in which each line consists of a letter followed by its code. The letters should be
ordered by tree level. To find the position for a letter in the tree, scan the code and branch left for
a dot and branch right for a dash. Encode a message by replacing each letter by its code symbol.
Then decode the message using the Morse code tree. Make sure you use a delimiter symbol
between coded letters.
Implementation Notes: You will need to complete the generic implementation of the BinaryTree
data structure first (see slides). Once it is complete, solve the problem above (note that the book
uses dots and dashes, we will use the asterisk (*) as the dot, hyphen (-) as a dash, and space ( ) as
the delimiter symbol between coded letters). Provide a menu program that asks the user to 1) test
output for all morse code letters with their respective translated alphabet letters (make sure you
are using the binary tree to do the actual translation, output as a nicely formatted table), 2) enter
an input file name to decode morse code and output the translated text to the screen, or 3) enter
in a line of morse code through the console to decode morse code and output the translated text
to the screen
relevenat picture of both the tree diagram and the table of morse code
Solution
JAVA CODE:
import java.io.*;
import java.util.*;
public class MorseCoder implements MorseCodeInterface {
private MorseNode root;
/**
* constructor to build the tree
*/
public MorseCoder() {
root = new MorseNode();
readTreeInfo();
}
/**
* reads in the tree info from the text file (helper method)
*/
private void readTreeInfo() {
Scanner input = null;
try {
input = new Scanner(new File(\"encodings.txt\"));
} catch (FileNotFoundException exception) {
System.out.println(\"File not found!\");
}
while (input.hasNextLine()) {
String data = input.nextLine().trim();
if (data.length() > 0) {
add(data.substring(1).trim(), data.charAt(0));
}
}
input.close();
}
/**
* adds the letter to the tree based on the mcode string (helper method)
* @param mcode the string being fed in
* @param ltr the letter being added at the node
*/
private void add(String mcode, char ltr) {
MorseNode current = root;
String signal = \" \";
for (int i = 0; i < mcode.length(); i++) {
signal = mcode.substring(i, i + 1);
if (signal.equals(\".\")) {
if (current.getLeft() != null) {
current = current.getLeft();
} else {
current.set.
Complete in JavaCardApp.javapublic class CardApp { private.pdf
Complete in Java
CardApp.java
public class CardApp {
private LinkedList list;
/**
* User interface prompts user, reads and writes files.
*/
public static void main(String[] args) {
}
/**
* Default constructor to initialize the deck
*/
public CardApp() {
}
/**
* Inserts a new Card into the deck
* @param card a playing Card
*/
public void addCard(Card card) {
}
/**
* Shuffles cards following this algorithm:
* First swaps first and last card
* Next, swaps every even card with the card 3
* nodes away from that card. Stops when it
* reaches the 3rd to last node
* Then, swaps ALL cards with the card that is
* 2 nodes away from it, starting at the 2nd card
* and stopping stopping at the 3rd to last node
*/
public void shuffle() {
}
/**
* Implements the bubble sort algorithm
* to sort cardList into sorted order, first by suit
* (alphabetical order)
* then by rank from 2 to A
*/
public void sort() {
}
/**
* Returns the deck of cards with each card separated
* by a blank space and a new line character at the end.
* @return The deck of cards as a string.
*/
@Override public String toString() {
return "";
}
}
Card.java
public class Card implements Comparable{
private String rank;
private String suit;
/**
* Constructor for the Card class
* @param rank the rank of card from 2 to A
* @param suit the suit of card C, D, H, or S
*/
public Card(String rank, String suit) {
}
/**
* Returns the card's rank
* @return rank a rank from 2 (low) to A (high)
*/
public String getRank() {
return "";
}
/**
* Returns the card's suit
* @return C, D, H, or S
*/
public String getSuit() {
return "";
}
/**
* Updates the card's rank
* @param rank a new rank
*/
public void setRank(String rank) {
}
/**
* Updates the card's suit
* @param suit the new suit
*/
public void setSuit(String suit) {
}
/**
* Concatenates rank and suit
* @return card rank and suit
*/
@Override public String toString() {
return "";
}
/**
* Overrides the equals method for Card
* Compares rank and suit and
* follows the equals formula given in
* Lesson 4 and also in Joshua Block's text
* @param obj another Object to compare for
* equality
* @return whether obj is a Card and, if so,
* of equal rank and suit
*/
@Override public boolean equals(Object obj) {
return false;
}
/**
* Orders two cards first by suit (alphabetically)
* Next by rank. "A" is considered the high card
* Order goes 2, 3, 4, 5, 6, 7, 8, 9, 10, J, Q, K, A
* @param card another Card to compare to this Card
* @return a negative number if this comes before c
* and a positive number if c comes before this
* and 0 if this and c are equal according to the above
* equals method
*/
@Override public int compareTo(Card card) {
return -1;
}
}
}
LinkedList.Java
import java.util.NoSuchElementException;
public class LinkedList {
private class Node {
private T data;
private Node next;
private Node prev;
public Node(T data) {
this.data = data;
this.next = null;
this.prev = null;
}
}
private int length;
private Node first;
private Node last;
private Node iterato.
20145-5SumII_CSC374-407_assign3.htmlCSC 374407 Computer Sy.docx
20145-5SumII_CSC374-407_assign3.html
CSC 374/407: Computer Systems II: 2015 Summer II, Assignment #3
Last modified 2015 August 6
Purpose:
To practice working with POSIX threads, mutexes and conditions;
and to practice good pointer programming in CAssignment:The "telephone" game (70 Points)Overview
We are going to simulate the children's game of "telephone".
In this game N (in our case, 10) children are in a circle.
The first one says something to the second.
The second one may or may not hear what the first one said accurately but he/she passes what he/she thinks was said to the third.
This continues until the message gets to the last child.
The program for our game has two classes.
The first one, Sentence holds the current state of a sentence.
It has been written for you, and all you have to do is use it.
The second one, MessageSystem holds mutexes, conditions and sentence pointer buffers between each child.
You'll have to finish this one.
For this assignment you have to:
You have to fill in the mutex and condition portions of MessageSystem.
Write the function void* child (void*) that the child threads will run.
Finish main() to invoke and wait for the child threads.
Each child i will get the pointer to its sentence from i-1 and will transmit it (imperfectly) to i.
Thus it needs to access two buffers: one at i-1 and the other at i.
All buffers are protected by mutexes, so child i-1 and child i don't step on each other's toes when trying to access the buffer at i-1.
Before child i can get the sentence pointer from the buffer at i-1 the sentence has to be there.
If it is not it should temporarily surrender the lock (if it obtained it) and wait until the sentence becomes available.
AssignmentCut and paste the following/*--------------------------------------------------------------------------*
*---- ----*
*---- telephoneGame ----*
*---- ----*
*---- This program simulates the children's game of "telephone", ----*
*---- where an original message mutates as it is imperfectly ----*
*---- transmited among children in a pairwise manner. ----*
*---- ----*
*---- It demonstrates Linux/Unix thread programming using ----*
*---- pthread_mutex_t and pthread_cond_t. ----*
*---- ----*
*---- Compile with: ----*
*---- linux> g++ -lpthread telephoneGame.cpp -o telephoneGame ----*
*---- ----*
*---- ---- ---- ---- ---- ---- ---- ---- ---- ----*
*---- ----*
*---- Version 1.0 Joseph Phillips 2010 October 23 ----*
*---- ----*
*--------------------------------------------------------------------------*/
/*--------------------------------------------------------------------------*
*---- ----*
*---- Includes and namespace designations: ----*
*---- ----*
*----------------------------------------------------------------------.
For this project, write a program that stores integers in a binary.docx
For this project, write a program that stores integers in a binary search tree.
The tree should use the BTNode class which is provided.
Write a test program that generates 20 random numbers in the range of -50 to 50 to build the tree and then uses preorderPrint,
inorderPrint, and postOrderPrint to display the contents of the tree.
To get an A implement a new method for the BTNode class which creates a Java vector class to contain
the data from all the nodes in the tree. The specification for this method is provided in the BTNode file.
Details about the Java vector class are provided in Appendix D, although the only vector method you'll use is addElement.
Also specify and implement in-order and post-order traversals and answer the question which of the
three new methods creates a vector with the entries sorted from smallest to largest?
Your test program should display the vectors created by your new methods rather than the print methods of BTNode.
// File: BTNode.java from the package edu.colorado.nodes
// Complete documentation is available from the BTNode link in:
// http://www.cs.colorado.edu/~main/docs/
package BTNode;
import java.util.Vector;
/******************************************************************************
* A <CODE>BTNode<<E></CODE> provides a node for a binary tree. Each node
* contains a piece of data (which is a reference to an E object) and references
* to a left and right child. The references to children may be null to indicate
* that there is no child. The reference stored in a node can also be null.
*
* <dl><dt><b>Limitations:</b> <dd>
* Beyond <CODE>Int.MAX_VALUE</CODE> elements, <CODE>treeSize</CODE>, is
* wrong.
*
* <dt><b>Java Source Code for this class:</b><dd>
* <A HREF="../../../../edu/colorado/nodes/BTNode.java">
* http://www.cs.colorado.edu/~main/edu/colorado/nodes/BTNode.java </A>
*
* @author Michael Main
* <A HREF="mailto:[email protected]"> ([email protected]) </A>
*
* @version
* Jul 22, 2005
******************************************************************************/
public class BTNode<E>
{
// Invariant of the BTNode<E> class:
// 1. Each node has one reference to an E Object, stored in the instance
// variable data.
// 2. The instance variables left and right are references to the node's
// left and right children.
private E data;
private BTNode<E> left, right;
/**
* Initialize a <CODE>BTNode</CODE> with a specified initial data and links
* children. Note that a child link may be the null reference,
* which indicates that the new node does not have that child.
* @param <CODE>initialData</CODE>
* the initial data of this new node
* @param <CODE>initialLeft</CODE>
* a reference to the left child of this new node--this reference may be null
* to indicate that there is no node after this new node.
* @param <CODE>initialRight</CODE>
.
Recommended
StackInterface An interface for the ADT stack. Do not modif.pdf
StackInterface
/**
An interface for the ADT stack.
Do not modify this file
*/
package PJ2;
public interface StackInterface
{
/** Gets the current number of data in this stack.
@return the integer number of entries currently in the stack*/
public int size();
/** Adds a new data to the top of this stack.
@param aData an object to be added to the stack */
public void push(T aData);
/** Removes and returns this stack\'s top data.
@return either the object at the top of the stack or,
if the stack is empty before the operation, null */
public T pop();
/** Retrieves this stack\'s top data.
@return either the data at the top of the stack or
null if the stack is empty */
public T peek();
/** Detects whether this stack is empty.
@return true if the stack is empty */
public boolean empty();
/** Removes all data from this stack */
public void clear();
} // end StackInterface
SimpleLinkedStack.java
/**
A class of stacks whose entries are stored in a chain of nodes.
Implement all methods in SimpleLinkedStack class using
the inner Node class.
Main Reference : text book or class notes
Do not change or add data fields
Do not add new methods
You may access Node object fields directly, i.e. data and next
*/
package PJ2;
public class SimpleLinkedStack implements StackInterface
{
// Data fields
private Node topNode; // references the first node in the chain
private int count; // number of data in this stack
public SimpleLinkedStack()
{
// add stataments
} // end default constructor
public void push(T newData)
{
// add stataments
} // end push
public T peek()
{
// add stataments
return null;
} // end peek
public T pop()
{
// add stataments
return null;
} // end pop
public boolean empty()
{
// add stataments
return false;
} // end empty
public int size()
{
// add stataments
return -1;
} // end isEmpty
public void clear()
{
// add stataments
} // end clear
public String toString()
{
// add stataments
// note: data class in stack must implement toString() method
// return a list of data in Stack, separate them with \',\'
return \"\";
}
/****************************************************
private inner node class
Do not modify this class!!
you may access data and next directly
***************************************************/
private class Node
{
private T data; // entry in list
private Node next; // link to next node
private Node (T dataPortion)
{
data = dataPortion;
next = null; // set next to NULL
} // end constructor
private Node (T dataPortion, Node nextNode)
{
data = dataPortion;
next = nextNode; // set next to refer to nextNode
} // end constructor
} // end Node
/****************************************************
Do not modify: Stack test
****************************************************/
public static void main (String args[])
{
System.out.println(\"\ \"+
\"*******************************************************\ \"+
\"Sample Expected output:\ \"+
\"\ \"+
\"OK: stack is empty\ \"+
\"Push 3 data: 10, 30, 50\ \"+
\"Print stack [50,30,10,]\ \"+
\"OK: sta.
PLEASE complete in java codes A program that pops open an .pdf
PLEASE complete in java codes
A program that pops open an interactive map.
*/
public class App extends PApplet {
/****************************************************************/
/* BEGIN - DON'T MODIFY THIS CODE */
/****************************************************************/
UnfoldingMap map; // will be a reference to the actual map
String mapTitle; // will hold the title of the map
final float SCALE_FACTOR = 0.0002f; // a factor used to scale pedestrian counts to calculate a
reasonable radius for a bubble marker on the map
final int DEFAULT_ZOOM_LEVEL = 11;
final Location DEFAULT_LOCATION = new Location(40.7286683f, -73.997895f); // a hard-coded
NYC location to start with
String[][] data; // will hold data extracted from the CSV data file
/****************************************************************/
/* END - DON'T MODIFY THIS CODE */
/****************************************************************/
/**
* This method is automatically called every time the user presses a key while viewing the map.
* The `key` variable (type char) is automatically is assigned the value of the key that was pressed.
* Complete the functions called from here, such that:
* - when the user presses the `1` key, the code calls the showMay2021MorningCounts method to
show the morning counts in May 2021, with blue bubble markers on the map.
* - when the user presses the `2` key, the code calls the showMay2021EveningCounts method to
show the evening counts in May 2021, with blue bubble markers on the map.
* - when the user presses the `3` key, the code calls the
showMay2021EveningMorningCountsDifferencemethod to show the difference between the
evening and morning counts in May 2021. If the evening count is greater, the marker should be a
green bubble, otherwise, the marker should be a red bubble.
* - when the user presses the `4` key, the code calls the showMay2021VersusMay2019Counts
method to show the difference between the average of the evening and morning counts in May
2021 and the average of the evening and morning counts in May 2019. If the counts for 2021 are
greater, the marker should be a green bubble, otherwise, the marker should be a red bubble.
* - when the user presses the `5` key, the code calls the customVisualization1 method to show
data of your choosing, visualized with marker types of your choosing.
* - when the user presses the `6` key, the code calls the customVisualization2 method to show
data of your choosing, visualized with marker types of your choosing.
*/
public void keyPressed() {
// System.out.println("Key pressed: " + key);
// complete this method
}
/**
* Adds markers to the map for the morning pedestrian counts in May 2021.
* These counts are in the second-to-last field in the CSV data file. So we look at the second-to-last
array element in our data array for these values.
*
* @param data A two-dimensional String array, containing the data returned by the
getDataFromLines method.
*/
public void showMay2021MorningCounts(String[][.
The Morse code (see Table 6.10 in book) is a common code that is use.pdf
The Morse code (see Table 6.10 in book) is a common code that is used to encode messages
consisted of letters and digits. Each letter consists of a series of dots and dashes; for example, the
code for the letter a is *- and the code for the letter b is -***. Store each letter of the alphabet in a
node of a binary tree of level 5. The root node is at level 1 and stores no letter. The left node at
level 2 stores the letter e (code is *), and the right node stores letter t (code is -). The 4 nodes at
level 3 store the letters with codes (**, *-, -*, --). To build the tree (see Figure 6.38 in book),
read a file in which each line consists of a letter followed by its code. The letters should be
ordered by tree level. To find the position for a letter in the tree, scan the code and branch left for
a dot and branch right for a dash. Encode a message by replacing each letter by its code symbol.
Then decode the message using the Morse code tree. Make sure you use a delimiter symbol
between coded letters.
Implementation Notes: You will need to complete the generic implementation of the BinaryTree
data structure first (see slides). Once it is complete, solve the problem above (note that the book
uses dots and dashes, we will use the asterisk (*) as the dot, hyphen (-) as a dash, and space ( ) as
the delimiter symbol between coded letters). Provide a menu program that asks the user to 1) test
output for all morse code letters with their respective translated alphabet letters (make sure you
are using the binary tree to do the actual translation, output as a nicely formatted table), 2) enter
an input file name to decode morse code and output the translated text to the screen, or 3) enter
in a line of morse code through the console to decode morse code and output the translated text
to the screen
relevenat picture of both the tree diagram and the table of morse code
Solution
JAVA CODE:
import java.io.*;
import java.util.*;
public class MorseCoder implements MorseCodeInterface {
private MorseNode root;
/**
* constructor to build the tree
*/
public MorseCoder() {
root = new MorseNode();
readTreeInfo();
}
/**
* reads in the tree info from the text file (helper method)
*/
private void readTreeInfo() {
Scanner input = null;
try {
input = new Scanner(new File(\"encodings.txt\"));
} catch (FileNotFoundException exception) {
System.out.println(\"File not found!\");
}
while (input.hasNextLine()) {
String data = input.nextLine().trim();
if (data.length() > 0) {
add(data.substring(1).trim(), data.charAt(0));
}
}
input.close();
}
/**
* adds the letter to the tree based on the mcode string (helper method)
* @param mcode the string being fed in
* @param ltr the letter being added at the node
*/
private void add(String mcode, char ltr) {
MorseNode current = root;
String signal = \" \";
for (int i = 0; i < mcode.length(); i++) {
signal = mcode.substring(i, i + 1);
if (signal.equals(\".\")) {
if (current.getLeft() != null) {
current = current.getLeft();
} else {
current.set.
Complete in JavaCardApp.javapublic class CardApp { private.pdf
Complete in Java
CardApp.java
public class CardApp {
private LinkedList list;
/**
* User interface prompts user, reads and writes files.
*/
public static void main(String[] args) {
}
/**
* Default constructor to initialize the deck
*/
public CardApp() {
}
/**
* Inserts a new Card into the deck
* @param card a playing Card
*/
public void addCard(Card card) {
}
/**
* Shuffles cards following this algorithm:
* First swaps first and last card
* Next, swaps every even card with the card 3
* nodes away from that card. Stops when it
* reaches the 3rd to last node
* Then, swaps ALL cards with the card that is
* 2 nodes away from it, starting at the 2nd card
* and stopping stopping at the 3rd to last node
*/
public void shuffle() {
}
/**
* Implements the bubble sort algorithm
* to sort cardList into sorted order, first by suit
* (alphabetical order)
* then by rank from 2 to A
*/
public void sort() {
}
/**
* Returns the deck of cards with each card separated
* by a blank space and a new line character at the end.
* @return The deck of cards as a string.
*/
@Override public String toString() {
return "";
}
}
Card.java
public class Card implements Comparable{
private String rank;
private String suit;
/**
* Constructor for the Card class
* @param rank the rank of card from 2 to A
* @param suit the suit of card C, D, H, or S
*/
public Card(String rank, String suit) {
}
/**
* Returns the card's rank
* @return rank a rank from 2 (low) to A (high)
*/
public String getRank() {
return "";
}
/**
* Returns the card's suit
* @return C, D, H, or S
*/
public String getSuit() {
return "";
}
/**
* Updates the card's rank
* @param rank a new rank
*/
public void setRank(String rank) {
}
/**
* Updates the card's suit
* @param suit the new suit
*/
public void setSuit(String suit) {
}
/**
* Concatenates rank and suit
* @return card rank and suit
*/
@Override public String toString() {
return "";
}
/**
* Overrides the equals method for Card
* Compares rank and suit and
* follows the equals formula given in
* Lesson 4 and also in Joshua Block's text
* @param obj another Object to compare for
* equality
* @return whether obj is a Card and, if so,
* of equal rank and suit
*/
@Override public boolean equals(Object obj) {
return false;
}
/**
* Orders two cards first by suit (alphabetically)
* Next by rank. "A" is considered the high card
* Order goes 2, 3, 4, 5, 6, 7, 8, 9, 10, J, Q, K, A
* @param card another Card to compare to this Card
* @return a negative number if this comes before c
* and a positive number if c comes before this
* and 0 if this and c are equal according to the above
* equals method
*/
@Override public int compareTo(Card card) {
return -1;
}
}
}
LinkedList.Java
import java.util.NoSuchElementException;
public class LinkedList {
private class Node {
private T data;
private Node next;
private Node prev;
public Node(T data) {
this.data = data;
this.next = null;
this.prev = null;
}
}
private int length;
private Node first;
private Node last;
private Node iterato.
20145-5SumII_CSC374-407_assign3.htmlCSC 374407 Computer Sy.docx
20145-5SumII_CSC374-407_assign3.html
CSC 374/407: Computer Systems II: 2015 Summer II, Assignment #3
Last modified 2015 August 6
Purpose:
To practice working with POSIX threads, mutexes and conditions;
and to practice good pointer programming in CAssignment:The "telephone" game (70 Points)Overview
We are going to simulate the children's game of "telephone".
In this game N (in our case, 10) children are in a circle.
The first one says something to the second.
The second one may or may not hear what the first one said accurately but he/she passes what he/she thinks was said to the third.
This continues until the message gets to the last child.
The program for our game has two classes.
The first one, Sentence holds the current state of a sentence.
It has been written for you, and all you have to do is use it.
The second one, MessageSystem holds mutexes, conditions and sentence pointer buffers between each child.
You'll have to finish this one.
For this assignment you have to:
You have to fill in the mutex and condition portions of MessageSystem.
Write the function void* child (void*) that the child threads will run.
Finish main() to invoke and wait for the child threads.
Each child i will get the pointer to its sentence from i-1 and will transmit it (imperfectly) to i.
Thus it needs to access two buffers: one at i-1 and the other at i.
All buffers are protected by mutexes, so child i-1 and child i don't step on each other's toes when trying to access the buffer at i-1.
Before child i can get the sentence pointer from the buffer at i-1 the sentence has to be there.
If it is not it should temporarily surrender the lock (if it obtained it) and wait until the sentence becomes available.
AssignmentCut and paste the following/*--------------------------------------------------------------------------*
*---- ----*
*---- telephoneGame ----*
*---- ----*
*---- This program simulates the children's game of "telephone", ----*
*---- where an original message mutates as it is imperfectly ----*
*---- transmited among children in a pairwise manner. ----*
*---- ----*
*---- It demonstrates Linux/Unix thread programming using ----*
*---- pthread_mutex_t and pthread_cond_t. ----*
*---- ----*
*---- Compile with: ----*
*---- linux> g++ -lpthread telephoneGame.cpp -o telephoneGame ----*
*---- ----*
*---- ---- ---- ---- ---- ---- ---- ---- ---- ----*
*---- ----*
*---- Version 1.0 Joseph Phillips 2010 October 23 ----*
*---- ----*
*--------------------------------------------------------------------------*/
/*--------------------------------------------------------------------------*
*---- ----*
*---- Includes and namespace designations: ----*
*---- ----*
*----------------------------------------------------------------------.
For this project, write a program that stores integers in a binary.docx
For this project, write a program that stores integers in a binary search tree.
The tree should use the BTNode class which is provided.
Write a test program that generates 20 random numbers in the range of -50 to 50 to build the tree and then uses preorderPrint,
inorderPrint, and postOrderPrint to display the contents of the tree.
To get an A implement a new method for the BTNode class which creates a Java vector class to contain
the data from all the nodes in the tree. The specification for this method is provided in the BTNode file.
Details about the Java vector class are provided in Appendix D, although the only vector method you'll use is addElement.
Also specify and implement in-order and post-order traversals and answer the question which of the
three new methods creates a vector with the entries sorted from smallest to largest?
Your test program should display the vectors created by your new methods rather than the print methods of BTNode.
// File: BTNode.java from the package edu.colorado.nodes
// Complete documentation is available from the BTNode link in:
// http://www.cs.colorado.edu/~main/docs/
package BTNode;
import java.util.Vector;
/******************************************************************************
* A <CODE>BTNode<<E></CODE> provides a node for a binary tree. Each node
* contains a piece of data (which is a reference to an E object) and references
* to a left and right child. The references to children may be null to indicate
* that there is no child. The reference stored in a node can also be null.
*
* <dl><dt><b>Limitations:</b> <dd>
* Beyond <CODE>Int.MAX_VALUE</CODE> elements, <CODE>treeSize</CODE>, is
* wrong.
*
* <dt><b>Java Source Code for this class:</b><dd>
* <A HREF="../../../../edu/colorado/nodes/BTNode.java">
* http://www.cs.colorado.edu/~main/edu/colorado/nodes/BTNode.java </A>
*
* @author Michael Main
* <A HREF="mailto:[email protected]"> ([email protected]) </A>
*
* @version
* Jul 22, 2005
******************************************************************************/
public class BTNode<E>
{
// Invariant of the BTNode<E> class:
// 1. Each node has one reference to an E Object, stored in the instance
// variable data.
// 2. The instance variables left and right are references to the node's
// left and right children.
private E data;
private BTNode<E> left, right;
/**
* Initialize a <CODE>BTNode</CODE> with a specified initial data and links
* children. Note that a child link may be the null reference,
* which indicates that the new node does not have that child.
* @param <CODE>initialData</CODE>
* the initial data of this new node
* @param <CODE>initialLeft</CODE>
* a reference to the left child of this new node--this reference may be null
* to indicate that there is no node after this new node.
* @param <CODE>initialRight</CODE>
.
Please read the comment ins codeExpressionTree.java-------------.pdf
Please read the comment ins code
ExpressionTree.java
----------------------------------
/**
* This is the class for Expression Tree.
* Used to create Expression Tree and Evaluate it
*/
/**
* Following logic is used to construct a Tree
* Here we use stack for Preparing Tree
* Loop through given Expression String
* If Character is Operand , Create node and push to stack
* If Character is Operator then
* 1)Create Node for Operator
* 2)Pop 2 nodes from Stack and Made
* OpretorNode--> left == first node pop
* OpretorNode--> right == second node pop
* At the end of creation of Expression Tree, Stack have only one node , which is root of
Expression tree
*/
/** Class ExpressionTree **/
class ExpressionTree
{
/** class TreeNode
* Stored Character ==> Digit(0..9) or a Operator +,-,*,/
* Left Node and Right Node
*
* **/
class TreeNode
{
char data;
TreeNode left, right;
/** constructor **/
public TreeNode(char data)
{
this.data = data;
this.left = null;
this.right = null;
}
}
/** class StackNode **/
class StackNode
{
TreeNode treeNode;
StackNode next;
/** constructor **/
public StackNode(TreeNode treeNode)
{
this.treeNode = treeNode;
next = null;
}
}
private static StackNode top;
/** constructor
* Constructor takes input string like \"+-+7*935*82*625\"
* Input should be in Prefix notation
* **/
public ExpressionTree(String expression)
{
top = null;
//Call Method for prepare expression tree
buildTree(expression);
}
/** function to clear tree **/
public void clear()
{
top = null;
}
/** function to push a node **/
private void push(TreeNode ptr)
{
if (top == null)
top = new StackNode(ptr);
else
{
StackNode nptr = new StackNode(ptr);
nptr.next = top;
top = nptr;
}
}
/** function to pop a node
* When it find operator pop 2 elements from Stack
*
* **/
private TreeNode pop()
{
if (top == null)
throw new RuntimeException(\"Underflow\");
else
{
TreeNode ptr = top.treeNode;
top = top.next;
return ptr;
}
}
/** function to get top node **/
private TreeNode peek()
{
return top.treeNode;
}
/** function to insert character **/
private void insert(char val)
{
try
{
//If Operand , Create node and push to Stack
if (isDigit(val))
{
TreeNode nptr = new TreeNode(val);
push(nptr);
}
//If Operator , Create node and popup 2 elements and make them its right and left
else if (isOperator(val))
{
TreeNode nptr = new TreeNode(val);
nptr.left = pop();
nptr.right = pop();
push(nptr);
}
}
catch (Exception e)
{
System.out.println(\"Invalid Expression\");
}
}
/** function to check if digit **/
private boolean isDigit(char ch)
{
return ch >= \'0\' && ch <= \'9\';
}
/** function to check if operator **/
private boolean isOperator(char ch)
{
return ch == \'+\' || ch == \'-\' || ch == \'*\' || ch == \'/\';
}
/** function to convert character to digit **/
private int toDigit(char ch)
{
return ch - \'0\';
}
/** function to build tree from input */
public void buildTree(String eqn)
{
for (int i = eqn.length() - 1; i >= 0; i--)
insert(eqn.charAt(i));
}
/** function to evaluate tree */
public dou.
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.
java question Fill the add statement areaProject is to wo.pdf
java question: \"Fill the add statement area\"
Project is to work with stacks.
package p2;
public class Coordinate {
public int x;
public int y;
public Coordinate( int x, int y ) {
this.x = x;
this.y = y;
}
public String toString() {
return \"(\" + this.x + \",\" + this.y + \")\";
}
@Override
public boolean equals( Object object ) {
if( object == null ) {
return false;
}
if( ! Coordinate.class.isAssignableFrom( object.getClass() )) {
return false;
}
final Coordinate other = (Coordinate) object;
return this.x == other.x && this.y == other.y;
}
}
package p2;
public class Coordinate {
public int x;
public int y;
public Coordinate( int x, int y ) {
this.x = x;
this.y = y;
}
public String toString() {
return \"(\" + this.x + \",\" + this.y + \")\";
}
@Override
public boolean equals( Object object ) {
if( object == null ) {
return false;
}
if( ! Coordinate.class.isAssignableFrom( object.getClass() )) {
return false;
}
final Coordinate other = (Coordinate) object;
return this.x == other.x && this.y == other.y;
}
}
package p2;
import java.util.Vector;
public class Maze {
private char[][] maze;
private int height;
private int width;
/**
* Create a new Maze of the specified height and width, initializing every
* location as empty, with a \' \'.
**/
public Maze( int width, int height ) {
// ADD STATEMENTS HERE
}
/**
* Mutator to allow us to set the specified Coordinate as blocked,
* marking it with a \'X\'
**/
public void setBlocked( Coordinate coord ) {
// ADD STATEMENTS HERE
}
/**
* Mutator to allow us to set the specified Coordinate as having been visited,
* marking it with a \'*\'
**/
public void setVisited( Coordinate coord ) {
// ADD STATEMENTS HERE
}
/**
* Mutator to allow us to set the specified Coordinate as part of the path solution,
* marking it with a \'.\'
**/
public void setPath( Coordinate coord ) {
// ADD STATEMENTS HERE
}
/**
* Returns the character at the locatio specified by the Coordinate
**/
public char at( Coordinate coord ) {
// ADD STATEMENTS HERE
}
/**
* Returns a Coordinate array containing all Coordinates that are clear around
* the specified coordinate.
**/
public Coordinate[] clearAround( Coordinate coord ) {
Vector vector = new Vector();
// ADD STATEMENTS HERE
// Look at each of the locations around the specified Coordinate, and add it
// to the vector if it is clear (i.e. a space)
return vector.toArray( new Coordinate[0] );
}
/**
* Returns a Coordinate that provides the entrance location in this maze.
**/
public Coordinate start() {
return new Coordinate( 0, 1 );
}
/**
* Returns a Coordinate that provides the exit location from this maze.
**/
public Coordinate end() {
// ADD STATEMENTS HERE
}
/**
* The toString() method is responsible for creating a String representation
* of the Maze. See the project specification for sample output. Note that
* the String representation adds numbers across the top and side of the Maze
* to show the Coordinates of each cell in the maze.
**/
public String toString() {
StringBuilder buffer =.
Interview C++11 code
C++11 code to solve an interview problem, please also see "Interview UML design".
Introduction to Dart
Introduction to Google's Dart Programming language, with a brief overview of the major language features.
CS117-S18-AlharbiMohammed-master.gitignore.class.ctxt..docx
CS117-S18-AlharbiMohammed-master/.gitignore
*.class
*.ctxt
*.*~
doc
/.project
default.log
defaultlog.txt
CS117-S18-AlharbiMohammed-master/Command.javaCS117-S18-AlharbiMohammed-master/Command.javaimport java.util.ArrayList;
/**
* This class is part of the "Campus of Kings" application. "Campus of Kings" is a
* very simple, text based adventure game.
*
* This class holds information about a command that was issued by the user. A
* command currently consists of two strings: a command word and a second word
* (for example, if the command was "take map", then the two strings obviously
* are "take" and "map").
*
* The way this is used is: Commands are already checked for being valid command
* words. If the user entered an invalid command (a word that is not known) then
* the command word is <null>.
*
* If the command had only one word, then the second word is <null>.
*
* @author Maria Jump
* @version 2015.02.01
*/
publicclassCommand{
/** The command word for this command. */
privateString commandWord;
/** The rest of the line with all the spaces removed. */
privateArrayList<String> restOfLine;
/**
* Create a command object. First is supplied. The second word is assumed
* to be null.
*
* @param firstWord
* The first word of the command. Null if the command was not
* recognized.
*/
publicCommand(String firstWord){
commandWord = firstWord;
restOfLine =newArrayList<String>();
}
/**
* Create a command object. First and second word must be supplied, but
* either one (or both) can be null.
*
* @param firstWord
* The first word of the command. Null if the command was not
* recognized.
* @param rest
* The rest of the command.
*/
publicCommand(String firstWord,ArrayList<String> rest){
commandWord = firstWord;
restOfLine = rest;
}
/**
* Return the command word (the first word) of this command. If the command
* was not understood, the result is null.
*
* @return The command word.
*/
publicString getCommandWord(){
return commandWord;
}
/**
* Returns if this command was not understood.
*
* @return true if this command was not understood.
*/
publicboolean isUnknown(){
return(commandWord ==null);
}
/**
* Returns if this command has a second word.
*
* @return true if the command has a second word.
*/
publicboolean hasSecondWord(){
return restOfLine !=null;
}
/**
* Returns if this command has more words.
*
* @param index The index of the word needed.
* @return true if the command has a word at given index.
*/
publicboolean hasWord(int index){
return index >=0&& index < restOfLine.size();
}
/**
* Returns the word at the requested index in the command.
*
* @param index
* The index of word in the command that is being requested.
*
* @ret.
Lab Assignment 4 CSE330 Spring 2014 Skeleton Code for ex.docx
/* Lab Assignment 4 CSE330 Spring 2014 */
/* Skeleton Code for ex0 of lab4 */
/* No code will be provided for ex1 of lab4 */
#include <stdio.h> /* for NULL */
#include <ctype.h> /* for atoi() */
#include <errno.h> /* for perror() */
#include <signal.h> /* for sigvec() etc. */
#include <sys/types.h> /* for <arpa/inet.h> */
#include <sys/socket.h> /* for PF_INET, etc. */
#include <netinet/in.h> /* for struct sockaddr_in */
#include <arpa/inet.h> /* for inet_addr() */
#include <sys/time.h>
#include "lab4.h"
/* this is in netinet/in.h; included here for reference only.
struct sockaddr_in {
short sin_family;
u_short sin_port;
struct in_addr sin_addr;
char sin_zero[8];
};
*/
/***************************************************************************/
#define LINESIZE 80
#define TYPE0TIMEOUT 3
#define TYPE1TIMEOUT 30
/* You should give a long timeout, like 30sec, otherwise */
/* duplicated responses from the server may cause some problem */
#define MAXRETRY 3
/***************************************************************************/
static char *RCSId="$Id: client2.c,v 4 2014/04/20 03:15:07 cse3300 Exp $";
/***************************************************************************/
/* some functions you may find useful if you implement them */
extern int stringToAddress(char *s, struct sockaddr_in *a);
extern int msgok(LABMSG *);
extern u_short msgchecksum(u_short *);
extern void alarmCatcher(void);
extern int tries; /* for retransmission routines */
int numtries;
/***** this will die ****/
FILE *logFile;
void die(char *s)
{
perror(s);
exit(2);
}
void startTimer(int secs)
{
alarm(secs);
}
void stopTimer(void)
{
alarm(0);
}
/* should change it by yourself if needed!!! */
void printResponse(LABMSG *mp, int ck)
{
int type;
mp->courseEtc = ntohs(mp->courseEtc);
type = ( (mp->courseEtc & MESSAGETYPE) !=0)?1:0;
printf("course=%d, Type=%d\n", mp->courseEtc&0x3fff,type);
if (ntohl(mp->cookie) != ck)
printf("Cookies don't match: sent %x received %x\n",mp->cookie,ck);
if (mp->courseEtc & REQRESP)
printf("response ");
else {
printf("request??\n");
return;
}
mp->result = ntohs(mp->result);
/*printf(" result = %x: ",mp->result);*/
if (mp->result&TRANSOUTCOME) { /* Check outcome */
printf("error: ");
switch (mp->result & 0x7fff) {
case ERROR_CHECKSUM:
printf("checksum failure\n");
break;
case ERROR_SYNTAX:
printf("syntax error\n");
break;
case ERROR_UNKSSN:
printf("unknown SSN %d\n", ntohl(mp->reqSSN) );
break;
case ERROR_SERVER:
printf("Unspecified Server Error\n");
default:
printf("Unknown Error.\n");
} /* case switch */
} else { /* successful transaction */
if(type)printf("Test succeeded.");
if (!type) /* Type 0 -- print SSN and Response */
printf(": %d -> %d\n", ntohl(mp->reqSSN), mp->result&0x7fff);
else
printf("\n"); /* XXX print number of responses */
}
}
/*-----------------------------------*/
/* added by ZXC:
this fun ...
CoffeeScript - An Introduction
An interesting presentation for learning the language from very basic. It provides very good insight to the language. JavaScript is the only prerequisite. It comes with a lot of examples that helps to learn the basics very quickly. Here is the SkyDrive download link http://sdrv.ms/16T7whf
Please do Part A, Ill be really gratefulThe main.c is the skeleto.pdf
Please do Part A, I'll be really grateful
The main.c is the skeleton code, the content of main.c is given below:
#include
#include
/* a rtpkt is the packet sent from one router to
another*/
struct rtpkt {
int sourceid; /* id of sending router sending this pkt */
int destid; /* id of router to which pkt being sent
(must be an directly connected neighbor) */
int *mincost; /* min cost to all the node */
};
struct distance_table
{
int **costs; // the distance table of curr_node, costs[i][j] is the cost from node i to node j
};
/*****************************************************************
***************** NETWORK EMULATION CODE STARTS BELOW ***********
The code below emulates the layer 2 and below network environment:
- emulates the transmission and delivery (with no loss and no
corruption) between two physically connected nodes
- calls the initializations routine rtinit once before
beginning emulation for each node.
You should read and understand the code below. For Part A, you should fill all parts with
annotation starting with "Todo". For Part B and Part C, you need to add additional routines for
their features.
******************************************************************/
struct event {
float evtime; /* event time */
int evtype; /* event type code */
int eventity; /* entity (node) where event occurs */
struct rtpkt *rtpktptr; /* ptr to packet (if any) assoc w/ this event */
struct event *prev;
struct event *next;
};
struct event *evlist = NULL; /* the event list */
struct distance_table *dts;
int **link_costs; /*This is a 2D matrix stroing the content defined in topo file*/
int num_nodes;
/* possible events: */
/*Note in this lab, we only have one event, namely FROM_LAYER2.It refer to that the packet
will pop out from layer3, you can add more event to emulate other activity for other layers. Like
FROM_LAYER3*/
#define FROM_LAYER2 1
float clocktime = 0.000;
/********************* EVENT HANDLINE ROUTINES *******/
/* The next set of routines handle the event list */
/*****************************************************/
void rtinit(struct distance_table *dt, int node, int *link_costs, int num_nodes)
{
/* Todo: Please write the code here*/
}
void rtupdate(struct distance_table *dt, struct rtpkt recv_pkt)
{
/* Todo: Please write the code here*/
}
void main(int argc, char *argv[])
{
struct event *eventptr;
/* Todo: Please write the code here to process the input.
Given different flag, you have different number of input for part A, B, C.
Please write your own code to parse the input for each part.
Specifically, in part A you need parse the input file and get num_nodes,
and fill in the content of dts and link_costs */
dts = (struct distance_table *) malloc(num_nodes * sizeof(struct distance_table));
link_costs = (int **) malloc(num_nodes * sizeof(int *));
for (int i = 0; i < num_nodes; i++)
{
link_costs[i] = (int *)malloc(num_nodes * sizeof(int));
}
for (int i = 0; i < num_nodes; i++)
{
rtinit(&dts[i], i, link_costs[i], num_nodes);
}
whil.
(In java language)1. Use recursion in implementing the binarySearc.pdf
(In java language)
1. Use recursion in implementing the binarySearch method
2. Use Generics in implementing different methods
3. Use the attached driver. Do not modify the driver
Please put answers into the skeleton / complete the following given skeleton with the code in
java language:
import java.util.ArrayList;
public class MyGenerics{
//Declarations
//****************************************************************************
//No-argument constructor:
//****************************************************************************
public MyGenerics (){
}//end of constructor
//****************************************************************************
//max: Receives a generic one-dimensional array and returns the maximum
// value in the array.
//****************************************************************************
public > E max(E[] list){
return null;
}//end of max
//****************************************************************************
//max: Receives a generic two-dimensional array and returns the maximum
// value in the array.
//****************************************************************************
public > E max(E[][] list) {
return null;
}
//****************************************************************************
//largest: Receives a generic arrayList and returns the maximum
// value in the array.
//****************************************************************************
public > E largest(ArrayList list) {
return null;
}
//****************************************************************************
//binarySearch: Receives a generic one-dimensional array and a generic key
// and returns the location of the key (positive) or
// a negative location if not found.
//****************************************************************************
public > int binarySearch(E[] list, E key) {
int low = 0;
int high = list.length - 1;
return binarySearch (list, key, low, high);
}
public > int binarySearch(E[] list, E key, int low, int high) {
return -99; // update
}
//****************************************************************************
//sort: Receives a generic arrayList and returns nothing.
//****************************************************************************
public > void sort(ArrayList list) {
}
//****************************************************************************
//sort: Receives a generic one-dimensional array and returns nothing.
//****************************************************************************
public > void sort(E[] list) {
}
//****************************************************************************
//displayOneDList: Receives a generic one-dimensional array and displays its contents
//****************************************************************************
public void displayOneDList(E[] list, String listName){
}
//****************************************************************************
//displayTwoDList: Receives a generic two-dimensional array & a string .
New folderjsjfArrayStack.classpackage jsjf;publicsynchronize.docx
New folder/jsjf/ArrayStack.classpackage jsjf;
publicsynchronizedclass ArrayStack implements StackADT {
privatestaticfinal int DEFAULT_CAPACITY = 100;
private int top;
private Object[] stack;
public void ArrayStack();
public void ArrayStack(int);
public void push(Object);
private void expandCapacity();
public Object pop() throws exceptions.EmptyCollectionException;
public Object peek() throws exceptions.EmptyCollectionException;
public int size();
public boolean isEmpty();
public String toString();
}
New folder/jsjf/ArrayStack.javaNew folder/jsjf/ArrayStack.javapackage jsjf;
import jsjf.exceptions.*;
import java.util.Arrays;
// -------------------------------------------------------
// Author: Yifu Wu
// Date: 03/10/16
// Source Name: ArrayStack<T>
// Due date: 03/10/16
// Description:
/**
* An array implementation of a stack in which the bottom of the
* stack is fixed at index 0.
*
* @author Java Foundations
* @version 4.0
*/
publicclassArrayStack<T>implementsStackADT<T>
{
privatefinalstaticint DEFAULT_CAPACITY =100;
privateint top;
private T[] stack;
/**
* Creates an empty stack using the default capacity.
*/
publicArrayStack()
{
this(DEFAULT_CAPACITY);
}
/**
* Creates an empty stack using the specified capacity.
* @param initialCapacity the initial size of the array
*/
publicArrayStack(int initialCapacity)
{
top =0;
stack =(T[])(newObject[initialCapacity]);
}
/**
* Adds the specified element to the top of this stack, expanding
* the capacity of the array if necessary.
* @param element generic element to be pushed onto stack
*/
publicvoid push(T element)
{
if(size()== stack.length)
expandCapacity();
stack[top]= element;
top++;
}
/**
* Creates a new array to store the contents of this stack with
* twice the capacity of the old one.
*/
privatevoid expandCapacity()
{
//stack = Arrays.copyOf(stack, stack.length * 2);
System.out.println("Expanding stack capacity\n");
T[] temp =(T[])(newObject[2*top]);
for(int i=0; i< top; i++)
temp[i]= stack[i];
stack = temp;
}
/**
* Removes the element at the top of this stack and returns a
* reference to it.
* @return element removed from top of stack
* @throws EmptyCollectionException if stack is empty
*/
public T pop()throwsEmptyCollectionException
{
if(isEmpty())
thrownewEmptyCollectionException("stack");
top--;
T result = stack[top];
stack[top]=null;
return result;
}
/**
* Returns a reference to the element at the top of this stack.
* The element is not removed from the stack.
* @return element on top of stack
* @throws EmptyCollectionException if stack is empty
*/
public T peek()throwsEmptyCollectionException
{
if(isEmpty())
thrownewEmptyCollectionException("stack");
return stack[top-1];
}
/**
* Returns the number of elements in ...
Checking Oracle VM VirtualBox. Part 2
Virtual machines are used for very different tasks. Personally I have been using VirtualBox for many
years to test software and simply study various Linux distributions. And now, after years of using the
tool and encountering undefined behavior every now and then, I've decided to make use of my
experience in analysis of open-source projects and check the source code of Oracle VM Virtual Box.In
this article, I will continue describing the numerous suspicious fragments found in the project.
The first part of the article: Checking Oracle VM VirtualBox. Part 1.
Game Design and Development Workshop Day 1
This course teaches you how to build awesome video games using Cocos2Dx. Cocos2Dx is a feature packed, free game development engine. It is cross platform, high performance, and supports three languages: C++, Lua and JavaScript. With it, you can write games for iOS, Android, Windows, Mac, and the Web. It is nothing short of amazing and this course teaches you how to use it. We will program Cocos2Dx in JavaScript, but this is not a programming class. If you don't know how to write code in JavaScript or some other curly brace language, this is not the course for you. For those whose JavaScript is rusty, we will do quick language overview. Don't let the JavaScript part fool you. Cocos2Dx is built from highly optimized C++ and OpenGL, JavaScript is used for game logic, not graphics. Our games will run at a super fast, 60 frames a second.
In this lab, we will write an application to store a deck of cards i.pdf
In this lab, we will write an application to store a deck of cards in a linked list, and then write
methods to sort and shuffle the deck.
Copy your completed LinkedList class from Lab 4 into the LinkedList.java file below.
Complete all methods of the Card class as described by the Javadoc comments. The class
contains both a suit and a rank. A suit is one of the categories into which the cards of a deck are
divided. The rank is the relative importance of the card within its suit.
Note that the Card constructor must convert any rank and suit letters to uppercase.
For the equals() method, be sure to follow the steps outlined in Lesson 4. How to implement the
compareTo() method is also covered in Lesson 4.
Note that you are not allowed to add any additional methods or member variables to this class or
you will not receive credit for this assignment.
Complete all methods of the CardApp class in the CardApp.java file as described by the Javadoc
comments.
You may add as many methods as you would like to this file, but are not allowed to add any
additional member variables.
The CardApp program must prompt for and allow the user to enter the name of any input file as
shown in the Example output below.
Implement the shuffle() method as specified in the comments for shuffle(). After you have
shuffled the deck of cards, write the result into a file named shuffled.txt.
Implement the sort() method using bubble sort from Lesson 4. First sort by suit in alphabetical
order and then by rank from 2 to A. The pseudocode for bubble sort is as follows:
After you have sorted the deck of cards, write the result to a file named sorted.txt.
The CardApp.java file also contains the main() method of the application. Use Develop mode to
test your CardApp code along with your Card and LinkedList code.
All input and output files must contain a list of cards, with each card stored on its own line. See
the example files cards1.txt and cards2.txt for example file formats.
[[[cards1.txt]]]
2H
3H
4H
5H
6H
7H
8H
9H
10H
JH
[[[cards2.txt]]]
AS
2S
3S
4S
5S
6S
7S
8S
9S
10S
JS
QS
KS
AC
2C
3C
4C
5C
6C
7C
8C
9C
10C
JC
QC
KC
AH
2H
3H
4H
5H
6H
7H
8H
9H
10H
JH
QH
KH
AD
2D
3D
4D
5D
6D
7D
8D
9D
10D
JD
QD
KD
[[[CardApp.java]]]
/**
* CardApp.java
* @author Your name
* @author Partner's name
* CIS 22C, Applied Lab 1
*/
public class CardApp {
private LinkedList list;
/**
* User interface prompts user, reads and writes files.
*/
public static void main(String[] args) {
}
/**
* Default constructor to initialize the deck
*/
public CardApp() {
}
/**
* Inserts a new Card into the deck
* @param card a playing Card
*/
public void addCard(Card card) {
}
/**
* Shuffles cards following this algorithm:
* First swaps first and last card
* Next, swaps every even card with the card 3
* nodes away from that card. Stops when it
* reaches the 3rd to last node
* Then, swaps ALL cards with the card that is
* 2 nodes away from it, starting at the 2nd card
* and stopping stopping at the 3rd to last node
*/
public vo.
Assg 12 Binary Search Trees COSC 2336assg-12.cppAssg 12 Binary .docx
Assg 12 Binary Search Trees COSC 2336/assg-12.cppAssg 12 Binary Search Trees COSC 2336/assg-12.cpp/**
* @author Jane Programmer
* @cwid 123 45 678
* @class COSC 2336, Spring 2019
* @ide Visual Studio Community 2017
* @date April 8, 2019
* @assg Assignment 12
*
* @description Assignment 12 Binary Search Trees
*/
#include<cassert>
#include<iostream>
#include"BinaryTree.hpp"
usingnamespace std;
/** main
* The main entry point for this program. Execution of this program
* will begin with this main function.
*
* @param argc The command line argument count which is the number of
* command line arguments provided by user when they started
* the program.
* @param argv The command line arguments, an array of character
* arrays.
*
* @returns An int value indicating program exit status. Usually 0
* is returned to indicate normal exit and a non-zero value
* is returned to indicate an error condition.
*/
int main(int argc,char** argv)
{
// -----------------------------------------------------------------------
cout <<"--------------- testing BinaryTree construction ----------------"<< endl;
BinaryTree t;
cout <<"<constructor> Size of new empty tree: "<< t.size()<< endl;
cout << t << endl;
assert(t.size()==0);
cout << endl;
// -----------------------------------------------------------------------
cout <<"--------------- testing BinaryTree insertion -------------------"<< endl;
//t.insert(10);
//cout << "<insert> Inserted into empty tree, size: " << t.size() << endl;
//cout << t << endl;
//assert(t.size() == 1);
//t.insert(3);
//t.insert(7);
//t.insert(12);
//t.insert(15);
//t.insert(2);
//cout << "<insert> inserted 5 more items, size: " << t.size() << endl;
//cout << t << endl;
//assert(t.size() == 6);
cout << endl;
// -----------------------------------------------------------------------
cout <<"--------------- testing BinaryTree height -------------------"<< endl;
//cout << "<height> Current tree height: " << t.height() << endl;
//assert(t.height() == 3);
// increase height by 2
//t.insert(4);
//t.insert(5);
//cout << "<height> after inserting nodes, height: " << t.height()
// << " size: " << t.size() << endl;
//cout << t << endl;
//assert(t.height() == 5);
//assert(t.size() == 8);
cout << endl;
// -----------------------------------------------------------------------
cout <<"--------------- testing BinaryTree clear -------------------"<< endl;
//t.clear();
//cout << "<clear> after clearing tree, height: " << t.height()
// << " size: " << t.size() << endl;
//cout << t << endl;
//assert(t.size() == 0);
//assert(t.height() == 0);
cout << endl;
// return 0 to indicate successful completion
return0;
}
Assg 12 Binary Search Trees COSC 2336/assg-12.pdf
Assg 12: Binary Search Trees
COSC 2336 Spring 2019
April 10, 2019
Dates:
Due: Sunday April 21, by Midnight
Objectives
� Practice recursive algorithms
� Learn how to construct a binary tree usi ...
Please write the C++ code that would display the exact same output a.pdf
Please write the C++ code that would display the exact same output as provided. Thank you.
main.cpp
#include "TreeNode.h"
//GIVEN
void inorderTraversal(TreeNode * root);
//TODO
TreeNode * search(TreeNode * node,int data);
//GIVEN
void insert(TreeNode * node,int data);
//GIVEN
bool isNull(TreeNode * node){
return node==nullptr;
}
int main() {
// create the root, gets set to null
TreeNode * root;
// create the roor and set the data of root to 5
root= new TreeNode(5);
//create two additional nodes with data values 10 and 3
// these will go to the right and left of root respectively
TreeNode * ten= new TreeNode(10);
TreeNode * three= new TreeNode(3);
//connect ten to the right of root (which has data 5)
root->setRight(ten);
//connect three to the left of root (which has data 5)
root->setLeft(three);
// note this can also be done as
//root.setRight(new TreeNode(10));
//root.setLeft(new TreeNode(3);)
// add two more nodes
//the first has data value 7. So to keep the tree in insorted order, it should get attached as the
left node of ten
// the second has data value 4. So to keep the tree in insorted order, it should get attached as the
right node of three
ten->addLeft(7);
three->addRight(4);
std::cout<<"**************************************\n";
std::cout<<"Printing the Inorder Traversal\n";
inorderTraversal(root);
std::cout<<"**************************************\n";
std::cout<<"Searching for Node \n";
TreeNode* result = search(root,4);
if (result!=nullptr){
std::cout<<"Found "<getData()<<"\n";
}
else
std::cout<<"Not Found "<<4<<"\n";
result = search(root,1);
if (result!=nullptr){
std::cout<<"Found "<getData()<<"\n";
}
else
std::cout<<"Not Found "<<1<<"\n";
std::cout<<"**************************************\n";
std::cout<<"Inserting 6\n";
insert(root,6);
std::cout<<"**************************************\n";
std::cout<<"Printing the Inorder Traversal\n";
inorderTraversal(root);
}
// uses recursion
void inorderTraversal(TreeNode * node){
// exit case
if (isNull(node)) return;
if (node->isLeaf()){
std::cout<<"Printing Leaf Node "<getData()<<"\n";
return;}
// reached a node with no left, so print the node and travel right
if (!isNull(node->getLeft()))
// if there is a left path, then travel further on that
inorderTraversal(node->getLeft());
std::cout<<"Printing Node "<getData()<<"\n";
// save and travel the right path of the current node being processed
inorderTraversal(node->getRight());
}
// uses recursion
//TODO
TreeNode * search(TreeNode * node, int data){
// if the node is null return the null ptr
//if this nodes data equals the search date return found
// if not, if the left tree exists and search data less than
//this nodes data return the result of recursive all to search with left pointer
// if no left tree, but right tree exists and search data greater than
//this nodes data return the result of recursive all to search with right pointer
// if both above conditions not true return null ptr
}
//uses recursion
void insert(TreeNode * node,int .
Fix my codeCode.pdf
Fix my code:
Code:
/***************************************************************************
* A Linked List class with a private static inner Node class.
*
*****************************************************************************/
import java.util.*;
public class MySingleLinkedList
{
private Node head;
/**
* Constructs an empty list
*/
public MySingleLinkedList()
{
head = null;
}
/**
* Returns true if the list is empty
* @return true/false - empty/not empty
*/
public boolean isEmpty()
{
return head == null;
}
/**
* Inserts a new node at the beginning of this list.
* @param item - element to add
*
*/
public void addFirst(E item)
{
head = new Node(item, head);
}
/**
* Returns the first element in the list.
* @return the head of the list
* @exception NoSuchElementException if an empty list
*/
public E getFirst()
{
if(head == null) throw new NoSuchElementException();
return head.data;
}
/**
* Removes the first element in the list.
* @return head of the list
*
*/
public E removeFirst()
{
E tmp = getFirst();
head = head.next;
return tmp;
}
/**
* Inserts a new node to the end of this list.
* @param item - the element to add at the end of list
*/
public void addLast(E item)
{
if( head == null)
addFirst(item);
else
{
Node tmp = head;
while(tmp.next != null) tmp = tmp.next;
tmp.next = new Node(item, null);
}
}
/**
* Removes all nodes from the list.
*
*/
public void clear()
{
head = null;
}
/**
* Inserts a new node after the first appearance of the node containing the key
* @param key - the data of existing node included in the list
* @param toInsert - the data of the new node to be inserted
*/
public void insertAfter(E key, E toInsert)
{
Node tmp = head;
while(tmp != null && !tmp.data.equals(key))
tmp = tmp.next;
if(tmp != null)
tmp.next = new Node(toInsert, tmp.next);
}
/*
* ================================ The following functions need to be filled
===================================================
*
*/
/**
* Returns the last element in the list.
* @return last element in the list
* @throws NoSuchElementException if the list is empty
*/
public E getLast()
{
// TODO: please fill your code here.
Node tmp = head;
while(tmp.next != null) {
tmp = tmp.next;
}
return tmp.data;
}
/**
* Returns true if this list contains the specified element.
* @param item - element to be checked
* @return True - if contained; otherwise False
*
*/
public boolean contains(E item)
{
Node tmp = head;
while (tmp != null && !tmp.data.equals(item))
tmp = tmp.next;
if (tmp.data.equals(item) ) {
return true;
}
return false;
}
/**
* Returns the data at the specified position in the list.
* @param the position index
* @return the data contained at the given position index
* @throws IndexOutOfBoundsException if pos is larger than the size of list
*
*/
public E get(int pos)
{
Node tmp = head;
int i = 0;
while (i < pos) {
i++;
tmp = tmp.next;
}
return tmp.data;
}
/**
* Inserts a new node before the first appearance of the node containing the key.
* @param key the data of existing.
(Need in 2 hours) 100 plagiarism freeIn our society as we deal .docx
(Need in 2 hours) 100% plagiarism free
In our society as we deal on a daily basis with threats and opportunities we often don’t consider the events that got us to where we are today. We just try to work ahead and make something that is new or better than what we perceive we have now. In doing so we may be repeating mistakes from the past and we may be overlooking some success that has already occurred. Itis important to know the history of the type of venture that we are engaged in so that we can use our time and resources efficiently. This can certainly be said of police/citizen relations.
For this week’s assignment consider how American policing has evolved from its earliest beginnings until now. Analyze the memorable events and remarkable people who influenced the development of our system and describe why changes were made and how effective they have been. Critically examine the early founding principles of policing, such as those suggested by Sir Robert Peel and apply those principles to what is actually happening today.
Write a 1 page APA style paper. Only the body of the paper will count toward the word requirement (title page and references are in addition to the 1 pages)
In your paper, cite at least 2-3 references using the APA style guide format for in-text citation.
Only one reference may be found on the internet. The other references must be found in the library (this includes EBSCO Host and the Gale Criminal Justice
Collection
).
Click
here
to view your assignment rubric.
.
(Minimum of 250 words with peer review reference ) I am a nurse.docx
(Minimum of 250 words with peer review reference )
I am a nurse working in the emergency room)
In your own words, define
translational research
and how it connects to your role, either individually or in collective practice. Describe how you might use it in your current or anticipated future setting.
.
More Related Content
Similar to MIS 4310-01 Final Take Home Exam (100 points) DUE Thursd.docx
Please read the comment ins codeExpressionTree.java-------------.pdf
Please read the comment ins code
ExpressionTree.java
----------------------------------
/**
* This is the class for Expression Tree.
* Used to create Expression Tree and Evaluate it
*/
/**
* Following logic is used to construct a Tree
* Here we use stack for Preparing Tree
* Loop through given Expression String
* If Character is Operand , Create node and push to stack
* If Character is Operator then
* 1)Create Node for Operator
* 2)Pop 2 nodes from Stack and Made
* OpretorNode--> left == first node pop
* OpretorNode--> right == second node pop
* At the end of creation of Expression Tree, Stack have only one node , which is root of
Expression tree
*/
/** Class ExpressionTree **/
class ExpressionTree
{
/** class TreeNode
* Stored Character ==> Digit(0..9) or a Operator +,-,*,/
* Left Node and Right Node
*
* **/
class TreeNode
{
char data;
TreeNode left, right;
/** constructor **/
public TreeNode(char data)
{
this.data = data;
this.left = null;
this.right = null;
}
}
/** class StackNode **/
class StackNode
{
TreeNode treeNode;
StackNode next;
/** constructor **/
public StackNode(TreeNode treeNode)
{
this.treeNode = treeNode;
next = null;
}
}
private static StackNode top;
/** constructor
* Constructor takes input string like \"+-+7*935*82*625\"
* Input should be in Prefix notation
* **/
public ExpressionTree(String expression)
{
top = null;
//Call Method for prepare expression tree
buildTree(expression);
}
/** function to clear tree **/
public void clear()
{
top = null;
}
/** function to push a node **/
private void push(TreeNode ptr)
{
if (top == null)
top = new StackNode(ptr);
else
{
StackNode nptr = new StackNode(ptr);
nptr.next = top;
top = nptr;
}
}
/** function to pop a node
* When it find operator pop 2 elements from Stack
*
* **/
private TreeNode pop()
{
if (top == null)
throw new RuntimeException(\"Underflow\");
else
{
TreeNode ptr = top.treeNode;
top = top.next;
return ptr;
}
}
/** function to get top node **/
private TreeNode peek()
{
return top.treeNode;
}
/** function to insert character **/
private void insert(char val)
{
try
{
//If Operand , Create node and push to Stack
if (isDigit(val))
{
TreeNode nptr = new TreeNode(val);
push(nptr);
}
//If Operator , Create node and popup 2 elements and make them its right and left
else if (isOperator(val))
{
TreeNode nptr = new TreeNode(val);
nptr.left = pop();
nptr.right = pop();
push(nptr);
}
}
catch (Exception e)
{
System.out.println(\"Invalid Expression\");
}
}
/** function to check if digit **/
private boolean isDigit(char ch)
{
return ch >= \'0\' && ch <= \'9\';
}
/** function to check if operator **/
private boolean isOperator(char ch)
{
return ch == \'+\' || ch == \'-\' || ch == \'*\' || ch == \'/\';
}
/** function to convert character to digit **/
private int toDigit(char ch)
{
return ch - \'0\';
}
/** function to build tree from input */
public void buildTree(String eqn)
{
for (int i = eqn.length() - 1; i >= 0; i--)
insert(eqn.charAt(i));
}
/** function to evaluate tree */
public dou.
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.
java question Fill the add statement areaProject is to wo.pdf
java question: \"Fill the add statement area\"
Project is to work with stacks.
package p2;
public class Coordinate {
public int x;
public int y;
public Coordinate( int x, int y ) {
this.x = x;
this.y = y;
}
public String toString() {
return \"(\" + this.x + \",\" + this.y + \")\";
}
@Override
public boolean equals( Object object ) {
if( object == null ) {
return false;
}
if( ! Coordinate.class.isAssignableFrom( object.getClass() )) {
return false;
}
final Coordinate other = (Coordinate) object;
return this.x == other.x && this.y == other.y;
}
}
package p2;
public class Coordinate {
public int x;
public int y;
public Coordinate( int x, int y ) {
this.x = x;
this.y = y;
}
public String toString() {
return \"(\" + this.x + \",\" + this.y + \")\";
}
@Override
public boolean equals( Object object ) {
if( object == null ) {
return false;
}
if( ! Coordinate.class.isAssignableFrom( object.getClass() )) {
return false;
}
final Coordinate other = (Coordinate) object;
return this.x == other.x && this.y == other.y;
}
}
package p2;
import java.util.Vector;
public class Maze {
private char[][] maze;
private int height;
private int width;
/**
* Create a new Maze of the specified height and width, initializing every
* location as empty, with a \' \'.
**/
public Maze( int width, int height ) {
// ADD STATEMENTS HERE
}
/**
* Mutator to allow us to set the specified Coordinate as blocked,
* marking it with a \'X\'
**/
public void setBlocked( Coordinate coord ) {
// ADD STATEMENTS HERE
}
/**
* Mutator to allow us to set the specified Coordinate as having been visited,
* marking it with a \'*\'
**/
public void setVisited( Coordinate coord ) {
// ADD STATEMENTS HERE
}
/**
* Mutator to allow us to set the specified Coordinate as part of the path solution,
* marking it with a \'.\'
**/
public void setPath( Coordinate coord ) {
// ADD STATEMENTS HERE
}
/**
* Returns the character at the locatio specified by the Coordinate
**/
public char at( Coordinate coord ) {
// ADD STATEMENTS HERE
}
/**
* Returns a Coordinate array containing all Coordinates that are clear around
* the specified coordinate.
**/
public Coordinate[] clearAround( Coordinate coord ) {
Vector vector = new Vector();
// ADD STATEMENTS HERE
// Look at each of the locations around the specified Coordinate, and add it
// to the vector if it is clear (i.e. a space)
return vector.toArray( new Coordinate[0] );
}
/**
* Returns a Coordinate that provides the entrance location in this maze.
**/
public Coordinate start() {
return new Coordinate( 0, 1 );
}
/**
* Returns a Coordinate that provides the exit location from this maze.
**/
public Coordinate end() {
// ADD STATEMENTS HERE
}
/**
* The toString() method is responsible for creating a String representation
* of the Maze. See the project specification for sample output. Note that
* the String representation adds numbers across the top and side of the Maze
* to show the Coordinates of each cell in the maze.
**/
public String toString() {
StringBuilder buffer =.
Interview C++11 code
C++11 code to solve an interview problem, please also see "Interview UML design".
Introduction to Dart
Introduction to Google's Dart Programming language, with a brief overview of the major language features.
CS117-S18-AlharbiMohammed-master.gitignore.class.ctxt..docx
CS117-S18-AlharbiMohammed-master/.gitignore
*.class
*.ctxt
*.*~
doc
/.project
default.log
defaultlog.txt
CS117-S18-AlharbiMohammed-master/Command.javaCS117-S18-AlharbiMohammed-master/Command.javaimport java.util.ArrayList;
/**
* This class is part of the "Campus of Kings" application. "Campus of Kings" is a
* very simple, text based adventure game.
*
* This class holds information about a command that was issued by the user. A
* command currently consists of two strings: a command word and a second word
* (for example, if the command was "take map", then the two strings obviously
* are "take" and "map").
*
* The way this is used is: Commands are already checked for being valid command
* words. If the user entered an invalid command (a word that is not known) then
* the command word is <null>.
*
* If the command had only one word, then the second word is <null>.
*
* @author Maria Jump
* @version 2015.02.01
*/
publicclassCommand{
/** The command word for this command. */
privateString commandWord;
/** The rest of the line with all the spaces removed. */
privateArrayList<String> restOfLine;
/**
* Create a command object. First is supplied. The second word is assumed
* to be null.
*
* @param firstWord
* The first word of the command. Null if the command was not
* recognized.
*/
publicCommand(String firstWord){
commandWord = firstWord;
restOfLine =newArrayList<String>();
}
/**
* Create a command object. First and second word must be supplied, but
* either one (or both) can be null.
*
* @param firstWord
* The first word of the command. Null if the command was not
* recognized.
* @param rest
* The rest of the command.
*/
publicCommand(String firstWord,ArrayList<String> rest){
commandWord = firstWord;
restOfLine = rest;
}
/**
* Return the command word (the first word) of this command. If the command
* was not understood, the result is null.
*
* @return The command word.
*/
publicString getCommandWord(){
return commandWord;
}
/**
* Returns if this command was not understood.
*
* @return true if this command was not understood.
*/
publicboolean isUnknown(){
return(commandWord ==null);
}
/**
* Returns if this command has a second word.
*
* @return true if the command has a second word.
*/
publicboolean hasSecondWord(){
return restOfLine !=null;
}
/**
* Returns if this command has more words.
*
* @param index The index of the word needed.
* @return true if the command has a word at given index.
*/
publicboolean hasWord(int index){
return index >=0&& index < restOfLine.size();
}
/**
* Returns the word at the requested index in the command.
*
* @param index
* The index of word in the command that is being requested.
*
* @ret.
Lab Assignment 4 CSE330 Spring 2014 Skeleton Code for ex.docx
/* Lab Assignment 4 CSE330 Spring 2014 */
/* Skeleton Code for ex0 of lab4 */
/* No code will be provided for ex1 of lab4 */
#include <stdio.h> /* for NULL */
#include <ctype.h> /* for atoi() */
#include <errno.h> /* for perror() */
#include <signal.h> /* for sigvec() etc. */
#include <sys/types.h> /* for <arpa/inet.h> */
#include <sys/socket.h> /* for PF_INET, etc. */
#include <netinet/in.h> /* for struct sockaddr_in */
#include <arpa/inet.h> /* for inet_addr() */
#include <sys/time.h>
#include "lab4.h"
/* this is in netinet/in.h; included here for reference only.
struct sockaddr_in {
short sin_family;
u_short sin_port;
struct in_addr sin_addr;
char sin_zero[8];
};
*/
/***************************************************************************/
#define LINESIZE 80
#define TYPE0TIMEOUT 3
#define TYPE1TIMEOUT 30
/* You should give a long timeout, like 30sec, otherwise */
/* duplicated responses from the server may cause some problem */
#define MAXRETRY 3
/***************************************************************************/
static char *RCSId="$Id: client2.c,v 4 2014/04/20 03:15:07 cse3300 Exp $";
/***************************************************************************/
/* some functions you may find useful if you implement them */
extern int stringToAddress(char *s, struct sockaddr_in *a);
extern int msgok(LABMSG *);
extern u_short msgchecksum(u_short *);
extern void alarmCatcher(void);
extern int tries; /* for retransmission routines */
int numtries;
/***** this will die ****/
FILE *logFile;
void die(char *s)
{
perror(s);
exit(2);
}
void startTimer(int secs)
{
alarm(secs);
}
void stopTimer(void)
{
alarm(0);
}
/* should change it by yourself if needed!!! */
void printResponse(LABMSG *mp, int ck)
{
int type;
mp->courseEtc = ntohs(mp->courseEtc);
type = ( (mp->courseEtc & MESSAGETYPE) !=0)?1:0;
printf("course=%d, Type=%d\n", mp->courseEtc&0x3fff,type);
if (ntohl(mp->cookie) != ck)
printf("Cookies don't match: sent %x received %x\n",mp->cookie,ck);
if (mp->courseEtc & REQRESP)
printf("response ");
else {
printf("request??\n");
return;
}
mp->result = ntohs(mp->result);
/*printf(" result = %x: ",mp->result);*/
if (mp->result&TRANSOUTCOME) { /* Check outcome */
printf("error: ");
switch (mp->result & 0x7fff) {
case ERROR_CHECKSUM:
printf("checksum failure\n");
break;
case ERROR_SYNTAX:
printf("syntax error\n");
break;
case ERROR_UNKSSN:
printf("unknown SSN %d\n", ntohl(mp->reqSSN) );
break;
case ERROR_SERVER:
printf("Unspecified Server Error\n");
default:
printf("Unknown Error.\n");
} /* case switch */
} else { /* successful transaction */
if(type)printf("Test succeeded.");
if (!type) /* Type 0 -- print SSN and Response */
printf(": %d -> %d\n", ntohl(mp->reqSSN), mp->result&0x7fff);
else
printf("\n"); /* XXX print number of responses */
}
}
/*-----------------------------------*/
/* added by ZXC:
this fun ...
CoffeeScript - An Introduction
An interesting presentation for learning the language from very basic. It provides very good insight to the language. JavaScript is the only prerequisite. It comes with a lot of examples that helps to learn the basics very quickly. Here is the SkyDrive download link http://sdrv.ms/16T7whf
Please do Part A, Ill be really gratefulThe main.c is the skeleto.pdf
Please do Part A, I'll be really grateful
The main.c is the skeleton code, the content of main.c is given below:
#include
#include
/* a rtpkt is the packet sent from one router to
another*/
struct rtpkt {
int sourceid; /* id of sending router sending this pkt */
int destid; /* id of router to which pkt being sent
(must be an directly connected neighbor) */
int *mincost; /* min cost to all the node */
};
struct distance_table
{
int **costs; // the distance table of curr_node, costs[i][j] is the cost from node i to node j
};
/*****************************************************************
***************** NETWORK EMULATION CODE STARTS BELOW ***********
The code below emulates the layer 2 and below network environment:
- emulates the transmission and delivery (with no loss and no
corruption) between two physically connected nodes
- calls the initializations routine rtinit once before
beginning emulation for each node.
You should read and understand the code below. For Part A, you should fill all parts with
annotation starting with "Todo". For Part B and Part C, you need to add additional routines for
their features.
******************************************************************/
struct event {
float evtime; /* event time */
int evtype; /* event type code */
int eventity; /* entity (node) where event occurs */
struct rtpkt *rtpktptr; /* ptr to packet (if any) assoc w/ this event */
struct event *prev;
struct event *next;
};
struct event *evlist = NULL; /* the event list */
struct distance_table *dts;
int **link_costs; /*This is a 2D matrix stroing the content defined in topo file*/
int num_nodes;
/* possible events: */
/*Note in this lab, we only have one event, namely FROM_LAYER2.It refer to that the packet
will pop out from layer3, you can add more event to emulate other activity for other layers. Like
FROM_LAYER3*/
#define FROM_LAYER2 1
float clocktime = 0.000;
/********************* EVENT HANDLINE ROUTINES *******/
/* The next set of routines handle the event list */
/*****************************************************/
void rtinit(struct distance_table *dt, int node, int *link_costs, int num_nodes)
{
/* Todo: Please write the code here*/
}
void rtupdate(struct distance_table *dt, struct rtpkt recv_pkt)
{
/* Todo: Please write the code here*/
}
void main(int argc, char *argv[])
{
struct event *eventptr;
/* Todo: Please write the code here to process the input.
Given different flag, you have different number of input for part A, B, C.
Please write your own code to parse the input for each part.
Specifically, in part A you need parse the input file and get num_nodes,
and fill in the content of dts and link_costs */
dts = (struct distance_table *) malloc(num_nodes * sizeof(struct distance_table));
link_costs = (int **) malloc(num_nodes * sizeof(int *));
for (int i = 0; i < num_nodes; i++)
{
link_costs[i] = (int *)malloc(num_nodes * sizeof(int));
}
for (int i = 0; i < num_nodes; i++)
{
rtinit(&dts[i], i, link_costs[i], num_nodes);
}
whil.
(In java language)1. Use recursion in implementing the binarySearc.pdf
(In java language)
1. Use recursion in implementing the binarySearch method
2. Use Generics in implementing different methods
3. Use the attached driver. Do not modify the driver
Please put answers into the skeleton / complete the following given skeleton with the code in
java language:
import java.util.ArrayList;
public class MyGenerics{
//Declarations
//****************************************************************************
//No-argument constructor:
//****************************************************************************
public MyGenerics (){
}//end of constructor
//****************************************************************************
//max: Receives a generic one-dimensional array and returns the maximum
// value in the array.
//****************************************************************************
public > E max(E[] list){
return null;
}//end of max
//****************************************************************************
//max: Receives a generic two-dimensional array and returns the maximum
// value in the array.
//****************************************************************************
public > E max(E[][] list) {
return null;
}
//****************************************************************************
//largest: Receives a generic arrayList and returns the maximum
// value in the array.
//****************************************************************************
public > E largest(ArrayList list) {
return null;
}
//****************************************************************************
//binarySearch: Receives a generic one-dimensional array and a generic key
// and returns the location of the key (positive) or
// a negative location if not found.
//****************************************************************************
public > int binarySearch(E[] list, E key) {
int low = 0;
int high = list.length - 1;
return binarySearch (list, key, low, high);
}
public > int binarySearch(E[] list, E key, int low, int high) {
return -99; // update
}
//****************************************************************************
//sort: Receives a generic arrayList and returns nothing.
//****************************************************************************
public > void sort(ArrayList list) {
}
//****************************************************************************
//sort: Receives a generic one-dimensional array and returns nothing.
//****************************************************************************
public > void sort(E[] list) {
}
//****************************************************************************
//displayOneDList: Receives a generic one-dimensional array and displays its contents
//****************************************************************************
public void displayOneDList(E[] list, String listName){
}
//****************************************************************************
//displayTwoDList: Receives a generic two-dimensional array & a string .
New folderjsjfArrayStack.classpackage jsjf;publicsynchronize.docx
New folder/jsjf/ArrayStack.classpackage jsjf;
publicsynchronizedclass ArrayStack implements StackADT {
privatestaticfinal int DEFAULT_CAPACITY = 100;
private int top;
private Object[] stack;
public void ArrayStack();
public void ArrayStack(int);
public void push(Object);
private void expandCapacity();
public Object pop() throws exceptions.EmptyCollectionException;
public Object peek() throws exceptions.EmptyCollectionException;
public int size();
public boolean isEmpty();
public String toString();
}
New folder/jsjf/ArrayStack.javaNew folder/jsjf/ArrayStack.javapackage jsjf;
import jsjf.exceptions.*;
import java.util.Arrays;
// -------------------------------------------------------
// Author: Yifu Wu
// Date: 03/10/16
// Source Name: ArrayStack<T>
// Due date: 03/10/16
// Description:
/**
* An array implementation of a stack in which the bottom of the
* stack is fixed at index 0.
*
* @author Java Foundations
* @version 4.0
*/
publicclassArrayStack<T>implementsStackADT<T>
{
privatefinalstaticint DEFAULT_CAPACITY =100;
privateint top;
private T[] stack;
/**
* Creates an empty stack using the default capacity.
*/
publicArrayStack()
{
this(DEFAULT_CAPACITY);
}
/**
* Creates an empty stack using the specified capacity.
* @param initialCapacity the initial size of the array
*/
publicArrayStack(int initialCapacity)
{
top =0;
stack =(T[])(newObject[initialCapacity]);
}
/**
* Adds the specified element to the top of this stack, expanding
* the capacity of the array if necessary.
* @param element generic element to be pushed onto stack
*/
publicvoid push(T element)
{
if(size()== stack.length)
expandCapacity();
stack[top]= element;
top++;
}
/**
* Creates a new array to store the contents of this stack with
* twice the capacity of the old one.
*/
privatevoid expandCapacity()
{
//stack = Arrays.copyOf(stack, stack.length * 2);
System.out.println("Expanding stack capacity\n");
T[] temp =(T[])(newObject[2*top]);
for(int i=0; i< top; i++)
temp[i]= stack[i];
stack = temp;
}
/**
* Removes the element at the top of this stack and returns a
* reference to it.
* @return element removed from top of stack
* @throws EmptyCollectionException if stack is empty
*/
public T pop()throwsEmptyCollectionException
{
if(isEmpty())
thrownewEmptyCollectionException("stack");
top--;
T result = stack[top];
stack[top]=null;
return result;
}
/**
* Returns a reference to the element at the top of this stack.
* The element is not removed from the stack.
* @return element on top of stack
* @throws EmptyCollectionException if stack is empty
*/
public T peek()throwsEmptyCollectionException
{
if(isEmpty())
thrownewEmptyCollectionException("stack");
return stack[top-1];
}
/**
* Returns the number of elements in ...
Checking Oracle VM VirtualBox. Part 2
Virtual machines are used for very different tasks. Personally I have been using VirtualBox for many
years to test software and simply study various Linux distributions. And now, after years of using the
tool and encountering undefined behavior every now and then, I've decided to make use of my
experience in analysis of open-source projects and check the source code of Oracle VM Virtual Box.In
this article, I will continue describing the numerous suspicious fragments found in the project.
The first part of the article: Checking Oracle VM VirtualBox. Part 1.
Game Design and Development Workshop Day 1
This course teaches you how to build awesome video games using Cocos2Dx. Cocos2Dx is a feature packed, free game development engine. It is cross platform, high performance, and supports three languages: C++, Lua and JavaScript. With it, you can write games for iOS, Android, Windows, Mac, and the Web. It is nothing short of amazing and this course teaches you how to use it. We will program Cocos2Dx in JavaScript, but this is not a programming class. If you don't know how to write code in JavaScript or some other curly brace language, this is not the course for you. For those whose JavaScript is rusty, we will do quick language overview. Don't let the JavaScript part fool you. Cocos2Dx is built from highly optimized C++ and OpenGL, JavaScript is used for game logic, not graphics. Our games will run at a super fast, 60 frames a second.
In this lab, we will write an application to store a deck of cards i.pdf
In this lab, we will write an application to store a deck of cards in a linked list, and then write
methods to sort and shuffle the deck.
Copy your completed LinkedList class from Lab 4 into the LinkedList.java file below.
Complete all methods of the Card class as described by the Javadoc comments. The class
contains both a suit and a rank. A suit is one of the categories into which the cards of a deck are
divided. The rank is the relative importance of the card within its suit.
Note that the Card constructor must convert any rank and suit letters to uppercase.
For the equals() method, be sure to follow the steps outlined in Lesson 4. How to implement the
compareTo() method is also covered in Lesson 4.
Note that you are not allowed to add any additional methods or member variables to this class or
you will not receive credit for this assignment.
Complete all methods of the CardApp class in the CardApp.java file as described by the Javadoc
comments.
You may add as many methods as you would like to this file, but are not allowed to add any
additional member variables.
The CardApp program must prompt for and allow the user to enter the name of any input file as
shown in the Example output below.
Implement the shuffle() method as specified in the comments for shuffle(). After you have
shuffled the deck of cards, write the result into a file named shuffled.txt.
Implement the sort() method using bubble sort from Lesson 4. First sort by suit in alphabetical
order and then by rank from 2 to A. The pseudocode for bubble sort is as follows:
After you have sorted the deck of cards, write the result to a file named sorted.txt.
The CardApp.java file also contains the main() method of the application. Use Develop mode to
test your CardApp code along with your Card and LinkedList code.
All input and output files must contain a list of cards, with each card stored on its own line. See
the example files cards1.txt and cards2.txt for example file formats.
[[[cards1.txt]]]
2H
3H
4H
5H
6H
7H
8H
9H
10H
JH
[[[cards2.txt]]]
AS
2S
3S
4S
5S
6S
7S
8S
9S
10S
JS
QS
KS
AC
2C
3C
4C
5C
6C
7C
8C
9C
10C
JC
QC
KC
AH
2H
3H
4H
5H
6H
7H
8H
9H
10H
JH
QH
KH
AD
2D
3D
4D
5D
6D
7D
8D
9D
10D
JD
QD
KD
[[[CardApp.java]]]
/**
* CardApp.java
* @author Your name
* @author Partner's name
* CIS 22C, Applied Lab 1
*/
public class CardApp {
private LinkedList list;
/**
* User interface prompts user, reads and writes files.
*/
public static void main(String[] args) {
}
/**
* Default constructor to initialize the deck
*/
public CardApp() {
}
/**
* Inserts a new Card into the deck
* @param card a playing Card
*/
public void addCard(Card card) {
}
/**
* Shuffles cards following this algorithm:
* First swaps first and last card
* Next, swaps every even card with the card 3
* nodes away from that card. Stops when it
* reaches the 3rd to last node
* Then, swaps ALL cards with the card that is
* 2 nodes away from it, starting at the 2nd card
* and stopping stopping at the 3rd to last node
*/
public vo.
Assg 12 Binary Search Trees COSC 2336assg-12.cppAssg 12 Binary .docx
Assg 12 Binary Search Trees COSC 2336/assg-12.cppAssg 12 Binary Search Trees COSC 2336/assg-12.cpp/**
* @author Jane Programmer
* @cwid 123 45 678
* @class COSC 2336, Spring 2019
* @ide Visual Studio Community 2017
* @date April 8, 2019
* @assg Assignment 12
*
* @description Assignment 12 Binary Search Trees
*/
#include<cassert>
#include<iostream>
#include"BinaryTree.hpp"
usingnamespace std;
/** main
* The main entry point for this program. Execution of this program
* will begin with this main function.
*
* @param argc The command line argument count which is the number of
* command line arguments provided by user when they started
* the program.
* @param argv The command line arguments, an array of character
* arrays.
*
* @returns An int value indicating program exit status. Usually 0
* is returned to indicate normal exit and a non-zero value
* is returned to indicate an error condition.
*/
int main(int argc,char** argv)
{
// -----------------------------------------------------------------------
cout <<"--------------- testing BinaryTree construction ----------------"<< endl;
BinaryTree t;
cout <<"<constructor> Size of new empty tree: "<< t.size()<< endl;
cout << t << endl;
assert(t.size()==0);
cout << endl;
// -----------------------------------------------------------------------
cout <<"--------------- testing BinaryTree insertion -------------------"<< endl;
//t.insert(10);
//cout << "<insert> Inserted into empty tree, size: " << t.size() << endl;
//cout << t << endl;
//assert(t.size() == 1);
//t.insert(3);
//t.insert(7);
//t.insert(12);
//t.insert(15);
//t.insert(2);
//cout << "<insert> inserted 5 more items, size: " << t.size() << endl;
//cout << t << endl;
//assert(t.size() == 6);
cout << endl;
// -----------------------------------------------------------------------
cout <<"--------------- testing BinaryTree height -------------------"<< endl;
//cout << "<height> Current tree height: " << t.height() << endl;
//assert(t.height() == 3);
// increase height by 2
//t.insert(4);
//t.insert(5);
//cout << "<height> after inserting nodes, height: " << t.height()
// << " size: " << t.size() << endl;
//cout << t << endl;
//assert(t.height() == 5);
//assert(t.size() == 8);
cout << endl;
// -----------------------------------------------------------------------
cout <<"--------------- testing BinaryTree clear -------------------"<< endl;
//t.clear();
//cout << "<clear> after clearing tree, height: " << t.height()
// << " size: " << t.size() << endl;
//cout << t << endl;
//assert(t.size() == 0);
//assert(t.height() == 0);
cout << endl;
// return 0 to indicate successful completion
return0;
}
Assg 12 Binary Search Trees COSC 2336/assg-12.pdf
Assg 12: Binary Search Trees
COSC 2336 Spring 2019
April 10, 2019
Dates:
Due: Sunday April 21, by Midnight
Objectives
� Practice recursive algorithms
� Learn how to construct a binary tree usi ...
Please write the C++ code that would display the exact same output a.pdf
Please write the C++ code that would display the exact same output as provided. Thank you.
main.cpp
#include "TreeNode.h"
//GIVEN
void inorderTraversal(TreeNode * root);
//TODO
TreeNode * search(TreeNode * node,int data);
//GIVEN
void insert(TreeNode * node,int data);
//GIVEN
bool isNull(TreeNode * node){
return node==nullptr;
}
int main() {
// create the root, gets set to null
TreeNode * root;
// create the roor and set the data of root to 5
root= new TreeNode(5);
//create two additional nodes with data values 10 and 3
// these will go to the right and left of root respectively
TreeNode * ten= new TreeNode(10);
TreeNode * three= new TreeNode(3);
//connect ten to the right of root (which has data 5)
root->setRight(ten);
//connect three to the left of root (which has data 5)
root->setLeft(three);
// note this can also be done as
//root.setRight(new TreeNode(10));
//root.setLeft(new TreeNode(3);)
// add two more nodes
//the first has data value 7. So to keep the tree in insorted order, it should get attached as the
left node of ten
// the second has data value 4. So to keep the tree in insorted order, it should get attached as the
right node of three
ten->addLeft(7);
three->addRight(4);
std::cout<<"**************************************\n";
std::cout<<"Printing the Inorder Traversal\n";
inorderTraversal(root);
std::cout<<"**************************************\n";
std::cout<<"Searching for Node \n";
TreeNode* result = search(root,4);
if (result!=nullptr){
std::cout<<"Found "<getData()<<"\n";
}
else
std::cout<<"Not Found "<<4<<"\n";
result = search(root,1);
if (result!=nullptr){
std::cout<<"Found "<getData()<<"\n";
}
else
std::cout<<"Not Found "<<1<<"\n";
std::cout<<"**************************************\n";
std::cout<<"Inserting 6\n";
insert(root,6);
std::cout<<"**************************************\n";
std::cout<<"Printing the Inorder Traversal\n";
inorderTraversal(root);
}
// uses recursion
void inorderTraversal(TreeNode * node){
// exit case
if (isNull(node)) return;
if (node->isLeaf()){
std::cout<<"Printing Leaf Node "<getData()<<"\n";
return;}
// reached a node with no left, so print the node and travel right
if (!isNull(node->getLeft()))
// if there is a left path, then travel further on that
inorderTraversal(node->getLeft());
std::cout<<"Printing Node "<getData()<<"\n";
// save and travel the right path of the current node being processed
inorderTraversal(node->getRight());
}
// uses recursion
//TODO
TreeNode * search(TreeNode * node, int data){
// if the node is null return the null ptr
//if this nodes data equals the search date return found
// if not, if the left tree exists and search data less than
//this nodes data return the result of recursive all to search with left pointer
// if no left tree, but right tree exists and search data greater than
//this nodes data return the result of recursive all to search with right pointer
// if both above conditions not true return null ptr
}
//uses recursion
void insert(TreeNode * node,int .
Fix my codeCode.pdf
Fix my code:
Code:
/***************************************************************************
* A Linked List class with a private static inner Node class.
*
*****************************************************************************/
import java.util.*;
public class MySingleLinkedList
{
private Node head;
/**
* Constructs an empty list
*/
public MySingleLinkedList()
{
head = null;
}
/**
* Returns true if the list is empty
* @return true/false - empty/not empty
*/
public boolean isEmpty()
{
return head == null;
}
/**
* Inserts a new node at the beginning of this list.
* @param item - element to add
*
*/
public void addFirst(E item)
{
head = new Node(item, head);
}
/**
* Returns the first element in the list.
* @return the head of the list
* @exception NoSuchElementException if an empty list
*/
public E getFirst()
{
if(head == null) throw new NoSuchElementException();
return head.data;
}
/**
* Removes the first element in the list.
* @return head of the list
*
*/
public E removeFirst()
{
E tmp = getFirst();
head = head.next;
return tmp;
}
/**
* Inserts a new node to the end of this list.
* @param item - the element to add at the end of list
*/
public void addLast(E item)
{
if( head == null)
addFirst(item);
else
{
Node tmp = head;
while(tmp.next != null) tmp = tmp.next;
tmp.next = new Node(item, null);
}
}
/**
* Removes all nodes from the list.
*
*/
public void clear()
{
head = null;
}
/**
* Inserts a new node after the first appearance of the node containing the key
* @param key - the data of existing node included in the list
* @param toInsert - the data of the new node to be inserted
*/
public void insertAfter(E key, E toInsert)
{
Node tmp = head;
while(tmp != null && !tmp.data.equals(key))
tmp = tmp.next;
if(tmp != null)
tmp.next = new Node(toInsert, tmp.next);
}
/*
* ================================ The following functions need to be filled
===================================================
*
*/
/**
* Returns the last element in the list.
* @return last element in the list
* @throws NoSuchElementException if the list is empty
*/
public E getLast()
{
// TODO: please fill your code here.
Node tmp = head;
while(tmp.next != null) {
tmp = tmp.next;
}
return tmp.data;
}
/**
* Returns true if this list contains the specified element.
* @param item - element to be checked
* @return True - if contained; otherwise False
*
*/
public boolean contains(E item)
{
Node tmp = head;
while (tmp != null && !tmp.data.equals(item))
tmp = tmp.next;
if (tmp.data.equals(item) ) {
return true;
}
return false;
}
/**
* Returns the data at the specified position in the list.
* @param the position index
* @return the data contained at the given position index
* @throws IndexOutOfBoundsException if pos is larger than the size of list
*
*/
public E get(int pos)
{
Node tmp = head;
int i = 0;
while (i < pos) {
i++;
tmp = tmp.next;
}
return tmp.data;
}
/**
* Inserts a new node before the first appearance of the node containing the key.
* @param key the data of existing.
Similar to MIS 4310-01 Final Take Home Exam (100 points) DUE Thursd.docx (20)
Please read the comment ins codeExpressionTree.java-------------.pdf
Please read the comment ins codeExpressionTree.java-------------.pdf
package singlylinkedlist; public class Node { public String valu.pdf
package singlylinkedlist; public class Node { public String valu.pdf
js+ts fullstack typescript with react and express.pdf
js+ts fullstack typescript with react and express.pdf
java question Fill the add statement areaProject is to wo.pdf
java question Fill the add statement areaProject is to wo.pdf
CS117-S18-AlharbiMohammed-master.gitignore.class.ctxt..docx
CS117-S18-AlharbiMohammed-master.gitignore.class.ctxt..docx
Lab Assignment 4 CSE330 Spring 2014 Skeleton Code for ex.docx
Lab Assignment 4 CSE330 Spring 2014 Skeleton Code for ex.docx
Please do Part A, Ill be really gratefulThe main.c is the skeleto.pdf
Please do Part A, Ill be really gratefulThe main.c is the skeleto.pdf
(In java language)1. Use recursion in implementing the binarySearc.pdf
(In java language)1. Use recursion in implementing the binarySearc.pdf
New folderjsjfArrayStack.classpackage jsjf;publicsynchronize.docx
New folderjsjfArrayStack.classpackage jsjf;publicsynchronize.docx
In this lab, we will write an application to store a deck of cards i.pdf
In this lab, we will write an application to store a deck of cards i.pdf
Assg 12 Binary Search Trees COSC 2336assg-12.cppAssg 12 Binary .docx
Assg 12 Binary Search Trees COSC 2336assg-12.cppAssg 12 Binary .docx
Please write the C++ code that would display the exact same output a.pdf
Please write the C++ code that would display the exact same output a.pdf
More from raju957290
(Need in 2 hours) 100 plagiarism freeIn our society as we deal .docx
(Need in 2 hours) 100% plagiarism free
In our society as we deal on a daily basis with threats and opportunities we often don’t consider the events that got us to where we are today. We just try to work ahead and make something that is new or better than what we perceive we have now. In doing so we may be repeating mistakes from the past and we may be overlooking some success that has already occurred. Itis important to know the history of the type of venture that we are engaged in so that we can use our time and resources efficiently. This can certainly be said of police/citizen relations.
For this week’s assignment consider how American policing has evolved from its earliest beginnings until now. Analyze the memorable events and remarkable people who influenced the development of our system and describe why changes were made and how effective they have been. Critically examine the early founding principles of policing, such as those suggested by Sir Robert Peel and apply those principles to what is actually happening today.
Write a 1 page APA style paper. Only the body of the paper will count toward the word requirement (title page and references are in addition to the 1 pages)
In your paper, cite at least 2-3 references using the APA style guide format for in-text citation.
Only one reference may be found on the internet. The other references must be found in the library (this includes EBSCO Host and the Gale Criminal Justice
Collection
).
Click
here
to view your assignment rubric.
.
(Minimum of 250 words with peer review reference ) I am a nurse.docx
(Minimum of 250 words with peer review reference )
I am a nurse working in the emergency room)
In your own words, define
translational research
and how it connects to your role, either individually or in collective practice. Describe how you might use it in your current or anticipated future setting.
.
(minimum of 250 words with peer review reference) Topic 8 DQ 1.docx
(minimum of 250 words with peer review reference)
Topic 8 DQ 1
Open and clear communication is critical for the effective functioning of the interprofessional team and the delivery of safe patient care. Discuss the way communication technologies can enhance coordination of care by interprofessional teams. Be sure to discuss a specific communication technology in your response.
.
(Links to an external site.) (Links to an external site.) (Links.docx
(Links to an external site.)
(Links to an external site.)
(Links to an external site.)
(Links to an external site.)
(Links to an external site.)
(Links to an external site.)
(Links to an external site.)
Feminism
We will be working on strengthening our ability to properly cite our philosophers with this discussion post looking again specifically at author-date in-text citations. We will not be providing bibliographic entries for this post.
I have provided a copy of the notes from our earlier discussion below for reference.
For in-text citations we will use this recipe:
"These are some example words as might be quoted by a student of philosophy" (Author's Last Name Most Recent Copyright Date of the actual Text you are referencing, page number again from the actual text you are referencing). i.e. "But enough. It is now time to leave---for me to die, and for you to live--though which of us has the better destiny is unclear to everyone, save only to God" (Plato 2011, 50). This is a reference to our class's textbook so notice it is that copyright date and that page. Think of these citations as breadcrumbs that can lead your reader to the exact quote in the exact book so they can read more if they so choose.
Assignment:
This assignment is going to be a bit different than what we have done in the past as it will involve trying to put yourself into the headspace or mindset of another classmate.
Two Texts:
We have two (2) texts for this module on feminist theory and epistemologies. We have the French existential feminist philosopher Simone De Beauvoir whose introduction to the
The Second Sex
asks us to take a critical look at what society claims, demands, and promulgates that a woman is. We are introduced to a concept of gender as possibly being different than sex. We are provided with an idea that biology might be different than the socialization or social construction involved in performing a gender or being gendered. Her thoughts center around notions of freedom and the opposite, what is named by her (and also written about by Jean Paul Sartre) as acting in "bad faith". We often avoid our freedom by giving our choices to others. We treat ourselves (like we might poorly treat others) as objects rather than being authentic and participating in our own expansive transformative growth. Beauvoir provocatively then suggests that one is not born a woman but rather becomes one.
Maria Lugones and Elizabeth Spelman provide an overview and critique of feminist theories and the practices born of them. They expose the difficulties of theorizing for a broad array of women as though there might be some one-size-fits-all way of talking about the lives of women. They connect this historical difficulty in a delightful way to their own working relationship as being a Latina and a white/Anglo woman. Through their discussion we are given a retelling of the ongoing disappointment, not only of women often not being allowed a place to speak from, b.
(Need in 5 hours no essay short answer 100 plagiarism free)De.docx
(Need in 5 hours no essay short answer 100% plagiarism free)
Describe how other ethical systems define what is moral- specifically, ethics of virtue, natural law, religion, and ethics of
care
.
What are the principles of ethical decision making?
Describe the steps in analyzing an ethical dilemma.
Under corrective justice, distinguish between substantive and procedural justice.
What steps should organizational leaders take to encourage ethical decision making on the part of employees?
Provide justification for police power and the basic ethical standards that derive from this justification and what are the ethical issues involved in proactive & reactive investigations?
Describe the types of misconduct by community corrections professionals and provide some of the explanations for this misconduct.
What are the elements of any ethical system?
Discuss three of the five types of police misconduct, with examples of each type.
.
(minimum of 250 words with peer review reference) What t.docx
(minimum of 250 words with peer review reference)
What types of obstacles/objections do leaders face from stakeholders when implementing change within an organization? What strategies can leaders use to work with stakeholders, remove obstacles, and address objections?
.
(Page 132) G. Prewriting Using the Toulmin Model to Get Ideas for.docx
(Page 132) G. Prewriting: Using the Toulmin Model to Get Ideas for a Position Paper
You have used the Toulmin model in Exercises B through F to read and analyze other people’s argument. Now use it to identify the main parts of an argument you will write. You may use the model to help you plan any argument paper. Use the Toulmin model as a prewriting exercise to help you develop ideas for a position paper.
1. Write the claim. All of the rest of your paper will support this claim.
2. Write the support. Write two or three subclaims you will develop in the paper. To help you do this, write the word “because” after the claim, and list reasons that support it. Also jot down ideas for specific support for these subclaims, such as examples, facts, opinions, or visual images that come from your reading of the essays or from your own experience.
Student Paper #1
Sofia Diallou
Professor Miller
English 101
12 Feb. 2016
Toulmin Analysis of the “Road Trip” Cartoon
Identifies claim and support.
The reader has to infer the claim of this cartoon since it is not directly stated. The claim is that screens have replaced face-to-face conversation as the primary way people now interact with each other. The support is provided by the driver of the car, who notes how much lonelier car trips have become, and the other passengers, all of whom are focused on their smartphones and tablets.
Analyzes warrant.
The implied warrant is that screen-based technology makes us more isolated and disconnected from each other.
Identifies backing.
The backing is also implied and reinforced by the picture. It suggests that road trips are valuable opportunities for connection and conversation that many families are giving up. It also reinforces the common belief that interacting with screens is more appealing than interacting directly with people face-to-face.
Infers rebuttal.
No direct rebuttal or qualifier appears in this cartoon. I think, however, that this cartoon could be considered as a rebuttal to those who think that screen-based communication is always superior to face-to-face communication. As a rebuttal, this cartoon highlights the negative consequences of embracing screen-based communication.
3. Write the warrants. Decide whether to spell out the warrants in your paper or to leave them implicit so that the reading audience will have to infer them.
4. Decide on the backing. Assume that your classmates are your audience. They may be reading drafts of your paper. In your judgment, will some of them require backing for any of your warrants because they will not agree with them otherwise? If so, how can you back these warrants? Write out your ideas.
5. Plan rebuttal. Think about the positions others may hold on this issue. You identified some of these positions in your exploratory paper. Write out your strategies for weakening these arguments.
6. Decide whether to qualify the claim to make it more convincing to more people. Write one or more qualifiers that might work.
Read what.
(Normal Curves, 2013)In the video, Normal Curves, there is .docx
(Normal Curves, 2013)
In the video, Normal Curves, there is a discussion about how and why different types of data are normally distributed. (A simple Internet search will give you several good examples.
For your initial post, identify (but don't collect) a type of dataset that might be normally distributed, and then answer the following questions:
What is brief description of the data?
Is the data normally distributed? Specifically, why is the data not uniformly distributed, or distributed in some other way?
Normal data is clustered around the mean; what might cause the data you identified to have a different shape and not be clustered around the mean?
Please be sure to validate your opinions and ideas with citations and references in APA format.
.
(minimum of 250 words with peer review reference) Review HIPAA.docx
(minimum of 250 words with peer review reference)
Review HIPAA, protected health information (PHI), and requirements for privacy and confidentiality in EHRs. Discuss one ethical and one legal issue related to the use of EHRs that directly impact advanced registered nursing practice. Discuss possible consequences for compromising patient data and measures you can implement in your own practice to protect patient privacy and confidentiality.
.
(minimum of 250 words with peer review reference)Topic 8 DQ .docx
(minimum of 250 words with peer review reference)
Topic 8 DQ 1
How could Christian perspectives prevent an employee from performing their required duties? As an HR representative, what legal and ethical responsibilities do you have to ensure all employees views and beliefs are being considered?
.
(minimum of 250 words with peer review reference)Topic 7 D.docx
(minimum of 250 words with peer review reference)
Topic 7 DQ 2
Review HIPAA, protected health information (PHI), and requirements for privacy and confidentiality in EHRs. Discuss one ethical and one legal issue related to the use of EHRs that directly impact advanced registered nursing practice. Discuss possible consequences for compromising patient data and measures you can implement in your own practice to protect patient privacy and confidentiality.
.
(Sample) Safety and Health Training Plan 1.0 Intro.docx
(Sample)
Safety and Health Training Plan
1.0 Introduction
Training is one of the most important components within our company’s safety management system. It gives
employees an opportunity to learn their jobs properly, bring new ideas into the workplace, reinforce existing ideas
and practices, and it helps to put our Safety and Health Program into action.
Everyone in our company will benefit from safety and health training through fewer workplace injuries and illnesses,
reduced stress, and higher morale. Productivity, profits, and competitiveness will increase as production costs per
unit, turnover, and workers compensation rates lower.
2.0 Management commitment.
We (or company name) will provide the necessary funds and scheduling time to ensure effective safety and health
training is provided. This commitment will include paid work time for training and training in the language that the
worker understands. Both management and employees will be involved in developing the program.
To most effectively carry out their safety responsibilities, all employees must understand (1) their role in the program,
(2) the hazards and potential hazards that need to be prevented or controlled, and (3) the ways to protect themselves
and others. We will achieve these goals by:
• educating everyone on the natural and system consequences of their actions;
• educating all managers, supervisors and employees on their safety management system responsibilities;
• educating all employees about the specific hazards and control measures in their workplace;
• training all employees on hazard identification, analysis, reporting and control procedures; and
• training all employees on safe work procedures and practices.
Our training program will focus on health and safety concerns that determine the best way to deal with a particular
hazard. When a hazard is identified, we will first try to remove it entirely. If that is not feasible, we will then train
workers to protect themselves, if necessary, against the remaining hazard. Once we have decided that a safety or
health problem can best be addressed by training (or by another method combined with training), we will follow up by
developing specific training goals based on those particular needs.
Employees. At a minimum, employees must know the general safety and health rules of the worksite, specific site
hazards and the safe work practices needed to help control exposure, and the individual's role in all types of
emergency situations. We will ensure all employees understand the hazards to which they may be exposed and how to
prevent harm to themselves and others from exposure to these hazards.
We will commit available resources to ensure employees receive safety and health training during the circumstances
below.
• Whenever a person is hired --general safety orientation including an overview of company safety rules, and
why those r.
(SLIDES)Rohingya People Living Conditions---(Housing) and .docx
(SLIDES)
Rohingya People : Living Conditions---(Housing) and Access to Services (Healthcare)
1. Historical Content
2. Living Conditions (Housing)
3. Access to Services (Healthcare)
4. Capabilities Approach taken to help them
5. Conclusion
6. Questions (3) on their living conditions (housing) and Access to services (Healthcare)
Running Head: ARTIFICIAL INTELLIGENCE 1
ARTIFICIAL INTELLIGENCE 2
Artificial Intelligence, the Monster we are feeding-outline
Students Name
Professors Name
Course title
Date
The monster called Artificial Intelligence
Thesis: Major laboratories have been built all over the world to prototype and generate intelligent machines through deep learning. In this paper, I will argue that Artificial Intelligence is a monster that the humans are feeding and it will one day turn and overthrow man, leaving the world in the hands of machines.
I. Introduction
A. Thesis
B. Definition the terms intelligence, deep learning, programing, machine learning
C. History of artificial intelligence.
D. Major scientists who developed AI.
E. Trends in AI
II. Machine learning
A. Supervised learning
B. Non supervised learning
C. Comparison between supervised and non-supervised learning
III. Major advantages of AI
A. Real time assistance
B. In the business field
C. Industrialization
D. Efficiency
E. Accuracy
IV. Limitations of AI
A. Cost implication
B. Threats prevention
C. Loss of metal capability
D. Social factors
E. Ethical factors
F. Men becoming slaves
G. Emotions not guaranteed
H. Rigidity in thinking and execution of instructions
V. Criticism
The divine instruction was for man to steward and subdue the world, such innovations makes the human being achieve the divine instruction. This criticism is worth because it discusses part of the work in AI as divine instruction.
There is power and happiness if a creator creates something more powerful than itself. It is the happiness of a teacher to see their students do well and even pursue a course far much better. With such social theories supporting the work of artificial intelligence, it is making sense that the same AI should not be demonized but rather be seen as a human achievement.
VI. Conclusion
All the sections and subsections are discussed in a brief, precise and clear way ranging from the definitions, the implications and how negative artificial intelligence should be depicted in this section.
References
Boddington, P. (2017). Towards a code of ethics for artificial intelligence. Cham, Switzerland: Springer.
Lu, H., Li, Y., Chen, M., Kim, H., & Serikawa, S. (2018). Brain intelligence: go beyond artificial intelligence. Mobile Networks and Applications, 23(2), 368-375.
Osoba, O. A., & Welser IV, W. (2017). An intelligence in our image: The risks of bias and errors in artificial intelligence. Rand Corporation.
Rosé, C. P. (2017). Artificial intelligence: A social spin on language analysis. Nature, 545(7653), 166.
Russell, .
(Need in 8 hours 100 plagiarism free) Read the following es.docx
(Need in 8 hours 100% plagiarism free)
Read the following essay from Becoming a Critical Thinker (p. 129).
Create
a 1-2 page (title page and references page not included) paper in APA format to substantiate your viewpoint (pro or con as it relates to the essay).
Base
your paper on the W.I.S.E approach (from Becoming a Critical Thinker, Chapter 2). Look for errors in thinking and explore viewpoints that are different from those expressed in the essay. Conduct research to support your viewpoint and include three references in your paper.
How the Media Distort Reality
TV and movie apologists are forever telling us that we have no business criticizing them because they are only holding a mirror up to reality. Many people buy that explanation, but they shouldn’t.
It would be more accurate to say the media hold a magnifying glass to carefully selected realities—namely, the most outrageous and sensational events of the day, such as the tragic deaths of John F. Kennedy Jr. and Princess Diana, or the trials of celebrities such as O.J. Simpson, Kobe Bryant, and Michael Jackson.
Consider how this happens. The first platoon of media people report the latest sensational story as it unfolds, squeezing each new development for all the airtime or newsprint it will yield. Meanwhile, agents and attorneys are negotiating the sale of movie and TV rights to the story. The sleazier the story, the greater
the payoff
. After the movie is produced, every situation comedy, detective show, and western drama builds an episode around the successful theme.
In this way a single despicable, disgusting act—real or imagined—can generate months of sensational media fare.
In short, the media exploit our social problems for ratings, feed us a steady
diet
of debasing material,
celebrate
irresponsible behavior, and then have the audacity to blame parents and teachers for the social problems that result.
.
(note I am a nurse working in a hospital) Develop a synopsis.docx
(note: I am a nurse working in a hospital)
Develop a synopsis of your outcomes for acquiring, developing, training, and leveraging on human capital within your organization.
and develop a synopsis of your take-away from the process. Integrate any plans for preparing for a position as an HR specialist or manager within an organization.
.
(minimum of 250 words with peer review reference) Topic 8 DQ 2.docx
(minimum of 250 words with peer review reference)
Topic 8 DQ 2
Virtual care and telehealth technologies have the capability to greatly expand access to quality health care. Discuss some benefits and drawbacks of virtual care/telehealth particularly related to the collaboration and coordination of care and the role of the advanced registered nurse.
.
(See detail instruction in the attachment)This is a music pape.docx
(See detail instruction in the attachment)
This is a music paper to talk about the latest artists, music genres, or club scenes that excite your interests.
Cite AT LEAST ONE source from the course reading (I attached them down below) and TWO additional outside academic sources. In total, you should cite at lease SIX sources. You must include a reference cited list (bibliography) at the end of your essay. (please cite them carefully and easy to find, our TA read our paper very carefully and he will check every citation one by one)
A significant portion of your research will be the course readings, lectures, and listening assignments.
Use MLA citation please.
1200 words, (not including the title or the references cited list), double spaced
Answer the questions listed in the paper instruction that I attached.
I also include a class note document that I took throughout the course which includes all the music genre that I learn.
.
(please scroll all the way to bottom to see info covered in u3-4.docx
(please scroll all the way to bottom to see info covered in u3-4 below)
Over the course of the class, you will be retrieving and evaluating current event articles (in the last 5 years); making connections between the units we are currently studying and today. You will be responsible for finding an online article from a reputable news source. For example: Time.com, USA Today, The
New York Times
, etc.
See the attachment for specific details and grading criteria for the
Current Events Journal Assignment for Units 3-4
In Unit 3, we will be focusing on change and reform brought about as a result of the rapid social and economic changes of industrialization and urbanization. While the U.S. looked great from an outside perspective, with its rich flaunting their wealth and industry booming, it was riddled with exploitation of the people and political corruption, thus earning the name the Gilded Age. This brought in a sense of moral obligation and led to a reform movement that swept across the nation, with organization developing locally and nationally. This period of reform is known as the Progressive Era.
It was a time to expose the underlining errors of the U.S. society and to make changes for the good of the people. The Progressive Era would address a variety of issues, including factory and living conditions, agriculture reform, child labor, women’s rights, political reform, conservation, and other social concerns. While not perfect in its initial steps of change, this period will pave the way for continued social justice in our nation’s history.
Objectives:
Discuss the impact of political corruption on the U.S. government and evaluate the effectiveness of political reform.
Identify the leading reformers of the Progressive Era and evaluate the effectiveness of the reform movements.
Describe the problems facing farmers in the late 19th century and evaluate the effectiveness of the reform movement by the Populists and other farmers’ organizations and alliances.
Compare the Progressivism domestic and foreign policies of Theodore Roosevelt, Woodrow Wilson, and William Howard Taft.
Unit 4 Imperialism and WWI
In Unit 4, we will focus on the role of the United States in World affairs. In the late 19th century, the United States not only sought to redefine itself as American, but also to establish its place in the global political arena. Foreign policies paralleled those of many European nations, with a focus on imperialism and preserving foreign interests and markets, specifically in the Western hemisphere. It will be the United States positioning in the Spanish-American war that marks the beginning of its imperial power, with future expansions and political involvement in Latin America and the Pacific Ocean.
At the turn of the century, the United States will feel the long-term effect of its imperialistic decisions. Being recognized as a World leader, involvement in international affairs now spanned beyond the Western Hemispher.
(Insert Student Name) (Insert Student Number) - PPMP20011 Portfo.docx
(Insert Student Name) / (Insert Student Number) - PPMP20011 Portfolio template for Week 9
PPMP20011 Portfolio Template – Week 9
Description of topics including reading samples
Learning outcomes of the unit
Learnings from your experience, this and prior unit reading, assignments
Supporting documentation including your prior learning
Week 9 Topic: Applying Project Management Standards and Frameworks.
Collaborative Project Procurement Arrangements (2015) by Derek H. T. Walker and Beverly M. Lloyd Walker;
6. Evaluate project management tools that help avoid or provide conflict resolution via negotiated solutions.
The objective of this week’s topic is to make sure you have an appreciation of the Role of the Project Manager in Commercial Negotiation.
Try to ask yourself the questions that were in the slides in this week’s lecture:
1. In what way would Project Management Standards and Frameworks impact on Commercial Negotiation?
Walker & Walker (2015) discuss the general thrust of this investigations in Chapter 7 (p 137) what are your thoughts regarding:
2. Do the conclusions in Chapter 7 p 137 seem reasonable to you?
Walker & Walker (2015) then in Chapter 7 talk about a “PraXitioner” what are your thoughts regarding:
3. Do you agree with the authors that a PraXitioner is the way forward?
Continuing the theme of the PraXitioner Walker and Walker look at Implications for PM Education and Skills; what are your thoughts regarding:
4. Do you think that there will be a future shortage of good PraXitioner’s in Commercial Negotiation situations?
In the last part of Chapter 7 is a Summary of the Walker and Walker book; what are your thoughts regarding:
5. Do you agree with the authors?
6. Do you think that RBP is a good framework for Commercial Project Negotiation?
In conclusion to this week:
7. Do the ideas in Chapter 7 help in structuring your thoughts around Commercial Project Negotiation?
PPMP20011 Unit Profile
PPMP20011 Moodle Web site
Have you any insights you can add from other units you have studies or readings you’ve made?
References
Kerzner H. 2013. Project Management: A Systems Approach to Planning, Scheduling, and Control, 11th Edition. Hoboken, USA: John Wiley & Sons.
Peña-Mora F., and Tamaki T. 2001. "Effect of Delivery Systems on Collaborative Negotiations for Large -Scale Infrastructure Projects”. Journal of Management in Engineering. April 2001 pp.105-121
PMI. 2013a. A Guide to the Project Management Body of Knowledge (PMBOK Guide) 5th Edition. USA: Project Management Institute.
Wikipedia Channel Tunnel https://en.wikipedia.org/wiki/Channel_Tunnel
1 of 2
BUS 300 - The American Economy
Student’s Name: __________________________________________________ Date: _____________________________________
USA: Measures of Economic Well-Being 2016 2017 2018 Increase or Decrease?
Worker Productivity:
Inflation:
Unemployment (rate):
Gross Domestic Product (GDP):
Unemployment rate:
U..
(Just I need APA format and simple Paragraph for each question a.docx
(Just I need APA format and simple Paragraph for each question and less than 20% plagiarism, two reference, sent me in word for edit please)
(Preferential Medical journal American psiquiatric association)
A 38-year-old woman presents to the office with complaints of weight
loss, fatigue, and insomnia of 3-month duration. She reports that she has
been feeling gradually more tired and staying up late at night because
she can’t sleep. She does not feel that she is doing as well in her occupation
as a secretary and states that she has trouble remembering things.
She does not go outdoors as much as she used to and cannot recall the
last time she went out with friends or enjoyed a social gathering. She
feels tired most of the week and states she feels that she wants to go to
sleep and frequently does not want to get out of bed. She denies any
recent medication, illicit drug, or alcohol use. She feels intense guilt
regarding past failed relationships because she perceives them as faults.
She states she has never thought of suicide, but has begun to feel increasingly
worthless.
Her vital signs and general physical examination are normal, although
she becomes tearful while talking. Her mental status examination is significant
for depressed mood, psychomotor retardation, and difficulty attending
to questions. Laboratory studies reveal a normal metabolic panel, normal
complete blood count, and normal thyroid functions.
➤ What is the most likely diagnosis?
➤ What is your next step?
➤ What are important considerations and potential complications of
management?
.
More from raju957290 (20)
(Need in 2 hours) 100 plagiarism freeIn our society as we deal .docx
(Need in 2 hours) 100 plagiarism freeIn our society as we deal .docx
(Minimum of 250 words with peer review reference ) I am a nurse.docx
(Minimum of 250 words with peer review reference ) I am a nurse.docx
(minimum of 250 words with peer review reference) Topic 8 DQ 1.docx
(minimum of 250 words with peer review reference) Topic 8 DQ 1.docx
(Links to an external site.) (Links to an external site.) (Links.docx
(Links to an external site.) (Links to an external site.) (Links.docx
(Need in 5 hours no essay short answer 100 plagiarism free)De.docx
(Need in 5 hours no essay short answer 100 plagiarism free)De.docx
(minimum of 250 words with peer review reference) What t.docx
(minimum of 250 words with peer review reference) What t.docx
(Page 132) G. Prewriting Using the Toulmin Model to Get Ideas for.docx
(Page 132) G. Prewriting Using the Toulmin Model to Get Ideas for.docx
(Normal Curves, 2013)In the video, Normal Curves, there is .docx
(Normal Curves, 2013)In the video, Normal Curves, there is .docx
(minimum of 250 words with peer review reference) Review HIPAA.docx
(minimum of 250 words with peer review reference) Review HIPAA.docx
(minimum of 250 words with peer review reference)Topic 8 DQ .docx
(minimum of 250 words with peer review reference)Topic 8 DQ .docx
(minimum of 250 words with peer review reference)Topic 7 D.docx
(minimum of 250 words with peer review reference)Topic 7 D.docx
(Sample) Safety and Health Training Plan 1.0 Intro.docx
(Sample) Safety and Health Training Plan 1.0 Intro.docx
(SLIDES)Rohingya People Living Conditions---(Housing) and .docx
(SLIDES)Rohingya People Living Conditions---(Housing) and .docx
(Need in 8 hours 100 plagiarism free) Read the following es.docx
(Need in 8 hours 100 plagiarism free) Read the following es.docx
(note I am a nurse working in a hospital) Develop a synopsis.docx
(note I am a nurse working in a hospital) Develop a synopsis.docx
(minimum of 250 words with peer review reference) Topic 8 DQ 2.docx
(minimum of 250 words with peer review reference) Topic 8 DQ 2.docx
(See detail instruction in the attachment)This is a music pape.docx
(See detail instruction in the attachment)This is a music pape.docx
(please scroll all the way to bottom to see info covered in u3-4.docx
(please scroll all the way to bottom to see info covered in u3-4.docx
(Insert Student Name) (Insert Student Number) - PPMP20011 Portfo.docx
(Insert Student Name) (Insert Student Number) - PPMP20011 Portfo.docx
(Just I need APA format and simple Paragraph for each question a.docx
(Just I need APA format and simple Paragraph for each question a.docx
Recently uploaded
Introduction to Quality Improvement Essentials
This is a presentation by Dada Robert in a Your Skill Boost masterclass organised by the Excellence Foundation for South Sudan (EFSS) on Saturday, the 25th and Sunday, the 26th of May 2024.
He discussed the concept of quality improvement, emphasizing its applicability to various aspects of life, including personal, project, and program improvements. He defined quality as doing the right thing at the right time in the right way to achieve the best possible results and discussed the concept of the "gap" between what we know and what we do, and how this gap represents the areas we need to improve. He explained the scientific approach to quality improvement, which involves systematic performance analysis, testing and learning, and implementing change ideas. He also highlighted the importance of client focus and a team approach to quality improvement.
MARUTI SUZUKI- A Successful Joint Venture in India.pptx
Let us know about Maruti Suzuki, a successful Joint venture in India.
special B.ed 2nd year old paper_20240531.pdf
Instagram:-
https://instagram.com/special_education_needs_01?igshid=YmMyMTA2M2Y=
WhatsApp:-
https://chat.whatsapp.com/JVakNIYlSV94x7bwunO3Dc
YouTube:-
https://youtube.com/@special_education_needs
Teligram :- https://t.me/special_education_needs
Slide Shere :-
https://www.slideshare.net/shabnambano20?utm_campaign=profiletracking&utm_medium=sssite&utm_source=ssslideview
GIÁO ÁN DẠY THÊM (KẾ HOẠCH BÀI BUỔI 2) - TIẾNG ANH 8 GLOBAL SUCCESS (2 CỘT) N...
GIÁO ÁN DẠY THÊM (KẾ HOẠCH BÀI BUỔI 2) - TIẾNG ANH 8 GLOBAL SUCCESS (2 CỘT) N...Nguyen Thanh Tu Collection
https://app.box.com/s/4hfk1xwgxnova7f4dm37birdzflj806wThesis Statement for students diagnonsed withADHD.ppt
Presentation required for the master in Education.
Polish students' mobility in the Czech Republic
Polish students mobility to the Czech Republic within eTwinning project "Medieval adventures with Marco Polo"
How to Break the cycle of negative Thoughts
We all have good and bad thoughts from time to time and situation to situation. We are bombarded daily with spiraling thoughts(both negative and positive) creating all-consuming feel , making us difficult to manage with associated suffering. Good thoughts are like our Mob Signal (Positive thought) amidst noise(negative thought) in the atmosphere. Negative thoughts like noise outweigh positive thoughts. These thoughts often create unwanted confusion, trouble, stress and frustration in our mind as well as chaos in our physical world. Negative thoughts are also known as “distorted thinking”.
How to Split Bills in the Odoo 17 POS Module
Bills have a main role in point of sale procedure. It will help to track sales, handling payments and giving receipts to customers. Bill splitting also has an important role in POS. For example, If some friends come together for dinner and if they want to divide the bill then it is possible by POS bill splitting. This slide will show how to split bills in odoo 17 POS.
Sectors of the Indian Economy - Class 10 Study Notes pdf
The Indian economy is classified into different sectors to simplify the analysis and understanding of economic activities. For Class 10, it's essential to grasp the sectors of the Indian economy, understand their characteristics, and recognize their importance. This guide will provide detailed notes on the Sectors of the Indian Economy Class 10, using specific long-tail keywords to enhance comprehension.
For more information, visit-www.vavaclasses.com
Digital Tools and AI for Teaching Learning and Research
This Presentation in details discusses on Digital Tools and AI for Teaching Learning and Research
The Roman Empire A Historical Colossus.pdf
The Roman Empire, a vast and enduring power, stands as one of history's most remarkable civilizations, leaving an indelible imprint on the world. It emerged from the Roman Republic, transitioning into an imperial powerhouse under the leadership of Augustus Caesar in 27 BCE. This transformation marked the beginning of an era defined by unprecedented territorial expansion, architectural marvels, and profound cultural influence.
The empire's roots lie in the city of Rome, founded, according to legend, by Romulus in 753 BCE. Over centuries, Rome evolved from a small settlement to a formidable republic, characterized by a complex political system with elected officials and checks on power. However, internal strife, class conflicts, and military ambitions paved the way for the end of the Republic. Julius Caesar’s dictatorship and subsequent assassination in 44 BCE created a power vacuum, leading to a civil war. Octavian, later Augustus, emerged victorious, heralding the Roman Empire’s birth.
Under Augustus, the empire experienced the Pax Romana, a 200-year period of relative peace and stability. Augustus reformed the military, established efficient administrative systems, and initiated grand construction projects. The empire's borders expanded, encompassing territories from Britain to Egypt and from Spain to the Euphrates. Roman legions, renowned for their discipline and engineering prowess, secured and maintained these vast territories, building roads, fortifications, and cities that facilitated control and integration.
The Roman Empire’s society was hierarchical, with a rigid class system. At the top were the patricians, wealthy elites who held significant political power. Below them were the plebeians, free citizens with limited political influence, and the vast numbers of slaves who formed the backbone of the economy. The family unit was central, governed by the paterfamilias, the male head who held absolute authority.
Culturally, the Romans were eclectic, absorbing and adapting elements from the civilizations they encountered, particularly the Greeks. Roman art, literature, and philosophy reflected this synthesis, creating a rich cultural tapestry. Latin, the Roman language, became the lingua franca of the Western world, influencing numerous modern languages.
Roman architecture and engineering achievements were monumental. They perfected the arch, vault, and dome, constructing enduring structures like the Colosseum, Pantheon, and aqueducts. These engineering marvels not only showcased Roman ingenuity but also served practical purposes, from public entertainment to water supply.
The Art Pastor's Guide to Sabbath | Steve Thomason
What is the purpose of the Sabbath Law in the Torah. It is interesting to compare how the context of the law shifts from Exodus to Deuteronomy. Who gets to rest, and why?
Unit 8 - Information and Communication Technology (Paper I).pdf
This slides describes the basic concepts of ICT, basics of Email, Emerging Technology and Digital Initiatives in Education. This presentations aligns with the UGC Paper I syllabus.
Unit 2- Research Aptitude (UGC NET Paper I).pdf
This slide describes the research aptitude of unit 2 in the UGC NET paper I.
Instructions for Submissions thorugh G- Classroom.pptx
This presentation provides a briefing on how to upload submissions and documents in Google Classroom. It was prepared as part of an orientation for new Sainik School in-service teacher trainees. As a training officer, my goal is to ensure that you are comfortable and proficient with this essential tool for managing assignments and fostering student engagement.
ESC Beyond Borders _From EU to You_ InfoPack general.pdf
ESC Beyond Borders _From EU to You_ InfoPack general.pdfFundacja Rozwoju Społeczeństwa Przedsiębiorczego
Wolontariat grupowy1.4 modern child centered education - mahatma gandhi-2.pptx
Child centred education is an educational approach that priorities the interest, needs and abilities of the child in the learning process.
Recently uploaded (20)
MARUTI SUZUKI- A Successful Joint Venture in India.pptx
MARUTI SUZUKI- A Successful Joint Venture in India.pptx
GIÁO ÁN DẠY THÊM (KẾ HOẠCH BÀI BUỔI 2) - TIẾNG ANH 8 GLOBAL SUCCESS (2 CỘT) N...
GIÁO ÁN DẠY THÊM (KẾ HOẠCH BÀI BUỔI 2) - TIẾNG ANH 8 GLOBAL SUCCESS (2 CỘT) N...
Thesis Statement for students diagnonsed withADHD.ppt
Thesis Statement for students diagnonsed withADHD.ppt
aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa
aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa
Sectors of the Indian Economy - Class 10 Study Notes pdf
Sectors of the Indian Economy - Class 10 Study Notes pdf
Digital Tools and AI for Teaching Learning and Research
Digital Tools and AI for Teaching Learning and Research
The Art Pastor's Guide to Sabbath | Steve Thomason
The Art Pastor's Guide to Sabbath | Steve Thomason
Unit 8 - Information and Communication Technology (Paper I).pdf
Unit 8 - Information and Communication Technology (Paper I).pdf
Instructions for Submissions thorugh G- Classroom.pptx
Instructions for Submissions thorugh G- Classroom.pptx
ESC Beyond Borders _From EU to You_ InfoPack general.pdf
ESC Beyond Borders _From EU to You_ InfoPack general.pdf
1.4 modern child centered education - mahatma gandhi-2.pptx
1.4 modern child centered education - mahatma gandhi-2.pptx
MIS 4310-01 Final Take Home Exam (100 points) DUE Thursd.docx
- 1. MIS 4310-01 Final Take Home Exam (100 points) DUE: Thursday, December 14th, 2017 by 11:59 PM Use the code provided on Blackboard as your template. Fill in your own code where prompted. When finished, upload to Blackboard a file called “treasure_hunt.java”. Change the block comment to include your own name. This is an individual assignment! Code that you write that you cannot explain will result in an automatic zero. Create a Java application that simulates a treasure hunt with a 2D array. Your output should match the output below with similar input. Do NOT alter the code provided. Fill in code in the SEVEN (7) locations under each comment // YOUR CODE HERE. Sample Output: import java.util.Random;
- 2. import java.util.Scanner; /* * First Last * MIS 4310 Fall 2017 * FINAL TAKE HOME EXAM */ public class treasure_hunt { public static void main(String[] args) { boolean found = false; // is true if the treasure is found int dug = 0; // holds the number of times user digs Random gen = new Random(9); Scanner scan = new Scanner(System.in);
- 3. int locationRow; // stores the row where the treasure is int locationCol; // stores the column where the treasure is /* * Generates a String array that looks like * undug grass when printed to represent the backyard. */ String[][] backyard = new String[5][5]; for (int row = 0; row < backyard.length; row++) { for (int col = 0; col < backyard[row].length; col++) { backyard[row][col] = "^"; System.out.print(backyard[row][col] + " ");
- 4. } // end inner loop System.out.println(); } // end outer loop /* * Generate a random number for both the row and column * location of the treasure. Store the results in * locationRow and locationCol, respectively. * The random numbers should be within the array dimensions. */ //************************** // YOUR CODE HERE (1 OF 7) //**************************
- 5. /* * A while loop that runs as long as the treasure * is not found. */ while (found == false) { /* * Declare two integer variables, guessRow and guessCol * and set them both to -1. * Increment the variable dug to represent a dig. */ //************************** // YOUR CODE HERE (2 OF 7)
- 6. //************************** /* * Ask the user which row they want to dig. * Use a while loop to validate the input. * Run the while loop as long as the guessRow * value is outside the bounds of the array. */ //************************** // YOUR CODE HERE (3 OF 7) //************************** /* * Ask the user which column they want to dig. * Use a while loop to validate the input.
- 7. * Run the while loop as long as the guessCol * value is outside the bounds of the array. */ //************************** // YOUR CODE HERE (4 OF 7) //************************** /* * Use the if statement below to check if both the guessRow * and guessCol are both correct. If they are, set * found equal to true and print "You found the treasure!" * Then, mark the location by setting the array value * to an "X". Use a nested for loop to print the array * with the "X".
- 8. */ //************************** // YOUR CODE HERE (5 of 7) (inside the if statement () and {}) //************************** if () { } // end if /* * The else statement for the if statement you wrote * is provided. Within the statement, you will see code * that guides the user using an if, if else, and else
- 9. * statement block to the correct ROW. * * Using this block as your guide, write another block * of if, if else, and else that guides the user to the * correct COLUMN. * * Find the YOUR CODE HERE 6 and begin coding after. */ else { System.out.println("Only dirt at (" + guessRow + ", " + guessCol + ")"); if (guessRow == locationRow) { System.out.println("You're in the right row!");
- 10. } // end if else if (guessRow > locationRow ) { System.out.println("The treasure is to the north."); } // end else if else { System.out.println("The treasure is to the south."); } // end else //**************************
- 11. // YOUR CODE HERE (6 of 7) //************************** /* * Set the backyard value at guessRow and guessCol * equal to the letter "O". Print the array afterward * using a nested for loop. */ //************************** // YOUR CODE HERE (7 of 7) //************************** } // end else
- 12. } // end while /* * Prints how many digs it took the user to find the treasure. */ System.out.println("You found the treasure after " + dug + " digs."); } }