Print longest string in the stack Program plan: Import necessary package. Create a class “StackEx”, Define the method “printLongest()” that accepts “Stack”, Create new stack. Assign the first string removed from the stack to the “longest” variable. Insert the string into the new stack. Execute till the old stack is empty, Assign the next string removed from the stack. Check whether the length of current string is greater than the previous string. If it is true, assign the current string as longest. Insert the current string into the new stack. Execute till the new stack is empty, Restore the old stack. Print the longest string in the stack. Print the stack of strings at the end. Define the method “main()”, Create object for “stack”. Call the “push()” method of stack to add the strings “hello”, “hi”, “goodbye” and “howdy” into the “Stack” one by one. Print the stack of strings at the start. Call the method “printLongest()” with “Stack” as a parameter.

Question

Want to see the full answer?

Answer 1

Question

Chapter 14.3, Problem 23SCP

Program Plan Intro

Print longest string in the stack

Program plan:

Import necessary package.

Create a class “StackEx”,

Define the method “printLongest()” that accepts “Stack”,

Create new stack.

Assign the first string removed from the stack to the “longest” variable.

Insert the string into the new stack.

Execute till the old stack is empty,

Assign the next string removed from the stack.

Check whether the length of current string is greater than the previous string.

If it is true, assign the current string as longest.

Insert the current string into the new stack.

Execute till the new stack is empty,

Restore the old stack.

Print the longest string in the stack.

Print the stack of strings at the end.

Define the method “main()”,

Create object for “stack”.

Call the “push()” method of stack to add the strings “hello”, “hi”, “goodbye” and “howdy” into the “Stack” one by one.

Print the stack of strings at the start.

Call the method “printLongest()” with “Stack” as a parameter.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Answer 2

Question

Chapter 14.3, Problem 23SCP

Program Plan Intro

Print longest string in the stack

Program plan:

Import necessary package.

Create a class “StackEx”,

Define the method “printLongest()” that accepts “Stack”,

Create new stack.

Assign the first string removed from the stack to the “longest” variable.

Insert the string into the new stack.

Execute till the old stack is empty,

Assign the next string removed from the stack.

Check whether the length of current string is greater than the previous string.

If it is true, assign the current string as longest.

Insert the current string into the new stack.

Execute till the new stack is empty,

Restore the old stack.

Print the longest string in the stack.

Print the stack of strings at the end.

Define the method “main()”,

Create object for “stack”.

Call the “push()” method of stack to add the strings “hello”, “hi”, “goodbye” and “howdy” into the “Stack” one by one.

Print the stack of strings at the start.

Call the method “printLongest()” with “Stack” 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 23SCP

Program Plan Intro

Print longest string in the stack

Program plan:

Import necessary package.

Create a class “StackEx”,

Define the method “printLongest()” that accepts “Stack”,

Create new stack.

Assign the first string removed from the stack to the “longest” variable.

Insert the string into the new stack.

Execute till the old stack is empty,

Assign the next string removed from the stack.

Check whether the length of current string is greater than the previous string.

If it is true, assign the current string as longest.

Insert the current string into the new stack.

Execute till the new stack is empty,

Restore the old stack.

Print the longest string in the stack.

Print the stack of strings at the end.

Define the method “main()”,

Create object for “stack”.

Call the “push()” method of stack to add the strings “hello”, “hi”, “goodbye” and “howdy” into the “Stack” one by one.

Print the stack of strings at the start.

Call the method “printLongest()” with “Stack” 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 23SCP

Program Plan Intro

Print longest string in the stack

Program plan:

Import necessary package.

Create a class “StackEx”,

Define the method “printLongest()” that accepts “Stack”,

Create new stack.

Assign the first string removed from the stack to the “longest” variable.

Insert the string into the new stack.

Execute till the old stack is empty,

Assign the next string removed from the stack.

Check whether the length of current string is greater than the previous string.

If it is true, assign the current string as longest.

Insert the current string into the new stack.

Execute till the new stack is empty,

Restore the old stack.

Print the longest string in the stack.

Print the stack of strings at the end.

Define the method “main()”,

Create object for “stack”.

Call the “push()” method of stack to add the strings “hello”, “hi”, “goodbye” and “howdy” into the “Stack” one by one.

Print the stack of strings at the start.

Call the method “printLongest()” with “Stack” 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 23SCP

Program Plan Intro

Print longest string in the stack

Program plan:

Import necessary package.

Create a class “StackEx”,

Define the method “printLongest()” that accepts “Stack”,

Create new stack.

Assign the first string removed from the stack to the “longest” variable.

Insert the string into the new stack.

Execute till the old stack is empty,

Assign the next string removed from the stack.

Check whether the length of current string is greater than the previous string.

If it is true, assign the current string as longest.

Insert the current string into the new stack.

Execute till the new stack is empty,

Restore the old stack.

Print the longest string in the stack.

Print the stack of strings at the end.

Define the method “main()”,

Create object for “stack”.

Call the “push()” method of stack to add the strings “hello”, “hi”, “goodbye” and “howdy” into the “Stack” one by one.

Print the stack of strings at the start.

Call the method “printLongest()” with “Stack” as a parameter.

Answer 6

Chapter 14.3, Problem 23SCP

Program Plan Intro

Print longest string in the stack

Program plan:

Import necessary package.

Create a class “StackEx”,

Define the method “printLongest()” that accepts “Stack”,

Create new stack.

Assign the first string removed from the stack to the “longest” variable.

Insert the string into the new stack.

Execute till the old stack is empty,

Assign the next string removed from the stack.

Check whether the length of current string is greater than the previous string.

If it is true, assign the current string as longest.

Insert the current string into the new stack.

Execute till the new stack is empty,

Restore the old stack.

Print the longest string in the stack.

Print the stack of strings at the end.

Define the method “main()”,

Create object for “stack”.

Call the “push()” method of stack to add the strings “hello”, “hi”, “goodbye” and “howdy” into the “Stack” one by one.

Print the stack of strings at the start.

Call the method “printLongest()” with “Stack” as a parameter.

Answer 7

Chapter 14.3, Problem 23SCP

Program Plan Intro

Print longest string in the stack

Program plan:

Import necessary package.

Create a class “StackEx”,

Define the method “printLongest()” that accepts “Stack”,

Create new stack.

Assign the first string removed from the stack to the “longest” variable.

Insert the string into the new stack.

Execute till the old stack is empty,

Assign the next string removed from the stack.

Check whether the length of current string is greater than the previous string.

If it is true, assign the current string as longest.

Insert the current string into the new stack.

Execute till the new stack is empty,

Restore the old stack.

Print the longest string in the stack.

Print the stack of strings at the end.

Define the method “main()”,

Create object for “stack”.

Call the “push()” method of stack to add the strings “hello”, “hi”, “goodbye” and “howdy” into the “Stack” one by one.

Print the stack of strings at the start.

Call the method “printLongest()” with “Stack” as a parameter.

Answer 8

Expert Solution & Answer

Answer 9

Expert Solution & Answer

Answer 10

Want to see the full answer?

Check out a sample textbook solution

See solution

Answer 11

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

Want to see the full answer?

Chapter 14 Solutions