Compression of stack Program plan: Import necessary packages. Create a class “CompressedStack”, Define the method “compressDuplicates ()” that accepts stack of integers, Construct “LinkedList” object. Execute till stack becomes empty, Transfer all the elements from stack to queue. Execute till queue becomes empty, Transfer all the elements from queue to stack. Execute till stack becomes empty, Transfer all the elements from stack to queue. Check whether the queue is non-empty, Assign the first element removed from the queue. Set duplicate count to “1”. Execute till queue becomes empty, Assign the nest element removed from the queue. Check whether both removed elements are equal, Increment the duplicate count by “1”. Otherwise, Insert the duplicate count into stack. Insert the first element removed from the queue into the stack. Set the duplicates count to “1”. Set the second element to previous element. Insert the duplicate count to the stack. Insert the duplicated element into the stack. Print the stack with a count of number of duplicates and the duplicated value. Define the method “main()”, Construct “Stack” object. Add integers into the stack. Print the stack of integers. Call the method “compressDuplicates()” with stack as parameter.

Question

Want to see the full answer?

Answer 1

Question

Chapter 14, Problem 17E

Program Plan Intro

Compression of stack

Program plan:

Import necessary packages.

Create a class “CompressedStack”,

Define the method “compressDuplicates ()” that accepts stack of integers,

Construct “LinkedList” object.

Execute till stack becomes empty,

Transfer all the elements from stack to queue.

Execute till queue becomes empty,

Transfer all the elements from queue to stack.

Execute till stack becomes empty,

Transfer all the elements from stack to queue.

Check whether the queue is non-empty,

Assign the first element removed from the queue.

Set duplicate count to “1”.

Execute till queue becomes empty,

Assign the nest element removed from the queue.

Check whether both removed elements are equal,

Increment the duplicate count by “1”.

Otherwise,

Insert the duplicate count into stack.

Insert the first element removed from the queue into the stack.

Set the duplicates count to “1”.

Set the second element to previous element.

Insert the duplicate count to the stack.

Insert the duplicated element into the stack.

Print the stack with a count of number of duplicates and the duplicated value.

Define the method “main()”,

Construct “Stack” object.

Add integers into the stack.

Print the stack of integers.

Call the method “compressDuplicates()” with stack as 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 help making this EER diagram in Chen Notation.

In Java I have an input in a text file that I can't submit here. So, please use it as input.txt

Perceptual acuity, according to Ram Charan, explains how Ted Turner became the first CEO to recognize the potential of 24-hour news and thereby created CNN. a) True b) False

Answer 2

Question

Chapter 14, Problem 17E

Program Plan Intro

Compression of stack

Program plan:

Import necessary packages.

Create a class “CompressedStack”,

Define the method “compressDuplicates ()” that accepts stack of integers,

Construct “LinkedList” object.

Execute till stack becomes empty,

Transfer all the elements from stack to queue.

Execute till queue becomes empty,

Transfer all the elements from queue to stack.

Execute till stack becomes empty,

Transfer all the elements from stack to queue.

Check whether the queue is non-empty,

Assign the first element removed from the queue.

Set duplicate count to “1”.

Execute till queue becomes empty,

Assign the nest element removed from the queue.

Check whether both removed elements are equal,

Increment the duplicate count by “1”.

Otherwise,

Insert the duplicate count into stack.

Insert the first element removed from the queue into the stack.

Set the duplicates count to “1”.

Set the second element to previous element.

Insert the duplicate count to the stack.

Insert the duplicated element into the stack.

Print the stack with a count of number of duplicates and the duplicated value.

Define the method “main()”,

Construct “Stack” object.

Add integers into the stack.

Print the stack of integers.

Call the method “compressDuplicates()” with stack as parameter.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Answer 3

Question

Chapter 14, Problem 17E

Program Plan Intro

Compression of stack

Program plan:

Import necessary packages.

Create a class “CompressedStack”,

Define the method “compressDuplicates ()” that accepts stack of integers,

Construct “LinkedList” object.

Execute till stack becomes empty,

Transfer all the elements from stack to queue.

Execute till queue becomes empty,

Transfer all the elements from queue to stack.

Execute till stack becomes empty,

Transfer all the elements from stack to queue.

Check whether the queue is non-empty,

Assign the first element removed from the queue.

Set duplicate count to “1”.

Execute till queue becomes empty,

Assign the nest element removed from the queue.

Check whether both removed elements are equal,

Increment the duplicate count by “1”.

Otherwise,

Insert the duplicate count into stack.

Insert the first element removed from the queue into the stack.

Set the duplicates count to “1”.

Set the second element to previous element.

Insert the duplicate count to the stack.

Insert the duplicated element into the stack.

Print the stack with a count of number of duplicates and the duplicated value.

Define the method “main()”,

Construct “Stack” object.

Add integers into the stack.

Print the stack of integers.

Call the method “compressDuplicates()” with stack as parameter.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Answer 4

Question

Chapter 14, Problem 17E

Program Plan Intro

Compression of stack

Program plan:

Import necessary packages.

Create a class “CompressedStack”,

Define the method “compressDuplicates ()” that accepts stack of integers,

Construct “LinkedList” object.

Execute till stack becomes empty,

Transfer all the elements from stack to queue.

Execute till queue becomes empty,

Transfer all the elements from queue to stack.

Execute till stack becomes empty,

Transfer all the elements from stack to queue.

Check whether the queue is non-empty,

Assign the first element removed from the queue.

Set duplicate count to “1”.

Execute till queue becomes empty,

Assign the nest element removed from the queue.

Check whether both removed elements are equal,

Increment the duplicate count by “1”.

Otherwise,

Insert the duplicate count into stack.

Insert the first element removed from the queue into the stack.

Set the duplicates count to “1”.

Set the second element to previous element.

Insert the duplicate count to the stack.

Insert the duplicated element into the stack.

Print the stack with a count of number of duplicates and the duplicated value.

Define the method “main()”,

Construct “Stack” object.

Add integers into the stack.

Print the stack of integers.

Call the method “compressDuplicates()” with stack as parameter.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Answer 5

Chapter 14, Problem 17E

Program Plan Intro

Compression of stack

Program plan:

Import necessary packages.

Create a class “CompressedStack”,

Define the method “compressDuplicates ()” that accepts stack of integers,

Construct “LinkedList” object.

Execute till stack becomes empty,

Transfer all the elements from stack to queue.

Execute till queue becomes empty,

Transfer all the elements from queue to stack.

Execute till stack becomes empty,

Transfer all the elements from stack to queue.

Check whether the queue is non-empty,

Assign the first element removed from the queue.

Set duplicate count to “1”.

Execute till queue becomes empty,

Assign the nest element removed from the queue.

Check whether both removed elements are equal,

Increment the duplicate count by “1”.

Otherwise,

Insert the duplicate count into stack.

Insert the first element removed from the queue into the stack.

Set the duplicates count to “1”.

Set the second element to previous element.

Insert the duplicate count to the stack.

Insert the duplicated element into the stack.

Print the stack with a count of number of duplicates and the duplicated value.

Define the method “main()”,

Construct “Stack” object.

Add integers into the stack.

Print the stack of integers.

Call the method “compressDuplicates()” with stack as parameter.

Answer 6

Chapter 14, Problem 17E

Program Plan Intro

Compression of stack

Program plan:

Import necessary packages.

Create a class “CompressedStack”,

Define the method “compressDuplicates ()” that accepts stack of integers,

Construct “LinkedList” object.

Execute till stack becomes empty,

Transfer all the elements from stack to queue.

Execute till queue becomes empty,

Transfer all the elements from queue to stack.

Execute till stack becomes empty,

Transfer all the elements from stack to queue.

Check whether the queue is non-empty,

Assign the first element removed from the queue.

Set duplicate count to “1”.

Execute till queue becomes empty,

Assign the nest element removed from the queue.

Check whether both removed elements are equal,

Increment the duplicate count by “1”.

Otherwise,

Insert the duplicate count into stack.

Insert the first element removed from the queue into the stack.

Set the duplicates count to “1”.

Set the second element to previous element.

Insert the duplicate count to the stack.

Insert the duplicated element into the stack.

Print the stack with a count of number of duplicates and the duplicated value.

Define the method “main()”,

Construct “Stack” object.

Add integers into the stack.

Print the stack of integers.

Call the method “compressDuplicates()” with stack as parameter.

Answer 7

Chapter 14, Problem 17E

Program Plan Intro

Compression of stack

Program plan:

Import necessary packages.

Create a class “CompressedStack”,

Define the method “compressDuplicates ()” that accepts stack of integers,

Construct “LinkedList” object.

Execute till stack becomes empty,

Transfer all the elements from stack to queue.

Execute till queue becomes empty,

Transfer all the elements from queue to stack.

Execute till stack becomes empty,

Transfer all the elements from stack to queue.

Check whether the queue is non-empty,

Assign the first element removed from the queue.

Set duplicate count to “1”.

Execute till queue becomes empty,

Assign the nest element removed from the queue.

Check whether both removed elements are equal,

Increment the duplicate count by “1”.

Otherwise,

Insert the duplicate count into stack.

Insert the first element removed from the queue into the stack.

Set the duplicates count to “1”.

Set the second element to previous element.

Insert the duplicate count to the stack.

Insert the duplicated element into the stack.

Print the stack with a count of number of duplicates and the duplicated value.

Define the method “main()”,

Construct “Stack” object.

Add integers into the stack.

Print the stack of integers.

Call the method “compressDuplicates()” with stack as 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