1. Consider the following program, taking note of blanks 1 - 4.class Probleml{private int maxSize;private char [] stackArray;private int top;public Probleml (int max){maxSize = max;stackArraytop = -1;}public void push (char j) // put item on top of stack{ blankl}=new char [maxSize];public char pop() // take item from top of stack{ blank2 }public char peek () // peek at top of stack{blank3 }public boolean isEmpty() // true if stack is emptyblank4}} // end class ProblemlWrite the correct Java statement to fill the blank indicated as blank 1, blank 2, blank 3and blank 4 in the program.a) blank 1b) blank 2c) blank 3d) blank 4

Answered: 1. Consider the following program,…

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Question

1. Consider the following program, taking note of blanks 1 - 4.
class Probleml
{
private int maxSize;
private char [] stackArray;
private int top;
public Probleml (int max)
{
maxSize = max;
stackArray
top = -1;
}
public void push (char j) // put item on top of stack
{ blankl}
=
new char [maxSize];
public char pop() // take item from top of stack
{ blank2 }
public char peek () // peek at top of stack
{blank3 }
public boolean isEmpty() // true if stack is empty
blank4}
} // end class Probleml
Write the correct Java statement to fill the blank indicated as blank 1, blank 2, blank 3
and blank 4 in the program.
a) blank 1
b) blank 2
c) blank 3
d) blank 4

Expert Solution

Explanation

1) The Java program in question implements the stack

2) A stack is a linear data structure that follows the LIFO (Last–In, First–Out) principle. That means the objects can be inserted or removed only at one end of it, also called a top.

3) The stack supports the following operations:

push inserts an item at the top of the stack (i.e., above its current top element).
pop removes the object at the top of the stack and returns that object from the function. The stack size will be decremented by one.
peek returns the object at the top of the stack without removing it from the stack or modifying the stack in any way.
isEmpty tests if the stack is empty or not.

4) Below are the java statements to fill the blanks indicated as blank1, blank2, black3 and blank4

Step by step

Solved in 5 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions