Questions
Part 2 BeerBatch Class /** * A class to model an item (or set of items)...

Part 2

BeerBatch Class

/**
* A class to model an item (or set of items) in an
* auction: a batch.
*/
public class BeerBatch
{
    // A unique identifying number.
    private final int number;
    // A description of the batch.
    private String description;
    // The current highest offer for this batch.
    private Offer highestOffer;

    /**
     * Construct a BeerBatch, setting its number and description.
     * @param number The batch number.
     * @param description A description of this batch.
     */
    public BeerBatch(int number, String description)
    {
        this.number = number;
        this.description = description;
        this.highestOffer = null;
    }

    /**
     * Attempt an offer for this batch. A successful offer
     * must have a value higher than any existing offer.
     * @param offer A new offer.
     * @return true if successful, false otherwise
     */
    public boolean bidFor(Offer offer)
    {
        if(highestOffer == null) {
            // There is no previous bid.
            highestOffer = offer;
            return true;
        }
        else if(offer.getAmount() > highestOffer.getAmount()) {
            // The bid is better than the previous one.
            highestOffer = offer;
            return true;
        }
        else {
            // The bid is not better.
            return false;
        }
    }
  
    /**
     * @return A string representation of this batch's details.
     */
    public String batchDetail()
    {
        return "TO DO";
    }

    /**
     * @return The batch's number.
     */
    public int getNumber()
    {
        return number;
    }

    /**
     * @return The batch's description.
     */
    public String getDescription()
    {
        return description;
    }

    /**
     * @return The highest offer for this lot.
     *         This could be null if there is
     *         no current bid.
     */
    public Offer getHighestOffer()
    {
        return highestOffer;
    }
}
Offer Class

/**
* A class that models an offer.
* It contains a reference to the Person bidding and the amount of the offer.
*/
public class Offer
{
    // The person making the bid.
    private final Bidder bidder;
    // The amount of the offer.
    private final int amount;

    /**
     * Create an offer.
     * @param bidder Who is bidding for the batch.
     * @param x The amount of the offer.
     */
    public Offer(int x, Bidder b)
    {
        this.bidder = b;
        this.amount = x;
    }

    /**
     * @return The bidder.
     */
    public Bidder getBidder()
    {
        return bidder;
    }

    /**
     * @return The amount of the offer.
     */
    public int getAmount()
    {
        return amount;
    }
}

In: Computer Science

Create the following class to represent the sprite objects in the game. Sprite Name: String x:...

Create the following class to represent the sprite objects in the game.

Sprite

  • Name: String
  • x: x location
  • y: y location

      +   Sprite (String);

      +   Sprite (String, int, int);     

      +   setName (String): void

      +   setX(int): void

      +   setY(int): void

      +   getName (): String

      +   getX (): int

      +   getY (): int

      +   collide (Sprite): boolean

      +   toString (): String

Create ten (10) game objects as Sprite type and stored in an array. All the games objects location (x & y) must be set in range 1 to 800 randomly.

The collide method is a method to test the collision between the current sprite with another sprite (from parameter). This method will check the distance in between two sprites based on the current x and y location using Pythagoras theorem. If the distance of 2 objects is less than 10, then the method will return true. Otherwise false will be returned.

Create a driver class called TestSprite which will:

  • Display all the game sprite objects with a loop
  • Use the games objects from the array, test all the instance methods.

In: Computer Science

Bubba's Custom Shrimp Catering uses activity-based costing to determine the cost of its catering events. The...

Bubba's Custom Shrimp Catering uses activity-based costing to determine the cost of its catering events. The firm has two activity cost pools: cooking (activity rate is $500 per catering event) and serving (activity rate is $12 per plate). The firm currently has 25 catering events a year, with an average of 50 plates per event. It also incurs about $400 in direct costs for each event. The firm has four opportunities to improve its processes (listed below in the answer choices). None of these process improvements is expected to affect revenue. Each process improvement costs $2,500. Which of the following is the MOST profitable process improvement (read the answer choices carefully)? Selected Answer: c. Reduce direct costs per event by 25% Answers: a. Reduce the number of plates per event by 20%. b. Reduce serving activity rate by 25% c. Reduce direct costs per event by 25% d. Reduce cooking activity rate by 25%

In: Accounting

A circus act involves launching a human being from a cannon resting on the floor. The...

A circus act involves launching a human being from a cannon resting on the floor. The human has a 50 kg mass and is launched at a speed of 12 m/s, in a direction 30° up from the horizontal. The cannon has a mass of 110 kg. (a) Considering the system as cannon + human, state why the x-component of the momentum is conserved. (b) Find the recoil speed of the cannon. (c) It would be dangerous to use explosives, so the performer is actually launched from a loaded spring inside the barrel, compressed 1.7 m from its equilibrium position. Find the spring constant needed to achieve the launch + recoil. (d) You will note that the y-component of the net momentum is NOT conserved, since the performer flies up in the air. Why is the x-component conserved but the y-component not?

In: Physics

what are Logitech challenges

what are Logitech challenges

In: Operations Management

why Samsung Galaxy Note 7 fail and What the brand could done differntly to avoid this...

why Samsung Galaxy Note 7 fail and
What the brand could done differntly to avoid this failure?
what product that are in the market place now that have been successful they are very similer to Samsung Galaxy Note 7 ?

In: Operations Management

How many atomic p orbitals overlap to form the de localized system of pi molecular orbitals...

How many atomic p orbitals overlap to form the de localized system of pi molecular orbitals for each structure of Thymine, Pyrimidine, and cytosine?


In: Chemistry

Strategic Management Edition 4. - Frank T. Rothaermel IKEA - Chapter 10 Is there any special...

Strategic Management Edition 4. - Frank T. Rothaermel

IKEA - Chapter 10

Is there any special consideration a firm should have for its “home country”? Is it ethical to keep profits outside the home country in offshore accounts to avoid paying domestic corporate taxes?

In: Operations Management

Java Write a valid Java method called printReverse that takes a String as a parameter and...

Java

Write a valid Java method called printReverse that takes a String as a parameter and prints out the reverse of the String. Your method should not return anything. Make sure you use the appropriate return type.

In: Computer Science

How do you plan to design your own workshop​? Ellaborate with examples. (500 words)

How do you plan to design your own workshop​? Ellaborate with examples. (500 words)

In: Psychology

Economic 315: Money, Banking and Financial Market 1. Is there any relationship between increase in corporate...

Economic 315: Money, Banking and Financial Market

1. Is there any relationship between increase in corporate debt and corporate investing? Explain.

2. What is the alternative to investing that money in their corporations?

3. What is the purpose of stock buybacks?

4. Do you think stock buybacks are the good for the economy? Why or why not?

In: Economics

Please find error and fill the blank and send as I can copy and paste like...

Please find error and fill the blank and send as I can copy and paste like file or just codes if you can ?
1)
#include <stdio.h>
#include <stdlib.h>

#define Error( Str ) FatalError( Str )
#define FatalError( Str ) fprintf( stderr, "%s ", Str ), exit( 1 )
2) #include "list.h"
#include <stdlib.h>
#include "fatal.h"

/* Place in the interface file */

int Equal(ElementType x, ElementType y)
{
return x==y;
}
void Print(ElementType x)
{
printf("%2d", x);
}

List
CreateList( void )
{
List L;

L = ________________________________;
if( L == NULL )
Error( "Out of memory!" );
L->Next = NULL;
return L;
}

void
MakeEmpty( List L )
{
Position P, Tmp;

/* 1*/ P = L->Next; /* Header assumed */
/* 2*/ L->Next = NULL;
/* 3*/ while( P != NULL )
{
/* 4*/ Tmp = P->Next;
/* 5*/ free( P );
/* 6*/ P = Tmp;
}
}


/* START: fig3_8.txt */
/* Return true if L is empty */

int
IsEmpty( List L )
{
return L->Next == NULL;
}
/* END */

/* START: fig3_9.txt */
/* Return true if P is the last position in list L */
/* Parameter L is unused in this implementation */

int IsLast( Position P, List L )
{
return P->Next == NULL;
}
/* END */

/* START: fig3_10.txt */
/* Return Position of X in L; NULL if not found */

Position
Find( ElementType X, List L )
{
Position P;

/* 1*/ P = L->Next;
/* 2*/ while( P != NULL && !Equal(P->Element, X))
/* 3*/ P = P->Next;

/* 4*/ return _______;
}
/* END */

/* START: fig3_11.txt */
/* Delete (after legal position P) */
/* Assume use of a header node */
void
Delete(List L, Position P )
{
Position TmpCell;

TmpCell = P->Next;
P->Next = TmpCell->Next; /* Bypass deleted cell */
free( TmpCell );
}

/* END */

/* START: fig3_12.txt */
/* If X is not found, then Next field of returned value is NULL */
/* Assumes a header */

Position
FindPrevious( ElementType X, List L )
{
Position P;

/* 1*/ P = L;
/* 2*/ while( P->Next != NULL && !Equal(P->Next->Element, X) )
/* 3*/ P = P->Next;

/* 4*/ return P;
}
/* END */

/* START: fig3_13.txt */
/* Insert (after legal position P) */
/* Header implementation assumed */
/* Parameter L is unused in this implementation */

void
Insert( ElementType X, List L, Position P )
{
Position TmpCell;

/* 1*/ TmpCell = (Position)malloc( sizeof( struct Node ) );
/* 2*/ if( TmpCell == NULL )
/* 3*/ Error( "Out of space!!!" );

/* 4*/ TmpCell->Element = X;
/* 5*/ ____________________;
/* 6*/ P->Next = TmpCell;
}
/* END */

/* START: fig3_15.txt */
/* Correct DeleteList algorithm */

void
DeleteList( List L )
{
PtrToNode P, Tmp;

P = L;
while( P != NULL )
{
Tmp = P->Next;
free( P );
____________;
}
}
/* END */

Position
Header( List L )
{
return ________;
}

Position
First( List L )
{
return _________;
}

Position
Advance( Position P )
{
return ___________;
}

ElementType
Retrieve( Position P )
{
return ____________;
}

void Modify( ElementType X, Position P )
{
P->Element = X;
}

void PrintList(List L)
{
Position pL;
ElementType e;

pL = First(L);
while (pL) {
e = Retrieve(pL);
Print(e);
pL = Advance(pL);
}
printf(" ");
}

3)

#ifndef _List_H
#define _List_H



typedef int ElementType;
struct Node {
ElementType Element;
struct Node *Next;
};
typedef struct Node
*PtrToNode, *List, *Position;


void MakeEmpty( List L );
List CreateList( void );
int IsEmpty( List L );
int IsLast( Position P, List L );
Position Find( ElementType X, List L );
void Delete( List L, Position P );
Position FindPrevious( ElementType X, List L );
void Insert( ElementType X, List L, Position P );
void DeleteList( List L );
Position Header( List L );
Position First( List L );
Position Advance( Position P );
ElementType Retrieve( Position P );
void Modify( ElementType X, Position P );
void PrintList(List L);

#endif /* _List_H */
/* END */

4)

#include "stdio.h"
#include "list.h"
#include "fatal.h"


List Union(List A, List B) {
List C;
Position pA, pB, pC;
ElementType e;

C = CreateList();
pC = Header(C);

pA = First(A);
while (pA) {
e = Retrieve(pA);
Insert(e, C, pC);
pA = Advance(pA);
}

pB = First(B);
while (pB) {
e = Retrieve(pB);
if (!Find(e, A))
Insert(e, C, pC);
pB = Advance(pB);
}
return C;
}


int main() {
List A, B, C;
int j;


A = CreateList(); B = CreateList();

printf("Please input set A(finished with -1): ");
scanf("%d", &j);
while (j != -1){
Insert(j, A, Header(A));
scanf("%d", &j);
}
printf("A:"); PrintList(A);

printf("Please input set B(finished with -1): ");
scanf("%d", &j);
while (j != -1){
Insert(j, B, Header(B));
scanf("%d", &j);
}
printf("B:"); PrintList(B);

C = Union(A, B);
printf("C:"); PrintList(C);

DeleteList(A); DeleteList(B); DeleteList(C);

return 1;
}

In: Computer Science

When discussing CFCs (chlorofluorocarbons), what are the properties of that chemical (such as water solubility, vapor...

When discussing CFCs (chlorofluorocarbons), what are the properties of that chemical (such as water solubility, vapor pressure, etc.) that determines its migration in our environment?

In: Chemistry

The Path to Good Ethics Starts in Human Resources. Do you agree or disagree with this...

The Path to Good Ethics Starts in Human Resources. Do you agree or disagree with this statement? Please explain in detail and provide examples.

In: Operations Management

Suppose that each day, Northern, Central, and Southern California each use 100 billion gallons of water....

  1. Suppose that each day, Northern, Central, and Southern California each use 100 billion gallons of water. Also assume that Northern California and Central California have available 120 billion gallons of water, whereas Southern California has 40 billion gallons of water available. The cost of shipping 1 billion gallons of water between the three regions is as follows. Also, you will not be able to meet all the demand for water, so assume that each billion gallons of unmet demand incurs the following shortage costs:

Northern

Central

Southern

Northern

$5,000.00

$7,000.00

$10,000.00

Central

$7,000.00

$5,000.00

$6,000.00

Southern

$10,000.00

$6,000.00

$5,000.00

Shortage

$6,000.00

$5,500.00

$9,000.00

How should California’s water be distributed to minimize the sum of shipping and shortage costs and what is the total cost?

In: Computer Science