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

Objective: 1. Implement a custom Vector class in C++ that manages dynamic memory efficiently. 2. Demonstrate an understanding of the Big Five by managing deep copies, move semantics, and resource cleanup. 3. Explore the performance trade-offs between heap and stack allocation. Task Description: Part 1: Custom Vector Implementation 1. Create a Vector class that manages a dynamically allocated array. 。 Member Variables: ° T✶ data; // Dynamically allocated array for storage. std::size_t size; // Number of elements currently in the vector. std::size_t capacity; // Maximum number of elements before reallocation is required. 2. Implement the following core member functions: Default Constructor: Initialize an empty vector with no allocated storage. 。 Destructor: Free any dynamically allocated memory. 。 Copy Constructor: Perform a deep copy of the data array. 。 Copy Assignment Operator: Free existing resources and perform a deep copy. Move Constructor: Transfer ownership of the data array…

2.68♦♦ Write code for a function with the following prototype: * Mask with least signficant n bits set to 1 * Examples: n = 6 -> 0x3F, n = 17-> 0x1FFFF * Assume 1 <= n <= w int lower_one_mask (int n); Your function should follow the bit-level integer coding rules Be careful of the case n = W.

Hi-Volt Components You are the IT manager at Hi-Voltage Components, a medium-sized firm that makes specialized circuit boards. Hi-Voltage's largest customer, Green Industries, recently installed a computerized purchasing sys- tem. If Hi-Voltage connects to the purchasing system, Green Industries will be able to submit purchase orders electronically. Although Hi-Voltage has a computerized accounting system, that system is not capable of handling EDI. Tasks 1. What options does Hi-Voltage have for developing a system to connect with Green Industries' pur- chasing system? 2. What terms or concepts describe the proposed computer-to-computer relationship between Hi-Voltage and Green Industries? why not? 3. Would Hi-Voltage's proposed new system be a transaction processing system? Why or 4. Before Hi-Voltage makes a final decision, should the company consider an ERP system? Why or why not?