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 ...
java write a program to evaluate the postfix expressionthe program.pdfarjuntelecom26
java write a program to evaluate the postfix expression
the program should ask users for input and show the postfix epression and then the result.
and to have a try and catch exception since we have an empty stack
Solution
Postfix.java
import java.util.Scanner;
public class Postfix
{
/**
* Reads and evaluates multiple postfix expressions.
*/
public static void main (String[] args)
{
String expression, again;
int result;
try
{
Scanner in = new Scanner(System.in);
do
{
PostfixEvaluator evaluator = new PostfixEvaluator();
System.out.println (\"Enter a valid postfix expression: \");
expression = in.nextLine();
result = evaluator.evaluate (expression);
System.out.println();
System.out.println (\"That expression equals \" + result);
System.out.print (\"Evaluate another expression [Y/N]? \");
again = in.nextLine();
System.out.println();
}
while (again.equalsIgnoreCase(\"y\"));
}
catch (Exception IOException)
{
System.out.println(\"Input exception reported\");
}
}
}
PostfixEvaluator.java
//import datastructures.ArrayStack;
import java.util.StringTokenizer;
public class PostfixEvaluator
{
/** constant for addition symbol */
private final char ADD = \'+\';
/** constant for subtraction symbol */
private final char SUBTRACT = \'-\';
/** constant for multiplication symbol */
private final char MULTIPLY = \'*\';
/** constant for division symbol */
private final char DIVIDE = \'/\';
/** the stack */
private ArrayStack stack;
/**
* Sets up this evaluator by creating a new stack.
*/
public PostfixEvaluator()
{
stack = new ArrayStack();
}
/**
* Evaluates the specified postfix expression. If an operand is
* encountered, it is pushed onto the stack. If an operator is
* encountered, two operands are popped, the operation is
* evaluated, and the result is pushed onto the stack.
* //param expr String representation of a postfix expression
* //return int value of the given expression
*/
public int evaluate (String expr)
{
int op1, op2, result = 0;
String token;
StringTokenizer tokenizer = new StringTokenizer (expr);
while (tokenizer.hasMoreTokens())
{
token = tokenizer.nextToken();
if (isOperator(token))
{
op2 = (stack.pop()).intValue();
op1 = (stack.pop()).intValue();
result = evalSingleOp (token.charAt(0), op1, op2);
stack.push (new Integer(result));
}
else
stack.push (new Integer(Integer.parseInt(token)));
}
return result;
}
/**
* Determines if the specified token is an operator.
* //param token String representing a single token
* //return boolean true if token is operator
*/
private boolean isOperator (String token)
{
return ( token.equals(\"+\") || token.equals(\"-\") ||
token.equals(\"*\") || token.equals(\"/\") );
}
/**
* Performs integer evaluation on a single expression consisting of
* the specified operator and operands.
* //param operation operation to be performed
* //param op1 the first operand
* //param op2 the second operand
* //return int value of the expression
*/
private int evalSingleOp (char operation, int op1, int op2)
{
int result = 0;
switch .
Please review my code (java)Someone helped me with it but i cannot.pdffathimafancyjeweller
Please make it to clear 12-95. The basketball passed through the hoop even though it barely
cleared the hands of the player B who attempted to block it. Neglecting the size of the ball,
determine the magnitude vn of its initial velocity and the height h of the ball when it passes over
player B 10 ft 5 ft Prob. 12-95
Solution
Consider the motion along horizontal direction
Vox = initial velocity in horizontal direction = Va Cos30
X = horizontal distance = 25 + 3 = 28 ft
t = time taken
t = X / Vox = 28/(Va Cos30) eq-1
consider the motion in vertical direction
Y = vertical displacement = 10 - 7 = 3 ft
a = acceleration = - 32.2
Voy = initial velocity = Va Sin30
t = time taken
using the equation
Y = Voy t + (0.5) a t2
3 = (Va Sin30) (28/(Va Cos30)) + (0.5) (- 32.2) (28/(Va Cos30))2
Va = 35.8 m/s
t\' = time taken to reach B = 25 / (Va Cos30) = 25 / (35.8 Cos30) = 0.81 sec
h = 7 + Voy t\' + (0.5) a t\'2
h = 7 + (35.8 Sin30) (0.81) + (0.5) (- 32.2) (0.81)2
h = 10.94 ft.
Modifications highlighted in bold lettersDropOutStack.javaim.pdfLalkamal2
//Modifications highlighted in bold letters
//DropOutStack.java
import java.util.Arrays;
public class DropOutStack {
/**
* Defines the interface to a stack collection.
*
* @author Java Foundations
* @version 4.0
*/
public interface StackADT {
/**
* Adds the specified element to the top of this stack.
*
* @param element
* element to be pushed onto the stack
*/
public void push(T element);
/**
* Removes and returns the top element from this stack.
*
* @return the element removed from the stack
*/
public T pop();
/**
* Returns without removing the top element of this stack.
*
* @return the element on top of the stack
*/
public T peek();
/**
* Returns true if this stack contains no elements.
*
* @return true if the stack is empty
*/
public boolean isEmpty();
/**
* Returns the number of elements in this stack.
*
* @return the number of elements in the stack
*/
public int size();
/**
* Returns a string representation of this stack.
*
* @return a string representation of the stack
*/
public String toString();
}
/**
* Represents the situation in which a collection is empty.
*
* @author Java Foundations
* @version 4.0
*/
public static class EmptyCollectionException extends RuntimeException {
/**
* Sets up this exception with an appropriate message.
*
* @param collection
* the name of the collection
*/
public EmptyCollectionException(String collection) {
super(\"The \" + collection + \" is empty.\");
}
}
/**
* Program entry point for stack testing.
*
* @param args
* Argument list.
*/
public static void main(String[] args) {
ArrayDropOutStack stack = new ArrayDropOutStack(4);
System.out.println(\"DROP-OUT STACK TESTING\");
stack.push(1);
stack.push(2);
stack.push(3);
stack.push(4);
System.out.println(\"Stack : \"+stack.toString());
System.out.println(\"pushing 5 element \");
stack.push(5);
System.out.println(\"Now stack elements\");
System.out.println(stack.toString());
System.out.println(\"The size of the stack is: \" + stack.size());
if (!stack.isEmpty())
System.out.println(\"The stack contains:\ \" + stack.toString());
stack.pop();
System.out.println(\"poping element 5\"+stack.toString());
System.out.println(\"The size of the stack is: \" + stack.size());
System.out.println(\"pushing 7 element \");
stack.push(7);
System.out.println(\"Now stack elements\");
System.out.println(stack.toString());
System.out.println(\"pushing 8 element \");
stack.push(8);
System.out.println(\"Now stack elements\");
System.out.println(stack.toString());
if (!stack.isEmpty())
System.out.println(\"The stack contains:\ \" + stack.toString());
}
/**
* An array implementation of a stack in which the bottom of the stack is
* fixed at index 0.
*
* @author Java Foundations
* @version 4.0
*/
public static class ArrayDropOutStack implements StackADT {
private final static int DEFAULT_CAPACITY = 100;
private int top;
private T[] stack;
/**
* Creates an empty stack using the default capacity.
*/
public ArrayDropOutStack() {
this(DEFAULT_CAPACITY);
}
/**
* Creates an empty stack using.
StackInterface An interface for the ADT stack. Do not modif.pdfARCHANASTOREKOTA
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.
Implement the ADT stack by using an array stack to contain its entri.pdfSIGMATAX1
Implement the ADT stack by using an array stack to contain its entries. Expand the array
dynamically, as necessary. Maintain the stack’s bottom entry in stack[stack.length – 1].
Your Stack class must implement StackInterface (provided). You may use ArrayStack.java
(provided) as the starting point for your implementation.
You must implement a comprehensive set of unit tests using the main() method (and private
utility methods) in ArrayStack.java.
ArrayStack.java
public class ArrayStack implements StackInterface
{
private T[] stack; // Array of stack entries
private int topIndex; // Index of top entry
private boolean initialized = false;
private static final int DEFAULT_CAPACITY = 50;
private static final int MAX_CAPACITY = 10000;
public ArrayStack()
{
this(DEFAULT_CAPACITY);
} // end default constructor
public ArrayStack(int initialCapacity)
{
checkCapacity(initialCapacity);
// The cast is safe because the new array contains null entries
@SuppressWarnings(\"unchecked\")
T[] tempStack = (T[])new Object[initialCapacity];
stack = tempStack;
topIndex = -1;
initialized = true;
} // end constructor
// < Implementations of the stack operations go here. >
// < Implementations of the private methods go here; checkCapacity and
// checkInitialization are analogous to those in Chapter 2. >
// . . .
} // end ArrayStack
StackInterface.java
public interface StackInterface
{
/** Adds a new entry to the top of this stack.
@param newEntry An object to be added to the stack. */
public void push(T newEntry);
/** Removes and returns this stack\'s top entry.
@return The object at the top of the stack.
@throws EmptyStackException if the stack is empty before the operation. */
public T pop();
/** Retrieves this stack\'s top entry.
@return The object at the top of the stack.
@throws EmptyStackException if the stack is empty. */
public T peek();
/** Detects whether this stack is empty.
@return True if the stack is empty. */
public boolean isEmpty();
/** Removes all entries from this stack. */
public void clear();
} // end StackInterface
Solution
StackTester.java
public class StackTester
{
public static void main(String[] args)
{
ArrayStack aS = new ArrayStack();
aS.push(3);
aS.push(5);
aS.push(10);
aS.push(11);
System.out.println(\"\"+ aS.peek() + \", \" + aS.pop() + \", \" + aS.peek2());
aS.remove(1);
}
}
ArrayStack.java
import java.util.Arrays;
public class ArrayStack implements StackInterface
{
private T[] stack;
private int topIndex;
private boolean initialized = false;
private static final int DEFAULT_CAPACITY = 50;
private static final int MAX_CAPACITY = 10000;
public ArrayStack()
{
this(DEFAULT_CAPACITY);
}
public ArrayStack(int initialCapacity)
{
checkCapacity(initialCapacity);
@SuppressWarnings(\"unchecked\")
T[] tempStack = (T[])new Object[initialCapacity];
stack = tempStack;
topIndex = -1;
initialized = true;
}
public boolean isEmpty()
{
return topIndex < 0;
}
private void ensureCapacity()
{
if(topIndex == stack.length - 1)
{
int newLength = 2*stack.length;
.
A linked stack is implemented using a standard Node class as follows.pdfkisgstin23
A linked stack is implemented using a standard Node class as follows: import java.util.*; class
stack implements Iterable {private Node top; private int size; public stack () {top = null; size =
0;} public Object pop() {if (size == 0) throw new RuntimeException (\"\"); Object answer =
top.getData (); top = top.getNext (); Size --; return answer;} public void push (Object x) {Node
newNode = new Node (x top); top = newNode; size++;}//the iterator method is missing} Write a
class StackIterator to implement objects that can be returned by the stack iterator. Also write the
missing stack method called iterator. You can decide whether the iterator will run through the
data in the stack in LIFO or FIFO order (one choice is much easier).
Solution
Hi,
Pease find the program below:
import java.util.*;
import java.lang.Iterable;
@SuppressWarnings(\"rawtypes\")
public class LinkedStack implements Iterable{
private int n; // size of the stack
private Node first; // top of stack
// Helper linked list class
private class Node {
private Object item;
private Node next;
}
/**
* Initializes an empty stack.
*/
public LinkedStack() {
first = null;
n = 0;
}
/**
* Is this stack empty?
* @return true if this stack is empty; false otherwise
*/
public boolean isEmpty() {
return first == null;
}
/**
* Returns the number of items in the stack.
*/
public int size() {
return n;
}
/**
* Adds the item to this stack.
*/
public void push(Object item) {
Node oldfirst = first;
first = new Node();
first.item = item;
first.next = oldfirst;
n++;
}
/**
* Removes and returns the item most recently added to this stack.
* @return the item most recently added
*/
public Object pop() {
if (isEmpty()) throw new NoSuchElementException(\"Stack underflow\");
Object item = first.item; // save item to return
first = first.next; // delete first node
n--; //decreases the size by 1
return item; // return the saved item
}
/**
* Returns (but does not remove) the item most recently added to this stack.
* @return the item most recently added to this stack
*/
public Object peek() {
if (isEmpty()) throw new NoSuchElementException(\"Stack underflow\");
return first.item;
}
/**
* Returns an iterator to this stack that iterates through the items in LIFO order.
*/
public Iterator iterator() {
return new ListIterator();
}
// an iterator, doesn\'t implement remove() since it\'s optional
private class ListIterator implements Iterator {
private int i = n;
private Node first1 = first; //the first node
public boolean hasNext()
{
return (i > 0);
}
public Object next()
{
Object item = first1.item;
first1 = first1.next;
i--;
return item;
}
public void remove()
{
// not needed as this is optional
}
}
//Main method to implement the test
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
/* Creating object of class linkedStack */
LinkedStack ls = new LinkedStack();
/* Perform Stack Operations */
System.out.println(\"Linked Stack Test\ \");
char ch;
do
{
System.out.println(\"\ Linked Stack .
package singlylinkedlist; public class Node { public String valu.pdfamazing2001
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 write a program to evaluate the postfix expressionthe program.pdfarjuntelecom26
java write a program to evaluate the postfix expression
the program should ask users for input and show the postfix epression and then the result.
and to have a try and catch exception since we have an empty stack
Solution
Postfix.java
import java.util.Scanner;
public class Postfix
{
/**
* Reads and evaluates multiple postfix expressions.
*/
public static void main (String[] args)
{
String expression, again;
int result;
try
{
Scanner in = new Scanner(System.in);
do
{
PostfixEvaluator evaluator = new PostfixEvaluator();
System.out.println (\"Enter a valid postfix expression: \");
expression = in.nextLine();
result = evaluator.evaluate (expression);
System.out.println();
System.out.println (\"That expression equals \" + result);
System.out.print (\"Evaluate another expression [Y/N]? \");
again = in.nextLine();
System.out.println();
}
while (again.equalsIgnoreCase(\"y\"));
}
catch (Exception IOException)
{
System.out.println(\"Input exception reported\");
}
}
}
PostfixEvaluator.java
//import datastructures.ArrayStack;
import java.util.StringTokenizer;
public class PostfixEvaluator
{
/** constant for addition symbol */
private final char ADD = \'+\';
/** constant for subtraction symbol */
private final char SUBTRACT = \'-\';
/** constant for multiplication symbol */
private final char MULTIPLY = \'*\';
/** constant for division symbol */
private final char DIVIDE = \'/\';
/** the stack */
private ArrayStack stack;
/**
* Sets up this evaluator by creating a new stack.
*/
public PostfixEvaluator()
{
stack = new ArrayStack();
}
/**
* Evaluates the specified postfix expression. If an operand is
* encountered, it is pushed onto the stack. If an operator is
* encountered, two operands are popped, the operation is
* evaluated, and the result is pushed onto the stack.
* //param expr String representation of a postfix expression
* //return int value of the given expression
*/
public int evaluate (String expr)
{
int op1, op2, result = 0;
String token;
StringTokenizer tokenizer = new StringTokenizer (expr);
while (tokenizer.hasMoreTokens())
{
token = tokenizer.nextToken();
if (isOperator(token))
{
op2 = (stack.pop()).intValue();
op1 = (stack.pop()).intValue();
result = evalSingleOp (token.charAt(0), op1, op2);
stack.push (new Integer(result));
}
else
stack.push (new Integer(Integer.parseInt(token)));
}
return result;
}
/**
* Determines if the specified token is an operator.
* //param token String representing a single token
* //return boolean true if token is operator
*/
private boolean isOperator (String token)
{
return ( token.equals(\"+\") || token.equals(\"-\") ||
token.equals(\"*\") || token.equals(\"/\") );
}
/**
* Performs integer evaluation on a single expression consisting of
* the specified operator and operands.
* //param operation operation to be performed
* //param op1 the first operand
* //param op2 the second operand
* //return int value of the expression
*/
private int evalSingleOp (char operation, int op1, int op2)
{
int result = 0;
switch .
Please review my code (java)Someone helped me with it but i cannot.pdffathimafancyjeweller
Please make it to clear 12-95. The basketball passed through the hoop even though it barely
cleared the hands of the player B who attempted to block it. Neglecting the size of the ball,
determine the magnitude vn of its initial velocity and the height h of the ball when it passes over
player B 10 ft 5 ft Prob. 12-95
Solution
Consider the motion along horizontal direction
Vox = initial velocity in horizontal direction = Va Cos30
X = horizontal distance = 25 + 3 = 28 ft
t = time taken
t = X / Vox = 28/(Va Cos30) eq-1
consider the motion in vertical direction
Y = vertical displacement = 10 - 7 = 3 ft
a = acceleration = - 32.2
Voy = initial velocity = Va Sin30
t = time taken
using the equation
Y = Voy t + (0.5) a t2
3 = (Va Sin30) (28/(Va Cos30)) + (0.5) (- 32.2) (28/(Va Cos30))2
Va = 35.8 m/s
t\' = time taken to reach B = 25 / (Va Cos30) = 25 / (35.8 Cos30) = 0.81 sec
h = 7 + Voy t\' + (0.5) a t\'2
h = 7 + (35.8 Sin30) (0.81) + (0.5) (- 32.2) (0.81)2
h = 10.94 ft.
Modifications highlighted in bold lettersDropOutStack.javaim.pdfLalkamal2
//Modifications highlighted in bold letters
//DropOutStack.java
import java.util.Arrays;
public class DropOutStack {
/**
* Defines the interface to a stack collection.
*
* @author Java Foundations
* @version 4.0
*/
public interface StackADT {
/**
* Adds the specified element to the top of this stack.
*
* @param element
* element to be pushed onto the stack
*/
public void push(T element);
/**
* Removes and returns the top element from this stack.
*
* @return the element removed from the stack
*/
public T pop();
/**
* Returns without removing the top element of this stack.
*
* @return the element on top of the stack
*/
public T peek();
/**
* Returns true if this stack contains no elements.
*
* @return true if the stack is empty
*/
public boolean isEmpty();
/**
* Returns the number of elements in this stack.
*
* @return the number of elements in the stack
*/
public int size();
/**
* Returns a string representation of this stack.
*
* @return a string representation of the stack
*/
public String toString();
}
/**
* Represents the situation in which a collection is empty.
*
* @author Java Foundations
* @version 4.0
*/
public static class EmptyCollectionException extends RuntimeException {
/**
* Sets up this exception with an appropriate message.
*
* @param collection
* the name of the collection
*/
public EmptyCollectionException(String collection) {
super(\"The \" + collection + \" is empty.\");
}
}
/**
* Program entry point for stack testing.
*
* @param args
* Argument list.
*/
public static void main(String[] args) {
ArrayDropOutStack stack = new ArrayDropOutStack(4);
System.out.println(\"DROP-OUT STACK TESTING\");
stack.push(1);
stack.push(2);
stack.push(3);
stack.push(4);
System.out.println(\"Stack : \"+stack.toString());
System.out.println(\"pushing 5 element \");
stack.push(5);
System.out.println(\"Now stack elements\");
System.out.println(stack.toString());
System.out.println(\"The size of the stack is: \" + stack.size());
if (!stack.isEmpty())
System.out.println(\"The stack contains:\ \" + stack.toString());
stack.pop();
System.out.println(\"poping element 5\"+stack.toString());
System.out.println(\"The size of the stack is: \" + stack.size());
System.out.println(\"pushing 7 element \");
stack.push(7);
System.out.println(\"Now stack elements\");
System.out.println(stack.toString());
System.out.println(\"pushing 8 element \");
stack.push(8);
System.out.println(\"Now stack elements\");
System.out.println(stack.toString());
if (!stack.isEmpty())
System.out.println(\"The stack contains:\ \" + stack.toString());
}
/**
* An array implementation of a stack in which the bottom of the stack is
* fixed at index 0.
*
* @author Java Foundations
* @version 4.0
*/
public static class ArrayDropOutStack implements StackADT {
private final static int DEFAULT_CAPACITY = 100;
private int top;
private T[] stack;
/**
* Creates an empty stack using the default capacity.
*/
public ArrayDropOutStack() {
this(DEFAULT_CAPACITY);
}
/**
* Creates an empty stack using.
StackInterface An interface for the ADT stack. Do not modif.pdfARCHANASTOREKOTA
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.
Implement the ADT stack by using an array stack to contain its entri.pdfSIGMATAX1
Implement the ADT stack by using an array stack to contain its entries. Expand the array
dynamically, as necessary. Maintain the stack’s bottom entry in stack[stack.length – 1].
Your Stack class must implement StackInterface (provided). You may use ArrayStack.java
(provided) as the starting point for your implementation.
You must implement a comprehensive set of unit tests using the main() method (and private
utility methods) in ArrayStack.java.
ArrayStack.java
public class ArrayStack implements StackInterface
{
private T[] stack; // Array of stack entries
private int topIndex; // Index of top entry
private boolean initialized = false;
private static final int DEFAULT_CAPACITY = 50;
private static final int MAX_CAPACITY = 10000;
public ArrayStack()
{
this(DEFAULT_CAPACITY);
} // end default constructor
public ArrayStack(int initialCapacity)
{
checkCapacity(initialCapacity);
// The cast is safe because the new array contains null entries
@SuppressWarnings(\"unchecked\")
T[] tempStack = (T[])new Object[initialCapacity];
stack = tempStack;
topIndex = -1;
initialized = true;
} // end constructor
// < Implementations of the stack operations go here. >
// < Implementations of the private methods go here; checkCapacity and
// checkInitialization are analogous to those in Chapter 2. >
// . . .
} // end ArrayStack
StackInterface.java
public interface StackInterface
{
/** Adds a new entry to the top of this stack.
@param newEntry An object to be added to the stack. */
public void push(T newEntry);
/** Removes and returns this stack\'s top entry.
@return The object at the top of the stack.
@throws EmptyStackException if the stack is empty before the operation. */
public T pop();
/** Retrieves this stack\'s top entry.
@return The object at the top of the stack.
@throws EmptyStackException if the stack is empty. */
public T peek();
/** Detects whether this stack is empty.
@return True if the stack is empty. */
public boolean isEmpty();
/** Removes all entries from this stack. */
public void clear();
} // end StackInterface
Solution
StackTester.java
public class StackTester
{
public static void main(String[] args)
{
ArrayStack aS = new ArrayStack();
aS.push(3);
aS.push(5);
aS.push(10);
aS.push(11);
System.out.println(\"\"+ aS.peek() + \", \" + aS.pop() + \", \" + aS.peek2());
aS.remove(1);
}
}
ArrayStack.java
import java.util.Arrays;
public class ArrayStack implements StackInterface
{
private T[] stack;
private int topIndex;
private boolean initialized = false;
private static final int DEFAULT_CAPACITY = 50;
private static final int MAX_CAPACITY = 10000;
public ArrayStack()
{
this(DEFAULT_CAPACITY);
}
public ArrayStack(int initialCapacity)
{
checkCapacity(initialCapacity);
@SuppressWarnings(\"unchecked\")
T[] tempStack = (T[])new Object[initialCapacity];
stack = tempStack;
topIndex = -1;
initialized = true;
}
public boolean isEmpty()
{
return topIndex < 0;
}
private void ensureCapacity()
{
if(topIndex == stack.length - 1)
{
int newLength = 2*stack.length;
.
A linked stack is implemented using a standard Node class as follows.pdfkisgstin23
A linked stack is implemented using a standard Node class as follows: import java.util.*; class
stack implements Iterable {private Node top; private int size; public stack () {top = null; size =
0;} public Object pop() {if (size == 0) throw new RuntimeException (\"\"); Object answer =
top.getData (); top = top.getNext (); Size --; return answer;} public void push (Object x) {Node
newNode = new Node (x top); top = newNode; size++;}//the iterator method is missing} Write a
class StackIterator to implement objects that can be returned by the stack iterator. Also write the
missing stack method called iterator. You can decide whether the iterator will run through the
data in the stack in LIFO or FIFO order (one choice is much easier).
Solution
Hi,
Pease find the program below:
import java.util.*;
import java.lang.Iterable;
@SuppressWarnings(\"rawtypes\")
public class LinkedStack implements Iterable{
private int n; // size of the stack
private Node first; // top of stack
// Helper linked list class
private class Node {
private Object item;
private Node next;
}
/**
* Initializes an empty stack.
*/
public LinkedStack() {
first = null;
n = 0;
}
/**
* Is this stack empty?
* @return true if this stack is empty; false otherwise
*/
public boolean isEmpty() {
return first == null;
}
/**
* Returns the number of items in the stack.
*/
public int size() {
return n;
}
/**
* Adds the item to this stack.
*/
public void push(Object item) {
Node oldfirst = first;
first = new Node();
first.item = item;
first.next = oldfirst;
n++;
}
/**
* Removes and returns the item most recently added to this stack.
* @return the item most recently added
*/
public Object pop() {
if (isEmpty()) throw new NoSuchElementException(\"Stack underflow\");
Object item = first.item; // save item to return
first = first.next; // delete first node
n--; //decreases the size by 1
return item; // return the saved item
}
/**
* Returns (but does not remove) the item most recently added to this stack.
* @return the item most recently added to this stack
*/
public Object peek() {
if (isEmpty()) throw new NoSuchElementException(\"Stack underflow\");
return first.item;
}
/**
* Returns an iterator to this stack that iterates through the items in LIFO order.
*/
public Iterator iterator() {
return new ListIterator();
}
// an iterator, doesn\'t implement remove() since it\'s optional
private class ListIterator implements Iterator {
private int i = n;
private Node first1 = first; //the first node
public boolean hasNext()
{
return (i > 0);
}
public Object next()
{
Object item = first1.item;
first1 = first1.next;
i--;
return item;
}
public void remove()
{
// not needed as this is optional
}
}
//Main method to implement the test
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
/* Creating object of class linkedStack */
LinkedStack ls = new LinkedStack();
/* Perform Stack Operations */
System.out.println(\"Linked Stack Test\ \");
char ch;
do
{
System.out.println(\"\ Linked Stack .
package singlylinkedlist; public class Node { public String valu.pdfamazing2001
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.
/**
* @author Derek Harter
* @cwid 123 45 678
* @class
* @ide Visual Studio Community 2017
* @date
* @assg C++ Stacks videos
*
* @description A Stack ADT with two concrete impelementation
* examples: an array based stack implementaiton (AStack), and
* a linked list based implementation (LStack).
*/
#include <iostream>
#include <string>
#include <sstream>
using namespace std;
//-------------------------------------------------------------------------
/** stack (base class)
* The basic definition of the Stack Abstract Data Type (ADT)
* and stack operations. All declared functions here are
* virtual, they must be implemented by concrete derived
* classes.
*/
template <class T>
class Stack
{
public:
/** clear
* Method to clear out or empty any items on stack,
* put stack back to empty state.
* Postcondition: Stack is empty.
*/
virtual void clear() = 0;
/** isEmpty
* Function to determine whether the stack is empty. Needed
* because it is undefined to pop from empty stack. This
* function will not change the state of the stack (const).
*
* @returns bool true if stack is empty, false otherwise.
*/
virtual bool isEmpty() const = 0;
/** push
* Add a new item onto top of stack.
*
* @param newItem The item of template type T to push on top of
* the current stack.
*/
virtual void push(const T& newItem) = 0;
/** top
* Return the top item from the stack. Note in this ADT, peeking
* at the top item does not remove the top item. Some ADT combine
* top() and pop() as one operation. It is undefined to try and
* peek at the top item of an empty stack. Derived classes should
* throw an exception if this is attempted.
*
* @returns T Returns the top item from stack.
*/
virtual T top() const = 0;
/** pop
* Remove the item from the top of the stack. It is undefined what
* it means to try and pop from an empty stack. Derived classes should
* throw an exception if pop() from empty is attempted.
*/
virtual void pop() = 0;
/** size
* Accessor method to provide the current size of the stack.
*/
virtual int size() const = 0;
/** tostring
* Represent stack as a string
*/
virtual string tostring() const = 0;
// operload operators, mostly to support boolean comparison between
// two stacks for testing
bool operator==(const Stack<T>& rhs) const;
virtual const T& operator[](int index) const = 0;
// overload output stream operator for all stacks using tostring()
template <typename U>
friend ostream& operator<<(ostream& out, const Stack<U>& aStack);
};
/** Stack equivalence
* Compare two given stacks to determine if they are equal or not.
* stacks are equal if they are both of the same size, and each corresponding
* item on each stack is equal at the same position on the stack.
* This function relies on overloaded operator[] to access items on stack
* by index for the comparis.
EmptyCollectionException-java -- - Represents the situation in which.docxBlakeSGMHemmingss
EmptyCollectionException.java
/*
* Represents the situation in which a collection is empty.
*/
public class EmptyCollectionException extends RuntimeException
{
/* General class level objects */
/*
* Sets up this exception with an appropriate message.
* @param collection the name of the collection
*/
public EmptyCollectionException(String collection)
{
super("The " + collection + " is empty.");
}
}
PriorityNode.java
/*
* Represents a node in a linked list.
*/
public class PriorityNode<T>
{
/* General class level objects */
private PriorityNode<T> _next;
private T _element;
private int _priority;
private final int _MAX_PRIORITY = 100;
/*
* Creates an empty node with a given priority.
*/
public PriorityNode(T elem, int priority)
{
// TODO To be completed as a Programming Project
}
/*
* Creates a node storing the specified element with a default priority.
*
* @param elem element to be stored
*/
public PriorityNode(T elem)
{
// TODO To be completed as a Programming Project
}
/*
* Returns the node that follows this one.
*
* @return reference to next node
*/
public PriorityNode<T> getNext()
{
// TODO To be completed as a Programming Project
}
/*
* Sets the node that follows this one.
*
* @param node node to follow this one
*/
public void setNext(PriorityNode<T> node)
{
// TODO To be completed as a Programming Project
}
/*
* Returns the element stored in this node.
*
* @return element stored at the node
*/
public T getElement()
{
// TODO To be completed as a Programming Project
}
/*
* Returns the priority of this node.
*
* @return element priority the node
*/
public int getPriority()
{
// TODO To be completed as a Programming Project
}
/*
* Sets the element stored in this node.
*
* @param elem element to be stored at this node
*/
public void setElement(T elem)
{
// TODO To be completed as a Programming Project
}
/*
* optional toString() override.
*/
//public String toString()
//{
// // TODO To be completed as a Programming Project
//}
}
PriorityQueue.java
/*
* LinkedQueue represents a linked implementation of a queue.
*/
public class PriorityQueue<T> implements PriorityQueueADT<T>
{
/* General class level objects */
private int _count;
private PriorityNode<T> _head, _tail;
/*
* Constructor - Creates an empty queue.
*/
public PriorityQueue()
{
_count = 0;
_head = _tail = null;
}
/*
* Adds one element to the rear of this queue.
* Higher priorities are inserted closer to the front of the queue
* Items with the same priority are processed in normal queue order
*
* @param element the element to be added to the rear of the queue
* @param priority relative priority of the queue item
*/
public void enqueue(T element, int priority)
{
// TODO To be completed as a Programming Project
// add in-order insertion of the PriorityNode based on getPriority() value
// the higher the priority is the closer to head it gets
// equivalent priority is normal .
we using java code DynamicArrayjava Replace all .pdfgudduraza28
we using java code /** * DynamicArray.java * * Replace all //TODO tags with your code * * Note
that below the "//TODO" tag there may be * something like "return null;", "return 0;", etc. * That line
is just "stubbed in" so the class * will compile. When you add your code (one or many *
statements), you will want to delete the "stubbed" line. * By "stubbed in" we mean "mocked" or
"faked in" temporarily. * * When testing, construct using the static factory methods:
DynamicList.newEmpty() DynamicList.fromGrowthFactor(growthFactor)
DynamicList.from(arrayElements) */ package model.list; import java.lang.reflect.Array; import
java.util.concurrent.atomic.AtomicInteger; import java.util.function.BiFunction; import
java.util.function.Consumer; import java.util.function.Function; import
model.linearpub.DynamicList; import model.linearpub.StructureIterator; public class
DynamicArray<E> implements DynamicList<E> { //--------------------------------- // Instance Variables
//TODO - declare instance variable(s) //--------------------------------- // Private Constructors /**
Constructs and returns new DynamicArray (no args constructor) */ private DynamicArray() {
this(defaultGrowthFactor()); } /** Constructs and returns new DynamicArray with "aGrowthFactor"
*/ private DynamicArray(double aGrowthFactor) { //TODO -- this is the constructor that should
//initialize the dynamic array as needed } //------------------------------------------------ public static double
defaultGrowthFactor() { //TODO - replace 0 with a good growth factor return 0; } protected static int
defaultInitialCapacity() { //TODO - replace 0 with a good initial capacity return 0; } //--------------------
List Statistics --------------------- /** * Return number of elements in this list. */ @Override public int
size() { //TODO return 0; } /** * Return true is this list contains no elements. */ @Override public
boolean isEmpty() { //TODO return false; } //------------------ Accessing Elements -------------------- /**
* Return element at given index. * Throws IndexOutOfBoundsException if passed index is invalid.
*/ @Override public E get(int index) { //TODO return null; } /** * Return first element * Throws
RuntimeException if list is empty */ @Override public E first() { //TODO return null; } /** * Return
last element * Throws RuntimeException if list is empty */ @Override public E last() { //TODO
return null; } /** * Return a new list containing the elements of this list * between the given index
"start" (inclusive) and * the given index "stop" (exclusive). * Throws IndexOutOfBoundsException if
either passed index is invalid. */ @Override public DynamicList<E> subList(int start, int stop) {
//TODO return null; } /** * Return index of first matching element (where searchFct outputs true) *
Return -1 if no match * Example usage (first list of integers, then employees): * index =
list.find(eaInteger -> eaInteger == 10); * index = employeeList.find(employee -> employee
.getFirstName().equals("Kofi.
Java Foundations StackADT-java --- - Defines the interface to a stack.docxVictorXUQGloverl
Java Foundations
StackADT.java
/**
* Defines the interface to a stack collection.
*
* @author Java Foundations
* @version 4.0
*/
public interface StackADT<T> {
/**
* Adds the specified element to the top of this stack.
*
* @param element element to be pushed onto the stack
*/
public void push(T element);
/**
* Removes and returns the top element from this stack.
*
* @return the element removed from the stack
* @throws EmptyCollectionException if the stack is empty
*/
public T pop();
/**
* Returns the top element of this stack without removing it from the stack.
*
* @return the element on top of the stack. It is not removed from the stack
* @throws EmptyCollectionException if the stack is empty
*/
public T peek();
/**
* Returns true if this stack contains no elements.
*
* @return true if the stack is empty, false if the stack is not empty
*/
public boolean isEmpty();
/**
* Returns the number of elements in this stack.
*
* @return the number of elements in the stack
*/
public int size();
}
QueueADT.java
/**
* QueueADT defines the interface to a queue collection.
*
* @author Java Foundation
* @version 4.0
*/
public interface QueueADT<T> {
/**
* Adds one element to the rear of this queue.
*
* @param element the element to be added to the rear of the queue
*/
public void enqueue(T element);
/**
* Removes and returns the element at the front of this queue.
*
* @return the element at the front of the queue
* @throws EmptyCollectionException if the queue is empty
*/
public T dequeue();
/**
* Returns without removing the element at the front of this queue.
*
* @return the first element in the queue
* @throws EmptyCollectionException if the queue is empty
*/
public T first();
/**
* Returns true if this queue contains no elements.
*
* @return true if the queue is empty, false if the queue is not empty
*/
public boolean isEmpty();
/**
* Returns the number of elements in this queue.
*
* @return the number of elements in the queue
*/
public int size();
}
LinkedDeque.java
public class LinkedDeque<T> implements QueueADT<T>, StackADT<T>, DequeADT<T> {
// inner class for a double linked list node
private class DNode<T> {
private T element;
private DNode<T> prev, next;
}
// data fields for the LinkedDeque class
private DNode<T> front, rear;
private int size;
// deque interface methods
@Override
public void addFirst(T element) {
// create a new node and set it up
DNode<T> newNode = new DNode<T>();
newNode.element = element; // from param to new node obj
newNode.prev = newNode.next = null;
if(this.isEmpty()) {
// we are making the only node in the deque
this.rear = this.front = newNode;
} else {
// there already exists a new node
// so, put the new node before the front node
newNode.next = this.front;
this.front.prev = newNode;
this.front = newNode;
}
this.size++;
}
@Override
public T removeFirst() {
T grabbedElt = this.getFirst(); // checks for empty for us
if.
package algs13;
import stdlib.*;
import java.util.Iterator;
import java.util.NoSuchElementException;
/* ***********************************************************************
* Compilation: javac Queue.java
* Execution: java Queue < input.txt
* Data files: http://algs4.cs.princeton.edu/13stacks/tobe.txt
*
* A generic queue, implemented using a linked list.
*
* % java Queue < tobe.txt
* to be or not to be (2 left on queue)
*
*************************************************************************/
/**
* The <tt>Queue</tt> class represents a first-in-first-out (FIFO)
* queue of generic items.
* It supports the usual <em>enqueue</em> and <em>dequeue</em>
* operations, along with methods for peeking at the top item,
* testing if the queue is empty, and iterating through
* the items in FIFO order.
* <p>
* All queue operations except iteration are constant time.
* <p>
* For additional documentation, see <a href="http://algs4.cs.princeton.edu/13stacks">Section 1.3</a> of
* <i>Algorithms, 4th Edition</i> by Robert Sedgewick and Kevin Wayne.
*/
public class Queue<T> implements Iterable<T> {
private int N; // number of elements on queue
private Node<T> first; // beginning of queue
private Node<T> last; // end of queue
// helper linked list class
private static class Node<T> {
public Node() { }
public T item;
public Node<T> next;
}
/**
* Create an empty queue.
*/
public Queue() {
first = null;
last = null;
N = 0;
}
/**
* Is the queue empty?
*/
public boolean isEmpty() {
return first == null;
}
/**
* Return the number of items in the queue.
*/
public int size() {
return N;
}
/**
* Return the item least recently added to the queue.
* @throws java.util.NoSuchElementException if queue is empty.
*/
public T peek() {
if (isEmpty()) throw new NoSuchElementException("Queue underflow");
return first.item;
}
/**
* Add the item to the queue.
*/
public void enqueue(T item) {
Node<T> oldlast = last;
last = new Node<>();
last.item = item;
last.next = null;
if (isEmpty()) first = last;
else oldlast.next = last;
N++;
}
/**
* Remove and return the item on the queue least recently added.
* @throws java.util.NoSuchElementException if queue is empty.
*/
public T dequeue() {
if (isEmpty()) throw new NoSuchElementException("Queue underflow");
T item = first.item;
first = first.next;
N--;
if (isEmpty()) last = null;
return item;
}
/**
* Return string representation.
*/
public String toString() {
StringBuilder s = new StringBuilder();
for (T item : this)
s.append(item + " ");
return s.toString();
}
// check internal invariants
private static <T> boolean check(Queue<T> that) {
int N = that.N;
Queue.Node<T> first = that.first;
Queue.Node<T> last = that.last;
if (N == 0) {
if (first != null) return false;
if (last != null) return false;
}
else if (N == 1) {
if (f.
ReversePoem.java ---------------------------------- public cl.pdfravikapoorindia
ReversePoem.java :-
---------------------------------
public class ReversePoem {
/*This programs has you display a pessimistic poem from a list of phrases*/
// and then reverse the phrases to find another more optimistic poem.
public static void main(String[] args) throws Exception
{
//Queue object
MyQueue queue = new MyQueue<>();
//Stack object
MyStack stack = new MyStack<>();
//String buffer to apppend all Strings
StringBuffer sb = new StringBuffer();
// Create a single String object from the 16 Strings below
String set1 = \"I am part of a lost generation#and I refuse to believe that#\";
sb.append(set1);
String set2 = \"I can change the world#I realize this may be a shock but#\";
sb.append(set2);
String set3 = \"\'Happiness comes from within\'#is a lie, and#\";
sb.append(set3);
String set4 = \"\'Money will make me happy\'#So in 30 years I will tell my children#\";
sb.append(set4);
String set5 = \"they are not the most important thing in my life#\";
sb.append(set5);
String set6 = \"My employer will know that#I have my priorities straight because#\";
sb.append(set6);
String set7 = \"work#is more important than#family#I tell you this#\";
sb.append(set7);
String set8 = \"Once upon a time#Families stayed together#\";
sb.append(set8);
String set9 = \"but this will not be true in my era#\";
sb.append(set9);
String set10 = \"This is a quick fix society#Experts tell me#\";
sb.append(set10);
String set11 = \"30 years from now, I will be celebrating the 10th anniversary of my
divorce#\";
sb.append(set11);
String set12 = \"I do not concede that#I will live in a country of my own making#\";
sb.append(set12);
String set13 = \"In the future#Environmental destruction will be the norm#\";
sb.append(set13);
String set14 = \"No longer can it be said that#My peers and I care about this earth#\";
sb.append(set14);
String set15 = \"It will be evident that#My generation is apathetic and lethargic#\";
sb.append(set15);
String set16 = \"It is foolish to presume that#There is hope#\";
sb.append(set16);
String finalString = sb.toString();
String itmes[] = finalString.split(\"#\");
System.out.println(\"========== Original Phrase ==============\");
for(int i = 0 ; i < itmes.length;i++){
queue.enqueue(itmes[i]);
System.out.println(itmes[i]);
}
for(int i = 0 ; i < itmes.length;i++){
stack.push(queue.dequeue());
}
System.out.println(\"========== Reverse Phrase ==============\");
for(int i = 0 ; i < itmes.length;i++){
System.out.println(stack.pop());
}
/* You are given a list of phrases in Strings; the phrases
are separated by pound signs: \'#\':
1. Create a single String object from this list.
2. Then, split the String of phrases into an array of
phrases using the String split method.
3. Display a poem by walking through the array and
displaying each phrase one per line.
4. And, at the same time, place each phrase on a
MyQueue object using only the enqueue method.
5. After all the phrases have been placed on the queue,
transfer the phrases from the MyQueue object to a
MyS.
1 The goal is to implement DataStructuresArrayStack accor.pdfsaradashata
(1) The goal is to implement DataStructures.ArrayStack according to the interface ADTs.StackADT
********************************************
package DataStructures;
import ADTs.StackADT;
import Exceptions.EmptyCollectionException;
import Exceptions.StackOverflowException;
public class ArrayStack<T> implements StackADT<T> {
/** The index of where the top of the stack is */
int top;
/** The array that holds the stack */
T[] buffer;
public ArrayStack() {
}
public ArrayStack(int initialCapacity) {
}
}
*******************************************************
package ADTs;
import Exceptions.EmptyCollectionException;
import Exceptions.StackOverflowException;
/**
* An interface for a Stack
* Specific stack implementations will implement this interface
* For use Data Structures & Algorithms
*
*
* author unknown
*/
public interface StackADT<T> extends CollectionADT<T> {
/**
* Adds the specified element to the top of the stack
*
* @param element element to be pushed onto the stack
*/
public void push(T element) throws StackOverflowException;
/**
* Removes and returns the element that is on top of the stack
*
* @return the element removed from the stack
* @throws EmptyCollectionException
*/
public T pop() throws EmptyCollectionException;
/**
* Returns (without removing) the element that is on top of the stack
*
* @return the element on top of the stack
* @throws EmptyCollectionException
*/
public T peek() throws EmptyCollectionException;
}
*****************************************
package ADTs;
import Exceptions.*;
/**
* An interface for an ordered (NOT SORTED) List
* Elements stay in the order they are put in to the list
* For use in Data Structures & Algorithms
*
*
* @author unknown
*/
public interface ListADT<T> extends CollectionADT<T> {
/**
* Adds the specified element to the list at the front
*
* @param element: the element to be added
*
*/
public void addFirst(T element);
/**
* Adds the specified element to the end of the list
*
* @param element: the element to be added
*/
public void addLast(T element);
/**
* Adds the specified element to the list after the existing element
*
* @param existing: the element that is in the list already
* @param element: the element to be added
* @throws ElementNotFoundException if existing isn't in the list
*/
public void addAfter(T existing, T element) throws ElementNotFoundException,
EmptyCollectionException;
/**
* Removes and returns the specified element
*
* @return the element specified
* @throws EmptyCollectionException
* @throws ElementNotFoundException
*/
public T remove(T element) throws EmptyCollectionException, ElementNotFoundException;
/**
* Removes and returns the first element
*
* @return the first element in the list
* @throws EmptyCollectionException
*/
public T removeFirst() throws EmptyCollectionException;
/**
* Removes and returns the last element
*
* @return the last element in the list
* @throws EmptyCollectionException
*/
public T removeLast() throws EmptyCollectionException;
/**
* Returns (wit.
Please complete all the code as per instructions in Java programming.docxcgraciela1
Please complete all the code as per instructions in Java programming import org.w3c.dom.Node; import javax.xml.crypto.NodeSetData; import java.awt.*; import java.util.Iterator; import java.util.NoSuchElementException; /** * This class implements an acyclic (non-cyclic), doubly-linked list. * @param */ public class CiscDoublyLinkedList implements CiscList { /** * A reference to the first node in the list (or null if list is empty). */ private Node head; /** * A reference to the last node int the list (or null if list is empty). */ private Node tail; /** * Number of elements in the list. */ private int size; /** * Returns the number of elements in this list. * * * @return the number of elements in this list */ @Override public int size() { return size; } /** * Returns {@code true} if this list contains no elements. * * * @return {@code true} if this list contains no elements */ @Override public boolean isEmpty() { if (size == 0){ return true; } return false; } /** * Returns {@code true} if this list contains the specified element (compared using the {@code equals} method). * * * @param o element whose presence in this list is to be tested * @return {@code true} if this list contains the specified element * @throws NullPointerException if the specified element is null */ @Override public boolean contains(Object o) { if(o == null) { throw new NullPointerException(); } Node node = head; while(node != null) { if(node.data.equals(o)){ return true; } node = node.next; } return false; } /** * Returns the index of the first occurrence of the specified element in this list, or -1 if this list does not * contain the element (compared using the {@code equals} method). * * * @param o element to search for * @return the index of the first occurrence of the specified element in this list, or -1 if this list does not * contain the element * @throws NullPointerException if the specified element is null */ @Override public int indexOf(Object o) { if (o == null){ throw new NullPointerException(); } for(int i =0; i = size){ throw new IndexOutOfBoundsException(); } return null; } /** * Appends the specified element to the end of this list. * * *
Lists may place the specified element at arbitrary locations if desired. In particular, an ordered list will * insert the specified element at its sorted location. List classes should clearly specify in their documentation * how elements will be added to the list if different from the default behavior (end of this list). * * @param e element to be appended to this list * @return {@code true} * @throws NullPointerException if the specified element is null */ @Override public boolean add(E e) { if(e == null){ throw new NullPointerException(); } return false; } /** * Replaces the element at the specified position in this list with the specified element. * * * @param index index of the element to replace * @param element element to be stored at the specified position * @return the element previously at the specified position *.
java question Fill the add statement areaProject is to wo.pdfdbrienmhompsonkath75
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 =.
Need help with writing the test cases for the following code in java-.docxLucasmHKChapmant
Need help with this question ASAP! Please and thanks
2 points The is typically the most powerful stakeholder for the project but is often not the most powerful person in the company. 2 points The two axes on grid we use to measure the impact a stakeholder could have on our project and how we manage the relationship with them are and
.
Hi, Please find my code.I have correted all of your classes.Plea.pdfpritikulkarni20
Hi, Please find my code.
I have correted all of your classes.
Please let me know in case if do not get concpt.
######## Node.java ###########
public class Node {
private E element;
private Node next;
public Node() {
this.element = null;
this.next = null;
}
public Node(E e) {
this.element = e;
this.next = null;
}
public E getElement() {
return this.element;
}
public void setElement(E element) {
this.element= element;
}
public Node getNext() {
return next;
}
public void setNext(Node next) {
this.next = next;
}
}
########## Stack.java #############
public class Stack {
private int N;
private Node top;
public Stack() {
N = 0;
this.top =null;
}
/*
* places element on the top of the stack
*/
public void push(E element){
Node temp = new Node(element);
temp.setNext(top);
top = temp;
N++;
}
/*
* remove the top node and return its contents
*/
public E pop(){
if(top == null)
return null;
E e = top.getElement();
top = top.getNext();
N--;
return e;
}
/*
* Look at the top element of the Stack and return it, without removing
*/
public E peek(){
if(top == null)
return null;
return top.getElement();
}
//returns the size of the stack
public int size(){
return N; //replace
}
public boolean isEmpty(){
return top==null;
}
}
############ Queue.java ############
public class Queue {
private Node front;
private Node back;
private int N;
public Queue() {
this.front = null;
this.back = null;
N = 0;
}
/*
* places element in the back of the Queue
*/
public void enqueue(E element){
Node temp = new Node(element);
if(front == null) {
front = temp;
back = temp;
}
else{
back.setNext(temp);
back = temp;
}
N++;
}
/*
* remove the front node of the queue and return it
*/
public E dequeue(){
if(front == null) {
return null;
}
E item = front.getElement();
front = front.getNext();
// if we had only one element
if(front == null){
back = null;
}
N--;
return item;
}
/*
* Look at the front of the queue and return it, without removing
*/
public E peek(){
if(back == null)
return null;
return back.getElement();
}
//returns the size of the queue
public int size(){
return N;
}
public boolean isEmpty(){
return front==null;
}
}
########### Palindrome.java ############
import java.util.Scanner;
public class Palindrome
{
public static void main(String[ ] args)
{
Scanner input = new Scanner(System.in);
String inputString;
System.out.print(\"Please enter your string: \");
inputString = input.next( );
if (isPalindrome( inputString )){
System.out.println(\"Yes it is a palindrome.\");
}
else{
System.out.println(\"No this is not a palindrome.\");
}
}
public static boolean isPalindrome(String input)
{
Queue q = new Queue ();
Stack s = new Stack ();
char letter;
int i;
for (i = 0; i < input.length( ); i++)
{
letter = input.charAt(i);
q.enqueue(letter);
s.push(letter);
}
while (!q.isEmpty( ))
{
if (q.dequeue() != s.pop( ))
return false;
}
return true;
}
}
/*
Sample Output:
Please enter your string: MadaM
Yes it is a palindrome.
*/
Solution
Hi, Please find my code.
I have correted all of your classes.
Pl.
META-INF/MANIFEST.MF
Manifest-Version: 1.0
.classpath
PriorityQueue.classpublicsynchronizedclass PriorityQueue {
Heap q;
public void PriorityQueue(int, java.util.Comparator);
public Object peek();
public Object remove();
void add(Object);
boolean isEmpty();
public int size();
}
PriorityQueue.javaPriorityQueue.javaimport java.util.Comparator;
publicclassPriorityQueue<E>{
Heap q;
/**
*PriorityQueue initializes the queue.
*
* @param initialCapacity an int that is the heaps initial size.
* @param comparator the priority of various imputs.
*/
publicPriorityQueue(int initialCapacity,Comparator<?super E> comparator){
q=newHeap(initialCapacity,comparator);
}
/**
* Peek, returns the next item in the queue without removing it.
*
* If it is empty then null is returned.
* @return the next item in the queue.
*/
public E peek(){
if(q.size()==0){
returnnull;
}
return(E) q.findMax();
}
/**
* This removes the first item from the queue.
*
* It returns null if the queue is empty.
* @return the first item in the queue.
*/
public E remove(){
if(q.size()==0){
returnnull;
}
return(E) q.removeMax();
}
/**
* This adds item to the queue
* @param item that is added to the queue.
*/
void add(E item){
q.insert(item);
}
/**
* isEmpty returns if the queue is empty or not.
*
* @return boolean if the queue is empty or not.
*/
boolean isEmpty(){
if(q.size()!=0){
returnfalse;
}
returntrue;
}
/**
* size returns the size of the queue.
*
* @return int the size of the queue.
*/
publicint size(){
return q.size();
}
}
ArithmeticExpression.classpublicsynchronizedclass ArithmeticExpression {
BinaryTree t;
java.util.ArrayList list;
String equation;
void ArithmeticExpression(String) throws java.text.ParseException;
public String toString(BinaryTree);
public String toPostfixString(BinaryTree);
void setVariable(String, int) throws java.rmi.NotBoundException;
public int evaluate(BinaryTree);
}
ArithmeticExpression.javaArithmeticExpression.javaimport java.rmi.NotBoundException;
import java.text.ParseException;
import java.util.ArrayList;
import java.util.Stack;
/**
* ArithmeticExpression takes equations in the form of strings creates a binary
* tree, and can return either the regular or postfix equation. It also allows
* them to be calculated.
*
*
* Extra Credit:
* ** it can handle spaces or no spaces in the string inputted. ** it can return
* regular or postfix notation
*
* @author tai-lanhirabayashi
*
*/
publicclassArithmeticExpression{
BinaryTree t;
ArrayList list;
String equation;
/**
* ArithmeticExpression is the construction which takes in a space
* delimitated equation containing "*,/,+,-" symbols and converts it into a
* binary tree.
*
* If the expression is not valid it will throw a ParseException. This is ...
BUS310ASSIGNMENTImagine that you work for a company with an ag.docxcurwenmichaela
BUS310ASSIGNMENT
Imagine that you work for a company with an age diverse workforce. You have baby boomers working with millenials. Their backgrounds are different, and how they view work is different. This is causing some friction within the workforce. Before the tension escalates, you need to have a meeting to discuss the issue. Prepare a five to seven (5-7) slide PowerPoint presentation for your staff meeting that addresses this issue and proposes a solution.
Create a five to seven (5-7) slide PowerPoint presentation in which you:
1. Propose a solution that will relieve friction in your company’s age diverse workforce.
2. Format your assignment according to the following formatting requirements:
a. Format the PowerPoint presentation with headings on each slide and at least one (1) relevant graphic (photograph, graph, clip art, etc.). Ensure that the presentation is visually appealing and readable from up to 18 feet away. Check with your professor for any additional instructions.
b. Include a title slide containing the title of the assignment, your name, your professor’s name, the course title, and the date.
The specific course learning outcomes associated with this assignment are:
· Explain effective approaches to the broad spectrum of employee relations, including career development, fostering ethical behavior, discipline, labor relations, and dismissals.
· Use technology and information resources to research issues in human resource management.
· Write clearly and concisely about human resource management using proper writing mechanics.
Click here to view the grading rubric for this assignment.
Team Project Deliverable and Presentation
You team works for XYZ Company, which has a directional strategy focused on expanding the company through horizontal integration. Your team can determine the official name of the company and industry. The company does a great job keeping close watch on its cash position and consistently maintains a positive cash flow; is very solvent; controls its overhead expenses; has solid marketing and sales, production, and human resources performance metrics, and fosters a culture of strategic thinkers. Historically, your company has expanded through a combination of organic (new startups) and inorganic growth and feels it’s time to consider acquisition opportunities.
The Board is looking to engage in a friendly acquisition of a company that will not only increase its market share, but allow it to penetrate new markets and increase the company’s abilities to meet current and future consumer needs and expectations. Since management’s attitude is to pursue a friendly acquisition as opposed to a hostile takeover, your team may consider looking at conglomerates that have experienced significant growth through inorganic growth (acquisitions) and may now be looking to refocus on their core business and are willing to consider divesting some of its businesses that are within your industry. There could be other companies.
/**
* @author Derek Harter
* @cwid 123 45 678
* @class
* @ide Visual Studio Community 2017
* @date
* @assg C++ Stacks videos
*
* @description A Stack ADT with two concrete impelementation
* examples: an array based stack implementaiton (AStack), and
* a linked list based implementation (LStack).
*/
#include <iostream>
#include <string>
#include <sstream>
using namespace std;
//-------------------------------------------------------------------------
/** stack (base class)
* The basic definition of the Stack Abstract Data Type (ADT)
* and stack operations. All declared functions here are
* virtual, they must be implemented by concrete derived
* classes.
*/
template <class T>
class Stack
{
public:
/** clear
* Method to clear out or empty any items on stack,
* put stack back to empty state.
* Postcondition: Stack is empty.
*/
virtual void clear() = 0;
/** isEmpty
* Function to determine whether the stack is empty. Needed
* because it is undefined to pop from empty stack. This
* function will not change the state of the stack (const).
*
* @returns bool true if stack is empty, false otherwise.
*/
virtual bool isEmpty() const = 0;
/** push
* Add a new item onto top of stack.
*
* @param newItem The item of template type T to push on top of
* the current stack.
*/
virtual void push(const T& newItem) = 0;
/** top
* Return the top item from the stack. Note in this ADT, peeking
* at the top item does not remove the top item. Some ADT combine
* top() and pop() as one operation. It is undefined to try and
* peek at the top item of an empty stack. Derived classes should
* throw an exception if this is attempted.
*
* @returns T Returns the top item from stack.
*/
virtual T top() const = 0;
/** pop
* Remove the item from the top of the stack. It is undefined what
* it means to try and pop from an empty stack. Derived classes should
* throw an exception if pop() from empty is attempted.
*/
virtual void pop() = 0;
/** size
* Accessor method to provide the current size of the stack.
*/
virtual int size() const = 0;
/** tostring
* Represent stack as a string
*/
virtual string tostring() const = 0;
// operload operators, mostly to support boolean comparison between
// two stacks for testing
bool operator==(const Stack<T>& rhs) const;
virtual const T& operator[](int index) const = 0;
// overload output stream operator for all stacks using tostring()
template <typename U>
friend ostream& operator<<(ostream& out, const Stack<U>& aStack);
};
/** Stack equivalence
* Compare two given stacks to determine if they are equal or not.
* stacks are equal if they are both of the same size, and each corresponding
* item on each stack is equal at the same position on the stack.
* This function relies on overloaded operator[] to access items on stack
* by index for the comparis.
EmptyCollectionException-java -- - Represents the situation in which.docxBlakeSGMHemmingss
EmptyCollectionException.java
/*
* Represents the situation in which a collection is empty.
*/
public class EmptyCollectionException extends RuntimeException
{
/* General class level objects */
/*
* Sets up this exception with an appropriate message.
* @param collection the name of the collection
*/
public EmptyCollectionException(String collection)
{
super("The " + collection + " is empty.");
}
}
PriorityNode.java
/*
* Represents a node in a linked list.
*/
public class PriorityNode<T>
{
/* General class level objects */
private PriorityNode<T> _next;
private T _element;
private int _priority;
private final int _MAX_PRIORITY = 100;
/*
* Creates an empty node with a given priority.
*/
public PriorityNode(T elem, int priority)
{
// TODO To be completed as a Programming Project
}
/*
* Creates a node storing the specified element with a default priority.
*
* @param elem element to be stored
*/
public PriorityNode(T elem)
{
// TODO To be completed as a Programming Project
}
/*
* Returns the node that follows this one.
*
* @return reference to next node
*/
public PriorityNode<T> getNext()
{
// TODO To be completed as a Programming Project
}
/*
* Sets the node that follows this one.
*
* @param node node to follow this one
*/
public void setNext(PriorityNode<T> node)
{
// TODO To be completed as a Programming Project
}
/*
* Returns the element stored in this node.
*
* @return element stored at the node
*/
public T getElement()
{
// TODO To be completed as a Programming Project
}
/*
* Returns the priority of this node.
*
* @return element priority the node
*/
public int getPriority()
{
// TODO To be completed as a Programming Project
}
/*
* Sets the element stored in this node.
*
* @param elem element to be stored at this node
*/
public void setElement(T elem)
{
// TODO To be completed as a Programming Project
}
/*
* optional toString() override.
*/
//public String toString()
//{
// // TODO To be completed as a Programming Project
//}
}
PriorityQueue.java
/*
* LinkedQueue represents a linked implementation of a queue.
*/
public class PriorityQueue<T> implements PriorityQueueADT<T>
{
/* General class level objects */
private int _count;
private PriorityNode<T> _head, _tail;
/*
* Constructor - Creates an empty queue.
*/
public PriorityQueue()
{
_count = 0;
_head = _tail = null;
}
/*
* Adds one element to the rear of this queue.
* Higher priorities are inserted closer to the front of the queue
* Items with the same priority are processed in normal queue order
*
* @param element the element to be added to the rear of the queue
* @param priority relative priority of the queue item
*/
public void enqueue(T element, int priority)
{
// TODO To be completed as a Programming Project
// add in-order insertion of the PriorityNode based on getPriority() value
// the higher the priority is the closer to head it gets
// equivalent priority is normal .
we using java code DynamicArrayjava Replace all .pdfgudduraza28
we using java code /** * DynamicArray.java * * Replace all //TODO tags with your code * * Note
that below the "//TODO" tag there may be * something like "return null;", "return 0;", etc. * That line
is just "stubbed in" so the class * will compile. When you add your code (one or many *
statements), you will want to delete the "stubbed" line. * By "stubbed in" we mean "mocked" or
"faked in" temporarily. * * When testing, construct using the static factory methods:
DynamicList.newEmpty() DynamicList.fromGrowthFactor(growthFactor)
DynamicList.from(arrayElements) */ package model.list; import java.lang.reflect.Array; import
java.util.concurrent.atomic.AtomicInteger; import java.util.function.BiFunction; import
java.util.function.Consumer; import java.util.function.Function; import
model.linearpub.DynamicList; import model.linearpub.StructureIterator; public class
DynamicArray<E> implements DynamicList<E> { //--------------------------------- // Instance Variables
//TODO - declare instance variable(s) //--------------------------------- // Private Constructors /**
Constructs and returns new DynamicArray (no args constructor) */ private DynamicArray() {
this(defaultGrowthFactor()); } /** Constructs and returns new DynamicArray with "aGrowthFactor"
*/ private DynamicArray(double aGrowthFactor) { //TODO -- this is the constructor that should
//initialize the dynamic array as needed } //------------------------------------------------ public static double
defaultGrowthFactor() { //TODO - replace 0 with a good growth factor return 0; } protected static int
defaultInitialCapacity() { //TODO - replace 0 with a good initial capacity return 0; } //--------------------
List Statistics --------------------- /** * Return number of elements in this list. */ @Override public int
size() { //TODO return 0; } /** * Return true is this list contains no elements. */ @Override public
boolean isEmpty() { //TODO return false; } //------------------ Accessing Elements -------------------- /**
* Return element at given index. * Throws IndexOutOfBoundsException if passed index is invalid.
*/ @Override public E get(int index) { //TODO return null; } /** * Return first element * Throws
RuntimeException if list is empty */ @Override public E first() { //TODO return null; } /** * Return
last element * Throws RuntimeException if list is empty */ @Override public E last() { //TODO
return null; } /** * Return a new list containing the elements of this list * between the given index
"start" (inclusive) and * the given index "stop" (exclusive). * Throws IndexOutOfBoundsException if
either passed index is invalid. */ @Override public DynamicList<E> subList(int start, int stop) {
//TODO return null; } /** * Return index of first matching element (where searchFct outputs true) *
Return -1 if no match * Example usage (first list of integers, then employees): * index =
list.find(eaInteger -> eaInteger == 10); * index = employeeList.find(employee -> employee
.getFirstName().equals("Kofi.
Java Foundations StackADT-java --- - Defines the interface to a stack.docxVictorXUQGloverl
Java Foundations
StackADT.java
/**
* Defines the interface to a stack collection.
*
* @author Java Foundations
* @version 4.0
*/
public interface StackADT<T> {
/**
* Adds the specified element to the top of this stack.
*
* @param element element to be pushed onto the stack
*/
public void push(T element);
/**
* Removes and returns the top element from this stack.
*
* @return the element removed from the stack
* @throws EmptyCollectionException if the stack is empty
*/
public T pop();
/**
* Returns the top element of this stack without removing it from the stack.
*
* @return the element on top of the stack. It is not removed from the stack
* @throws EmptyCollectionException if the stack is empty
*/
public T peek();
/**
* Returns true if this stack contains no elements.
*
* @return true if the stack is empty, false if the stack is not empty
*/
public boolean isEmpty();
/**
* Returns the number of elements in this stack.
*
* @return the number of elements in the stack
*/
public int size();
}
QueueADT.java
/**
* QueueADT defines the interface to a queue collection.
*
* @author Java Foundation
* @version 4.0
*/
public interface QueueADT<T> {
/**
* Adds one element to the rear of this queue.
*
* @param element the element to be added to the rear of the queue
*/
public void enqueue(T element);
/**
* Removes and returns the element at the front of this queue.
*
* @return the element at the front of the queue
* @throws EmptyCollectionException if the queue is empty
*/
public T dequeue();
/**
* Returns without removing the element at the front of this queue.
*
* @return the first element in the queue
* @throws EmptyCollectionException if the queue is empty
*/
public T first();
/**
* Returns true if this queue contains no elements.
*
* @return true if the queue is empty, false if the queue is not empty
*/
public boolean isEmpty();
/**
* Returns the number of elements in this queue.
*
* @return the number of elements in the queue
*/
public int size();
}
LinkedDeque.java
public class LinkedDeque<T> implements QueueADT<T>, StackADT<T>, DequeADT<T> {
// inner class for a double linked list node
private class DNode<T> {
private T element;
private DNode<T> prev, next;
}
// data fields for the LinkedDeque class
private DNode<T> front, rear;
private int size;
// deque interface methods
@Override
public void addFirst(T element) {
// create a new node and set it up
DNode<T> newNode = new DNode<T>();
newNode.element = element; // from param to new node obj
newNode.prev = newNode.next = null;
if(this.isEmpty()) {
// we are making the only node in the deque
this.rear = this.front = newNode;
} else {
// there already exists a new node
// so, put the new node before the front node
newNode.next = this.front;
this.front.prev = newNode;
this.front = newNode;
}
this.size++;
}
@Override
public T removeFirst() {
T grabbedElt = this.getFirst(); // checks for empty for us
if.
package algs13;
import stdlib.*;
import java.util.Iterator;
import java.util.NoSuchElementException;
/* ***********************************************************************
* Compilation: javac Queue.java
* Execution: java Queue < input.txt
* Data files: http://algs4.cs.princeton.edu/13stacks/tobe.txt
*
* A generic queue, implemented using a linked list.
*
* % java Queue < tobe.txt
* to be or not to be (2 left on queue)
*
*************************************************************************/
/**
* The <tt>Queue</tt> class represents a first-in-first-out (FIFO)
* queue of generic items.
* It supports the usual <em>enqueue</em> and <em>dequeue</em>
* operations, along with methods for peeking at the top item,
* testing if the queue is empty, and iterating through
* the items in FIFO order.
* <p>
* All queue operations except iteration are constant time.
* <p>
* For additional documentation, see <a href="http://algs4.cs.princeton.edu/13stacks">Section 1.3</a> of
* <i>Algorithms, 4th Edition</i> by Robert Sedgewick and Kevin Wayne.
*/
public class Queue<T> implements Iterable<T> {
private int N; // number of elements on queue
private Node<T> first; // beginning of queue
private Node<T> last; // end of queue
// helper linked list class
private static class Node<T> {
public Node() { }
public T item;
public Node<T> next;
}
/**
* Create an empty queue.
*/
public Queue() {
first = null;
last = null;
N = 0;
}
/**
* Is the queue empty?
*/
public boolean isEmpty() {
return first == null;
}
/**
* Return the number of items in the queue.
*/
public int size() {
return N;
}
/**
* Return the item least recently added to the queue.
* @throws java.util.NoSuchElementException if queue is empty.
*/
public T peek() {
if (isEmpty()) throw new NoSuchElementException("Queue underflow");
return first.item;
}
/**
* Add the item to the queue.
*/
public void enqueue(T item) {
Node<T> oldlast = last;
last = new Node<>();
last.item = item;
last.next = null;
if (isEmpty()) first = last;
else oldlast.next = last;
N++;
}
/**
* Remove and return the item on the queue least recently added.
* @throws java.util.NoSuchElementException if queue is empty.
*/
public T dequeue() {
if (isEmpty()) throw new NoSuchElementException("Queue underflow");
T item = first.item;
first = first.next;
N--;
if (isEmpty()) last = null;
return item;
}
/**
* Return string representation.
*/
public String toString() {
StringBuilder s = new StringBuilder();
for (T item : this)
s.append(item + " ");
return s.toString();
}
// check internal invariants
private static <T> boolean check(Queue<T> that) {
int N = that.N;
Queue.Node<T> first = that.first;
Queue.Node<T> last = that.last;
if (N == 0) {
if (first != null) return false;
if (last != null) return false;
}
else if (N == 1) {
if (f.
ReversePoem.java ---------------------------------- public cl.pdfravikapoorindia
ReversePoem.java :-
---------------------------------
public class ReversePoem {
/*This programs has you display a pessimistic poem from a list of phrases*/
// and then reverse the phrases to find another more optimistic poem.
public static void main(String[] args) throws Exception
{
//Queue object
MyQueue queue = new MyQueue<>();
//Stack object
MyStack stack = new MyStack<>();
//String buffer to apppend all Strings
StringBuffer sb = new StringBuffer();
// Create a single String object from the 16 Strings below
String set1 = \"I am part of a lost generation#and I refuse to believe that#\";
sb.append(set1);
String set2 = \"I can change the world#I realize this may be a shock but#\";
sb.append(set2);
String set3 = \"\'Happiness comes from within\'#is a lie, and#\";
sb.append(set3);
String set4 = \"\'Money will make me happy\'#So in 30 years I will tell my children#\";
sb.append(set4);
String set5 = \"they are not the most important thing in my life#\";
sb.append(set5);
String set6 = \"My employer will know that#I have my priorities straight because#\";
sb.append(set6);
String set7 = \"work#is more important than#family#I tell you this#\";
sb.append(set7);
String set8 = \"Once upon a time#Families stayed together#\";
sb.append(set8);
String set9 = \"but this will not be true in my era#\";
sb.append(set9);
String set10 = \"This is a quick fix society#Experts tell me#\";
sb.append(set10);
String set11 = \"30 years from now, I will be celebrating the 10th anniversary of my
divorce#\";
sb.append(set11);
String set12 = \"I do not concede that#I will live in a country of my own making#\";
sb.append(set12);
String set13 = \"In the future#Environmental destruction will be the norm#\";
sb.append(set13);
String set14 = \"No longer can it be said that#My peers and I care about this earth#\";
sb.append(set14);
String set15 = \"It will be evident that#My generation is apathetic and lethargic#\";
sb.append(set15);
String set16 = \"It is foolish to presume that#There is hope#\";
sb.append(set16);
String finalString = sb.toString();
String itmes[] = finalString.split(\"#\");
System.out.println(\"========== Original Phrase ==============\");
for(int i = 0 ; i < itmes.length;i++){
queue.enqueue(itmes[i]);
System.out.println(itmes[i]);
}
for(int i = 0 ; i < itmes.length;i++){
stack.push(queue.dequeue());
}
System.out.println(\"========== Reverse Phrase ==============\");
for(int i = 0 ; i < itmes.length;i++){
System.out.println(stack.pop());
}
/* You are given a list of phrases in Strings; the phrases
are separated by pound signs: \'#\':
1. Create a single String object from this list.
2. Then, split the String of phrases into an array of
phrases using the String split method.
3. Display a poem by walking through the array and
displaying each phrase one per line.
4. And, at the same time, place each phrase on a
MyQueue object using only the enqueue method.
5. After all the phrases have been placed on the queue,
transfer the phrases from the MyQueue object to a
MyS.
1 The goal is to implement DataStructuresArrayStack accor.pdfsaradashata
(1) The goal is to implement DataStructures.ArrayStack according to the interface ADTs.StackADT
********************************************
package DataStructures;
import ADTs.StackADT;
import Exceptions.EmptyCollectionException;
import Exceptions.StackOverflowException;
public class ArrayStack<T> implements StackADT<T> {
/** The index of where the top of the stack is */
int top;
/** The array that holds the stack */
T[] buffer;
public ArrayStack() {
}
public ArrayStack(int initialCapacity) {
}
}
*******************************************************
package ADTs;
import Exceptions.EmptyCollectionException;
import Exceptions.StackOverflowException;
/**
* An interface for a Stack
* Specific stack implementations will implement this interface
* For use Data Structures & Algorithms
*
*
* author unknown
*/
public interface StackADT<T> extends CollectionADT<T> {
/**
* Adds the specified element to the top of the stack
*
* @param element element to be pushed onto the stack
*/
public void push(T element) throws StackOverflowException;
/**
* Removes and returns the element that is on top of the stack
*
* @return the element removed from the stack
* @throws EmptyCollectionException
*/
public T pop() throws EmptyCollectionException;
/**
* Returns (without removing) the element that is on top of the stack
*
* @return the element on top of the stack
* @throws EmptyCollectionException
*/
public T peek() throws EmptyCollectionException;
}
*****************************************
package ADTs;
import Exceptions.*;
/**
* An interface for an ordered (NOT SORTED) List
* Elements stay in the order they are put in to the list
* For use in Data Structures & Algorithms
*
*
* @author unknown
*/
public interface ListADT<T> extends CollectionADT<T> {
/**
* Adds the specified element to the list at the front
*
* @param element: the element to be added
*
*/
public void addFirst(T element);
/**
* Adds the specified element to the end of the list
*
* @param element: the element to be added
*/
public void addLast(T element);
/**
* Adds the specified element to the list after the existing element
*
* @param existing: the element that is in the list already
* @param element: the element to be added
* @throws ElementNotFoundException if existing isn't in the list
*/
public void addAfter(T existing, T element) throws ElementNotFoundException,
EmptyCollectionException;
/**
* Removes and returns the specified element
*
* @return the element specified
* @throws EmptyCollectionException
* @throws ElementNotFoundException
*/
public T remove(T element) throws EmptyCollectionException, ElementNotFoundException;
/**
* Removes and returns the first element
*
* @return the first element in the list
* @throws EmptyCollectionException
*/
public T removeFirst() throws EmptyCollectionException;
/**
* Removes and returns the last element
*
* @return the last element in the list
* @throws EmptyCollectionException
*/
public T removeLast() throws EmptyCollectionException;
/**
* Returns (wit.
Please complete all the code as per instructions in Java programming.docxcgraciela1
Please complete all the code as per instructions in Java programming import org.w3c.dom.Node; import javax.xml.crypto.NodeSetData; import java.awt.*; import java.util.Iterator; import java.util.NoSuchElementException; /** * This class implements an acyclic (non-cyclic), doubly-linked list. * @param */ public class CiscDoublyLinkedList implements CiscList { /** * A reference to the first node in the list (or null if list is empty). */ private Node head; /** * A reference to the last node int the list (or null if list is empty). */ private Node tail; /** * Number of elements in the list. */ private int size; /** * Returns the number of elements in this list. * * * @return the number of elements in this list */ @Override public int size() { return size; } /** * Returns {@code true} if this list contains no elements. * * * @return {@code true} if this list contains no elements */ @Override public boolean isEmpty() { if (size == 0){ return true; } return false; } /** * Returns {@code true} if this list contains the specified element (compared using the {@code equals} method). * * * @param o element whose presence in this list is to be tested * @return {@code true} if this list contains the specified element * @throws NullPointerException if the specified element is null */ @Override public boolean contains(Object o) { if(o == null) { throw new NullPointerException(); } Node node = head; while(node != null) { if(node.data.equals(o)){ return true; } node = node.next; } return false; } /** * Returns the index of the first occurrence of the specified element in this list, or -1 if this list does not * contain the element (compared using the {@code equals} method). * * * @param o element to search for * @return the index of the first occurrence of the specified element in this list, or -1 if this list does not * contain the element * @throws NullPointerException if the specified element is null */ @Override public int indexOf(Object o) { if (o == null){ throw new NullPointerException(); } for(int i =0; i = size){ throw new IndexOutOfBoundsException(); } return null; } /** * Appends the specified element to the end of this list. * * *
Lists may place the specified element at arbitrary locations if desired. In particular, an ordered list will * insert the specified element at its sorted location. List classes should clearly specify in their documentation * how elements will be added to the list if different from the default behavior (end of this list). * * @param e element to be appended to this list * @return {@code true} * @throws NullPointerException if the specified element is null */ @Override public boolean add(E e) { if(e == null){ throw new NullPointerException(); } return false; } /** * Replaces the element at the specified position in this list with the specified element. * * * @param index index of the element to replace * @param element element to be stored at the specified position * @return the element previously at the specified position *.
java question Fill the add statement areaProject is to wo.pdfdbrienmhompsonkath75
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 =.
Need help with writing the test cases for the following code in java-.docxLucasmHKChapmant
Need help with this question ASAP! Please and thanks
2 points The is typically the most powerful stakeholder for the project but is often not the most powerful person in the company. 2 points The two axes on grid we use to measure the impact a stakeholder could have on our project and how we manage the relationship with them are and
.
Hi, Please find my code.I have correted all of your classes.Plea.pdfpritikulkarni20
Hi, Please find my code.
I have correted all of your classes.
Please let me know in case if do not get concpt.
######## Node.java ###########
public class Node {
private E element;
private Node next;
public Node() {
this.element = null;
this.next = null;
}
public Node(E e) {
this.element = e;
this.next = null;
}
public E getElement() {
return this.element;
}
public void setElement(E element) {
this.element= element;
}
public Node getNext() {
return next;
}
public void setNext(Node next) {
this.next = next;
}
}
########## Stack.java #############
public class Stack {
private int N;
private Node top;
public Stack() {
N = 0;
this.top =null;
}
/*
* places element on the top of the stack
*/
public void push(E element){
Node temp = new Node(element);
temp.setNext(top);
top = temp;
N++;
}
/*
* remove the top node and return its contents
*/
public E pop(){
if(top == null)
return null;
E e = top.getElement();
top = top.getNext();
N--;
return e;
}
/*
* Look at the top element of the Stack and return it, without removing
*/
public E peek(){
if(top == null)
return null;
return top.getElement();
}
//returns the size of the stack
public int size(){
return N; //replace
}
public boolean isEmpty(){
return top==null;
}
}
############ Queue.java ############
public class Queue {
private Node front;
private Node back;
private int N;
public Queue() {
this.front = null;
this.back = null;
N = 0;
}
/*
* places element in the back of the Queue
*/
public void enqueue(E element){
Node temp = new Node(element);
if(front == null) {
front = temp;
back = temp;
}
else{
back.setNext(temp);
back = temp;
}
N++;
}
/*
* remove the front node of the queue and return it
*/
public E dequeue(){
if(front == null) {
return null;
}
E item = front.getElement();
front = front.getNext();
// if we had only one element
if(front == null){
back = null;
}
N--;
return item;
}
/*
* Look at the front of the queue and return it, without removing
*/
public E peek(){
if(back == null)
return null;
return back.getElement();
}
//returns the size of the queue
public int size(){
return N;
}
public boolean isEmpty(){
return front==null;
}
}
########### Palindrome.java ############
import java.util.Scanner;
public class Palindrome
{
public static void main(String[ ] args)
{
Scanner input = new Scanner(System.in);
String inputString;
System.out.print(\"Please enter your string: \");
inputString = input.next( );
if (isPalindrome( inputString )){
System.out.println(\"Yes it is a palindrome.\");
}
else{
System.out.println(\"No this is not a palindrome.\");
}
}
public static boolean isPalindrome(String input)
{
Queue q = new Queue ();
Stack s = new Stack ();
char letter;
int i;
for (i = 0; i < input.length( ); i++)
{
letter = input.charAt(i);
q.enqueue(letter);
s.push(letter);
}
while (!q.isEmpty( ))
{
if (q.dequeue() != s.pop( ))
return false;
}
return true;
}
}
/*
Sample Output:
Please enter your string: MadaM
Yes it is a palindrome.
*/
Solution
Hi, Please find my code.
I have correted all of your classes.
Pl.
META-INF/MANIFEST.MF
Manifest-Version: 1.0
.classpath
PriorityQueue.classpublicsynchronizedclass PriorityQueue {
Heap q;
public void PriorityQueue(int, java.util.Comparator);
public Object peek();
public Object remove();
void add(Object);
boolean isEmpty();
public int size();
}
PriorityQueue.javaPriorityQueue.javaimport java.util.Comparator;
publicclassPriorityQueue<E>{
Heap q;
/**
*PriorityQueue initializes the queue.
*
* @param initialCapacity an int that is the heaps initial size.
* @param comparator the priority of various imputs.
*/
publicPriorityQueue(int initialCapacity,Comparator<?super E> comparator){
q=newHeap(initialCapacity,comparator);
}
/**
* Peek, returns the next item in the queue without removing it.
*
* If it is empty then null is returned.
* @return the next item in the queue.
*/
public E peek(){
if(q.size()==0){
returnnull;
}
return(E) q.findMax();
}
/**
* This removes the first item from the queue.
*
* It returns null if the queue is empty.
* @return the first item in the queue.
*/
public E remove(){
if(q.size()==0){
returnnull;
}
return(E) q.removeMax();
}
/**
* This adds item to the queue
* @param item that is added to the queue.
*/
void add(E item){
q.insert(item);
}
/**
* isEmpty returns if the queue is empty or not.
*
* @return boolean if the queue is empty or not.
*/
boolean isEmpty(){
if(q.size()!=0){
returnfalse;
}
returntrue;
}
/**
* size returns the size of the queue.
*
* @return int the size of the queue.
*/
publicint size(){
return q.size();
}
}
ArithmeticExpression.classpublicsynchronizedclass ArithmeticExpression {
BinaryTree t;
java.util.ArrayList list;
String equation;
void ArithmeticExpression(String) throws java.text.ParseException;
public String toString(BinaryTree);
public String toPostfixString(BinaryTree);
void setVariable(String, int) throws java.rmi.NotBoundException;
public int evaluate(BinaryTree);
}
ArithmeticExpression.javaArithmeticExpression.javaimport java.rmi.NotBoundException;
import java.text.ParseException;
import java.util.ArrayList;
import java.util.Stack;
/**
* ArithmeticExpression takes equations in the form of strings creates a binary
* tree, and can return either the regular or postfix equation. It also allows
* them to be calculated.
*
*
* Extra Credit:
* ** it can handle spaces or no spaces in the string inputted. ** it can return
* regular or postfix notation
*
* @author tai-lanhirabayashi
*
*/
publicclassArithmeticExpression{
BinaryTree t;
ArrayList list;
String equation;
/**
* ArithmeticExpression is the construction which takes in a space
* delimitated equation containing "*,/,+,-" symbols and converts it into a
* binary tree.
*
* If the expression is not valid it will throw a ParseException. This is ...
Similar to New folderjsjfArrayStack.classpackage jsjf;publicsynchronize.docx (20)
BUS310ASSIGNMENTImagine that you work for a company with an ag.docxcurwenmichaela
BUS310ASSIGNMENT
Imagine that you work for a company with an age diverse workforce. You have baby boomers working with millenials. Their backgrounds are different, and how they view work is different. This is causing some friction within the workforce. Before the tension escalates, you need to have a meeting to discuss the issue. Prepare a five to seven (5-7) slide PowerPoint presentation for your staff meeting that addresses this issue and proposes a solution.
Create a five to seven (5-7) slide PowerPoint presentation in which you:
1. Propose a solution that will relieve friction in your company’s age diverse workforce.
2. Format your assignment according to the following formatting requirements:
a. Format the PowerPoint presentation with headings on each slide and at least one (1) relevant graphic (photograph, graph, clip art, etc.). Ensure that the presentation is visually appealing and readable from up to 18 feet away. Check with your professor for any additional instructions.
b. Include a title slide containing the title of the assignment, your name, your professor’s name, the course title, and the date.
The specific course learning outcomes associated with this assignment are:
· Explain effective approaches to the broad spectrum of employee relations, including career development, fostering ethical behavior, discipline, labor relations, and dismissals.
· Use technology and information resources to research issues in human resource management.
· Write clearly and concisely about human resource management using proper writing mechanics.
Click here to view the grading rubric for this assignment.
Team Project Deliverable and Presentation
You team works for XYZ Company, which has a directional strategy focused on expanding the company through horizontal integration. Your team can determine the official name of the company and industry. The company does a great job keeping close watch on its cash position and consistently maintains a positive cash flow; is very solvent; controls its overhead expenses; has solid marketing and sales, production, and human resources performance metrics, and fosters a culture of strategic thinkers. Historically, your company has expanded through a combination of organic (new startups) and inorganic growth and feels it’s time to consider acquisition opportunities.
The Board is looking to engage in a friendly acquisition of a company that will not only increase its market share, but allow it to penetrate new markets and increase the company’s abilities to meet current and future consumer needs and expectations. Since management’s attitude is to pursue a friendly acquisition as opposed to a hostile takeover, your team may consider looking at conglomerates that have experienced significant growth through inorganic growth (acquisitions) and may now be looking to refocus on their core business and are willing to consider divesting some of its businesses that are within your industry. There could be other companies.
BUS308 – Week 1 Lecture 2 Describing Data Expected Out.docxcurwenmichaela
BUS308 – Week 1 Lecture 2
Describing Data
Expected Outcomes
After reading this lecture, the student should be familiar with:
1. Basic descriptive statistics for data location
2. Basic descriptive statistics for data consistency
3. Basic descriptive statistics for data position
4. Basic approaches for describing likelihood
5. Difference between descriptive and inferential statistics
What this lecture covers
This lecture focuses on describing data and how these descriptions can be used in an
analysis. It also introduces and defines some specific descriptive statistical tools and results.
Even if we never become a data detective or do statistical tests, we will be exposed and
bombarded with statistics and statistical outcomes. We need to understand what they are telling
us and how they help uncover what the data means on the “crime,” AKA research question/issue.
How we obtain these results will be covered in lecture 1-3.
Detecting
In our favorite detective shows, starting out always seems difficult. They have a crime,
but no real clues or suspects, no idea of what happened, no “theory of the crime,” etc. Much as
we are at this point with our question on equal pay for equal work.
The process followed is remarkably similar across the different shows. First, a case or
situation presents itself. The heroes start by understanding the background of the situation and
those involved. They move on to collecting clues and following hints, some of which do not pan
out to be helpful. They then start to build relationships between and among clues and facts,
tossing out ideas that seemed good but lead to dead-ends or non-helpful insights (false leads,
etc.). Finally, a conclusion is reached and the initial question of “who done it” is solved.
Data analysis, and specifically statistical analysis, is done quite the same way as we will
see.
Descriptive Statistics
Week 1 Clues
We are interested in whether or not males and females are paid the same for doing equal
work. So, how do we go about answering this question? The “victim” in this question could be
considered the difference in pay between males and females, specifically when they are doing
equal work. An initial examination (Doc, was it murder or an accident?) involves obtaining
basic information to see if we even have cause to worry.
The first action in any analysis involves collecting the data. This generally involves
conducting a random sample from the population of employees so that we have a manageable
data set to operate from. In this case, our sample, presented in Lecture 1, gave us 25 males and
25 females spread throughout the company. A quick look at the sample by HR provided us with
assurance that the group looked representative of the company workforce we are concerned with
as a whole. Now we can confidently collect clues to see if we should be concerned or not.
As with any detective, the first issue is to understand the.
BUS308 – Week 5 Lecture 1 A Different View Expected Ou.docxcurwenmichaela
BUS308 – Week 5 Lecture 1
A Different View
Expected Outcomes
After reading this lecture, the student should be familiar with:
1. What a confidence interval for a statistic is.
2. What a confidence interval for differences is.
3. The difference between statistical and practical significance.
4. The meaning of an Effect Size measure.
Overview
Years ago, a comedy show used to introduce new skits with the phrase “and now for
something completely different.” That seems appropriate for this week’s material.
This week we will look at evaluating our data results in somewhat different ways. One of
the criticisms of the hypothesis testing procedure is that it only shows one value, when it is
reasonably clear that a number of different values would also cause us to reject or not reject a
null hypothesis of no difference. Many managers and researchers would like to see what these
values could be; and, in particular, what are the extreme values as help in making decisions.
Confidence intervals will help us here.
The other criticism of the hypothesis testing procedure is that we can “manage” the
results, or ensure that we will reject the null, by manipulating the sample size. For example, if
we have a difference in a customer preference between two products of only 1%, is this a big
deal? Given the uncertainty contained in sample results, we might tend to think that we can
safely ignore this result. However, if we were to use a sample of, say, 10,000, we would find
that this difference is statistically significant. This, for many, seems to fly in the face of
reasonableness. We will look at a measure of “practical significance,” meaning the likelihood of
the difference being worth paying any attention to, called the effect size to help us here.
Confidence Intervals
A confidence interval is a range of values that, based upon the sample results, most likely
contains the actual population parameter. The “most likely” element is the level of confidence
attached to the interval, 95% confidence interval, 90% confidence interval, 99% confidence
interval, etc. They can be created at any time, with or without performing a statistical test, such
as the t-test.
A confidence interval may be expressed as a range (45 to 51% of the town’s population
support the proposal) or as a mean or proportion with a margin of error (48% of the town
supports the proposal, with a margin of error of 3%). This last format is frequently seen with
opinion poll results, and simply means that you should add and subtract this margin of error from
the reported proportion to obtain the range. With either format, the confidence percent should
also be provided.
Confidence intervals for a single mean (or proportion) are fairly straightforward to
understand, and relate to t-test outcomes simply. Details on how to construct the interval will be
given in this week’s second lecture. We want to understand how to interpret and understa.
BUS308 – Week 1 Lecture 1
Statistics
Expected Outcomes
After reading this lecture, the student should be familiar with:
1. The basic ideas of data analysis.
2. Key statistical concepts and terms.
3. The basic approach for this class.
4. The case focus for the class.
What we are all about
Data, measurements, counts, etc., is often considered the language of business. However,
it also plays an important role in our personal lives as well. Data, or more accurately, the
analysis of data answers our questions. These may be business related or personal. Some
questions we may have heard that require data to answer include:
1. On average, how long does it take you to get to work? Or, alternately, when do you
have to leave to get to work on time?
2. For budget purposes, what is the average expense for utilities, food, etc.?
3. Has the quality rejection rate on production Line 3 changed?
4. Did the new attendance incentive program reduce the tardiness for the department?
5. Which vendor has the best average price for what we order?
6. Which customers have the most complaints about our products?
7. Has the average production time decreased with the new process?
8. Do different groups respond differently to an employee questionnaire?
9. What are the chances that a customer will complain about or return a product?
Note that all of these very reasonable questions require that we collect data, analyze it,
and reach some conclusion based upon that result.
Making Sense of Data
This class is about ways to turn data sets, lots of raw numbers, into information that we
can use. This may include simple descriptions of the data with measures such as average, range,
high and low values, etc. It also includes ways to examine the information within the data set so
that we can make decisions, identify patterns, and identify existing relationships. This is often
called data analysis; some courses discuss this approach with the term “data-based decision
making.” During this class we will focus on the logic of analyzing data and interpreting these
results.
What this class is not
This class is not a mathematics course. I know, it is called statistics and it deals with
numbers, but we do not focus on creating formulas or even doing calculations. Excel will do all
of the calculations for us; for those of you who have not used Excel before, and even for some
who have, you will be pleasantly surprised at how powerful and relatively easy to use it is.
It is also not a class in collecting the data. Courses in research focus on how to plan on
collecting data so that it is fair and unbiased. Statistics deals with working on the data after it has
been collected.
Class structure
There are two main themes to this class. The first focuses on interpreting statistical
outcomes. When someone says, the result is statistically significant with a p-value of 0.01; we
need, as professionals, to know what it means. .
BUS308 Statistics for ManagersDiscussions To participate in .docxcurwenmichaela
BUS308
Statistics for Managers
Discussions
To participate in the following discussions, go to this week's
Discussion
link in the left navigation.
Language
Numbers and measurements are the language of business.. Organizations look at results, expenses, quality levels, efficiencies, time, costs, etc. What measures does your department keep track of ? How are the measures collected, and how are they summarized/described? How are they used in making decisions? (Note: If you do not have a job where measures are available to you, ask someone you know for some examples or conduct outside research on an interest of yours.)
Guided Response: Review several of your classmates’ posts. Respond to at least two of your classmates by providing recommendations for the measures being discussed.
Levels
Managers and professionals often pay more attention to the levels of their measures (means, sums, etc.) than to the variation in the data (the dispersion or the probability patterns/distributions that describe the data). For the measures you identified in Discussion 1, why must dispersion be considered to truly understand what the data is telling us about what we measure/track? How can we make decisions about outcomes and results if we do not understand the consistency (variation) of the data? Does looking at the variation in the data give us a different understanding of results?
Guided Response: Review several of your classmates’ posts. Respond to at least two classmates by commenting on the situations that are being illustrated.
.
BUS308 Week 4 Lecture 1
Examining Relationships
Expected Outcomes
After reading this lecture, the student should be familiar with:
1. Issues around correlation
2. The basics of Correlation analysis
3. The basics of Linear Regression
4. The basics of the Multiple Regression
Overview
Often in our detective shows when the clues are not providing a clear answer – such as
we are seeing with the apparent continuing contradiction between the compa-ratio and salary
related results – we hear the line “maybe we need to look at this from a different viewpoint.”
That is what we will be doing this week.
Our investigation changes focus a bit this week. We started the class by finding ways to
describe and summarize data sets – finding measures of the center and dispersion of the data with
means, medians, standard deviations, ranges, etc. As interesting as these clues were, they did not
tell us all we needed to know to solve our question about equal work for equal pay. In fact, the
evidence was somewhat contradictory depending upon what measure we focused on. In Weeks 2
and 3, we changed our focus to asking questions about differences and how important different
sample outcomes were. We found that all differences were not important, and that for many
relatively small result differences we could safely ignore them for decision making purposes –
they were due to simple sampling (or chance) errors. We found that this idea of sampling error
could extend into work and individual performance outcomes observed over time; and that over-
reacting to such differences did not make much sense.
Now, in our continuing efforts to detect and uncover what the data is hiding from us, we
change focus again as we start to find out why something happened, what caused the data to act
as it did; rather than merely what happened (describing the data as we have been doing). This
week we move from examining differences to looking at relationships; that is, if some measure
changes does another measure change as well? And, if so, can we use this information to make
predictions and/or understand what underlies this common movement?
Our tools in doing this involve correlation, the measurement of how closely two
variables move together; and regression, an equation showing the impact of inputs on a final
output. A regression is similar to a recipe for a cake or other food dish; take a bit of this and
some of that, put them together, and we get our result.
Correlation
We have seen correlations a lot, and probably have even used them (formally or
informally). We know, for example, that all other things being equal; the more we eat. the more
we weigh. Kids, up to the early teens, grow taller the older they get. If we consistently speed,
we will get more speeding tickets than those who obey the speed limit. The more efforts we put
into studying, the better grades we get. All of these are examples of correlations.
Correlatio.
BUS225 Group Assignment1. Service BlueprintCustomer acti.docxcurwenmichaela
BUS225 Group Assignment
1. Service Blueprint
Customer actions include the choice of visiting a Calvin Klein retail store, browsing clothes and asking for recommendations from a sales representative. Visible actions performed by Calvin Klein’s sales representative include greet customers upon arrival, check for inventory, bring clothes to customers and process payment. These actions are visible to customers and one invisible action performed by the sales representative would be finding customer clothes in the back room. The support processes include inventory-tracking system, inventory in the back room and POS systems, which allow the sales representative to deliver service smoothly.
2. Introduction
Calvin Klein is one amongst the leading fashion style and marketing studios within the world. It styles and markets women’s and men’s designer assortment attire and a variety of different products that area unit factory-made and marketed through an intensive network of licensing agreements and different arrangements worldwide.
2.1 Target Market
Calvin Klein targets male and female, and the millenials. The demographics of the people that would be receiving these messages from the “My Calvins” campaign would be men and women between the ages of 15-30, not married and have a median income.
Millenials believe that the next generation of robots are not going to replace people, but instead help to improve the effectiveness and service of industries. In today’s world, to suggest that automation will eliminate the need for human workers is proving to be as ridiculous as suggesting that tablets will replace laptops.
In the industrial world, robot design is pivoting from giant mechanical arms that take up factory floors, to smaller, more collaborative bots, that are designed to work alongside people. While these collaborative bots only make up 3% of the market today, they will make up 34% of the market by 2025.
3. Trend and importance of robotics
3.1. Role of robotics
The service sector is at an inflection point with regard to productivity gains and service industrialization similar to the industrial revolution in manufacturing that started in the eighteenth century. Robotics in combination with rapidly improving technologies like artificial intelligence (AI), mobile, cloud, big data and biometrics will bring opportunities for a wide range of innovations that have the potential to dramatically change service industries. The purpose of this paper is to explore the potential role service robots will play in the future and to advance a research agenda for service researchers (Wirtz et al. 2018).
Advancements in technology are radically transforming service, and increasingly providing the underlying basis for service strategy. Technological capabilities inevitably advance, firms will tend to move from standardized to personalized and from transactional to relational over time, implying that firms should be alert to technological opportunities to .
BUS301 Memo Rubric Spring 2020 - Student.docxBUS301 Writing Ru.docxcurwenmichaela
BUS301 Memo Rubric Spring 2020 - Student.docx
BUS301 Writing Rubric
Performance Dimensions
N/A
Not Met
Met
Comments
Organization (OABC)
Opening gets attention, provides context, and introduces topic
0
1
Agenda previews content of the document
0
1
Body
0
2
Sound paragraphing decisions (length and development)
Paragraphs limited to one topic per paragraph
Complete discussion of one topic before moving to next topic
Transitions and flow between paragraphs smooth
The overall flow/logic/structure of document is apparent
Closing summarizes and concludes, recommends, if appropriate
0
1
Content
The content of the document is relevant; information meaningful
0
2
The document is developed with adequate support and examples
0
2
The content is accurate and appropriate, with insightful analysis
0
2
Proofreading
The grammar and spelling are correct (proofread)
0
3
Punctuation—comma usage, capitalization, etc.—used correctly
0
3
The sentence structure and length are appropriate
0
1
Format
Appropriate formatting is used for type of document written
0
1
Good use of font, margins, spacing, headings, and visuals
0
1
[11/2016]
Example - Good - Corrected student example Spring 2020.docx
TO: Professor __________
FROM: Suzy Student
DATE: February 1, 2020
SUBJECT: Out of Class Experience – Cybersecurity Conference
Cybersecurity is a topic everyone should be concerned about, so I attended the 3rd Annual Cybersecurity Event held in the Grawn Atrium. I gained insight and knowledge from listening to the speakers that came from different kinds of industries. In this memo, I will discuss what I learned from the speaker and two takeaways: 1) cybersecurity is everywhere, 2) personal identifiable information, and 3) cybersecurity for the business student.
Cybersecurity is Everywhere
The conference was an opportunity to learn about cybersecurity. The first speaker talked about how companies are attacked in many different ways every day. The “bad guys” are trying to steal company information as well as employee information. Both kinds of information are valuable on the black market. The second speaker talked about the internet of things (IoT). These are things that are attached to the internet. The speaker talked about autonomous cars and medical equipment (heart) that talks to the internet. She talked about how cyber can and should influence designs. “Things” must be created with cybersecurity included in every step of the design. The last speaker talked about how my information has value. The “bad guys” steal my information and people want to buy it. Making money is one reason hackers steal millions of records.
Personal Identifiable Information
Personal Identifiable Information (PII) is any information relating to an identifiable person. There are laws in place to help make sure this information is secure. This topic is a takeaway for me because I had no idea my data had any value t.
BUS1431Introduction and PreferencesBUS143 Judgmen.docxcurwenmichaela
BUS143
1
Introduction and Preferences
BUS143: Judgment and Decision Making
Ye Li
All rights reserved ®
Why you decided to take this class
“Decisions are the essence of
management. They’re what
managers do—sit around all
day making (or avoiding)
decisions. Managers are judged
on the outcomes, and most of
them—most of us—have only
the foggiest idea how we do
what we do.”
Thomas Stewart
Former editor (2002-2008),
Harvard Business Review
BUS143
2
Decision Making: Two Questions
• Why is decision making difficult?
• What constitutes a good decision?
Decision Making: Good Process
• What is a decision?
– A costly commitment to a course of action.
• Outcomes versus Process
Outcomes
Good Bad
Process
Good
Bad
Bad “luck”
Good “luck”
BUS143
3
Components of a Good Decision
• I have considered my ABCs
– Alternatives
– Beliefs
– Consequences
• I am devoting an appropriate amount of
resources
• I have avoided major decision traps
Decision Making Components: The ABCs
• Alternatives
– Identification and articulation
– Construction/refinement
• Beliefs
– Identification and quantification of uncertainties
– Information collection/gathering
• Consequences
– Identification of consequences (and objectives
addressed by consequences)
– When possible, quantification of tradeoffs among
objectives
BUS143
4
Decision Making: Good Process
• Putting it all together (for now)…
Good decision making is choosing the
alternative that best meets your objectives
in the face of uncertainty about what
consequences will ensue.
3 Perspectives on Decision Making
• Normative
– How should people make decisions?
Related concepts: rational; optimizing; forward-looking
• Descriptive
– How do people make decisions?
Related concepts: boundedly rational; limited cognitive capacity;
heuristics or rule-based; myopic
• Prescriptive
– How can we help people make better decisions?
– Prescriptive advice via practical applications, in…
Management
Marketing
Finance
HR
Life!
BUS143
5
Example
• Problem
– Imagine two 1-mile-long (1.61km) pieces of railroad track, put
end to end, and attached to the ground at the extremes.
When it gets hot, each piece of track expands by 1 inch
(2.54cm), forcing the pieces to rise above the ground where
they meet in the middle.
How high will the track be in the middle?
• Normative rule:
– Pythagorean Theorem:
• Descriptive reality:
– Most people underestimate x. (We anchor on 1 inch.)
• Prescription:
– Use normative rule (geometry). Don’t rely on intuition.
More Examples
• Normative rule:
– Lighter objects should
be judged as lighter.
• Descriptive reality:
– Sometimes our vision
tricks us.
• Prescription:
– Use an outside reference
or instrument
– Note: Pilots have specific
strategies for
counteracting visual
illusions
Which box looks lighter?
BUS143
6
Class Philosophy
• Overarching goal:
– Help you to.
BUS210 analysis – open question codesQ7a01 Monthly OK02 Not .docxcurwenmichaela
BUS210 analysis – open question codes
Q7a
01 Monthly OK
02 Not trading hours
03 Every 2 weeks
05 Don’t know
Q8
01 More information wanted
02 More security/Police
03 More involvement from business
04 Inconvenient times
05 Street activation needs improvement
06 Too busy to be involved
08 More outside main areas
Q11
01 Toilets
02 Security/Police
03 Problems with access
04 Better parking needed
05 Has been positive improvement
Q14
01 Pedestrian flows
02 Tourist/visitor information
03 Business statistics – local and general
D2 Business Types
01 Accommodation/hospitality
02 Retail
03 Bank
04 Café/fast food
05 Professional services
06 Travel
07 NGO/Charity
08 Manufacturing
09 Media/art
Questionnaire
Introduce: We have been commissioned by the X Sydney Council to conduct independent research of its BID members. The research will be used to improve Council activities. Your comments will be confidential.
For the following statement, can you tell me whether you agree or disagree? Then ask: is that strongly/mildly agree/disagree?
1 = strongly agree 2 = mildly agree 3 = mildly disagree 4 = strongly disagree
5 = Don’t know (don’t say) 6 = N/A (don’t say) READ OUT AS INDICATED IN QUESTIONS BELOW
Write in rating
START QUESTIONS HERE: Firstly, some questions about Council BID membership and street activation groups
Q1 (read out scale options) I’m active in the Council BID
Q2 (read out scale options again) Local businesses support the BID
Q3 The BID should be doing more for businesses in X Sydney
Q4 I am satisfied with the street activation activities organised by the Council BID
Q5 I participate in the BID street activation groups (yes/no question) if yes go to Q7
Yes/No
Q6 I am interested in participating in a BID street activation group
Q7 Do you think BID member meetings should be more frequent?
If yes, how often (write in) ……………………………………………
YES/NO/Don’t know
Q8 Do you have any comments in relation to the questions I’ve just asked?
(write in)
……………………………………………………………………………………………………………
……………………………………………………………………………………………………………
……………………………………………………………………………………………………………
(read out) Now, Just a few questions about safety and amenities
Q9 (Read out scale again) Being able to access safety, crime prevention tools information and reporting forms all in one place through the BID website is something I value
Q10 The public space and amenity quality is good in the Council area
Q11 Do you have any comments about safety and amenities
(write in)
……………………………………………………………………………………………………………
……………………………………………………………………………………………………………
……………………………………………………………………………………………………………
And finally a few questions about communications (read out)
Q12 I a.
Bus101 quiz (Business Organizations)The due time is in 1hrs1 .docxcurwenmichaela
Bus101 quiz (Business Organizations)
The due time is in 1hrs
1/ Both socialism and communism are variations of:
Select one:
a. command economies.
b. competitive economies.
c. free-market economies.
d. plutocratic systems.
2 / To be effective, empowerment will require lower-level workers to :
Select one:
a. have more training.
b. accept less responsibility and lower wages.
c. receive less training.
d. have written policies regulating each aspect of their work.
3)
As a small business owner, Tanika can't afford to provide her employees with the high wages and benefits offered by big corporations. One way to retain her employees and create a high level of motivation would be to:
Select one:
a. threaten to fire her existing employees and hire new workers.
b. adopt a policy of promoting the workers who have been employed the longest.
c. empower her employees to develop their own ideas.
d. hire only family members, since they are more loyal.
4/
Anita is employed as plant manager for Mojo Industries, Incorporated. Though she spends some time performing all management functions, she is particularly concerned with tactical planning and controlling. Anita's position would be classified as part of Mojo's:
Select one:
a. top management.
b. lateral management.
c. supervisory management.
d. middle management.
5/
Which of the following policies would tend to foster entrepreneurship?
Select one:
a. establishing a currency that is tradable on world markets.
b. establishing more regulations to protect the environment.
c. developing policies to reduce corruption between individuals.
d. allowing public ownership of businesses.
6)
All else held equal, socially responsible firms:
Select one:
a. are viewed more favorably by consumers.
b. enjoy significantly higher profits.
c. often experience customer loyalty problems.
d. fail to earn sufficient profits for their owners.
7) After personal savings, the next largest source of capital for entrepreneurs is from:
Select one:
a. large multinational banks.
b. the Small Business Administration.
c. state and local governments.
d. friends and family.
8/
Patrick's Products has a manufacturing plant near Chicago. The plant specializes in compact washers and dryers for countries in which consumers have less living space. Patrick's Products participates in the global market through:
Select one:
a. importing.
b. dumping.
c. exporting.
d. balancing trade.
9/
Managers who listen to their subordinates and allow them to participate in decision-making are using the ____________ style of leadership.
Select one:
a. autocratic
b. free-rein
c. participative
d. bureaucratic
10/
Which of the following statements about partnerships is the most accurate?
Select one:
a. A partnership is simply a corporation with fewer than 100 owners.
b. A major advantage of a partnership is that it offers owners limited liability.
c. A major drawback of a partnership is that it is difficult to terminate.
d. Partnerships are taxed at the lowest corporate tax .
BUS 625 Week 4 Response to Discussion 2Guided Response Your.docxcurwenmichaela
BUS 625 Week 4 Response to Discussion 2
Guided Response: Your initial response should be a minimum of 300 words in length. Respond to at least two of your classmates by commenting on their posts. Though two replies are the basic expectation for class discussions, for deeper engagement and learning, you are encouraged to provide responses to any comments or questions others have given to you.
Below there are two of my classmate’s discussion that needs I need to response to their names are Umadevi Sayana
and Britney Graves
Umadevi Sayana
TuesdayMar 17 at 7:50am
Manage Discussion Entry
Twitter mining analyzed the Twitter message in predicting, discovering, or investigating the causation. Twitter mining included text mining that designed specifically to leverage Twitter content and context tweets. With the use of text mining, twitter was able to include analysis of additional information that associates to tweets, which include hashtags, names, and other related characteristics. The mining also employs much information as several tweets, likes, retweets, and favorites trying to understand the considerations better. Twitter using text mining was successful in capturing and reflecting different events that relate to other conventional and social media. In 2013, there were over 500 million messages per day for twitter and became impossible for any human to analyze. It became important than to develop computer-based algorithms, including data mining. Twitter implements text mining in analyzing the sentiment that associates with twitter messages. It based on the analysis of the keyword that words are having a negative, positive, or neutral sentiment (Sunmoo, Noémie& Suzanne, (Links to an external site.)n.d). Positive words, for example like great, beautiful, love, and negative words of stupid, evil, and waste, do regularly have lexicons. Using text mining, Twitter was able to capture sentiments by capturing many dictionary symbols. Moreover, the sentiment applied to abbreviations, emoticons, and repeated characters, symbols, and abbreviations.
The sentiments on topics of economics, politics, and security are usually negative, and sentiments related to sports are harmful. Twitter also used text mining to collect and analyze for topic modeling techniques over time. To pull out the data from Twitter, TwitterR used. “Someone well versed in database architecture and data storage is needed to extract the relevant information in different databases and to merge them into a form that is useful for analysis” ( Sharpe, De Veaux & Velleman, 2019, p.753). It provides the interface that connects to Twitter web API; retweetedby/ids also used combined with RCurl package in finding out several tweets that retweeted. Text mining is also used in Twitter to clean the text by taking out hyperlinks, numbers, stop words, punctuations, followed by stem completion. Text mining also implemented for social network analysis.
Web mining focus on data knowledge discovery .
BUS 625 Week 2 Response for Discussion 1 & 2Week 2 Discussion 1 .docxcurwenmichaela
BUS 625 Week 2 Response for Discussion 1 & 2
Week 2 Discussion 1 Response
Guided Response: Your initial response should be a minimum of 300 words in length. Respond to at least two of your classmates by commenting on their posts. In your response, provide your own interpretation of their distribution graph. Note any differences between your classmate’s interpretation and your own. Though two replies are the basic expectation for class discussions, for deeper engagement and learning you are encouraged to provide responses to any comments or questions others have given to you. Continuing to engage with peers and the instructor will further the conversation and provide you with opportunities to demonstrate your content expertise, critical thinking, and real-world experiences with the discussion topics.
Below there are two of my classmate’s discussion that needs I need to response to their names are Kristopher Wentworth and Ashley Thiberville
Kristopher Wentworth
This graph is a representation of single people versus married couples from the year 1950 to the year 2019. This information was gathered and presented by the U.S. Department of Commerce and the U.S. Census Bureau who have a good record of presenting accurate data and are highly credible. The U.S. Department of Commerce is responsible for promoting economic growth in the united states. The U.S. Census Bureau is an agency of the Federal government that is responsible for producing data about the people of America and the economy.
So, the graph that I chose to talk about is one showing the gap between how many people are married and how many people are single in the united states from 1950 - 2019. I chose this graph because it caught my attention right away because of the contrasting colors but also because of the information displayed. It is crazy to think that since 1950 the American population has more than doubled according to this graph and with the growing population, the numbers of married couples and singles rise too. However, if you look at the percentages of singles they haven't changed all too much. For example, the number of single Americans in 1950 was 37.3M and in 2019 it was 125.7M. Even with such a large population boom the percentage that was never married really hadn't changed going from 69% to 68%.
The presentation of this graph is excellent with the line graph being yellow and on a blue backdrop, it allows it to really stand out. The shape of the graph shows a sharp incline as the population in us explodes. Since this graph is focused on the single population of America it puts the focus on that with stats like "never been married, divorced, widowed" because there are multiple ways to be single and really only one way to be married.
Ashley Thiberville
The above histogram was compiled by the United States Census Bureau to show the rise of one-person households in the US. The Census Bureau is a branch of the Department of Commerce within the United States gov.
Bus 626 Week 6 - Discussion Forum 1Guided Response Respon.docxcurwenmichaela
Bus 626 Week 6 - Discussion Forum 1
Guided Response: Respond to at least two of your fellow students’ and to your instructor’s posts in a substantive manner and provide information or concepts that they may not have considered. Each response should have a minimum of 100 words. Support your position by using information from the week’s readings. You are encouraged to post your required replies earlier in the week to promote more meaningful and interactive discourse in this discussion forum. Continue to monitor the discussion forum until Day 7 and respond with robust dialogue to anyone who replies to your initial post.
Jocelyn Harnett
Egypt has a sizable trade deficit that has continued to grow through the 21st century. The country has imports that make up a third of GDP and exports that make up one tenth of GDP. Egypt has many critical trade partners that include China, the United States, and the Gulf Arab countries. Throughout history Egypt has had an unstable government which has led to an unstable economy. This is related to the fluctuations the country has experienced in tariffs and taxes. The country has stabilized in recent years, but the historic instability still remains a critical factor when considering the expansion of Wal-Mart into Egypt. The trade deficit would not be a concern under normal conditions due to the fact that this means money is flowing into the country and creating new opportunities, but because the government is not stable Wal-Mart would want to ascertain that money was being invested properly in the future. If money is not being utilized correctly than the trade deficit becomes a concern because future generations are inheriting a debt that had no payback associated with it. The exchange rate of the Egyptian pound has gotten stronger to the US Dollar, which is a good indicator the economy is heading in the correct direction. Wal-Mart expansion could benefit from getting into the market in Egypt at the right time to see major profits.
Egypt is a market that will continue to grow as the internal government becomes stabilized and the country continues to focus on improving the economic welfare of the people. Currently the market in Egypt is volatile and companies that select to make an investment here must be aware of the many different cultural aspects that will affect success. The government is working to “find solutions and solve difficulties for people and businesses” (Bawaba, 2019) and has seen success in the first half of 2019. “At the time of May 31, 2019, the whole country had 721,516 businesses doing business, increasing 23,921 enterprises (3.43 %) compared to the end of 2018.” (Bawaba, 2019). This sort of success validates a foreign company wanting to make an investment, but continued analysis of the country’s government stability will be needed before each new storefront is added.
References:
Bawaba, A. (2019). Egypt : "Reviewing tax policies, finding solutions to solve difficulties for people and .
BUS 499, Week 8 Corporate Governance Slide #TopicNarration.docxcurwenmichaela
BUS 499, Week 8: Corporate Governance
Slide #
Topic
Narration
1
Introduction
Welcome to Senior Seminar in Business Administration.
In this lesson we will discuss Corporate Governance.
Please go to the next slide.
2
Objectives
Upon completion of this lesson, you will be able to:
Describe how corporate governance affects strategic decisions.
Please go to the next slide.
3
Supporting Topics
In order to achieve these objectives, the following supporting topics will be covered:
Separation of ownership and managerial control;
Ownership concentration;
Board of directors;
Market for corporate control;
International corporate governance; and
Governance mechanisms and ethical behavior.
Please go to the next slide.
4
Separation of Ownership and Managerial Control
To start off the lesson, corporate governance is defined as a set of mechanisms used to manage the relationship among stakeholders and to determine and control the strategic direction and performance of organizations. Corporate governance is concerned with identifying ways to ensure that decisionsare made effectively and that they facilitate strategic competitiveness. Another way to think of governance is to establish and maintain harmony between parties.
Traditionally, U. S. firms were managed by founder- owners and their descendants. As firms became larger the managerial revolution led to a separation of ownership and control in most large corporations. This control of the firm shifted from entrepreneurs to professional managers while ownership became dispersed among unorganized stockholders. Due to these changes modern public corporation was created and was based on the efficient separation of ownership and managerial control.
The separation of ownership and managerial control allows shareholders to purchase stock. This in turn entitles them to income from the firm’s operations after paying expenses. This requires that shareholders take a risk that the firm’s expenses may exceed its revenues.
Shareholders specialize in managing their investment risk. Those managing small firms also own a significant percentage of the firm and there is often less separation between ownership and managerial control. Meanwhile, in a large number of family owned firms, ownership and managerial control are not separated at all. The primary purpose of most large family firms is to increase the family’s wealth.
The separation between owners and managers creates an agencyrelationship. An agency relationship exists when one or more persons hire another person or persons as decision- making specialists to perform a service. As a result an agency relationship exists when one party delegates decision- making responsibility to a second party for compensation. Other examples of agency relationships are consultants and clients and insured and insurer. An agency relationship can also exist between managers and their employees, as well as between top- level managers and the firm’s owners.
The sep.
BUS 499, Week 6 Acquisition and Restructuring StrategiesSlide #.docxcurwenmichaela
BUS 499, Week 6: Acquisition and Restructuring Strategies
Slide #
Topic
Narration
1
Introduction
Welcome to Business Administration.
In this lesson we will discuss Acquisition and Restructuring Strategies.
Please go to the next slide.
2
Objectives
Upon completion of this lesson, you will be able to:
Identify various levels and types of strategy in a firm.
Please go to the next slide.
3
Supporting Topics
In order to achieve this objective, the following supporting topics will be covered:
The popularity of merger and acquisition strategies;
Reasons for acquisitions;
Problems in achieving acquisition success;
Effective acquisitions; and
Restructuring.
Please go to the next slide.
4
The Popularity of Merger and Acquisition Strategies
The acquisition strategy has been a popular strategy among U.S. firms for many years. Some believe that this strategy played a central role in an effective restructuring of U.S. business during the 1980s and 1990s and into the twenty-first century.
An acquisition strategy is sometimes used because of the uncertainty in the competitive landscape. A firm may make an acquisition to increase its market power because of a competitive threat, to enter a new market because of the opportunity available in that market, or to spread the risk due to the uncertain environment.
The strategic management process calls for an acquisition strategy to increase a firm’s strategic competitiveness as well as its returns to shareholders. Thus, an acquisition strategy should be used only when the acquiring firm will be able to increase its value through ownership of the acquired firm and the use of its assets.
Please go to the next slide.
5
Mergers, Acquisitions, and Takeovers
A merger is a strategy through which two firms agree to integrate their operations on a relatively coequal basis. Few true mergers actually occur, because one party is usually dominant in regard to market share or firm size.
An acquisition is a strategy through which one firm buys a controlling, or one hundred percent, interest in another firm with the intent of making the acquired firm a subsidiary business within its portfolio. In this case, the management of the acquired firm reports to the management of the acquiring firm. Although most mergers are friendly transactions, acquisitions can be friendly or unfriendly.
A takeover is a special type of an acquisition strategy wherein the target firm does not solicit the acquiring firm’s bid. The number of unsolicited takeover bids increased in the economic downturn of 2001 to 2002, a common occurrence in economic recessions; because the poorly managed firms that are undervalued relative to their assets are more easily identified.
On a comparative basis, acquisitions are more common than mergers and takeovers.
Please go to the next slide.
6
Reasons for Acquisitions
There are a number of reasons firms decide to acquire another company. These are:
Increased market power;
Overcoming entry barriers;
Co.
BUS 499, Week 4 Business-Level Strategy, Competitive Rivalry, and.docxcurwenmichaela
BUS 499, Week 4: Business-Level Strategy, Competitive Rivalry, and Competitive Dynamics
Slide #
Topic
Narration
1
Introduction
Welcome to Senior Seminar in Business Administration.
In this lesson, we will discuss Business-Level Strategy, Competitive Rivalry, and Competitive Dynamics.
Next slide.
2
Objectives
Upon completion of this lesson, you will be able to:
Identify various levels and types of strategy in a firm.
Next slide.
3
Supporting Topics
In order to achieve this objective, the following supporting topics will be covered:
Customers: their relationship with business-level strategies;
The purpose of a business-level strategy;
Types of business-level strategies;
A model of competitive rivalry;
Competitor analysis;
Drivers of competitive actions and responses;
Competitive rivalry;
Likelihood of attack;
Likelihood of response; and
Competitive dynamics.
Next slide.
4
Customer Relationships
Strategic competitiveness results only when the firm is able to satisfy a group of customers by using its competitive advantages as the basis for competing in individual product markets. A key reason firms must satisfy customers with their business-level strategy is that returns earned from relationships with customers are the lifeblood of all organizations. The most successful companies try to find new ways to satisfy current customers and/or meet the needs of new customers.
The firm’s relationships with its customers are strengthened when it delivers superior value to them. Strong interactive relationships with customers often provide the foundation for the firm’s efforts to profitably serve customers’ unique needs.
The reach dimension of relationships with customers is concerned with the firm’s access and connection to customers. Richness is concerned with the depth and detail of the two-way flow of information between the firm and the customer. Affiliation is concerned with facilitating useful interactions with customers.
Deciding who the target customer is that the firm intends to serve with its business-level strategy is an important decision. Companies divide customers into groups based on differences in the customers’ needs to make this decision. Dividing customers into groups based on their needs is called market segmentation, which is a process that clusters people with similar needs into individual and identifiable groups.
Next slide.
5
Customer Relationships, continued
After the firm decides who it will serve, it must identify the targeted customer group’s needs that its good or services can satisfy. Successful firms learn how to deliver to customers what they want and when they want it. In a general sense, needs are related to a product’s benefits and features. Having close and frequent interactions with both current and potential customers helps firms identify those individuals’ and groups’ current and future needs.
As explained in previous lessons, core competencies are resources and capabilities that serve as a source of.
BUS 437 Project Procurement Management Discussion QuestionsWe.docxcurwenmichaela
BUS 437 Project Procurement Management Discussion Questions
Week 2 Discussion
“Effective Management.” There are three (3) recommendations for effective management of projects in concurrent multiphase environments: Organizational System Design, System Implementation, and Managing in Concurrent Engineering.· Which of these three (3) recommendations for effective management would you or do you use most often? Why?
Week 3 Discussion
Top of Form
“Managing Configuration and Data for Effective Project Management.” The process protocol model consists of thirteen (13) steps from Inception to Feedback.· What are the steps?· Can any be skipped in this process model? What are the steps?
Week 4 Discussion“Organizational Project Management Maturity Model.” Students will respond to the following:· What is the four-step process of innovation and learning and how can your organization apply these steps to manage a project?· Of the five (5) levels of an organizational project management maturity model, which level is often the most difficult to manage? Why?
INTEGRATED SEMESTER ASSIGNMENT
(FINC 300, INFO 300, MGMT 300, MKTG 300)
DUE: April 12, 2019
INSTRUCTIONS:
The objective of the integrated semester is to help you extend your knowledge of how the finance,
operations, management, and marketing disciplines work and how they integrate their functioning in
the real world of business. This assignment is an assessment of how well you understand this
integration. It is worth 10% of your course grade.
YOUR ASSIGNMENT IS TO ANSWER ALL OF THE QUESTIONS, IN A SINGLE DOCUMENT:
• The assignment should be prepared as a Word document, 12 -14 pages in length (approx. 3
pages for each discipline’s questions).
• The document should be double spaced, using Ariel font #12.
• Label each section (e.g., FINANCE) to indicate which discipline’s questions you are
answering.
• Add any Appendices at the end of the Word document.
• Upload the entire Word file through the link on Canvas to each of your Integrated Semester
courses by the due date.
Note: Your reference sources, in addition to the base case and question sets, should be online sites
and articles, Bloomberg terminals, your Integrated Semester textbooks and PowerPoint slides. Also
note, Turnitin, a software tool that improves writing and prevents plagiarism, will be used to assess
your sourcing of information. Do your own work.
FINANCE ASSIGNMENT
The objective of the integrated semester is to help you extend your knowledge of how the finance,
operations, management, and marketing disciplines work and how they integrate their functioning in
the real world of business. This assignment is an assessment of how well you understand this
integration. It is worth 10% of your course grade.
Use either the Bloomberg terminals located at the Feliciano School of Business or other reputable
sources such as finance.yahoo.com, morningstar.com or Wall Street Jo.
BUS 480.01HY Case Study Assignment Instructions .docxcurwenmichaela
BUS 480.01HY Case Study Assignment
Instructions
Instructions: Each of you have been assigned a company to complete a case study analysis report.
The case distribution can be found on BlackBoard (course content -> case study analysis - > case
study distribution). Complete a thorough research on your company in order to complete the
analysis. It is required for you to use scholarly journals and peer-reviewed articles, which can be
found on the University’s website in the library section. I have provided you with very detailed
information on how to complete a thorough case analysis report. I am available during my office
hours to discuss. I will also schedule a case analysis session during lunch time this week. If you are
able to make it, please attend for one-on-one assistance.
Your “draft is due this Thursday, October 11th. I am not looking for perfection here, but please do
your best in writing and researching. Your final product will be due on Thursday, October 18th.
BUS 480.01HY Case Study Assignment
Instructions
1. Format – please review the case study format guidelines placed on BlackBoard
The use of headers and sub-headers is strongly suggested
2. Submission
1. Submit to BlackBoard (course content -> case study analysis - > Case Study Analysis
Report). Failure to submit in proper area will result in a 0.
3. Introduction
In 3-4 paragraphs describe the case facts and background. This should include BRIEF
information about the firm, however do NOT simply duplicate what is in the case itself.
As things change quickly in business, you may wish to check the current status of the
firm and briefly discuss the most current information.
4. Body
This should be about 4-5 pages in length (minimum – this is only a guideline). Review
posted guidelines for more information/detail
a) State the Problem/Key Issues
What are the key marketing or business issues in the case? These might be problems,
opportunities or challenges the firm is facing. For example:
o Sales have declined by 10 percent in the last year.
o The competition has launched a new and innovative product.
o Consumer tastes have changed and the firm’s most successful product is at risk.
o The CEO made a public racial slur and has affected the company internally and
externally.
5. Conclusion (include recommendations in this section)
For the issues you identified above, you must identify potential solutions and analyze
each of them. For example, for the decline in sales noted above we might try any of the
following, among other options:
1. increase advertising
2. develop a new product
3. implement diversity training
4. launch a brand awareness campaign
For each of the alternatives, you should analyze the costs, benefits, resources required
and possible outcomes. Typically, you will have 3-4 of these alternatives. Any given
alternative solution might address multiple issues. If t.
Unit 8 - Information and Communication Technology (Paper I).pdfThiyagu K
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.
Model Attribute Check Company Auto PropertyCeline George
In Odoo, the multi-company feature allows you to manage multiple companies within a single Odoo database instance. Each company can have its own configurations while still sharing common resources such as products, customers, and suppliers.
2024.06.01 Introducing a competency framework for languag learning materials ...Sandy Millin
http://sandymillin.wordpress.com/iateflwebinar2024
Published classroom materials form the basis of syllabuses, drive teacher professional development, and have a potentially huge influence on learners, teachers and education systems. All teachers also create their own materials, whether a few sentences on a blackboard, a highly-structured fully-realised online course, or anything in between. Despite this, the knowledge and skills needed to create effective language learning materials are rarely part of teacher training, and are mostly learnt by trial and error.
Knowledge and skills frameworks, generally called competency frameworks, for ELT teachers, trainers and managers have existed for a few years now. However, until I created one for my MA dissertation, there wasn’t one drawing together what we need to know and do to be able to effectively produce language learning materials.
This webinar will introduce you to my framework, highlighting the key competencies I identified from my research. It will also show how anybody involved in language teaching (any language, not just English!), teacher training, managing schools or developing language learning materials can benefit from using the framework.
Instructions for Submissions thorugh G- Classroom.pptxJheel Barad
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.
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.
Welcome to TechSoup New Member Orientation and Q&A (May 2024).pdfTechSoup
In this webinar you will learn how your organization can access TechSoup's wide variety of product discount and donation programs. From hardware to software, we'll give you a tour of the tools available to help your nonprofit with productivity, collaboration, financial management, donor tracking, security, and more.
Read| The latest issue of The Challenger is here! We are thrilled to announce that our school paper has qualified for the NATIONAL SCHOOLS PRESS CONFERENCE (NSPC) 2024. Thank you for your unwavering support and trust. Dive into the stories that made us stand out!
New folderjsjfArrayStack.classpackage jsjf;publicsynchronize.docx
1. 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 th
e
2. * 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, expand
ing
* the capacity of the array if necessary.
* @param element generic element to be pushed onto stack
*/
3. 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 capacityn");
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];
4. 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 this stack.
* @return the number of elements in the stack
*/
publicint size()
{
// To be completed as a Programming Project
return top;
}
/**
* Returns true if this stack is empty and false otherwise.
* @return true if this stack is empty
*/
publicboolean isEmpty()
{
5. // To be completed as a Programming Project
if(size()==0)
returntrue;
else
returnfalse;
}
/**
* Returns a string representation of this stack.
* @return a string representation of the stack
*/
publicString toString()
{
// To be completed as a Programming Project
String result ="";
for(int i = top-1;i >=0;i--)
result +="["+(i +1)+"]"+ stack[i].toString()+"n";
return result;
}
}
New
folder/jsjf/exceptions/EmptyCollectionException.classpackage
jsjf.exceptions;
publicsynchronizedclass EmptyCollectionException extends
RuntimeException {
public void EmptyCollectionException(String);
}
New folder/jsjf/exceptions/EmptyCollectionException.javaNew
folder/jsjf/exceptions/EmptyCollectionException.java
// -------------------------------------------------------
6. // Author: Yifu Wu
// Date: 03/10/16
// Source Name: EmptyCollectionException
// Due date: 03/10/16
// Description:
/**
* Represents the situation in which a collection is empty.
*
* @author Java Foundations
* @version 4.0
*/
package jsjf.exceptions;
publicclassEmptyCollectionExceptionextendsRuntimeException
{
/**
* Sets up this exception with an appropriate message.
* @param collection the name of the collection
*/
publicEmptyCollectionException(String collection)
{
super("The "+ collection +" is empty.");
}
}
New folder/jsjf/StackADT.classpackage jsjf;
publicabstractinterface StackADT {
publicabstract void push(Object);
publicabstract Object pop();
publicabstract Object peek();
publicabstract boolean isEmpty();
publicabstract int size();
publicabstract String toString();
}
7. New folder/jsjf/StackADT.javaNew
folder/jsjf/StackADT.javapackage jsjf;
// -------------------------------------------------------
// Author: Yifu Wu
// Date: 03/10/16
// Source Name: StackADT<T>
// Due date: 03/10/16
// Description:
/**
* Defines the interface to a stack collection.
*
* @author Java Foundations
* @version 4.0
*/
publicinterfaceStackADT<T>
{
/**
* Adds the specified element to the top of this stack.
* @param element element to be pushed onto the stack
*/
publicvoid push(T element);
/**
* Removes and returns the top element from this stack.
* @return the element removed from the stack
*/
public T pop();
/**
* Returns without removing the top element of this stack.
* @return the element on top of the stack
*/
public T peek();
8. /**
* Returns true if this stack contains no elements.
* @return true if the stack is empty
*/
publicboolean isEmpty();
/**
* Returns the number of elements in this stack.
* @return the number of elements in the stack
*/
publicint size();
/**
* Returns a string representation of this stack.
* @return a string representation of the stack
*/
publicString toString();
}
New folder/PostfixEvaluator2.classpublicsynchronizedclass
PostfixEvaluator2 {
privatestaticfinal char ADD = 43;
privatestaticfinal char SUBTRACT = 45;
privatestaticfinal char MULTIPLY = 42;
privatestaticfinal char DIVIDE = 47;
private jsjf.ArrayStack stack;
public void PostfixEvaluator2();
public int evaluate(String);
private boolean isOperator(String);
private int evaluateSingleOperator(char, int, int);
}
New folder/PostfixEvaluator2.javaNew
folder/PostfixEvaluator2.java
9. // -------------------------------------------------------
// Author: Yifu Wu
// Date: 03/10/16
// Source Name: PostfixEvaluator2
// Due date: 03/10/16
// Description:
/* Represents an integer evaluator of postfix expressions. Assu
mes
* the operands are constants.
*
* @author Java Foundations
* @version 4.0
*/
import jsjf.*;
import java.util.Stack;
import java.util.Scanner;
publicclassPostfixEvaluator2
{
privatefinalstaticchar ADD ='+';
privatefinalstaticchar SUBTRACT ='-';
privatefinalstaticchar MULTIPLY ='*';
privatefinalstaticchar DIVIDE ='/';
privateArrayStack<Integer> stack;
/**
* Sets up this evalutor by creating a new stack.
*/
publicPostfixEvaluator2()
{
stack =newArrayStack<Integer>();
}
/**
10. * Evaluates the specified postfix expression. If an operand is
* encountered, it is pushed onto the stack. If an operator is
* encountered, two operands are popped, the operation is
* evaluated, and the result is pushed onto the stack.
* @param expr string representation of a postfix expression
* @return value of the given expression
*/
publicint evaluate(String expr)
{
int op1, op2, result =0;
String token;
Scanner parser =newScanner(expr);
while(parser.hasNext())
{
token = parser.next();
if(isOperator(token))
{
op2 =(stack.pop()).intValue();
op1 =(stack.pop()).intValue();
result = evaluateSingleOperator(token.charAt(0), op1
, op2);
stack.push(newInteger(result));
}
else
stack.push(newInteger(Integer.parseInt(token)));
}
return result;
}
/**
* Determines if the specified token is an operator.
* @param token the token to be evaluated
* @return true if token is operator
11. */
privateboolean isOperator(String token)
{
return( token.equals("+")|| token.equals("-")||
token.equals("*")|| token.equals("/"));
}
/**
* Peforms integer evaluation on a single expression consisti
ng of
* the specified operator and operands.
* @param operation operation to be performed
* @param op1 the first operand
* @param op2 the second operand
* @return value of the expression
*/
privateint evaluateSingleOperator(char operation,int op1,int op2
)
{
int result =0;
switch(operation)
{
case ADD:
result = op1 + op2;
break;
case SUBTRACT:
result = op1 - op2;
break;
case MULTIPLY:
result = op1 * op2;
break;
case DIVIDE:
result = op1 / op2;
}
12. return result;
}
}
New folder/PostfixTester2.classpublicsynchronizedclass
PostfixTester2 {
public void PostfixTester2();
publicstatic void main(String[]);
}
New folder/PostfixTester2.javaNew folder/PostfixTester2.java
// -------------------------------------------------------
// Author: Yifu Wu
// Date: 03/10/16
// Source Name: PostfixTester2
// Due date: 03/10/16
// Description:
// Demonstrates the use of a stack to evaluate postfix expression
s.
// @author Java Foundations
// @version 4.0
import java.util.Scanner;
publicclassPostfixTester2
//-------------------------------------
// To Compile: javac PostfixTester.java
//-------------------------------------
{
/**
* Reads and evaluates multiple postfix expressions.
*/
publicstaticvoid main(String[] args)
{
String expression, again;
13. int result;
Scanner in =newScanner(System.in);
do
{
PostfixEvaluator2 evaluator =newPostfixEvaluator2();
System.out.println("Enter a valid post-
fix expression one token "+
"at a time with a space between each token (e.g. 5 4 + 3 2 1 -
+ *)");
System.out.println("Each token must be an integer or an operato
r (+,-,*,/)");
expression = in.nextLine();
result = evaluator.evaluate(expression);
System.out.println();
System.out.println("That expression equals "+ result);
System.out.print("Evaluate another expression [Y/N]? ");
again = in.nextLine();
System.out.println();
}
while(again.equalsIgnoreCase("y"));
}
}
//**************************************************
Output Display ****************************************
******************
//Enter a valid post-
fix expression one token at a time with a space between each to
ken (e.g. 5 4 + 3 2 1 - + *)
//Each token must be an integer or an operator (+,-,*,/)
//5 3 + 2 1 - 4 5 6 * + - -
14. //That expression equals 41
//Evaluate another expression [Y/N]? Y
//Enter a valid post-
fix expression one token at a time with a space between each to
ken (e.g. 5 4 + 3 2 1 - + *)
//Each token must be an integer or an operator (+,-,*,/)
//2 4 6 7 + - * 3 - 5 4 7 + + -
//That expression equals -37
//Evaluate another expression [Y/N]?
//Enter a valid post-
fix expression one token at a time with a space between each to
ken (e.g. 5 4 + 3 2 1 - + *)
//Each token must be an integer or an operator (+,-,*,/)
//8 7 2 1 + + - 6 / 8 7 - -
//That expression equals -1
//Evaluate another expression [Y/N]?
New folder/tp022871.BAT
@ECHO OFF
C:
CD "Usersy.wu2DesktopNew folder"
"C:Program Files (x86)Javajdk1.7.0binjava.exe"
PostfixTester2
PAUSE
15. New folder/tp06515e.BAT
@ECHO OFF
C:
CD "Usersy.wu2DesktopNew folder"
"C:Program Files (x86)Javajdk1.7.0binjava.exe"
PostfixTester2
PAUSE
New folder/tp0657b8.BAT
@ECHO OFF
C:
CD "Usersy.wu2DesktopNew folder"
"C:Program Files (x86)Javajdk1.7.0binjava.exe"
PostfixTester2
PAUSE
New folder/tp065a13.BAT
@ECHO OFF
C:
CD "Usersy.wu2DesktopNew folder"
"C:Program Files (x86)Javajdk1.7.0binjava.exe"
16. PostfixTester2
PAUSE
Running Head: AMAZON.COM1
AMAZON.COM6
Amazon.com
Name
Institution
Tutor
Course
Date
Reasons for selecting amazon.com
The size of the company is an important aspect that necessitated
selection of this company. Large companies are ideal for
carrying out research portfolios due to their wide nature that
makes it possible to amass a lot of knowledge from. This is
because smaller companies have limited outreach limiting the
amount of information that can be obtained from them. The
importance of a research is the need to acquire important
information and this goal is achieved by identification of a
17. company that can help to that effect (Bohari, Cheng & Fuad,
2013).
Suitable business sector is another factor that informs the
selection of a company from which to conduct research. The
need of learners to forces on companies that will provide them
with the relevant information is apparent and therefore focusing
the research to companies that are in line with the said
profession. Different companies work differs due to differing
points of orientation and operation making it hugely important
to focus on a specific line of operation. This helps to ensure
that the researchers are able to make sense of the information
they collect from the said company (Bohari, Cheng & Fuad,
2013).
Accessibility of the company is another factor that informs the
selection of an ideal research ground. It is necessitated by the
need to have ample time for carrying out research as it is a time
intensive process and only prudent to select a company that can
be easily accessed for the needed research to be conducted.
Research entails the collection of data and some of the methods
employed in this regard take a lot of time to compile and
therefore making it crucial for the said researching ground to be
convenient for the researcher. Another aspect that informs the
accessibility of a company is the timeline in which the research
is allocated as this serves to prescribe the extent to which
deferent companies can be engaged and therefore adopting the
most efficient entity (Bohari, Cheng & Fuad, 2013).
The available resources allocated for the research also help to
stipulate the manner and scope with which a research can be
conducted in different centers hence helping to identify the
centre that performs better under the current budget. Resources
can be in the form of funds, time as well as human personnel
needed to facilitate the research (Bohari, Cheng & Fuad, 2013).
Comprehensive overview of the company and its history
Amazon.com is a company that currently has an international
outreach due to its extension to other parts of the world upon
18. establishment and has formed partnerships with other firms in
the industry. The Company stated humbly; struggling to meet
the market expectations as well as attracting clients in a small
scope as a result. The revision of strategies however enabled the
market to get off well as it created conditions which were
convenient to clients and with time the reach of the company
expanded to new markets. Where is the history about Amazon
and when was it formed?
Expansion to other market called for diversification due to the
different cultures and conditions present in different stations of
the company such as languages hence changing accordingly to
subdue difficulties that arise in the process. The company relied
on experienced gained in the past to take risks which proved to
be worth ones hence spurring the company to success despite
huge resources used during the investment (Amazon.com,
2014). What type of system was used to help Amazon in this
diversification process?
Efficiency has been integral for the overwhelming success of
the company and it has been achieved by using different
strategies aimed at cutting the time taken for businesses to be
actualized as well as cutting on the cost of doing business hence
helping the company have a competitive advantage over its
competitors. Some of the strategies that helped in this regard
include the use of robots to assist in the delivery of services.
Use of machines has proved to be a master stroke due to the
vast funds that they help to save as they are both faster and
cheaper than human personnel (Bohari, Cheng & Fuad, 2013).
What tool or method helped Amazon achieve efficiency?
Another strategy that has helped in the realization of the
success the company enjoys currently is the creation of different
programs in the market and hence helping to utilize the market
better by ensuring that almost all the needs of the clients can be
addressed by the same company without having to edge other
firms for such services (Gawer & Cusumano, 2014). What type
of strategies were utilize by Amazon?
The relative ease of doing business with the company has
19. attracted other firms that have worked with the company so as
to bring efficiency on their side. This relative ease of doing
business has been necessitated by the vast use of information
technology and therefore accomplishing tasks with utmost
efficiency. The use of these technologies has been due to the
need of the company to compete favorably with other company
in the market place. Despite the current efficient strategies,
pains are underway to ensure that the future of the company is
secure by ensuring that the company retains the existing pool of
clients as well as attracts new ones.The company also owes
most of its success to a good leadership that has led to hard
work consequently leading to success (Killen, Jugdev, Drouin &
Petit, 2012). What type of technologies was used?
The company also serves as a training ground for employees
who opt to work in other firms in the future and hence help
them to not only outshining competitors but also assist them
with highly experienced workforce. The company focuses on the
future by planning to place importance on customers as well as
plans making partnership with firms with share same objectives
(Kresta & Tichy, 2012). What type of training was provided?
Despite these milestone covered on the way the company facing
several hardships amongst them stiff completion, constrains in
resource needed to effect a given investment and challenges that
occur in the market such as fluctuation of the market force all
of which impact negatively on the company. Due to the
imperfections created in the business world the company, just
like other companies is faced by challenges that are as a result
of the dynamism of the industry (Kresta & Tichy, 2012). What
type of challenges affected the market?
The contributing sectors to the incomes of the company chiefly
is the sale of services to customers and factors present in the
business industry such as taxation are avenues through which
some of the income is used. The need to use available income to
invest in technology is apparent so as to make the company to
stay relevant in the market. Just like other business, the
company engages in practices such as borrowing and they
20. influence the performance of the company in the future in two
ways. They help the company make up for deficits that might
arise due to different forces at ply in the industry and also
impact on the returns obtained for services provided due
interests payable for such debts (Amazon.com, 2014).
The company’s assessment by audit firms as required by the
laws of the current show that the company is in line with the set
down standards by the government to regulate the industry.
However, several suits have been filed in different suits against
the firm by other firm in the context of bleach of terms of
operation (Amazon.com, 2014).
Primary competitors
Among competitor of the firm include firms whose business
landscape is similar to those of the company and others whose
services are substitutes for the services provided by the
company. They include physical world retailers, other online e-
commerce and mobile commercial site, media companies that
provide information storage among others (Vogel, 2014).
The factors that the company prides itself for helping it
favorably compete in the market are efficiency and
effectiveness in the market. The company also draws a lot of
success for the positive reputation it hold in the market place.
However, some competitors boast better resources making them
have an edge in the market as a result and this explain the
presence of alliance in the market force to enable firms to stay
ahead of other competitors (Amazon.com, 2014).
SWOT analysis of the company
The strengths of the company include its use of high technology
in the industry making it efficient in the provision of services,
its larger scope that owes to its expansion to different markets
around the world, the huge reputation it holds in the industry
and its ability to forge partnerships with other firms in the
market who compliment its services (Amazon.com, 2014).
The weaknesses of the firm include the debts that the company
21. incur due to expenditure that outweigh available finances, its
inability to match the financing capabilities of some of the
competitors and its inability to coexist smoothly with other
entities in the industry without leading to law suits (Vogel,
2014).
Opportunities that the company has include the potential of the
firm to make good use of the partnerships it has made with
other firms to overcome the adversaries of uncertain market
forces, the potential of the company to extend its market to
other parts of the world were the services are not found such as
Africa and the opportunity to use the positive reputation to
bringing more clients on board (Kresta & Tichy, 2012).
Threats that face the company is fluctuations of market forces
which lead to losses, the numerous suits filed by other entities
that may serve to tarnish its positive reputation and huge
financial abilities of competing firms that can aid in the
monopolization of the market and therefore locking the
company out of business (Killen, Jugdev, Drouin & Petit, 2012).
The company ought to address the issue of deficit of payment
with urgency by ensuring that the returns it make outweighs the
cost of production as this is a potential quicksand that can lead
to the collapse of the company. This is further acerbated by the
financing muscles of the competing firms. The company too
should embrace use of favorable terms of operations that do not
aggrieve other entities as the numerous law suits against the
company serve to dent its reputation (Gawer & Cusumano,
2014).
Strategies that the company can use to address these issues
include investing in a robust legal department that will serve to
direct its actions for better future performance and use cheaper
methods of production such as high technology to reduce the
cost of production which ensure that the company would not
have future deficits of payment that cripple its progress (Bohari,
Cheng & Fuad, 2013). Does Amazon use the cost of quality
method at all?
22. References
Amazon.com (2014). Annual report
Bohari, A. M., Cheng, W. H., & Fuad, N. (2013). An analysis
on the competitiveness of halal food industry in Malaysia: an
approach of SWOT and ICT strategy. Geografia: Malaysian
Journal of Society and Space, 9(1), 1-11.
Gawer, A., & Cusumano, M. A. (2014). Industry platforms and
ecosystem innovation. Journal of Product Innovation
Management, 31(3), 417-433.
Killen, C. P., Jugdev, K., Drouin, N., & Petit, Y. (2012).
Advancing project and portfolio management research:
Applying strategic management theories. International Journal
of Project Management, 30(5), 525-538.
Kresta, A., & Tichy, T. (2012). International Equity Portfolio
Risk Modeling: The Case of the NIG Model and Ordinary
Copula Functions*. Finance a Uver, 62(2), 141.
Vogel, H. L. (2014). Entertainment industry economics: A guide
for financial analysis. Cambridge University Press.
To our shareowners:
A dreamy business offering has at least four characteristics.
Customers love it, it can grow to very large
size, it has strong returns on capital, and it’s durable in time –
with the potential to endure for decades. When you
find one of these, don’t just swipe right, get married.
Well, I’m pleased to report that Amazon hasn’t been
23. monogamous in this regard. After two decades of risk
taking and teamwork, and with generous helpings of good
fortune all along the way, we are now happily wed to
what I believe are three such life partners: Marketplace, Prime,
and AWS. Each of these offerings was a bold bet
at first, and sensible people worried (often!) that they could not
work. But at this point, it’s become pretty clear
how special they are and how lucky we are to have them. It’s
also clear that there are no sinecures in business.
We know it’s our job to always nourish and fortify them.
We’ll approach the job with our usual tools: customer obsession
rather than competitor focus, heartfelt
passion for invention, commitment to operational excellence,
and a willingness to think long-term. With good
execution and a bit of continuing good luck, Marketplace,
Prime, and AWS can be serving customers and earning
financial returns for many years to come.
Marketplace
Marketplace’s early days were not easy. First, we launched
Amazon Auctions. I think seven people came, if
you count my parents and siblings. Auctions transformed into
zShops, which was basically a fixed price version
of Auctions. Again, no customers. But then we morphed zShops
into Marketplace. Internally, Marketplace was
known as SDP for Single Detail Page. The idea was to take our
most valuable retail real estate – our product
detail pages – and let third-party sellers compete against our
own retail category managers. It was more
convenient for customers, and within a year, it accounted for
5% of units. Today, more than 40% of our units are
sold by more than two million third-party sellers worldwide.
Customers ordered more than two billion units from
sellers in 2014.
24. The success of this hybrid model accelerated the Amazon
flywheel. Customers were initially drawn by our
fast-growing selection of Amazon-sold products at great prices
with a great customer experience. By then
allowing third parties to offer products side-by-side, we became
more attractive to customers, which drew even
more sellers. This also added to our economies of scale, which
we passed along by lowering prices and
eliminating shipping fees for qualifying orders. Having
introduced these programs in the U.S., we rolled them out
as quickly as we could to our other geographies. The result was
a marketplace that became seamlessly integrated
with all of our global websites.
We work hard to reduce the workload for sellers and increase
the success of their businesses. Through our
Selling Coach program, we generate a steady stream of
automated machine-learned “nudges” (more than 70
million in a typical week) – alerting sellers about opportunities
to avoid going out-of-stock, add selection that’s
selling, and sharpen their prices to be more competitive. These
nudges translate to billions in increased sales to
sellers.
To further globalize Marketplace, we’re now helping sellers in
each of our geographies – and in countries
where we don’t have a presence – reach out to our customers in
countries outside their home geographies. We
hosted merchants from more than 100 different countries last
year, and helped them connect with customers in
185 nations.
Almost one-fifth of our overall third-party sales now occur
outside the sellers’ home countries, and our
merchants’ cross-border sales nearly doubled last year. In the
25. EU, sellers can open a single account, manage their
business in multiple languages, and make products available
across our five EU websites. More recently, we’ve
started consolidating cross-border shipments for sellers and
helping them obtain ocean shipping from Asia to
Europe and North America at preferential, bulk rates.
Marketplace is the heart of our fast-growing operations in India,
since all of our selection in India is offered
by third-party sellers. Amazon.in now offers more selection
than any other e-commerce site in India – with more
than 20 million products offered from over 21,000 sellers. With
our Easy Ship service, we pick up products from
a seller and handle delivery all the way to the end customer.
Building upon Easy Ship, the India team recently
piloted Kirana Now, a service that delivers everyday essentials
from local kirana (mom and pop) stores to
customers in two to four hours, adding convenience for our
customers and increasing sales for the stores
participating in the service.
Perhaps most important for sellers, we’ve created Fulfillment by
Amazon. But I’ll save that for after we
discuss Prime.
Amazon Prime
Ten years ago, we launched Amazon Prime, originally designed
as an all-you-can-eat free and fast shipping
program. We were told repeatedly that it was a risky move, and
in some ways it was. In its first year, we gave up
many millions of dollars in shipping revenue, and there was no
simple math to show that it would be worth it.
26. Our decision to go ahead was built on the positive results we’d
seen earlier when we introduced Free Super Saver
Shipping, and an intuition that customers would quickly grasp
that they were being offered the best deal in the
history of shopping. In addition, analysis told us that, if we
achieved scale, we would be able to significantly
lower the cost of fast shipping.
Our owned-inventory retail business was the foundation of
Prime. In addition to creating retail teams to
build each of our category-specific online “stores,” we have
created large-scale systems to automate much of
inventory replenishment, inventory placement, and product
pricing. The precise delivery-date promise of Prime
required operating our fulfillment centers in a new way, and
pulling all of this together is one of the great
accomplishments of our global operations team. Our worldwide
network of fulfillment centers has expanded
from 13 in 2005, when we launched Prime, to 109 this year. We
are now on our eighth generation of fulfillment
center design, employing proprietary software to manage
receipt, stowing, picking, and shipment. Amazon
Robotics, which began with our acquisition of Kiva in 2012, has
now deployed more than 15,000 robots to
support the stowing and retrieval of products at a higher density
and lower cost than ever before. Our owned-
inventory retail business remains our best customer-acquisition
vehicle for Prime and a critical part of building
out categories that attract traffic and third-party sellers.
Though fast delivery remains a core Prime benefit, we are
finding new ways to pump energy into Prime.
Two of the most important are digital and devices.
In 2011 we added Prime Instant Video as a benefit, now with
tens of thousands of movies and TV episodes
27. available for unlimited streaming in the U.S., and we’ve started
expanding the program into the U.K. and
Germany as well. We’re investing a significant amount on this
content, and it’s important that we monitor its
impact. We ask ourselves, is it worth it? Is it driving Prime?
Among other things, we watch Prime free trial starts,
conversion to paid membership, renewal rates, and product
purchase rates by members entering through this
channel. We like what we see so far and plan to keep investing
here.
While most of our PIV spend is on licensed content, we’re also
starting to develop original content. The
team is off to a strong start. Our show Transparent became the
first from a streaming service to win a Golden
Globe for best series and Tumble Leaf won the Annie for best
animated series for preschoolers. In addition to the
critical acclaim, the numbers are promising. An advantage of
our original programming is that its first run is on
Prime – it hasn’t already appeared anywhere else. Together with
the quality of the shows, that first run status
appears to be one of the factors leading to the attractive
numbers. We also like the fixed cost nature of original
programming. We get to spread that fixed cost across our large
membership base. Finally, our business model for
original content is unique. I’m pretty sure we’re the first
company to have figured out how to make winning a
Golden Globe pay off in increased sales of power tools and
baby wipes!
Amazon designed and manufactured devices – from Kindle to
Fire TV to Echo – also pump energy into
Prime services such as Prime Instant Video and Prime Music,
and generally drive higher engagement with every
28. element of the Amazon ecosystem. And there’s more to come –
our device team has a strong and exciting
roadmap ahead.
Prime isn’t done improving on its original fast and free shipping
promise either. The recently launched
Prime Now offers Prime members free two-hour delivery on
tens of thousands of items or one-hour delivery for a
$7.99 fee. Lots of early reviews read like this one, “In the past
six weeks my husband and I have made an
embarrassing number of orders through Amazon Prime Now.
It’s cheap, easy, and insanely fast.” We’ve
launched in Manhattan, Brooklyn, Miami, Baltimore, Dallas,
Atlanta, and Austin, and more cities are coming
soon.
Now, I’d like to talk about Fulfillment by Amazon. FBA is so
important because it is glue that inextricably
links Marketplace and Prime. Thanks to FBA, Marketplace and
Prime are no longer two things. In fact, at this
point, I can’t really think about them separately. Their
economics and customer experiences are now happily and
deeply intertwined.
FBA is a service for Marketplace sellers. When a seller decides
to use FBA, they stow their inventory in our
fulfillment centers. We take on all logistics, customer service,
and product returns. If a customer orders an FBA
item and an Amazon owned-inventory item, we can ship both
items to the customer in one box – a huge
efficiency gain. But even more important, when a seller joins
FBA, their items can become Prime eligible.
Maintaining a firm grasp of the obvious is more difficult than
one would think it should be. But it’s useful to
try. If you ask, what do sellers want? The correct (and obvious)
29. answer is: they want more sales. So, what
happens when sellers join FBA and their items become Prime
eligible? They get more sales.
Notice also what happens from a Prime member’s point of view.
Every time a seller joins FBA, Prime
members get more Prime eligible selection. The value of
membership goes up. This is powerful for our flywheel.
FBA completes the circle: Marketplace pumps energy into
Prime, and Prime pumps energy into Marketplace.
In a 2014 survey of U.S. sellers, 71% of FBA merchants
reported more than a 20% increase in unit sales
after joining FBA. In the holiday period, worldwide FBA units
shipped grew 50% over the prior year and
represented more than 40% of paid third-party units. Paid Prime
memberships grew more than 50% in the U.S.
last year and 53% worldwide. FBA is a win for customers and a
win for sellers.
Amazon Web Services
A radical idea when it was launched nine years ago, Amazon
Web Services is now big and growing fast.
Startups were the early adopters. On-demand, pay-as-you-go
cloud storage and compute resources dramatically
increased the speed of starting a new business. Companies like
Pinterest, Dropbox, and Airbnb all used AWS
services and remain customers today.
Since then, large enterprises have been coming on board as
well, and they’re choosing to use AWS for the
same primary reason the startups did: speed and agility. Having
lower IT cost is attractive, and sometimes the
absolute cost savings can be enormous. But cost savings alone
could never overcome deficiencies in performance
30. or functionality. Enterprises are dependent on IT – it’s mission
critical. So, the proposition, “I can save you a
significant amount on your annual IT bill and my service is
almost as good as what you have now,” won’t get too
many customers. What customers really want in this arena is
“better and faster,” and if “better and faster” can
come with a side dish of cost savings, terrific. But the cost
savings is the gravy, not the steak.
IT is so high leverage. You don’t want to imagine a competitor
whose IT department is more nimble than
yours. Every company has a list of technology projects that the
business would like to see implemented as soon
as possible. The painful reality is that tough triage decisions are
always made, and many projects never get done.
Even those that get resourced are often delivered late or with
incomplete functionality. If an IT department can
figure out how to deliver a larger number of business-enabling
technology projects faster, they’ll be creating
significant and real value for their organization.
These are the main reasons AWS is growing so quickly. IT
departments are recognizing that when they
adopt AWS, they get more done. They spend less time on low
value-add activities like managing datacenters,
networking, operating system patches, capacity planning,
database scaling, and so on and so on. Just as
important, they get access to powerful APIs and tools that
dramatically simplify building scalable, secure, robust,
high-performance systems. And those APIs and tools are
continuously and seamlessly upgraded behind the
scenes, without customer effort.
Today, AWS has more than a million active customers as
31. companies and organizations of all sizes use AWS
in every imaginable business segment. AWS usage grew by
approximately 90% in the fourth quarter of 2014
versus the prior year. Companies like GE, Major League
Baseball, Tata Motors, and Qantas are building new
applications on AWS – these range from apps for crowdsourcing
and personalized healthcare to mobile apps for
managing fleets of trucks. Other customers, like NTT
DOCOMO, the Financial Times, and the Securities and
Exchange Commission are using AWS to analyze and take
action on vast amounts of data. And many customers
like Condé Nast, Kellogg’s, and News Corp are migrating
legacy critical applications and, in some cases, entire
datacenters to AWS.
We’ve increased our pace of innovation as we’ve gone along –
from nearly 160 new features and services in
2012, to 280 in 2013, and 516 last year. There are many that
would be interesting to talk about – from WorkDocs
and WorkMail to AWS Lambda and the EC2 Container Service
to the AWS Marketplace – but for purposes of
brevity, I’m going to limit myself to one: our recently
introduced Amazon Aurora. We hope Aurora will offer
customers a new normal for a very important (but also very
problematic) technology that is a critical
underpinning of many applications: the relational database.
Aurora is a MySQL-compatible database engine that
offers the speed and availability of high-end commercial
databases with the simplicity and cost effectiveness of
open source databases. Aurora’s performance is up to 5x better
than typical MySQL databases, at one-tenth the
cost of commercial database packages. Relational databases is
an arena that’s been a pain point for organizations
and developers for a long time, and we’re very excited about
Aurora.
32. I believe AWS is one of those dreamy business offerings that
can be serving customers and earning financial
returns for many years into the future. Why am I optimistic? For
one thing, the size of the opportunity is big,
ultimately encompassing global spend on servers, networking,
datacenters, infrastructure software, databases,
data warehouses, and more. Similar to the way I think about
Amazon retail, for all practical purposes, I believe
AWS is market-size unconstrained.
Second, its current leadership position (which is significant) is
a strong ongoing advantage. We work hard –
very hard – to make AWS as easy to use as possible. Even so,
it’s still a necessarily complex set of tools with
rich functionality and a non-trivial learning curve. Once you’ve
become proficient at building complex systems
with AWS, you do not want to have to learn a new set of tools
and APIs assuming the set you already understand
works for you. This is in no way something we can rest on, but
if we continue to serve our customers in a truly
outstanding way, they will have a rational preference to stick
with us.
In addition, also because of our leadership position, we now
have thousands of what are effectively AWS
ambassadors roaming the world. Software developers changing
jobs, moving from one company to another,
become our best sales people: “We used AWS where I used to
work, and we should consider it here. I think we’d
get more done.” It’s a good sign that proficiency with AWS and
its services is already something software
developers are adding to their resumes.
Finally, I’m optimistic that AWS will have strong returns on
capital. This is one we as a team examine
because AWS is capital intensive. The good news is we like
33. what we see when we do these analyses.
Structurally, AWS is far less capital intensive than the mode
it’s replacing – do-it-yourself datacenters – which
have low utilization rates, almost always below 20%. Pooling of
workloads across customers gives AWS much
higher utilization rates, and correspondingly higher capital
efficiency. Further, once again our leadership position
helps: scale economies can provide us a relative advantage on
capital efficiency. We’ll continue to watch and
shape the business for good returns on capital.
AWS is young, and it is still growing and evolving. We think
we can continue to lead if we continue to
execute with our customers’ needs foremost in mind.
Career Choice
Before closing, I want to take a moment to update shareowners
on something we’re excited about and proud
of. Three years ago we launched an innovative employee benefit
– the Career Choice program, where we pre-pay
95% of tuition for employees to take courses for in-demand
fields, such as airplane mechanic or nursing,
regardless of whether the skills are relevant to a career at
Amazon. The idea was simple: enable choice.
We know that, for some of our fulfillment and customer service
center employees, Amazon will be a career.
For others, Amazon might be a stepping stone on the way to a
job somewhere else – a job that may require new
skills. If the right training can make the difference, we want to
help, and so far we have been able to help over
2,000 employees who have participated in the program in eight
different countries. There’s been so much interest
34. that we are now building onsite classrooms so college and
technical classes can be taught inside our fulfillment
centers, making it even easier for associates to achieve these
goals.
There are now eight FCs offering 15 classes taught onsite in our
purpose-built classrooms with high-end
technology features, and designed with glass walls to inspire
others to participate and generate encouragement
from peers. We believe Career Choice is an innovative way to
draw great talent to serve customers in our
fulfillment and customer service centers. These jobs can become
gateways to great careers with Amazon as we
expand around the world or enable employees the opportunity to
follow their passion in other in-demand
technical fields, like our very first Career Choice graduate did
when she started a new career as a nurse in her
community.
I would also like to invite you to come join the more than
24,000 people who have signed up so far to see
the magic that happens after you click buy on Amazon.com by
touring one of our fulfillment centers. In addition
to U.S. tours, we are now offering tours at sites around the
world, including Rugeley in the U.K. and Graben in
Germany and continuing to expand. You can sign up for a tour
at www.amazon.com/fctours.
* * *
Marketplace, Prime, and Amazon Web Services are three big
ideas. We’re lucky to have them, and we’re
determined to improve and nurture them – make them even
better for customers. You can also count on us to
work hard to find a fourth. We’ve already got a number of
candidates in work, and as we promised some twenty
35. years ago, we’ll continue to make bold bets. With the
opportunities unfolding in front of us to serve customers
better through invention, we assure you we won’t stop trying.
As always, I attach a copy of our original 1997 letter. Our
approach remains the same, because it’s still
Day 1.
Jeffrey P. Bezos
Founder and Chief Executive Officer
Amazon.com, Inc.
1997 LETTER TO SHAREHOLDERS
(Reprinted from the 1997 Annual Report)
To our shareholders:
Amazon.com passed many milestones in 1997: by year-end, we
had served more than 1.5 million customers,
yielding 838% revenue growth to $147.8 million, and extended
our market leadership despite aggressive
competitive entry.
But this is Day 1 for the Internet and, if we execute well, for
Amazon.com. Today, online commerce saves
customers money and precious time. Tomorrow, through
personalization, online commerce will accelerate the
very process of discovery. Amazon.com uses the Internet to
create real value for its customers and, by doing so,
hopes to create an enduring franchise, even in established and
large markets.
We have a window of opportunity as larger players marshal the
resources to pursue the online opportunity
36. and as customers, new to purchasing online, are receptive to
forming new relationships. The competitive
landscape has continued to evolve at a fast pace. Many large
players have moved online with credible offerings
and have devoted substantial energy and resources to building
awareness, traffic, and sales. Our goal is to move
quickly to solidify and extend our current position while we
begin to pursue the online commerce opportunities
in other areas. We see substantial opportunity in the large
markets we are targeting. This strategy is not without
risk: it requires serious investment and crisp execution against
established franchise leaders.
It’s All About the Long Term
We believe that a fundamental measure of our success will be
the shareholder value we create over the long
term. This value will be a direct result of our ability to extend
and solidify our current market leadership position.
The stronger our market leadership, the more powerful our
economic model. Market leadership can translate
directly to higher revenue, higher profitability, greater capital
velocity, and correspondingly stronger returns on
invested capital.
Our decisions have consistently reflected this focus. We first
measure ourselves in terms of the metrics most
indicative of our market leadership: customer and revenue
growth, the degree to which our customers continue to
purchase from us on a repeat basis, and the strength of our
brand. We have invested and will continue to invest
aggressively to expand and leverage our customer base, brand,
and infrastructure as we move to establish an
enduring franchise.
Because of our emphasis on the long term, we may make
37. decisions and weigh tradeoffs differently than
some companies. Accordingly, we want to share with you our
fundamental management and decision-making
approach so that you, our shareholders, may confirm that it is
consistent with your investment philosophy:
• We will continue to focus relentlessly on our customers.
• We will continue to make investment decisions in light of
long-term market leadership considerations
rather than short-term profitability considerations or short-term
Wall Street reactions.
• We will continue to measure our programs and the
effectiveness of our investments analytically, to
jettison those that do not provide acceptable returns, and to step
up our investment in those that work
best. We will continue to learn from both our successes and our
failures.
• We will make bold rather than timid investment decisions
where we see a sufficient probability of
gaining market leadership advantages. Some of these
investments will pay off, others will not, and we
will have learned another valuable lesson in either case.
• When forced to choose between optimizing the appearance of
our GAAP accounting and maximizing
the present value of future cash flows, we’ll take the cash flows.
• We will share our strategic thought processes with you when
we make bold choices (to the extent
competitive pressures allow), so that you may evaluate for
yourselves whether we are making rational
38. long-term leadership investments.
• We will work hard to spend wisely and maintain our lean
culture. We understand the importance of
continually reinforcing a cost-conscious culture, particularly in
a business incurring net losses.
• We will balance our focus on growth with emphasis on long-
term profitability and capital management.
At this stage, we choose to prioritize growth because we believe
that scale is central to achieving the
potential of our business model.
• We will continue to focus on hiring and retaining versatile and
talented employees, and continue to
weight their compensation to stock options rather than cash. We
know our success will be largely
affected by our ability to attract and retain a motivated
employee base, each of whom must think like,
and therefore must actually be, an owner.
We aren’t so bold as to claim that the above is the “right”
investment philosophy, but it’s ours, and we
would be remiss if we weren’t clear in the approach we have
taken and will continue to take.
With this foundation, we would like to turn to a review of our
business focus, our progress in 1997, and our
outlook for the future.
Obsess Over Customers
From the beginning, our focus has been on offering our
customers compelling value. We realized that the
Web was, and still is, the World Wide Wait. Therefore, we set
out to offer customers something they simply
39. could not get any other way, and began serving them with
books. We brought them much more selection than
was possible in a physical store (our store would now occupy 6
football fields), and presented it in a useful, easy-
to-search, and easy-to-browse format in a store open 365 days a
year, 24 hours a day. We maintained a dogged
focus on improving the shopping experience, and in 1997
substantially enhanced our store. We now offer
customers gift certificates, 1-ClickSM shopping, and vastly
more reviews, content, browsing options, and
recommendation features. We dramatically lowered prices,
further increasing customer value. Word of mouth
remains the most powerful customer acquisition tool we have,
and we are grateful for the trust our customers
have placed in us. Repeat purchases and word of mouth have
combined to make Amazon.com the market leader
in online bookselling.
By many measures, Amazon.com came a long way in 1997:
• Sales grew from $15.7 million in 1996 to $147.8 million – an
838% increase.
• Cumulative customer accounts grew from 180,000 to
1,510,000 – a 738% increase.
• The percentage of orders from repeat customers grew from
over 46% in the fourth quarter of 1996 to
over 58% in the same period in 1997.
• In terms of audience reach, per Media Metrix, our Web site
went from a rank of 90th to within the top
20.
• We established long-term relationships with many important
strategic partners, including America
40. Online, Yahoo!, Excite, Netscape, GeoCities, AltaVista,
@Home, and Prodigy.
Infrastructure
During 1997, we worked hard to expand our business
infrastructure to support these greatly increased
traffic, sales, and service levels:
• Amazon.com’s employee base grew from 158 to 614, and we
significantly strengthened our
management team.
• Distribution center capacity grew from 50,000 to 285,000
square feet, including a 70% expansion of our
Seattle facilities and the launch of our second distribution
center in Delaware in November.
• Inventories rose to over 200,000 titles at year-end, enabling us
to improve availability for our customers.
• Our cash and investment balances at year-end were $125
million, thanks to our initial public offering in
May 1997 and our $75 million loan, affording us substantial
strategic flexibility.
Our Employees
The past year’s success is the product of a talented, smart, hard-
working group, and I take great pride in
being a part of this team. Setting the bar high in our approach to
hiring has been, and will continue to be, the
single most important element of Amazon.com’s success.
41. It’s not easy to work here (when I interview people I tell them,
“You can work long, hard, or smart, but at
Amazon.com you can’t choose two out of three”), but we are
working to build something important, something
that matters to our customers, something that we can all tell our
grandchildren about. Such things aren’t meant to
be easy. We are incredibly fortunate to have this group of
dedicated employees whose sacrifices and passion
build Amazon.com.
Goals for 1998
We are still in the early stages of learning how to bring new
value to our customers through Internet
commerce and merchandising. Our goal remains to continue to
solidify and extend our brand and customer base.
This requires sustained investment in systems and infrastructure
to support outstanding customer convenience,
selection, and service while we grow. We are planning to add
music to our product offering, and over time we
believe that other products may be prudent investments. We also
believe there are significant opportunities to
better serve our customers overseas, such as reducing delivery
times and better tailoring the customer experience.
To be certain, a big part of the challenge for us will lie not in
finding new ways to expand our business, but in
prioritizing our investments.
We now know vastly more about online commerce than when
Amazon.com was founded, but we still have
so much to learn. Though we are optimistic, we must remain
vigilant and maintain a sense of urgency. The
challenges and hurdles we will face to make our long-term
vision for Amazon.com a reality are several:
aggressive, capable, well-funded competition; considerable
growth challenges and execution risk; the risks of
42. product and geographic expansion; and the need for large
continuing investments to meet an expanding market
opportunity. However, as we’ve long said, online bookselling,
and online commerce in general, should prove to
be a very large market, and it’s likely that a number of
companies will see significant benefit. We feel good about
what we’ve done, and even more excited about what we want to
do.
1997 was indeed an incredible year. We at Amazon.com are
grateful to our customers for their business and
trust, to each other for our hard work, and to our shareholders
for their support and encouragement.
Jeffrey P. Bezos
Founder and Chief Executive Officer
Amazon.com, Inc.
UNITED STATES
SECURITIES AND EXCHANGE COMMISSION
Washington, D.C. 20549
____________________________________
FORM 10-K
____________________________________
(Mark One)
ANNUAL REPORT PURSUANT TO SECTION 13 OR 15(d) OF
THE SECURITIES EXCHANGE ACT OF 1934
For the fiscal year ended December 31, 2014
or
43. TRANSITION REPORT PURSUANT TO SECTION 13 OR
15(d) OF THE SECURITIES EXCHANGE ACT OF 1934
For the transition period from to .
Commission File No. 000-22513
____________________________________
AMAZON.COM, INC.
(Exact Name of Registrant as Specified in its Charter)
Delaware 91-1646860
(State or Other Jurisdiction of
Incorporation or Organization)
(I.R.S. Employer
Identification No.)
410 Terry Avenue North
Seattle, Washington 98109-5210
(206) 266-1000
(Address and telephone number, including area code, of
registrant’s principal executive offices)
Securities registered pursuant to Section 12(b) of the Act:
Title of Each Class Name of Each Exchange on Which
Registered
Common Stock, par value $.01 per share NASDAQ Global
Select Market
Securities registered pursuant to Section 12(g) of the Act:
None
44. ____________________________________
Indicate by check mark if the registrant is a well-known
seasoned issuer, as defined in Rule 405 of the Securities Act.
Yes No
Indicate by check mark if the registrant is not required to file
reports pursuant to Section 13 or Section 15(d) of the Exchange
Act. Yes No
Indicate by check mark whether the registrant (1) has filed all
reports required to be filed by Section 13 or 15(d) of the
Securities Exchange Act of 1934
during the preceding 12 months (or for such shorter period that
the registrant was required to file such reports), and (2) has
been subject to such filing
requirements for the past 90 days. Yes No
Indicate by check mark whether the registrant has submitted
electronically and posted on its corporate Web site, if any,
every Interactive Data File required
to be submitted and posted pursuant to Rule 405 of Regulation
S-T during the preceding 12 months (or for such shorter period
that the registrant was required to
submit and post such files). Yes No
Indicate by check mark if disclosure of delinquent filers
pursuant to Item 405 of Regulation S-K is not contained herein,
and will not be contained, to the
best of registrant’s knowledge, in definitive proxy or
information statements incorporated by reference in Part III of
this Form 10-K or any amendment to this
Form 10-K.
Indicate by check mark whether the registrant is a large
45. accelerated filer, an accelerated filer, a non-accelerated filer, or
a smaller reporting company. See
definitions of “large accelerated filer,” “accelerated filer” and
“smaller reporting company” in Rule 12b-2 of the Exchange
Act.
Large accelerated filer Accelerated filer
Non-accelerated filer (Do not check if a smaller reporting
company) Smaller reporting company
Indicate by check mark whether the registrant is a shell
company (as defined in Rule 12b-2 of the Exchange Act). Yes
No
Aggregate market value of voting stock held by non-affiliates of
the registrant as of June 30, 2014 $ 122,614,381,040
Number of shares of common stock outstanding as of January
16, 2015 464,383,939
____________________________________
DOCUMENTS INCORPORATED BY REFERENCE
The information required by Part III of this Report, to the extent
not set forth herein, is incorporated herein by reference from the
registrant’s definitive
proxy statement relating to the Annual Meeting of Shareholders
to be held in 2015, which definitive proxy statement shall be
filed with the Securities and
Exchange Commission within 120 days after the end of the
fiscal year to which this Report relates.
2
46. AMAZON.COM, INC.
FORM 10-K
For the Fiscal Year Ended December 31, 2014
INDEX
Page
PART I
Item 1. Business 3
Item 1A. Risk Factors 6
Item 1B. Unresolved Staff Comments 14
Item 2. Properties 15
Item 3. Legal Proceedings 15
Item 4. Mine Safety Disclosures 15
PART II
Item 5. Market for the Registrant’s Common Stock, Related
Shareholder Matters, and Issuer Purchases of
Equity Securities 16
Item 6. Selected Consolidated Financial Data 17
Item 7. Management’s Discussion and Analysis of Financial
Condition and Results of Operation 18
Item 7A. Quantitative and Qualitative Disclosure About Market
Risk 34
Item 8. Financial Statements and Supplementary Data 36
Item 9. Changes in and Disagreements with Accountants on
Accounting and Financial Disclosure 72
Item 9A. Controls and Procedures 72
Item 9B. Other Information 74
PART III
Item 10. Directors, Executive Officers, and Corporate
Governance 74
47. Item 11. Executive Compensation 74
Item 12. Security Ownership of Certain Beneficial Owners and
Management and Related Shareholder Matters 74
Item 13. Certain Relationships and Related Transactions, and
Director Independence 74
Item 14. Principal Accountant Fees and Services 74
PART IV
Item 15. Exhibits, Financial Statement Schedules 75
Signatures 76
3
AMAZON.COM, INC.
PART I
Item 1. Business
This Annual Report on Form 10-K and the documents
incorporated herein by reference contain forward-looking
statements
based on expectations, estimates, and projections as of the date
of this filing. Actual results may differ materially from those
expressed in forward-looking statements. See Item 1A of Part
I—“Risk Factors.”
Amazon.com, Inc. was incorporated in 1994 in the state of
Washington and reincorporated in 1996 in the state of
Delaware. Our principal corporate offices are located in Seattle,
Washington. We completed our initial public offering in May
1997 and our common stock is listed on the NASDAQ Global
Select Market under the symbol “AMZN.”
48. As used herein, “Amazon.com,” “we,” “our,” and similar terms
include Amazon.com, Inc. and its subsidiaries, unless the
context indicates otherwise.
General
Amazon.com opened its virtual doors on the World Wide Web
in July 1995. We seek to be Earth’s most customer-centric
company. We are guided by four principles: customer obsession
rather than competitor focus, passion for invention, commitment
to operational excellence, and long-term thinking. In each of
our two geographic segments, we serve our primary customer
sets,
consisting of consumers, sellers, enterprises, and content
creators. In addition, we provide services, such as advertising
services
and co-branded credit card agreements.
We manage our business primarily on a geographic basis.
Accordingly, we have organized our operations into two
segments: North America and International. While each
reportable operating segment provides similar products and
services, a
majority of our technology costs are incurred in the U.S. and
included in our North America segment. Additional information
on
our operating segments and product information is contained in
Item 8 of Part II, “Financial Statements and Supplementary
Data—Note 12—Segment Information.” See Item 7 of Part II,
“Management’s Discussion and Analysis of Financial Condition
and Results of Operations—Results of Operations—
Supplemental Information” for supplemental information about
our net
sales. Our company-sponsored research and development
expense is set forth within “Technology and content” in Item 8
of Part
49. II, “Financial Statements and Supplementary Data—
Consolidated Statements of Operations.”
Consumers
We serve consumers through our retail websites and focus on
selection, price, and convenience. We design our websites to
enable millions of unique products to be sold by us and by third
parties across dozens of product categories. Customers access
our websites directly and through our mobile websites and apps.
We also manufacture and sell electronic devices, including
Kindle e-readers, Fire tablets, Fire TVs, Echo, and Fire phones.
We strive to offer our customers the lowest prices possible
through low everyday product pricing and shipping offers, and
to improve our operating efficiencies so that we can continue to
lower prices for our customers. We also provide easy-to-use
functionality, fast and reliable fulfillment, and timely customer
service. In addition, we offer Amazon Prime, an annual
membership program that includes unlimited free shipping on
millions of
items, access to unlimited instant streaming of thousands of
movies and TV episodes, and access to hundreds of thousands
of
books to borrow and read for free on a Kindle device.
We fulfill customer orders in a number of ways, including
through: North America and International fulfillment and
delivery networks that we operate; co-sourced and outsourced
arrangements in certain countries; and digital delivery. We
operate
customer service centers globally, which are supplemented by
co-sourced arrangements. See Item 2 of Part I, “Properties.”
Sellers
We offer programs that enable sellers to sell their products on
50. our websites and their own branded websites and to fulfill
orders through us. We are not the seller of record in these
transactions, but instead earn fixed fees, revenue share fees,
per-unit
activity fees, or some combination thereof.
Enterprises
We serve developers and enterprises of all sizes through
Amazon Web Services (“AWS”), which offers a broad set of
global compute, storage, database, analytics, applications, and
deployment services that enable virtually any type of business.
4
Content Creators
We serve authors and independent publishers with Kindle Direct
Publishing, an online platform that lets independent
authors and publishers choose a 70% royalty option and make
their books available in the Kindle Store, along with Amazon’s
own publishing arm, Amazon Publishing. We also offer
programs that allow authors, musicians, filmmakers, app
developers, and
others to publish and sell content.
Competition
Our businesses are rapidly evolving and intensely competitive.
Our current and potential competitors include: (1) physical-
world retailers, publishers, vendors, distributors, manufacturers,
and producers of our products; (2) other online e-commerce and
mobile e-commerce sites, including sites that sell or distribute
digital content; (3) media companies, web portals, comparison
51. shopping websites, web search engines, and social networks,
either directly or in collaboration with other retailers; (4)
companies
that provide e-commerce services, including website
development, fulfillment, customer service, and payment
processing;
(5) companies that provide information storage or computing
services or products, including infrastructure and other web
services; and (6) companies that design, manufacture, market,
or sell consumer electronics, telecommunication, and electronic
devices. We believe that the principal competitive factors in our
retail businesses include selection, price, and convenience,
including fast and reliable fulfillment. Additional competitive
factors for our seller and enterprise services include the quality,
speed, and reliability of our services and tools. Many of our
current and potential competitors have greater resources, longer
histories, more customers, and greater brand recognition. They
may secure better terms from suppliers, adopt more aggressive
pricing, and devote more resources to technology,
infrastructure, fulfillment, and marketing. Other companies also
may enter into
business combinations or alliances that strengthen their
competitive positions.
Intellectual Property
We regard our trademarks, service marks, copyrights, patents,
domain names, trade dress, trade secrets, proprietary
technologies, and similar intellectual property as critical to our
success, and we rely on trademark, copyright, and patent law,
trade-secret protection, and confidentiality and/or license
agreements with our employees, customers, partners, and others
to
protect our proprietary rights. We have registered, or applied
for the registration of, a number of U.S. and international
domain
52. names, trademarks, service marks, and copyrights. Additionally,
we have filed U.S. and international patent applications
covering
certain of our proprietary technology. We have licensed in the
past, and expect that we may license in the future, certain of our
proprietary rights to third parties.
Seasonality
Our business is affected by seasonality, which historically has
resulted in higher sales volume during our fourth quarter,
which ends December 31. We recognized 33%, 34%, and 35% of
our annual revenue during the fourth quarter of 2014, 2013,
and 2012.
Employees
We employed approximately 154,100 full-time and part-time
employees as of December 31, 2014. However, employment
levels fluctuate due to seasonal factors affecting our business.
Additionally, we utilize independent contractors and temporary
personnel to supplement our workforce. We have works
councils, statutory employee representation obligations, and
union
agreements in certain countries outside the United States. We
consider our employee relations to be good. Competition for
qualified personnel in our industry has historically been intense,
particularly for software engineers, computer scientists, and
other technical staff.
Available Information
Our investor relations website is www.amazon.com/ir and we
encourage investors to use it as a way of easily finding
information about us. We promptly make available on this
website, free of charge, the reports that we file or furnish with
53. the
Securities and Exchange Commission (“SEC”), corporate
governance information (including our Code of Business
Conduct and
Ethics), and select press releases and social media postings.
5
Executive Officers and Directors
The following tables set forth certain information regarding our
Executive Officers and Directors as of January 16, 2015:
Executive Officers of the Registrant
Name Age Position
Jeffrey P. Bezos 51 President, Chief Executive Officer, and
Chairman of the Board
Jeffrey M. Blackburn 45 Senior Vice President, Business
Development
Andrew R. Jassy 47 Senior Vice President, Amazon Web
Services
Diego Piacentini 54 Senior Vice President, International
Consumer Business
Shelley L. Reynolds 50 Vice President, Worldwide Controller,
and Principal Accounting Officer
Thomas J. Szkutak 54 Senior Vice President and Chief
Financial Officer
Jeffrey A. Wilke 48 Senior Vice President, Consumer Business
David A. Zapolsky 51 Senior Vice President, General Counsel,
and Secretary
Jeffrey P. Bezos. Mr. Bezos has been Chairman of the Board of
54. Amazon.com since founding it in 1994 and Chief
Executive Officer since May 1996. Mr. Bezos served as
President of the Company from founding until June 1999 and
again from
October 2000 to the present.
Jeffrey M. Blackburn. Mr. Blackburn has served as Senior Vice
President, Business Development, since April 2006.
Andrew R. Jassy. Mr. Jassy has served as Senior Vice President,
Amazon Web Services, since April 2006.
Diego Piacentini. Mr. Piacentini has served as Senior Vice
President, International Consumer Business, since February
2012, and as Senior Vice President, International Retail, from
January 2007 until February 2012.
Shelley L. Reynolds. Ms. Reynolds has served as Vice
President, Worldwide Controller, and Principal Accounting
Officer
since April 2007.
Thomas J. Szkutak. Mr. Szkutak has served as Senior Vice
President and Chief Financial Officer since joining
Amazon.com in October 2002. Mr. Szkutak plans to retire in
June 2015.
Jeffrey A. Wilke. Mr. Wilke has served as Senior Vice
President, Consumer Business, since February 2012, and as
Senior
Vice President, North America Retail, from January 2007 until
February 2012.
David A. Zapolsky. Mr. Zapolsky has served as Senior Vice
President, General Counsel, and Secretary since May 2014,
Vice President, General Counsel, and Secretary from September
55. 2012 to May 2014, and as Vice President and Associate General
Counsel for Litigation and Regulatory matters from April 2002
until September 2012.
Board of Directors
Name Age Position
Jeffrey P. Bezos 51 President, Chief Executive Officer, and
Chairman of the Board
Tom A. Alberg 74 Managing Director, Madrona Venture
Group
John Seely Brown 74 Visiting Scholar and Advisor to the
Provost, University of Southern California
William B. Gordon 64 Partner, Kleiner Perkins Caufield &
Byers
Jamie S. Gorelick 64 Partner, Wilmer Cutler Pickering Hale
and Dorr LLP
Judith A. McGrath 62 President, Astronauts Wanted * No
experience necessary
Alain Monié 64 Chief Executive Officer, Ingram Micro Inc.
Jonathan J. Rubinstein 58 Former Chairman and CEO, Palm,
Inc.
Thomas O. Ryder 70 Retired, Former Chairman, Reader’s
Digest Association, Inc.
Patricia Q. Stonesifer 58 President and Chief Executive
Officer, Martha’s Table
6
Item 1A. Risk Factors
Please carefully consider the following risk factors. If any of
the following risks occur, our business, financial condition,
56. operating results, and cash flows could be materially adversely
affected. In addition, the current global economic climate
amplifies many of these risks.
We Face Intense Competition
Our businesses are rapidly evolving and intensely competitive,
and we have many competitors in different industries,
including retail, e-commerce services, digital content and
electronic devices, and web and infrastructure computing
services.
Some of our current and potential competitors have greater
resources, longer histories, more customers, and/or greater
brand
recognition. They may secure better terms from vendors, adopt
more aggressive pricing, and devote more resources to
technology, infrastructure, fulfillment, and marketing.
Competition may intensify as our competitors enter into
business combinations or alliances and established companies in
other market segments expand to become competitive with our
business. In addition, new and enhanced technologies, including
search, web and infrastructure computing services, digital
content, and electronic devices, may increase our competition.
The
Internet facilitates competitive entry and comparison shopping,
and increased competition may reduce our sales and profits.
Our Expansion Places a Significant Strain on our Management,
Operational, Financial, and Other Resources
We are rapidly and significantly expanding our global
operations, including increasing our product and service
offerings
and scaling our infrastructure to support our retail and services
businesses. This expansion increases the complexity of our
57. business and places significant strain on our management,
personnel, operations, systems, technical performance, financial
resources, and internal financial control and reporting functions.
We may not be able to manage growth effectively, which could
damage our reputation, limit our growth, and negatively affect
our operating results.
Our Expansion into New Products, Services, Technologies, and
Geographic Regions Subjects Us to Additional Business,
Legal, Financial, and Competitive Risks
We may have limited or no experience in our newer market
segments, and our customers may not adopt our new offerings.
These offerings may present new and difficult technology
challenges, and we may be subject to claims if customers of
these
offerings experience service disruptions or failures or other
quality issues. In addition, profitability, if any, in our newer
activities
may be lower than in our older activities, and we may not be
successful enough in these newer activities to recoup our
investments in them. If any of this were to occur, it could
damage our reputation, limit our growth, and negatively affect
our
operating results.
We May Experience Significant Fluctuations in Our Operating
Results and Growth Rate
We may not be able to accurately forecast our growth rate. We
base our expense levels and investment plans on sales
estimates. A significant portion of our expenses and investments
is fixed, and we may not be able to adjust our spending quickly
enough if our sales are less than expected.
Our revenue growth may not be sustainable, and our percentage
58. growth rates may decrease. Our revenue and operating
profit growth depends on the continued growth of demand for
the products and services offered by us or our sellers, and our
business is affected by general economic and business
conditions worldwide. A softening of demand, whether caused
by changes
in customer preferences or a weakening of the U.S. or global
economies, may result in decreased revenue or growth.
Our sales and operating results will also fluctuate for many
other reasons, including due to risks described elsewhere in this
section and the following:
• our ability to retain and increase sales to existing customers,
attract new customers, and satisfy our customers’
demands;
• our ability to retain and expand our network of sellers;
• our ability to offer products on favorable terms, manage
inventory, and fulfill orders;
• the introduction of competitive websites, products, services,
price decreases, or improvements;
• changes in usage or adoption rates of the Internet, e-
commerce, electronic devices, and web services, including
outside
the U.S.;
• timing, effectiveness, and costs of expansion and upgrades of
our systems and infrastructure;
7
59. • the success of our geographic, service, and product line
expansions;
• the extent to which we finance, and the terms of any such
financing for, our current operations and future growth;
• the outcomes of legal proceedings and claims, which may
include significant monetary damages or injunctive relief
and could have a material adverse impact on our operating
results;
• variations in the mix of products and services we sell;
• variations in our level of merchandise and vendor returns;
• the extent to which we offer free shipping, continue to reduce
prices worldwide, and provide additional benefits to our
customers;
• the extent to which we invest in technology and content,
fulfillment, and other expense categories;
• increases in the prices of fuel and gasoline, as well as
increases in the prices of other energy products and
commodities
like paper and packing supplies;
• the extent to which our equity-method investees record
significant operating and non-operating items;
• the extent to which operators of the networks between our
customers and our websites successfully charge fees to grant
our customers unimpaired and unconstrained access to our
online services;
60. • our ability to collect amounts owed to us when they become
due;
• the extent to which use of our services is affected by spyware,
viruses, phishing and other spam emails, denial of
service attacks, data theft, computer intrusions, outages, and
similar events; and
• terrorist attacks and armed hostilities.
Our International Operations Expose Us to a Number of Risks
Our international activities are significant to our revenues and
profits, and we plan to further expand internationally. In
certain international market segments, we have relatively little
operating experience and may not benefit from any first-to-
market
advantages or otherwise succeed. It is costly to establish,
develop, and maintain international operations and websites,
and
promote our brand internationally. Our international operations
may not be profitable on a sustained basis.
In addition to risks described elsewhere in this section, our
international sales and operations are subject to a number of
risks, including:
• local economic and political conditions;
• government regulation of e-commerce and other services,
electronic devices, and competition, and restrictive
governmental actions (such as trade protection measures,
including export duties and quotas and custom duties and
tariffs), nationalization, and restrictions on foreign ownership;
• restrictions on sales or distribution of certain products or
61. services and uncertainty regarding liability for products,
services, and content, including uncertainty as a result of less
Internet-friendly legal systems, local laws, lack of legal
precedent, and varying rules, regulations, and practices
regarding the physical and digital distribution of media
products and enforcement of intellectual property rights;
• business licensing or certification requirements, such as for
imports, exports, web services, and electronic devices;
• limitations on the repatriation and investment of funds and
foreign currency exchange restrictions;
• limited fulfillment and technology infrastructure;
• shorter payable and longer receivable cycles and the resultant
negative impact on cash flow;
• laws and regulations regarding consumer and data protection,
privacy, network security, encryption, payments, and
restrictions on pricing or discounts;
• lower levels of use of the Internet;
• lower levels of consumer spending and fewer opportunities for
growth compared to the U.S.;
• lower levels of credit card usage and increased payment risk;
• difficulty in staffing, developing, and managing foreign
operations as a result of distance, language, and cultural
differences;
8
62. • different employee/employer relationships and the existence of
works councils and labor unions;
• compliance with the U.S. Foreign Corrupt Practices Act and
other applicable U.S. and foreign laws prohibiting corrupt
payments to government officials and other third parties;
• laws and policies of the U.S. and other jurisdictions affecting
trade, foreign investment, loans, and taxes; and
• geopolitical events, including war and terrorism.
As international e-commerce and other online and web services
grow, competition will intensify. Local companies may
have a substantial competitive advantage because of their
greater understanding of, and focus on, the local customer, as
well as
their more established local brand names. We may not be able to
hire, train, retain, and manage required personnel, which may
limit our international growth.
The People’s Republic of China (“PRC”) and India regulate
Amazon’s and its affiliates’ businesses and operations in
country through regulations and license requirements that may
restrict (i) foreign investment in and operation of the Internet,
IT
infrastructure, data centers, retail, delivery, and other sectors,
(ii) Internet content, and (iii) the sale of media and other
products
and services. For example, in order to meet local ownership and
regulatory licensing requirements, www.amazon.cn is operated
by PRC companies that are indirectly owned, either wholly or
partially, by PRC nationals. In addition, we provide certain
technology services in conjunction with third parties that hold
PRC licenses to provide services. In India, the government
63. restricts the ownership or control of Indian companies by
foreign entities involved in online multi-brand retail trading
activities.
For www.amazon.in, we provide certain marketing tools and
logistics services to third party sellers to enable them to sell
online
and deliver to customers. Although we believe these structures
and activities comply with existing laws, they involve unique
risks, and the PRC is actively considering changes in its foreign
investment rules that could impact these structures and
activities.
There are substantial uncertainties regarding the interpretation
of PRC and Indian laws and regulations, and it is possible that
the
government will ultimately take a view contrary to ours. In
addition, our Chinese and Indian businesses and operations may
be
unable to continue to operate if we or our affiliates are unable
to access sufficient funding or in China enforce contractual
relationships with respect to management and control of such
businesses. If our international activities were found to be in
violation of any existing or future PRC, Indian or other laws or
regulations or if interpretations of those laws and regulations
were to change, our businesses in those countries could be
subject to fines and other financial penalties, have licenses
revoked, or
be forced to shut down entirely.
If We Do Not Successfully Optimize and Operate Our
Fulfillment and Data Centers, Our Business Could Be Harmed
If we do not adequately predict customer demand or otherwise
optimize and operate our fulfillment and data centers
successfully, it could result in excess or insufficient fulfillment
or data center capacity, or result in increased costs, impairment
charges, or both, or harm our business in other ways. As we
64. continue to add fulfillment, warehouse, and data center
capability or
add new businesses with different requirements, our fulfillment
and data center networks become increasingly complex and
operating them becomes more challenging. There can be no
assurance that we will be able to operate our networks
effectively.
In addition, a failure to optimize inventory in our fulfillment
centers will increase our net shipping cost by requiring long-
zone or partial shipments. Orders from several of our websites
are fulfilled primarily from a single location, and we have only
a
limited ability to reroute orders to third parties for drop-
shipping. We and our co-sourcers may be unable to adequately
staff our
fulfillment and customer service centers. If the other businesses
on whose behalf we perform inventory fulfillment services
deliver product to our fulfillment centers in excess of forecasts,
we may be unable to secure sufficient storage space and may be
unable to optimize our fulfillment centers.
We rely on a limited number of shipping companies to deliver
inventory to us and completed orders to our customers. If we
are not able to negotiate acceptable terms with these companies
or they experience performance problems or other difficulties, it
could negatively impact our operating results and customer
experience. In addition, our ability to receive inbound inventory
efficiently and ship completed orders to customers also may be
negatively affected by inclement weather, fire, flood, power
loss,
earthquakes, labor disputes, acts of war or terrorism, acts of
God, and similar factors.
Third parties either drop-ship or otherwise fulfill an increasing
portion of our customers’ orders, and we are increasingly
65. reliant on the reliability, quality, and future procurement of
their services. Under some of our commercial agreements, we
maintain the inventory of other companies, thereby increasing
the complexity of tracking inventory and operating our
fulfillment
centers. Our failure to properly handle such inventory or the
inability of these other companies to accurately forecast product
demand would result in unexpected costs and other harm to our
business and reputation.
9
The Seasonality of Our Business Places Increased Strain on Our
Operations
We expect a disproportionate amount of our net sales to occur
during our fourth quarter. If we do not stock or restock
popular products in sufficient amounts such that we fail to meet
customer demand, it could significantly affect our revenue and
our future growth. If we overstock products, we may be required
to take significant inventory markdowns or write-offs and incur
commitment costs, which could reduce profitability. We may
experience an increase in our net shipping cost due to
complimentary upgrades, split-shipments, and additional long-
zone shipments necessary to ensure timely delivery for the
holiday
season. If too many customers access our websites within a
short period of time due to increased holiday demand, we may
experience system interruptions that make our websites
unavailable or prevent us from efficiently fulfilling orders,
which may
reduce the volume of goods we sell and the attractiveness of our
products and services. In addition, we may be unable to
adequately staff our fulfillment and customer service centers
66. during these peak periods and delivery and other fulfillment
companies and customer service co-sourcers may be unable to
meet the seasonal demand. We also face risks described
elsewhere
in this Item 1A relating to fulfillment center optimization and
inventory.
We generally have payment terms with our retail vendors that
extend beyond the amount of time necessary to collect
proceeds from our consumer customers. As a result of holiday
sales, as of December 31 of each year, our cash, cash
equivalents,
and marketable securities balances typically reach their highest
level (other than as a result of cash flows provided by or used in
investing and financing activities). This operating cycle results
in a corresponding increase in accounts payable as of
December 31. Our accounts payable balance generally declines
during the first three months of the year, resulting in a
corresponding decline in our cash, cash equivalents, and
marketable securities balances.
Our Business Could Suffer if We Are Unsuccessful in Making,
Integrating, and Maintaining Commercial Agreements,
Strategic Alliances, and Other Business Relationships
We provide e-commerce and other services to businesses
through commercial agreements, strategic alliances, and
business
relationships. Under these agreements, we provide web services,
technology, fulfillment, computing, digital storage, and other
services, as well as enable sellers to offer products or services
through our websites. These arrangements are complex and
require
substantial infrastructure capacity, personnel, and other
resource commitments, which may limit the amount of business
we can
67. service. We may not be able to implement, maintain, and
develop the components of these commercial relationships,
which may
include web services, fulfillment, customer service, inventory
management, tax collection, payment processing, hardware,
content, and third-party software, and engaging third parties to
perform services. The amount of compensation we receive under
certain of our commercial agreements is partially dependent on
the volume of the other company’s sales. Therefore, if the other
company’s offering is not successful, the compensation we
receive may be lower than expected or the agreement may be
terminated. Moreover, we may not be able to enter into
additional commercial relationships and strategic alliances on
favorable
terms. We also may be subject to claims from businesses to
which we provide these services if we are unsuccessful in
implementing, maintaining, or developing these services.
As our agreements terminate, we may be unable to renew or
replace these agreements on comparable terms, or at all. We
may in the future enter into amendments on less favorable terms
or encounter parties that have difficulty meeting their
contractual obligations to us, which could adversely affect our
operating results.
Our present and future e-commerce services agreements, other
commercial agreements, and strategic alliances create
additional risks such as:
• disruption of our ongoing business, including loss of
management focus on existing businesses;
• impairment of other relationships;
• variability in revenue and income from entering into,
amending, or terminating such agreements or relationships; and
68. • difficulty integrating under the commercial agreements.
Our Business Could Suffer if We Are Unsuccessful in Making,
Integrating, and Maintaining Acquisitions and Investments
We have acquired and invested in a number of companies, and
we may acquire or invest in or enter into joint ventures with
additional companies. These transactions create risks such as:
• disruption of our ongoing business, including loss of
management focus on existing businesses;
• problems retaining key personnel;
• additional operating losses and expenses of the businesses we
acquired or in which we invested;
• the potential impairment of tangible and intangible assets and
goodwill, including as a result of acquisitions;
10
• the potential impairment of customer and other relationships
of the company we acquired or in which we invested or
our own customers as a result of any integration of operations;
• the difficulty of incorporating acquired technology and rights
into our offerings and unanticipated expenses related to
such integration;
• the difficulty of integrating a new company’s accounting,
financial reporting, management, information and
information security, human resource, and other administrative
69. systems to permit effective management, and the lack
of control if such integration is delayed or not implemented;
• for investments in which an investee’s financial performance
is incorporated into our financial results, either in full or
in part, the dependence on the investee’s accounting, financial
reporting, and similar systems, controls, and processes;
• the difficulty of implementing at companies we acquire the
controls, procedures, and policies appropriate for a larger
public company;
• potential unknown liabilities associated with a company we
acquire or in which we invest; and
• for foreign transactions, additional risks related to the
integration of operations across different cultures and
languages,
and the economic, political, and regulatory risks associated with
specific countries.
As a result of future acquisitions or mergers, we might need to
issue additional equity securities, spend our cash, or incur
debt, contingent liabilities, or amortization expenses related to
intangible assets, any of which could reduce our profitability
and
harm our business. In addition, valuations supporting our
acquisitions and strategic investments could change rapidly
given the
current global economic climate. We could determine that such
valuations have experienced impairments or other-than-
temporary declines in fair value which could adversely impact
our financial results.
We Have Foreign Exchange Risk
70. The results of operations of, and certain of our intercompany
balances associated with, our international websites and
product and service offerings are exposed to foreign exchange
rate fluctuations. Upon translation, operating results may differ
materially from expectations, and we may record significant
gains or losses on the remeasurement of intercompany balances.
As
we have expanded our international operations, our exposure to
exchange rate fluctuations has increased. We also hold cash
equivalents and/or marketable securities in foreign currencies
including British Pounds, Chinese Yuan, Euros, and Japanese
Yen.
If the U.S. Dollar strengthens compared to these currencies,
cash equivalents, and marketable securities balances, when
translated, may be materially less than expected and vice versa.
The Loss of Key Senior Management Personnel Could
Negatively Affect Our Business
We depend on our senior management and other key personnel,
particularly Jeffrey P. Bezos, our President, CEO, and
Chairman. We do not have “key person” life insurance policies.
The loss of any of our executive officers or other key employees
could harm our business.
We Could Be Harmed by Data Loss or Other Security Breaches
As a result of our services being web-based and the fact that we
process, store, and transmit large amounts of data,
including personal information, for our customers, failure to
prevent or mitigate data loss or other security breaches,
including
breaches of our vendors’ technology and systems, could expose
us or our customers to a risk of loss or misuse of such
information, adversely affect our operating results, result in
litigation or potential liability for us, and otherwise harm our
71. business. We use third party technology and systems for a
variety of reasons, including, without limitation, encryption and
authentication technology, employee email, content delivery to
customers, back-office support, and other functions. Some
subsidiaries had past security breaches, and, although they did
not have a material adverse effect on our operating results, there
can be no assurance of a similar result in the future. Although
we have developed systems and processes that are designed to
protect customer information and prevent data loss and other
security breaches, including systems and processes designed to
reduce the impact of a security breach at a third party vendor,
such measures cannot provide absolute security.
We Face Risks Related to System Interruption and Lack of
Redundancy
We experience occasional system interruptions and delays that
make our websites and services unavailable or slow to
respond and prevent us from efficiently fulfilling orders or
providing services to third parties, which may reduce our net
sales
and the attractiveness of our products and services. If we are
unable to continually add software and hardware, effectively
upgrade our systems and network infrastructure, and take other
steps to improve the efficiency of our systems, it could cause
system interruptions or delays and adversely affect our
operating results.
11
Our computer and communications systems and operations
could be damaged or interrupted by fire, flood, power loss,
telecommunications failure, earthquakes, acts of war or
terrorism, acts of God, computer viruses, physical or electronic
72. break-
ins, and similar events or disruptions. Any of these events could
cause system interruption, delays, and loss of critical data, and
could prevent us from accepting and fulfilling customer orders
and providing services, which could make our product and
service offerings less attractive and subject us to liability. Our
systems are not fully redundant and our disaster recovery
planning
may not be sufficient. In addition, we may have inadequate
insurance coverage to compensate for any related losses. Any of
these events could damage our reputation and be expensive to
remedy.
We Face Significant Inventory Risk
In addition to risks described elsewhere in this Item 1A relating
to fulfillment center and inventory optimization by us and
third parties, we are exposed to significant inventory risks that
may adversely affect our operating results as a result of
seasonality, new product launches, rapid changes in product
cycles and pricing, defective merchandise, changes in consumer
demand and consumer spending patterns, changes in consumer
tastes with respect to our products, and other factors. We
endeavor to accurately predict these trends and avoid
overstocking or understocking products we manufacture and/or
sell.
Demand for products, however, can change significantly
between the time inventory or components are ordered and the
date of
sale. In addition, when we begin selling or manufacturing a new
product, it may be difficult to establish vendor relationships,
determine appropriate product or component selection, and
accurately forecast demand. The acquisition of certain types of
inventory or components may require significant lead-time and
prepayment and they may not be returnable. We carry a broad
selection and significant inventory levels of certain products,
73. such as consumer electronics, and we may be unable to sell
products in sufficient quantities or during the relevant selling
seasons. Any one of the inventory risk factors set forth above
may
adversely affect our operating results.
We May Not Be Able to Adequately Protect Our Intellectual
Property Rights or May Be Accused of Infringing Intellectual
Property Rights of Third Parties
We regard our trademarks, service marks, copyrights, patents,
trade dress, trade secrets, proprietary technology, and similar
intellectual property as critical to our success, and we rely on
trademark, copyright, and patent law, trade secret protection,
and
confidentiality and/or license agreements with our employees,
customers, and others to protect our proprietary rights.
Effective
intellectual property protection may not be available in every
country in which our products and services are made available.
We
also may not be able to acquire or maintain appropriate domain
names in all countries in which we do business. Furthermore,
regulations governing domain names may not protect our
trademarks and similar proprietary rights. We may be unable to
prevent
third parties from acquiring domain names that are similar to,
infringe upon, or diminish the value of our trademarks and other
proprietary rights.
We may not be able to discover or determine the extent of any
unauthorized use of our proprietary rights. Third parties that
license our proprietary rights also may take actions that
diminish the value of our proprietary rights or reputation. The
protection
of our intellectual property may require the expenditure of