BIG JAVA: LATE OBJECTS
BIG JAVA: LATE OBJECTS
2nd Edition
ISBN: 9781119626220
Author: Horstmann
Publisher: WILEY
Question
Book Icon
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.

Blurred answer
Students have asked these similar questions
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…
how to read log logs
Discrete Mathematics for Computer Engineering

Chapter 16 Solutions

BIG JAVA: LATE OBJECTS

Knowledge Booster
Background pattern image
Similar questions
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Text book image
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Text book image
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
Text book image
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Text book image
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Text book image
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education