Question

split() A static method that takes as input parameter a ThingArrayQueue called inputQ, that includes things with positive number attributes. The method returns an array of two ThingArrayQueues as output where the first queue includes all things with even values from input and the second queue includes all things with odd values from inputQ. Zero is considered an even number. The input queue should be empty after calling this method. *Queue has a mixture of things with even and odd numbers, including 0. *Queue has only things with even numbers. *Queue has only things with odd numbers. Queue is empty.
write in java

Answer 1

CODE:-

import java.util.LinkedList;

import java.util.Queue;

public class HomeworkLib {

    public static void main(String[] args) {

        Queue<Integer> inputQ = new LinkedList<>(); // HERE I AM CREATING A QUEUE IN JAVA

        inputQ.add(2); // ADDING FEW INTEGERS IN THE QUEUE

        inputQ.add(0);

        inputQ.add(5);

        inputQ.add(4);

        inputQ.add(7);

        inputQ.add(9);

        inputQ.add(8);

        inputQ.add(1);

        Queue<Integer>[] result = split(inputQ); // CALLING SPLIT METHOD AND SAVING IT'S RESULT IN RESULT

        System.out.println("EVEN QUEUE!");

        while (result[0].peek() != null) { // PRINTING THE RESULTS OF THE FIRST INDEX QUEUE

            System.out.println(result[0].poll());

        }

        System.out.println("ODD QUEUE!"); // PRINTING THE SECOND INDEX QUEUE

        while (result[1].peek() != null) {

            System.out.println(result[1].poll());

        }

    }

    public static Queue<Integer>[] split(Queue<Integer> inputQ) { // THIS IS QUEUE THAT RETURNS QUEUE ARRAY

        Queue<Integer> even = new LinkedList<>(); // CREATING 2 QUEUES

        Queue<Integer> odd = new LinkedList<>();

        while (inputQ.peek() != null) { // NOW ITERATING THE INPUTQ AND CHECKIN IF THAT NUMBER IS EVEN OR ODD

            int temp = inputQ.poll(); // AND RESPECTIVELY ADD INTO THE QUEUES.

            if (temp % 2 == 0 || temp == 0) {

                even.add(temp);

            } else {

                odd.add(temp);

            }

        }

        Queue<Integer>[] arr = new LinkedList[2]; // CREATING A ARRAY OF 2 QUEUES

        arr[0] = even; // ADDING EVEN AND ODD QUEUES INTO THE ARRAY

        arr[1] = odd;

        return arr; // RETURNING ARRAY

    }

}

HomeworkLib.java > & HomeworkLib > split(Queue<Integer>), 1 import java.util.Linkedlist; 2 import java.util.Queue; public class HomeworkLib { Run Debug public static void main(String[] args) { Queue<Integer> inputQ = new LinkedList<>(); // HERE I AM CREATING A QUEUE IN JAVA inputQ.add(2); // ADDING FEW INTEGERS IN THE QUEUE inputQ.add(); inputQ.add(5); inputQ.add(4); inputQ.add(7); inputQ.add(9); inputQ.add(8); inputQ.add(1); Queue<Integer>[1 result = split(input); // CALLING SPLIT METHOD AND SAVING IT'S RESULT IN RESULT System.out.println("EVEN QUEUE!"); while (result[@].peek() != null) { // PRINTING THE RESULTS OF THE FIRST INDEX QUEUE System.out.println(result[@].poll()); System.out.println("ODD QUEUE!"); // PRINTING THE SECOND INDEX QUEUE while (result[1].peek() != null) { System.out.println(result[1].poll());

public static Queue<Integer>[] split(Queue<Integer> input) { // THIS IS QUEUE THAT RETURNS QUEUE ARRAY Queue<Integer> even = new LinkedList<>(); // CREATING 2 QUEUES Queue<Integer> odd = new LinkedList<>(); while (input.peek() != null) { // NOW ITERATING THE INPUTQ AND CHECKIN IF THAT NUMBER IS EVEN OR ODD, int temp = input.poll(); // AND RESPECTIVELY ADD INTO THE QUEUES. if (temp % 2 == 0 || temp == 0) {j even.add(temp); } else { odd.add(temp); 2 Queue<Integer>[] arr = new LinkedList[2]; // CREATING A ARRAY OF 2 QUEUES arr[0] = even; // ADDING EVEN AND ODD QUEUES INTO THE ARRAY arr[1] = odd; return arr; //_RETURNING ARRAY -2 3 } }

OUTPUT:-

PS E:\java> java HomeworkLib.java Note: HomeworkLib.java uses unchecked or unsafe operations. Note: Recompile with -xlint: unchecked for details. EVEN QUEUE! A ODD QUEUE! PS E:\java> |

FOR ANY OTHER QUERY PLEASE COMMENT.