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

Do not use A.I and solve completely

Solve this

Specifications: Part-1Part-1: DescriptionIn this part of the lab you will build a single operation ALU. This ALU will implement a bitwise left rotation. Forthis lab assignment you are not allowed to use Digital's Arithmetic components.IF YOU ARE FOUND USING THEM, YOU WILL RECEIVE A ZERO FOR LAB2!The ALU you will be implementing consists of two 4-bit inputs (named inA and inB) and one 4-bit output (named out). Your ALU must rotate the bits in inA by the amount given by inB (i.e. 0-15).Part-1: User InterfaceYou are provided an interface file lab2_part1.dig; start Part-1 from this file.NOTE: You are not permitted to edit the content inside the dotted lines rectangle.Part-1: ExampleIn the figure above, the input values that we have selected to test are inA = {inA_3, inA_2, inA_1, inA_0} = {0, 1, 0,0} and inB = {inB_3, inB_2, inB_1, inB_0} = {0, 0, 1, 0}. Therefore, we must rotate the bus 0100 bitwise left by00102, or 2 in base 10, to get {0, 0, 0, 1}. Please note that a rotation left is…