If in the ArrayStack, the first element that we push to the stack, is stored in location capacity - 1 (capacity is the capacity of the array theData) in the array theData and the subsequent elements that we push, we keep on adding before the last element added in the array. That is, in the constructor of class ArrayStack, we initialize the topofstack to capacity and we write the push method as follows: public E push(E obj) if (topOfStack == 0) reallocate(); topOfStack--; theData[topOfStack] = obj; return obj; } This push method can work but the if statement should be: if (topOfStack == theData.length - 1) reallocate(); B This push method will work provided we modify the reallocate method. This push method can work, but topOfStack- ; should come after theData[topOfStack] = obj; D This push method can work, but topOfStack-- ; should be topOfStack++;

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question
100%

java program:

If in the ArrayStack, the first element that we push to the stack, is stored in location capacity – 1 (capacity is the capacity of the array theData) in the array theData and the subsequent elements that we push, we keep on adding before the last element added in the array. That is, in the constructor of class ArrayStack, we initialize the topOfStack to capacity and we write the push method as follows:

public E push(E obj)

{

       if (topOfStack == 0)

             reallocate();

       topOfStack--;

       theData[topOfStack] = obj;

       return obj;

 }

 
  1. This push method can work but the if statement should be:

      if (topOfStack == theData.length - 1) reallocate();

     
  2. This push method will work provided we modify the reallocate method.

     
  3. This push method can work, but topOfStack-- ; should come after

     theData[topOfStack] = obj;

     
  4. This push method can work, but topOfStack-- ; should be topOfStack++;

If in the ArrayStack, the first element that we push to the stack, is stored in location capacity - 1 (capacity is the capacity of the
array theData) in the array theData and the subsequent elements that we push, we keep on adding before the last element
added in the array. That is, in the constructor of class ArrayStack, we initialize the topofstack to capacity and we write the push
method as follows:
public E push(E obj)
{
if (topOfStack == 0)
reallocate();
topOfStack--;
theData[topOfStack] = obj;
return obj;
}
This push method can work but the if statement should be:
if (topOfStack == theData.length - 1) reallocate();
B) This push method will work provided we modify the reallocate method.
This push method can work, but topOfStack-- ; should come after
theData[topOfStack] = obj;
D This push method can work, but topOfStack--; should be topofStack++;
Transcribed Image Text:If in the ArrayStack, the first element that we push to the stack, is stored in location capacity - 1 (capacity is the capacity of the array theData) in the array theData and the subsequent elements that we push, we keep on adding before the last element added in the array. That is, in the constructor of class ArrayStack, we initialize the topofstack to capacity and we write the push method as follows: public E push(E obj) { if (topOfStack == 0) reallocate(); topOfStack--; theData[topOfStack] = obj; return obj; } This push method can work but the if statement should be: if (topOfStack == theData.length - 1) reallocate(); B) This push method will work provided we modify the reallocate method. This push method can work, but topOfStack-- ; should come after theData[topOfStack] = obj; D This push method can work, but topOfStack--; should be topofStack++;
Expert Solution
steps

Step by step

Solved in 2 steps

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY