Question

Java:Netbeans-Use the LinkedList class to simulate a queue, and use the add method to simulate the enqueue, and the remove method to simulate the dequeue method for a Queue. Remember to use FIFO.

Need help with 0. Add New Microchips pushMicroChip(), popMicroChip() and . To simulate this, you will create a menu option 0, which will generate 100 microchip long objects, and place them into a stack of microchips. Those microchip objects will be generated by using the System.nanotime() method.  

Create 3 queues, one called Animal Shelter, another called Cats, and another called Dogs. Use the following menu-driven application:

0. Add New Microchips
1. Donate a Cat
2. Donate a Dog
3. Adopt a Cat
4. Adopt a Dog
5. Adopt Oldest Pet
6. Exit

Create a Pet class that will be instantiated with the values in the following attributes: String name, int dateOfBirth //yyyymmdd format, String species, Long microchipNumber.

Note: The Dog queue and Cat queue are "regular" queues, and the Animal Shelter queue is a Priority Queue, where the priority is based upon the dateOfBirth of the pet. The older the pet, the higher its priority. See the attached .zip file for examples of a PriorityQueue.

Each week, on Monday before the Animal Shelter opens, an administrator of the Animal Shelter adds more microchips to the stack of microchips, so that there will be enough microchips to put in any animal that is donated into the shelter that week. To simulate this, you will create a menu option 0, which will generate 100 microchip long objects, and place them into a stack of microchips. Those microchip objects will be generated by using the System.nanotime() method.  

Each time a person donates a cat or dog, ask for the name of the pet, the species, and the date of birth, and pop the microchip stack to get a chip to put in the pet. Create a new Pet object. Then, add the Pet object to both its specific species queue, and the general Animal Shelter queue. If the stack of microchips is empty, give an error message to the user, stating the pet cannot be donated because there are no microchips left. Ask the user to press option 0 to get more microchips.  

When a person selects to adopt a specific species pet, remove the first pet object from the appropriate species queue, and also from the Animal Shelter queue. Take care to find the pet in the Animal queue, and remove it, but put back all the others that follow it, in the same order you found them (hint: You may need to create a new queue, removing the dog or cat that needs to be dequeued, and keeping all the rest. Once the new queue is created, point the old queue to the new queue.)

When a person comes in to adopt the oldest pet in the shelter, then process the Animal Shelter as a PriorityQueue, where the pet's date of birth is the attribute used to retrieve the oldest pet (hint: Pet class should implement Comparable, and should define a compareTo method that would sort in ascending date-of-birth order. ) So, when you dequeue the Animal Shelter as a Priority Queue, you will automatically get the Pet with the earliest/oldest date of birth first . Then, after removing the oldest pet object from the animal shelter, then dequeue it from the appropriate species queue (will have to do a sequential search in the the appropriate queue, according to the Pet object's species attribute. See hint above for keeping the exact order in the queue).

Create 4 global variables that represent the 3 queues for dogs, cats, and animal shelter (Priority Queue based on date-of-birth of pet), and the stack for the microchips. Create methods that can be called multiple times to accomplish all of the menu options. The names of the methods should be:

enqueueCat(), enqueueDog(), dequeueCat(), dequeueDog(), enqueueAnimal(), dequeueAnimal(), pushMicroChip(), popMicroChip()

package pet;

import java.util.LinkedList;

import java.util.Scanner;

class Pet {

String name, species;

int dob;

public Pet(String name, String species, int dob) {

super();

this.name = name;

this.species = species;

this.dob = dob;

}

public Pet() {

super();

}

@Override

public String toString() {

return "Pet [name=" + name + ", species=" + species + ", dob=" + dob + "]";

}

}

public class AnimalHouse {

public LinkedList cat;
public LinkedList dog;
public LinkedList animal;

//for input output purpose
Scanner sc = new Scanner(System.in);
Scanner scName = new Scanner(System.in);

public AnimalHouse() {

cat = new LinkedList<>();

dog = new LinkedList<>();

animal = new LinkedList<>();

}

public void enqueueCats() {

Pet pet = new Pet();

System.out.println("Enter name of pet : ");

pet.name = scName.nextLine();

System.out.println("Enter DOB (yyyymmdd) : ");

pet.dob = sc.nextInt();

pet.species = "Cat";

cat.addLast(pet);

animal.addLast(pet);

}

public Pet dequeueCats() {

Pet pet = cat.removeFirst();

animal.remove(pet);

System.out.println("Adopted " + pet);

return pet;

}

public void enqueueDogs() {

Pet pet = new Pet();

System.out.println("Enter name of pet : ");

pet.name = scName.nextLine();

System.out.println("Enter DOB (yyyymmdd) : ");

pet.dob = sc.nextInt();

pet.species = "Dog";

dog.addLast(pet);

animal.addLast(pet);

}

public Pet dequeueDogs() {

Pet pet = dog.removeFirst();

animal.remove(pet);

System.out.println("Adopted " + pet);

return pet;

}

public void enqueueAnimals(Pet animalIn) {

animal.addLast(animalIn);

}

public Pet dequeueAnimals() {

//store the oldest pet object
Pet oldestPet = new Pet();

//assume oldest age is
int oldest = 99999999;

//loop through all animal
for (Pet checkThisPet : animal) {

//compare and get old age
if (checkThisPet.dob < oldest) {

oldest = checkThisPet.dob;

oldestPet = checkThisPet;

}

}

//print old age pet
System.out.println("Oldest pet is " + oldestPet);

//based on species remove it from the queue
if (oldestPet.species.equalsIgnoreCase("cat")) {

animal.remove(oldestPet);

cat.remove(oldestPet);

} else {

animal.remove(oldestPet);

dog.remove(oldestPet);

}

return null;

}

public static void main(String[] args) {

AnimalHouse animals = new AnimalHouse();

int choice;

boolean continueMe = true;

while (continueMe) {

System.out.println("1. Donate a Cat");

System.out.println("2. Donate a Dog");

System.out.println("3. Adopt a Cat");

System.out.println("4. Adopt a Dog");

System.out.println("5. Adopt Oldest Pet");

System.out.println("6. Exit");

choice = animals.sc.nextInt();

switch (choice) {

case 1:
animals.enqueueCats();
break;

case 2:
animals.enqueueDogs();
break;

case 3:
animals.dequeueCats();
break;

case 4:
animals.dequeueDogs();
break;

case 5:
animals.dequeueAnimals();
break;

default:
continueMe = false;
break;

}

System.out.println("Cats are : " + animals.cat);

System.out.println("Dogs are : " + animals.dog);

System.out.println("Animals are : " + animals.animal);

}

}

}

Answer 1

enqueueCat(), enqueueDog(), dequeueCat(), dequeueDog(),

enqueueAnimal(), dequeueAnimal(), pushMicroChip(),

popMicroChip() ;

package pet;

import java.util.LinkedList;

import java.util.Scanner;

class Pet {

String name, species;

int dob;

public Pet(String name, String species, int dob) {

super();

this.name = name;

this.species = species;

this.dob = dob;

}

public Pet() {

super();

}

@Override

public String toString() {

return "Pet [name=" + name + ", species=" + species + ", dob=" + dob + "]";

}

}

public class AnimalHouse {

public LinkedList cat;
public LinkedList dog;
public LinkedList animal;

//for input output purpose
Scanner sc = new Scanner(System.in);
Scanner scName = new Scanner(System.in);

public AnimalHouse() {

cat = new LinkedList<>();

dog = new LinkedList<>();

animal = new LinkedList<>();

}

public void enqueueCats() {

Pet pet = new Pet();

System.out.println("Enter name of pet : ");

pet.name = scName.nextLine();

System.out.println("Enter DOB (yyyymmdd) : ");

pet.dob = sc.nextInt();

pet.species = "Cat";

cat.addLast(pet);

animal.addLast(pet);

}

public Pet dequeueCats() {

Pet pet = cat.removeFirst();

animal.remove(pet);

System.out.println("Adopted " + pet);

return pet;

}

public void enqueueDogs() {

Pet pet = new Pet();

System.out.println("Enter name of pet : ");

pet.name = scName.nextLine();

System.out.println("Enter DOB (yyyymmdd) : ");

pet.dob = sc.nextInt();

pet.species = "Dog";

dog.addLast(pet);

animal.addLast(pet);

}

public Pet dequeueDogs() {

Pet pet = dog.removeFirst();

animal.remove(pet);

System.out.println("Adopted " + pet);

return pet;

}

public void enqueueAnimals(Pet animalIn) {

animal.addLast(animalIn);

}

public Pet dequeueAnimals() {

//store the oldest pet object
Pet oldestPet = new Pet();

//assume oldest age is
int oldest = 99999999;

//loop through all animal
for (Pet checkThisPet : animal) {

//compare and get old age
if (checkThisPet.dob < oldest) {

oldest = checkThisPet.dob;

oldestPet = checkThisPet;

}

}

//print old age pet
System.out.println("Oldest pet is " + oldestPet);

//based on species remove it from the queue
if (oldestPet.species.equalsIgnoreCase("cat")) {

animal.remove(oldestPet);

cat.remove(oldestPet);

} else {

animal.remove(oldestPet);

dog.remove(oldestPet);

}

return null;

}

public static void main(String[] args) {

AnimalHouse animals = new AnimalHouse();

int choice;

boolean continueMe = true;

while (continueMe) {

System.out.println("1. Donate a Cat");

System.out.println("2. Donate a Dog");

System.out.println("3. Adopt a Cat");

System.out.println("4. Adopt a Dog");

System.out.println("5. Adopt Oldest Pet");

System.out.println("6. Exit");

choice = animals.sc.nextInt();

switch (choice) {

case 1:
animals.enqueueCats();
break;

case 2:
animals.enqueueDogs();
break;

case 3:
animals.dequeueCats();
break;

case 4:
animals.dequeueDogs();
break;

case 5:
animals.dequeueAnimals();
break;

default:
continueMe = false;
break;

}

System.out.println("Cats are : " + animals.cat);

System.out.println("Dogs are : " + animals.dog);

System.out.println("Animals are : " + animals.animal);

}

}

}