Macguffin games have been very popular lately. People from far and wide have been drawn to the games

INSTRUCTIONS TO CANDIDATES

ANSWER ALL QUESTIONS

Pool Queue:

The Macguffin games have been very popular lately. People from far and wide have been drawn to the games; some to play with friends, and some to simply play. As you, of course, know, the Macguffin games can be played individually, as a pair, as a trio, or even as a group of four.

Unfortunately, as you also know, the waiting lines can often get quite large for the games. What's more, considering the sheer number of players, and the variety of group sizes, it can be problematic to fairly accommodate people in an appropriate order.

 

Thus, the concept of a “Pool Queue” was created, to accommodate lines of people specifically for the Macguffin Games. A Pool Queue is pretty simple:

• Players are added in groups of one, two, three, or four.

◦ The sequence of players within a group is not important.

• Players who are added in a group may not be split from that group.

• A Macguffin Game may be comprised of one or more groups of players.

◦ If multiple groups are used, then they are merged into a single group.

• Older groups within the structure must always take precedence over newer groups.

◦ For example, if the first group entered can be included in the requested group size, then it must be included. Similarly, the second group has priority over the successive groups.

 

See the last page for an example.

 

Programming Task:

You have been provided with an interface for a PoolQueue. It defines the minimum operations for the list. Your primary task is to create a class, ConcretePoolQueue, that implements the interface. Note that it should throw an InsufficientElementsException if a remove is attempted that can't be satisfied.

You are free to implement the class in whatever fashion you desire (within reason). For example, though a linked implementation is recommended (because it's much easier), a contiguous implementation is also allowed. Outside of completely bizarre design choices1, you aren't required to concern yourself with things like optimal efficiency, or adhering to any specific design style. However, refer to the interface for other requirements.

You've also been provided with a sample test program, but feel free to make your own as well (you may, for example, wish to more rigorously test your implementation).

 

Writeup:

In addition to the sample output and printed code (see below), you must also include a typed writeup. In it, discuss the Big-O complexities of your implementations for addTriple, removeTriple, and hasTriple, and considerations for complexities of the generalized add/remove.

Include brief explanations for each.

 

Submission:

Create .pdf output of sample executions of your program. Zip those, along with a .pdf of your writeup, and all of your .java source code, and submit through Sakai. Include the provided .java files unedited.

 

Lastly: remember that we have tutorial time precisely for things like this.

 

 

1For example, if you implement something resembling a roulette wheel, or a simulation of a trebuchet, or random dice...

 

The basic premise is simple. Assuming groups enter from the right and exit to the left: D

BEG ACFH

 

Suppose you wanted a group of 4. There are two possible patterns: ADEF, and BCGH.

In this case, only ADEF is considered valid, because A has the highest priority (and thus must be included if possible). Even though BC does have a higher priority than DEF, that doesn't matter; A trumps. Similarly, if a triple had been requested instead, even though there would be three potential combinations (ABC, DEF, and AGH), only ABC is valid. (Note: as mentioned above, you can consider the result of ABC to be equivalent to ACB, BAC, BCA, CAB, and CBA)

 

---Sample Execution---

1. Add One 2. Add Two 3. Add Three 4. Add Four

5. Remove One 6. Remove Two 7. Remove Three 8. Remove Four

 

1 9. Test Options 0. Quit

Enter Name: Abby

:-

Added [Abby]

1. Add One 2. Add Two 3. Add Three 4. Add Four

5. Remove One 6. Remove Two 7. Remove Three 8. Remove Four

 

2 9. Test Options 0. Quit

First: Bobby Second: Claire

:-

 

Added [Bobby,Claire]

 

1. Add One

2. Add Two

3.

Add Three

4.

Add Four

5. Remove One 6. Remove Two 7. Remove Three 8. Remove Four

 

3 9. Test Options 0. Quit

First: Darren Second: Edgar

Third: Felix

:- Added [Darren,Edgar,Felix]

 

1. Add One 2. Add Two 3. Add Three 4. Add Four

5. Remove One 6. Remove Two 7. Remove Three 8. Remove Four

9. Test Options 0. Quit

2

First: Gilligan Second: Harry

:- Added [Gilligan,Harry]

 

1. Add One 2. Add Two 3. Add Three 4. Add Four

5. Remove One

 

4 6. Remove Two

9. Test Options 7. Remove Three

0. Quit 8. Remove Four

First: Ilona Second: Jill Third: Kevin Fourth: Larry

:-

 

 

Added [Ilona,Jill,Kevin,Larry]

 

1. Add One

2. Add Two

3. Add Three

4.

Add Four

5. Remove One

 

9 6. Remove Two

9. Test Options 7. Remove Three

0. Quit 8. Remove Four

One: Two:

Three: true true

true

 

Attachments:

Expert's Answer

382 Times Downloaded

Related Questions

. Introgramming & Unix Fall 2018, CRN 44882, Oakland University Homework Assignment 6 - Using Arrays and Functions in C

DescriptionIn this final assignment, the students will demonstrate their ability to apply two ma

. The standard path finding involves finding the (shortest) path from an origin to a destination, typically on a map. This is an

Path finding involves finding a path from A to B. Typically we want the path to have certain properties,such as being the shortest or to avoid going t

. Develop a program to emulate a purchase transaction at a retail store. This program will have two classes, a LineItem class and a Transaction class. The LineItem class will represent an individual

Develop a program to emulate a purchase transaction at a retail store. Thisprogram will have two classes, a LineItem class and a Transaction class. Th

. SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of Sea Ports. Here are the classes and their instance variables we wish to define:

1 Project 1 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of

. Project 2 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of Sea Ports. Here are the classes and their instance variables we wish to define:

1 Project 2 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of