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

Similar questions

Please answer in c++. Create a template class UniversalArray which createss an array of a given ssize, which is part of template declaration as given below: template<typename T, typename T1, int ArraySize> Besides the consstructor and destructor, the class should include:
5. Consider the following high-level code snippet. Assume that the base addresses of array1 and array2 are held in R1 and R2 and that array2 is initialized before it is used. int i; int array1 [100]; int array2 [100]; ... for (i=0; i<100; i=i+1) arrayl [i] = array2[i]; Write the code snippet in ARM assembly.
Implement in C Programming 6.11.2: Modify an array parameter. Write a function SwapArrayEnds() that swaps the first and last elements of the function's array parameter. Ex: sortArray = {10, 20, 30, 40} becomes {40, 20, 30, 10}. #include <stdio.h> /* Your solution goes here */ int main(void) { const int SORT_ARR_SIZE = 4; int sortArray[SORT_ARR_SIZE]; int i; int userNum; for (i = 0; i < SORT_ARR_SIZE; ++i) { scanf("%d", &sortArray[i]); } SwapArrayEnds(sortArray, SORT_ARR_SIZE); for (i = 0; i < SORT_ARR_SIZE; ++i) { printf("%d ", sortArray[i]); } printf("\n"); return 0;}
19- java. Which of the following is a drawback of using recursion? It may be less efficient than an iterative version. It may have fewer lines of code than an iterative version. It uses lesser memory stack than an iterative version. It runs faster than an iterative version.
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.
I need the answer as soon as possible
Would it be possible to implement unique, shared, or weak pointers in the code provided? If so, how?
PP 12.7 Implement an postfix-to-infix translator using stacks. The applicationshould repeatedly read a postfix expression and print the equivalentinfix expression until the user quits. Throw an exception if the postfixexpression entered is invalid.PP 12.8 Implement a class called ReverseWords that uses a stack to output a set of elements input by the user in reverse order.
Give one benefit nd one drawback of dynamic arrays over static arrays. The best solution will be Big Oh.
A) Write a generic Java queue class (a plain queue, not a priority queue). Then, call it GenericQueue, because the JDK already has an interface called Queue. This class must be able to create a queue of objects of any reference type. Consider the GenericStack class shown below for some hints. Like the Stack class below, the GenericQueue should use an underlying ArrayList<E>. Write these methods and any others you find useful: enqueue() adds an E to the queue peek() returns a reference to the object that has been in the queue the longest, without removing it from the queue dequeue() returns the E that has been in the queue the longest, and removes it from the queue contains(T t) returns true if the queue contains at least one object that is equal to t *in the sense that calling .equals() on the object with t the parameter returns true.* Otherwise contains returns false. size() and isEmpty() are obvious.
c++
3.25 Fixed Sized Deque Your task is to create an implementation of the Java Deque interface that can only hold N items where N is a number passed into the constructor. Note that most (if not all) of the unit tests rely on the method object[] toArray() inherited from Collection. Therefore, you must make sure you implement that method correctly in order to get most of the points. 301664.1524810.gpazay7 LAB АCTIVITY 3.25.1: Fixed Sized Deque 0/ 70 Submission Instructions Compile command javac FixedsizedDeque.java -xlint:all -encoding utf-8 We will use this command to compile your code Upload your files below by dragging and dropping into the area or choosing a file on your hard drive. FixedSizedDeque.java Drag file here or Choose on hard drive.