Find output for the given Queue Program plan: Import necessary packages. Create a class “StackQu”, Define the method “mystery2()” that accepts “Queue”, Create the object for “Stack”. Calculate the size of “Queue”. Execute loop till queue size, Assign the integer removed from the “Queue”. Check whether the integer is even, If it is true, add that integer into the “Stack”. Otherwise, Add that integer into the “Queue”. Print the “Queue” element and then the “Stack” elements. Define the method “main()”, Create object for “LinkedList”. Call the “add()” method of queue to add the elements “1”, “2”, “3”, “4”, “5” and “6” into the “Queue” one by one. Call the method “mystery2()” with “Queue” as a parameter.

Question

Want to see the full answer?

Answer 1

Question

Chapter 14.3, Problem

a.

Program Plan Intro

Find output for the given Queue

Program plan:

Import necessary packages.

Create a class “StackQu”,

Define the method “mystery2()” that accepts “Queue”,

Create the object for “Stack”.

Calculate the size of “Queue”.

Execute loop till queue size,

Assign the integer removed from the “Queue”.

Check whether the integer is even,

If it is true, add that integer into the “Stack”.

Otherwise,

Add that integer into the “Queue”.

Print the “Queue” element and then the “Stack” elements.

Define the method “main()”,

Create object for “LinkedList”.

Call the “add()” method of queue to add the elements “1”, “2”, “3”, “4”, “5” and “6” into the “Queue” one by one.

Call the method “mystery2()” with “Queue” as a parameter.

b.

Program Plan Intro

Find output for the given Queue

Program plan:

Import necessary packages.

Create a class “StackQu”,

Define the method “mystery2()” that accepts “Queue”,

Create the object for “Stack”.

Calculate the size of “Queue”.

Execute loop till queue size,

Assign the integer removed from the “Queue”.

Check whether the integer is even,

If it is true, add that integer into the “Stack”.

Otherwise,

Add that integer into the “Queue”.

Print the “Queue” element and then the “Stack” elements.

Define the method “main()”,

Create object for “LinkedList”.

Call the “add()” method of queue to add the elements “42”, “-3”, “4”, “15”, “9” and “71” into the “Queue” one by one.

Call the method “mystery2()” with “Queue” as a parameter.

c.

Program Plan Intro

Find output for the given Queue

Program plan:

Import necessary packages.

Create a class “StackQu”,

Define the method “mystery2()” that accepts “Queue”,

Create the object for “Stack”.

Calculate the size of “Queue”.

Execute loop till queue size,

Assign the integer removed from the “Queue”.

Check whether the integer is even,

If it is true, add that integer into the “Stack”.

Otherwise,

Add that integer into the “Queue”.

Print the “Queue” element and then the “Stack” elements.

Define the method “main()”,

Create object for “LinkedList”.

Call the “add()” method of queue to add the elements “30”, “20”, “10”, “60”, “50”, “40”, “3” and “0” into the “Queue” one by one.

Call the method “mystery2()” with “Queue” as a parameter.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

I need to define and discuss the uses of one monitoring or troubleshooting tool in Windows Server 2019. thank you

I would likr toget help with the following concepts: - Windows Server features - Windows Server versus Windows 10 used as a client-server network

I need to define and discuss the uses of one monitoring or troubleshooting tool in Windows Server 2019. thank you

Answer 2

Question

Chapter 14.3, Problem

a.

Program Plan Intro

Find output for the given Queue

Program plan:

Import necessary packages.

Create a class “StackQu”,

Define the method “mystery2()” that accepts “Queue”,

Create the object for “Stack”.

Calculate the size of “Queue”.

Execute loop till queue size,

Assign the integer removed from the “Queue”.

Check whether the integer is even,

If it is true, add that integer into the “Stack”.

Otherwise,

Add that integer into the “Queue”.

Print the “Queue” element and then the “Stack” elements.

Define the method “main()”,

Create object for “LinkedList”.

Call the “add()” method of queue to add the elements “1”, “2”, “3”, “4”, “5” and “6” into the “Queue” one by one.

Call the method “mystery2()” with “Queue” as a parameter.

b.

Program Plan Intro

Find output for the given Queue

Program plan:

Import necessary packages.

Create a class “StackQu”,

Define the method “mystery2()” that accepts “Queue”,

Create the object for “Stack”.

Calculate the size of “Queue”.

Execute loop till queue size,

Assign the integer removed from the “Queue”.

Check whether the integer is even,

If it is true, add that integer into the “Stack”.

Otherwise,

Add that integer into the “Queue”.

Print the “Queue” element and then the “Stack” elements.

Define the method “main()”,

Create object for “LinkedList”.

Call the “add()” method of queue to add the elements “42”, “-3”, “4”, “15”, “9” and “71” into the “Queue” one by one.

Call the method “mystery2()” with “Queue” as a parameter.

c.

Program Plan Intro

Find output for the given Queue

Program plan:

Import necessary packages.

Create a class “StackQu”,

Define the method “mystery2()” that accepts “Queue”,

Create the object for “Stack”.

Calculate the size of “Queue”.

Execute loop till queue size,

Assign the integer removed from the “Queue”.

Check whether the integer is even,

If it is true, add that integer into the “Stack”.

Otherwise,

Add that integer into the “Queue”.

Print the “Queue” element and then the “Stack” elements.

Define the method “main()”,

Create object for “LinkedList”.

Call the “add()” method of queue to add the elements “30”, “20”, “10”, “60”, “50”, “40”, “3” and “0” into the “Queue” one by one.

Call the method “mystery2()” with “Queue” as a parameter.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Answer 3

Question

Chapter 14.3, Problem

a.

Program Plan Intro

Find output for the given Queue

Program plan:

Import necessary packages.

Create a class “StackQu”,

Define the method “mystery2()” that accepts “Queue”,

Create the object for “Stack”.

Calculate the size of “Queue”.

Execute loop till queue size,

Assign the integer removed from the “Queue”.

Check whether the integer is even,

If it is true, add that integer into the “Stack”.

Otherwise,

Add that integer into the “Queue”.

Print the “Queue” element and then the “Stack” elements.

Define the method “main()”,

Create object for “LinkedList”.

Call the “add()” method of queue to add the elements “1”, “2”, “3”, “4”, “5” and “6” into the “Queue” one by one.

Call the method “mystery2()” with “Queue” as a parameter.

b.

Program Plan Intro

Find output for the given Queue

Program plan:

Import necessary packages.

Create a class “StackQu”,

Define the method “mystery2()” that accepts “Queue”,

Create the object for “Stack”.

Calculate the size of “Queue”.

Execute loop till queue size,

Assign the integer removed from the “Queue”.

Check whether the integer is even,

If it is true, add that integer into the “Stack”.

Otherwise,

Add that integer into the “Queue”.

Print the “Queue” element and then the “Stack” elements.

Define the method “main()”,

Create object for “LinkedList”.

Call the “add()” method of queue to add the elements “42”, “-3”, “4”, “15”, “9” and “71” into the “Queue” one by one.

Call the method “mystery2()” with “Queue” as a parameter.

c.

Program Plan Intro

Find output for the given Queue

Program plan:

Import necessary packages.

Create a class “StackQu”,

Define the method “mystery2()” that accepts “Queue”,

Create the object for “Stack”.

Calculate the size of “Queue”.

Execute loop till queue size,

Assign the integer removed from the “Queue”.

Check whether the integer is even,

If it is true, add that integer into the “Stack”.

Otherwise,

Add that integer into the “Queue”.

Print the “Queue” element and then the “Stack” elements.

Define the method “main()”,

Create object for “LinkedList”.

Call the “add()” method of queue to add the elements “30”, “20”, “10”, “60”, “50”, “40”, “3” and “0” into the “Queue” one by one.

Call the method “mystery2()” with “Queue” as a parameter.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Answer 4

Question

Chapter 14.3, Problem

a.

Program Plan Intro

Find output for the given Queue

Program plan:

Import necessary packages.

Create a class “StackQu”,

Define the method “mystery2()” that accepts “Queue”,

Create the object for “Stack”.

Calculate the size of “Queue”.

Execute loop till queue size,

Assign the integer removed from the “Queue”.

Check whether the integer is even,

If it is true, add that integer into the “Stack”.

Otherwise,

Add that integer into the “Queue”.

Print the “Queue” element and then the “Stack” elements.

Define the method “main()”,

Create object for “LinkedList”.

Call the “add()” method of queue to add the elements “1”, “2”, “3”, “4”, “5” and “6” into the “Queue” one by one.

Call the method “mystery2()” with “Queue” as a parameter.

b.

Program Plan Intro

Find output for the given Queue

Program plan:

Import necessary packages.

Create a class “StackQu”,

Define the method “mystery2()” that accepts “Queue”,

Create the object for “Stack”.

Calculate the size of “Queue”.

Execute loop till queue size,

Assign the integer removed from the “Queue”.

Check whether the integer is even,

If it is true, add that integer into the “Stack”.

Otherwise,

Add that integer into the “Queue”.

Print the “Queue” element and then the “Stack” elements.

Define the method “main()”,

Create object for “LinkedList”.

Call the “add()” method of queue to add the elements “42”, “-3”, “4”, “15”, “9” and “71” into the “Queue” one by one.

Call the method “mystery2()” with “Queue” as a parameter.

c.

Program Plan Intro

Find output for the given Queue

Program plan:

Import necessary packages.

Create a class “StackQu”,

Define the method “mystery2()” that accepts “Queue”,

Create the object for “Stack”.

Calculate the size of “Queue”.

Execute loop till queue size,

Assign the integer removed from the “Queue”.

Check whether the integer is even,

If it is true, add that integer into the “Stack”.

Otherwise,

Add that integer into the “Queue”.

Print the “Queue” element and then the “Stack” elements.

Define the method “main()”,

Create object for “LinkedList”.

Call the “add()” method of queue to add the elements “30”, “20”, “10”, “60”, “50”, “40”, “3” and “0” into the “Queue” one by one.

Call the method “mystery2()” with “Queue” as a parameter.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Answer 5

Chapter 14.3, Problem

a.

Program Plan Intro

Find output for the given Queue

Program plan:

Import necessary packages.

Create a class “StackQu”,

Define the method “mystery2()” that accepts “Queue”,

Create the object for “Stack”.

Calculate the size of “Queue”.

Execute loop till queue size,

Assign the integer removed from the “Queue”.

Check whether the integer is even,

If it is true, add that integer into the “Stack”.

Otherwise,

Add that integer into the “Queue”.

Print the “Queue” element and then the “Stack” elements.

Define the method “main()”,

Create object for “LinkedList”.

Call the “add()” method of queue to add the elements “1”, “2”, “3”, “4”, “5” and “6” into the “Queue” one by one.

Call the method “mystery2()” with “Queue” as a parameter.

b.

Program Plan Intro

Find output for the given Queue

Program plan:

Import necessary packages.

Create a class “StackQu”,

Define the method “mystery2()” that accepts “Queue”,

Create the object for “Stack”.

Calculate the size of “Queue”.

Execute loop till queue size,

Assign the integer removed from the “Queue”.

Check whether the integer is even,

If it is true, add that integer into the “Stack”.

Otherwise,

Add that integer into the “Queue”.

Print the “Queue” element and then the “Stack” elements.

Define the method “main()”,

Create object for “LinkedList”.

Call the “add()” method of queue to add the elements “42”, “-3”, “4”, “15”, “9” and “71” into the “Queue” one by one.

Call the method “mystery2()” with “Queue” as a parameter.

c.

Program Plan Intro

Find output for the given Queue

Program plan:

Import necessary packages.

Create a class “StackQu”,

Define the method “mystery2()” that accepts “Queue”,

Create the object for “Stack”.

Calculate the size of “Queue”.

Execute loop till queue size,

Assign the integer removed from the “Queue”.

Check whether the integer is even,

If it is true, add that integer into the “Stack”.

Otherwise,

Add that integer into the “Queue”.

Print the “Queue” element and then the “Stack” elements.

Define the method “main()”,

Create object for “LinkedList”.

Call the “add()” method of queue to add the elements “30”, “20”, “10”, “60”, “50”, “40”, “3” and “0” into the “Queue” one by one.

Call the method “mystery2()” with “Queue” as a parameter.

Answer 6

Chapter 14.3, Problem

a.

Program Plan Intro

Find output for the given Queue

Program plan:

Import necessary packages.

Create a class “StackQu”,

Define the method “mystery2()” that accepts “Queue”,

Create the object for “Stack”.

Calculate the size of “Queue”.

Execute loop till queue size,

Assign the integer removed from the “Queue”.

Check whether the integer is even,

If it is true, add that integer into the “Stack”.

Otherwise,

Add that integer into the “Queue”.

Print the “Queue” element and then the “Stack” elements.

Define the method “main()”,

Create object for “LinkedList”.

Call the “add()” method of queue to add the elements “1”, “2”, “3”, “4”, “5” and “6” into the “Queue” one by one.

Call the method “mystery2()” with “Queue” as a parameter.

Answer 7

Chapter 14.3, Problem

a.

Program Plan Intro

Find output for the given Queue

Program plan:

Import necessary packages.

Create a class “StackQu”,

Define the method “mystery2()” that accepts “Queue”,

Create the object for “Stack”.

Calculate the size of “Queue”.

Execute loop till queue size,

Assign the integer removed from the “Queue”.

Check whether the integer is even,

If it is true, add that integer into the “Stack”.

Otherwise,

Add that integer into the “Queue”.

Print the “Queue” element and then the “Stack” elements.

Define the method “main()”,

Create object for “LinkedList”.

Call the “add()” method of queue to add the elements “1”, “2”, “3”, “4”, “5” and “6” into the “Queue” one by one.

Call the method “mystery2()” with “Queue” as a parameter.

Answer 8

b.

Program Plan Intro

Find output for the given Queue

Program plan:

Import necessary packages.

Create a class “StackQu”,

Define the method “mystery2()” that accepts “Queue”,

Create the object for “Stack”.

Calculate the size of “Queue”.

Execute loop till queue size,

Assign the integer removed from the “Queue”.

Check whether the integer is even,

If it is true, add that integer into the “Stack”.

Otherwise,

Add that integer into the “Queue”.

Print the “Queue” element and then the “Stack” elements.

Define the method “main()”,

Create object for “LinkedList”.

Call the “add()” method of queue to add the elements “42”, “-3”, “4”, “15”, “9” and “71” into the “Queue” one by one.

Call the method “mystery2()” with “Queue” as a parameter.

Answer 9

b.

Program Plan Intro

Find output for the given Queue

Program plan:

Import necessary packages.

Create a class “StackQu”,

Define the method “mystery2()” that accepts “Queue”,

Create the object for “Stack”.

Calculate the size of “Queue”.

Execute loop till queue size,

Assign the integer removed from the “Queue”.

Check whether the integer is even,

If it is true, add that integer into the “Stack”.

Otherwise,

Add that integer into the “Queue”.

Print the “Queue” element and then the “Stack” elements.

Define the method “main()”,

Create object for “LinkedList”.

Call the “add()” method of queue to add the elements “42”, “-3”, “4”, “15”, “9” and “71” into the “Queue” one by one.

Call the method “mystery2()” with “Queue” as a parameter.

Answer 10

c.

Program Plan Intro

Find output for the given Queue

Program plan:

Import necessary packages.

Create a class “StackQu”,

Define the method “mystery2()” that accepts “Queue”,

Create the object for “Stack”.

Calculate the size of “Queue”.

Execute loop till queue size,

Assign the integer removed from the “Queue”.

Check whether the integer is even,

If it is true, add that integer into the “Stack”.

Otherwise,

Add that integer into the “Queue”.

Print the “Queue” element and then the “Stack” elements.

Define the method “main()”,

Create object for “LinkedList”.

Call the “add()” method of queue to add the elements “30”, “20”, “10”, “60”, “50”, “40”, “3” and “0” into the “Queue” one by one.

Call the method “mystery2()” with “Queue” as a parameter.

Answer 11

c.

Program Plan Intro

Find output for the given Queue

Program plan:

Import necessary packages.

Create a class “StackQu”,

Define the method “mystery2()” that accepts “Queue”,

Create the object for “Stack”.

Calculate the size of “Queue”.

Execute loop till queue size,

Assign the integer removed from the “Queue”.

Check whether the integer is even,

If it is true, add that integer into the “Stack”.

Otherwise,

Add that integer into the “Queue”.

Print the “Queue” element and then the “Stack” elements.

Define the method “main()”,

Create object for “LinkedList”.

Call the “add()” method of queue to add the elements “30”, “20”, “10”, “60”, “50”, “40”, “3” and “0” into the “Queue” one by one.

Call the method “mystery2()” with “Queue” as a parameter.

Answer 12

Expert Solution & Answer

Answer 13

Expert Solution & Answer

Answer 14

Want to see the full answer?

Check out a sample textbook solution

See solution

Answer 15

Ch. 14.1 - Prob. 1SCP Ch. 14.1 - Prob. 2SCP Ch. 14.1 - Prob. 3SCP Ch. 14.1 - Prob. 4SCP Ch. 14.1 - Prob. 5SCP Ch. 14.1 - Prob. 6SCP Ch. 14.1 - Prob. 7SCP Ch. 14.1 - Prob. 8SCP Ch. 14.1 - Prob. 9SCP Ch. 14.1 - Prob. 10SCP

Concept explainers

Want to see the full answer?

Chapter 14 Solutions