Java programming Questionhelp wih R 7.10:R-7.10 Reimplement the ArrayStack class, from Section 6.1.2, using dynamic arrays to support unlimited capacity. 6.1.2 A Simple Array-Based Stack ImplementationAs our first implementation of the stack ADT, we store elements in an array, nameddata, with capacity N for some fixed N. We oriented the stack so that the bottomelement of the stack is always stored in cell data [0], and the top element of thestack in cell data[t] for index t that is equal to one less than the current size of thestack. (See Figure 6.2.)1234567891011121314151617181 public class ArrayStack implements Stack {public static final int CAPACITY=1000;private E[] data;private int t = −1;public ArrayStack() { this(CAPACITY);public ArrayStack(int capacity) {data (E[]) new Object[capacity];PATEEN3852021data: A | B012tN-1Figure 6.2: Representing a stack with an array; the top element is in cell data[t].Recalling that arrays start at index 0 in Java, when the stack holds elementsfrom data [0] to data[t] inclusive, it has size t + 1. By convention, when the stack isempty it will have t equal to −1 (and thus has size t + 1, which is 0). A completeJava implementation based on this strategy is given in Code Fragment 6.2 (withJavadoc comments omitted due to space considerations).23}19 public E pop() {2425=26 }==22 data[t] = null;t--;return answer;CDEFG}}public int size() { return (t + 1); }public boolean isEmpty() { return (t == -1); }public void push(E e) throws IllegalStateException {if (size()data[++t] = e;}public E top() {if (isEmpty()) return null;return data[t];KLMdata.length) throw new IllegalState Exception("Stack is full");// increment t before storing new itemif (isEmpty()) return null;E answer = data[t];// default array capacity// generic array used for storage// index of the top element in stack} // constructs stack with default capacity// constructs stack with given capacity// safe cast; compiler may give warning// dereference to help garbage collectionCode Fragment 6.2: Array-based implementation of the Stack interface.

Dear Student, The new implementation of ArrayStack class using Dynamic arrays is given below -

Answered: Reimplement the ArrayStack class, f

Engineering

Computer Science

Reimplement the ArrayStack class, f

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

Q: In java: Create a Data Class.In this problem you will create a class named Data that can contain…

A: Java Classes: In Java, implementing various data storage structures is quite an easy task. A class…

Q: tNode class, define the IndexOf() function to return -1 if not found. rst index after the head node…

A: Approach is:- Step-1:-We will implement a linked list uisng class. Step-2:- We will ask user to…

Q: What is the difference between the use of an index-based loop and the use of an iterator with an…

A: ANS: - Index-Based Loop: - It is a structured control abstraction. It traverses through a range of…

Q: Write the full Java code for Searcher.java

A: all classes are same as you given the only modification is that Searcher Class.output:PASS: Search…

Q: Write the full Java code for LabProgram.java

A: To implement a recursive binary search algorithm with specific requirements:Parameters:target: the…

Q: class WordPair{ public: WordPair (String first, String second) String getFirst() String getSecond()…

A: Answer: C++ Source Code: #include<iostream>#include<vector> using namespace std; class…

Q: 6.1.1 The Stack Abstract Data Type Stacks are the simplest of all data structures, yet they are also…

A: We will be solving this question using stack in Java. Below is the solution.

Q: Hello i need help with this code. this is the problem: In Listing 11.10, MyStack is implemented…

A: UML diagram for class ArrayList

Q: 7 In a paint program, a “flood fill" fills all empty pixels of a drawing with a given color,…

A: #include <iostream>#include <stack>#define size 10using namespace std;// pair classclass…

Q: Implement in C Programming 8.18.1: LAB: Simple linked list Given an IntNode struct and the…

A: Define the structure IntNode to represent a node in the linked list. It contains an integer data…

Q: Write a program that declares an array of 5 integers called intArray. Do this in main(). Call…

A: Please find the answer below :

Q: In circular singly linked list, next pointer of the last node points to which node? null…

A: I have provided answers in step 2,

Q: Stack, Queue and Deque 5.1. Understand the basic operations for Stack, Queue and Deque Example:…

A: Stack:A stack is a linear data structure that follows the Last In, First Out (LIFO) principle.It…

Q: Revise the array list implementation given in Section 7.2.1 so that when the ac- tual number of…

A: Java program for given data implemented in next step

Q: Stack, Queue and Deque 5.1. Understand the basic operations for Stack, Queue and Deque Example:…

A: Stack:It is a linear data structure which follows the Last In, First Out (LIFO) principle.Queue:It…

Q: Given a list (44, 80, 96, 33, 15, 42, 73, 99, 91, 77) and a gap array of (5, 4, 1): What is the list…

A: Answer: We will do nothing but insertion sort for the given interval so we will see in the more…

Q: Answer the given question with a proper explanation and step-by-step solution.

A: In this answer, we are discussing which of the given snippets of code are allowed to manipulate the…

Q: You are given the class definition for CashRegister, and you are writing client code to set up an…

A: In step 2, I have provided answer with brief explanation...

Concept explainers

Array

The simplest way to start thinking about an array is as a collection, or a set of elements. In programming, these elements may be constants, variables, functions and pointers.

Question

Java programming Question

help wih R 7.10:

R-7.10 Reimplement the ArrayStack class, from Section 6.1.2, using dynamic arrays to support unlimited capacity.

6.1.2 A Simple Array-Based Stack Implementation
As our first implementation of the stack ADT, we store elements in an array, named
data, with capacity N for some fixed N. We oriented the stack so that the bottom
element of the stack is always stored in cell data [0], and the top element of the
stack in cell data[t] for index t that is equal to one less than the current size of the
stack. (See Figure 6.2.)
12345678
9
10
11
12
13
14
15
16
17
18
1 public class ArrayStack<E> implements Stack<E> {
public static final int CAPACITY=1000;
private E[] data;
private int t = −1;
public ArrayStack() { this(CAPACITY);
public ArrayStack(int capacity) {
data (E[]) new Object[capacity];
PATEEN385
20
21
data: A | B
0
1
2
t
N-1
Figure 6.2: Representing a stack with an array; the top element is in cell data[t].
Recalling that arrays start at index 0 in Java, when the stack holds elements
from data [0] to data[t] inclusive, it has size t + 1. By convention, when the stack is
empty it will have t equal to −1 (and thus has size t + 1, which is 0). A complete
Java implementation based on this strategy is given in Code Fragment 6.2 (with
Javadoc comments omitted due to space considerations).
23
}
19 public E pop() {
24
25
=
26 }
==
22 data[t] = null;
t--;
return answer;
CDEFG
}
}
public int size() { return (t + 1); }
public boolean isEmpty() { return (t == -1); }
public void push(E e) throws IllegalStateException {
if (size()
data[++t] = e;
}
public E top() {
if (isEmpty()) return null;
return data[t];
KLM
data.length) throw new IllegalState Exception("Stack is full");
// increment t before storing new item
if (isEmpty()) return null;
E answer = data[t];
// default array capacity
// generic array used for storage
// index of the top element in stack
} // constructs stack with default capacity
// constructs stack with given capacity
// safe cast; compiler may give warning
// dereference to help garbage collection
Code Fragment 6.2: Array-based implementation of the Stack interface.

Process by which instructions are given to a computer, software program, or application using code.

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

SEE SOLUTION Check out a sample Q&A here

Step 1 Explanation

VIEW

Step 2 Answer

VIEW

Step by step

Solved in 2 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

Draw a memory map for the code you see on the next page, until the execution reaches the point indicated by the comment /* HERE */.In your diagram:• You must have a stack, heap, and static memory sections • Identify each frame as illustrated by the previous examples.• Draw your variables as they are encountered during program execution. Code: public class Passenger {private String name;private int ticketCost;private StringBuffer luggage;private static final int LUGGAGE_COST = 20;public Passenger(String name, int ticketCost) {this.name = name;this.ticketCost = ticketCost;luggage = new StringBuffer();}public Passenger addLuggage(String desc) {ticketCost += LUGGAGE_COST;luggage.append(desc);return this;}public int getTicketCost() {return ticketCost;}public Passenger reduceCost(int by) {ticketCost -= by;/* HERE */return this;}public String toString() {return "Passenger [name=" + name + ", ticketCost=" + ticketCost + ", luggage=" + luggage + "]";}}public class Driver {public static void…
Create a computer programme to arrange objects in a stack so that the smallest ones are on top. Although you are allowed to utilise an extra temporary stack, you are not allowed to transfer the components into another data structure (such an array). The following operations are supported by the stack: push, pop, peek, and is Empty.
OCaml Code: The goal of this project is to understand and build an interpreter for a small, OCaml-like, stackbased bytecode language. Make sure that the code compiles correctly and provide the code with the screenshot of the output. Make sure to have the following methods below: -Push integers, strings, and names on the stack -Push booleans -Pushing an error literal or unit literal will push :error: or :unit:onto the stack, respectively -Command pop removes the top value from the stack -The command add refers to integer addition. Since this is a binary operator, it consumes the toptwo values in the stack, calculates the sum and pushes the result back to the stack - Command sub refers to integer subtraction -Command mul refers to integer multiplication -Command div refers to integer division -Command rem refers to the remainder of integer division -Command neg is to calculate the negation of an integer -Command swap interchanges the top two elements in the stack, meaning that the…
Please help me with this Principles of programming language homework question
Implement a class representing a circular sorted linked list. The class must have the following requirements: The linked list and the nodes must be implemented as C++ templates First must point to the largest value in the list It must include a constructor, a destructor, a copy constructor and an operator= It must include functions to insert a given item, delete a given item, search for a given item, check if the list is empty, return the length of the list and print the list (from smallest to largest) Hint: Use the menu-driven program of the linked list to test all the functions in your class. Screenshot the output and make comments on each area on the program.
You will create two programs. The first one will use the data structure Stack and the other program will use the data structure Queue. Keep in mind that you should already know from your video and free textbook that Java uses a LinkedList integration for Queue. Stack Program Create a deck of cards using an array (Array size 15). Each card is an object. So you will have to create a Card class that has a value (1 - 10, Jack, Queen, King, Ace) and suit (clubs, diamonds, heart, spade). You will create a stack and randomly pick a card from the deck to put be pushed onto the stack. You will repeat this 5 times. Then you will take cards off the top of the stack (pop) and reveal the values of the cards in the output. As a challenge, you may have the user guess the value and suit of the card at the bottom of the stack. Queue Program There is a new concert coming to town. This concert is popular and has a long line. The line uses the data structure Queue. The people in the line are objects…
Modify the C++ class for the abstract stack type shown belowto use a linked list representation and test it with the same code thatappears in this chapter. #include <iostream.h>class Stack {private: //** These members are visible only to other//** members and friends (see Section 11.6.4)int *stackPtr;int maxLen;int topSub;public: //** These members are visible to clientsStack() { //** A constructorstackPtr = new int [100];maxLen = 99;topSub = -1;}~Stack() {delete [] stackPtr;}; //** A destructorvoid push(int number) {if (topSub == maxLen)cerr << "Error in push--stack is full\n";else stackPtr[++topSub] = number;}void pop() {if (empty())cerr << "Error in pop--stack is empty\n";else topSub--;}int top() {if (empty())cerr << "Error in top--stack is empty\n";elsereturn (stackPtr[topSub]);}int empty() {return (topSub == -1);} }
2.2.14 Sorted queues being combined. Create a static function that receives two queues of sorted items as inputs and returns a queue formed by combining the two queues into a single sorted order queue. 2.2.15 Bottom-up mergesort of a queue. Create an implementation of the bottom-up mergesort using the following strategy: Make N queues, each holding one of the N things, given N items. assemble the N queues into a queue. Apply Exercise 2.2.14's merging process to the first two queues several times, and at the conclusion, reinsert the combined queue.Continue until there is just one queue left in the queue of queues.
In C++,
Write the full Java code for LabProgram.java