Stack as an array Program plan: In a file “ArrayStack.java”, import necessary packages, and create a class “ArrayStack”, Declare the “Object” array. Declare the variable. Define the constructor to create an empty stack. Define the method “push()” to insert the element at the top of stack, Call the method “growBufferIfNecessary()”. Increment the size. Fill the element. Define the method “pop()” to remove the element from the top of stack, Check whether the size is less than “1”, If it is true, throw an exception “NoSuchElementException”. Declare the object. Decrement the size. Call the method “shrinkBufferIfNecessary()”. Return the value. Define the method “empty()”, Check the condition, Declare the array. Create a loop, Fill the array. Assign the new array to buffer array. Define the method “shrinkBufferIfNecessary()”, Calculate the ratio. Check whether the ratio is less than “0.25”. If it is true, declare and initialize the object array. Create a loop, Fill the array. Assign the array. In a file “StackTest.java”, import necessary packages, and create a class “StackTest”, Define the “main()” method. Create “ArrayStack” object. Add the element “Jerry” to the top of stack. Add the element “Daniel” to the top of stack. Add the element “John” to the top of stack. Execute loop till stack becomes empty, Print the popped out element. Print new line. Print the expected output.

Question

Want to see the full answer?

Answer 1

Question

Chapter 16, Problem 11PE

Program Plan Intro

Stack as an array

Program plan:

In a file “ArrayStack.java”, import necessary packages, and create a class “ArrayStack”,

Declare the “Object” array.

Declare the variable.

Define the constructor to create an empty stack.

Define the method “push()” to insert the element at the top of stack,

Call the method “growBufferIfNecessary()”.

Increment the size.

Fill the element.

Define the method “pop()” to remove the element from the top of stack,

Check whether the size is less than “1”,

If it is true, throw an exception “NoSuchElementException”.

Declare the object.

Decrement the size.

Call the method “shrinkBufferIfNecessary()”.

Return the value.

Define the method “empty()”,

Check the condition,

Declare the array.

Create a loop,

Fill the array.

Assign the new array to buffer array.

Define the method “shrinkBufferIfNecessary()”,

Calculate the ratio.

Check whether the ratio is less than “0.25”.

If it is true, declare and initialize the object array.

Create a loop,

Fill the array.

Assign the array.

In a file “StackTest.java”, import necessary packages, and create a class “StackTest”,

Define the “main()” method.

Create “ArrayStack” object.

Add the element “Jerry” to the top of stack.

Add the element “Daniel” to the top of stack.

Add the element “John” to the top of stack.

Execute loop till stack becomes empty,

Print the popped out element.

Print new line.

Print the expected output.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

7. Long-Distance CallsA long-distance provider charges the following rates for telephone calls: Rate Category Rate per MinuteDaytime (6:00 a.m. through 5:59 p.m.) $0.07Evening (6:00 p.m. through 11:59 p.m.) $0.12Off-Peak (midnight through 5:59 a.m.) $0.05Write a GUI application that allows the user to select a rate category (from a set of radio buttons), and enter the number of minutes of the call into an Entry widget. An info dialog box should display the charge for the call.

Name and Address The Name and Address Problem Write a GUI program that displays your name and address when a button is clicked. The program’s window should appear as the sketch on the left side of Figure 13-61 when it runs. When the user clicks the Show Info button, the program should display your name and address, as shown in the sketch on the right of the figure.

Exercise 1 Function and Structure [30 pts] Please debug the following program and answer the following questions. There is a cycle in a linked list if some node in the list can be reached again by continuously following the next pointer. #include typedef struct node { int value; struct node *next; } node; int 11_has_cycle (node *first) if (first == node *head = { NULL) return 0; first; while (head->next != NULL) { } if (head first) { return 1; } head = head->next; return 0; void test ll_has_cycle () { int i; node nodes [6]; for (i = 0; i < 6; i++) { nodes [i] .next = NULL; nodes [i].value = i; } nodes [0] .next = &nodes [1]; nodes [1] .next = &nodes [2]; nodes [2] .next = &nodes [3]; nodes [3] .next nodes [4] .next &nodes [4]; NULL; nodes [5] .next = &nodes [0]; printf("1. Checking first list for cycles. \n Function 11_has_cycle says it has s cycle\n\n", 11_has_cycle (&nodes [0])?"a":"no"); printf("2. Checking length-zero list for cycles. \n Function 11_has_cycle says it has %s…