Homework Answers
Each function can be implpemented using a single statement. So, here are the functions below
1. push(T element):- This function is used for pushing the element into the stack.
public void push(T Element)
{
stack.push(T Element);
}
2. pop():- This function is used for popping the element from the stack which is the top element of the stack.
public T pop()
{
stack.pop();
}3. peek():- This function is used to fetch the top element of the stack.
public T peek()
{
System.out.println("Top element of stack is: " + stack.peek());
}4. isEmpty():- This function is used to check that whether the stack is empty or not. If the stack is empty then it return "true" else it return "false".
public boolean isEmpty()
{
System.out.println("Whether the stack is empty? => " + stack.isEmpty());
}5. size():- This function is used to get the size / no. of elements in stack. Eg. if there are 5 elements in the stack then the size=5.
public int size()
{
System.out.println("Size of stack is: " + stack.size());
}Add Answer to:
using java
//HINT: Each function can be completed using a single statement. public class LinkListStack<T> implements...
java create java program that make stack with LinkedList and stack is implement iterator. When stack’s iterator call next(), it pop its data. here is the example of output //by user 5 1 2 3 4 5 //then...
java create java program that make stack with LinkedList and stack is implement iterator. When stack’s iterator call next(), it pop its data. here is the example of output //by user 5 1 2 3 4 5 //then output comes like this 5 4 3 2 1 Stack is empty. here is the code that i'm going to use class Stack<T> implements Iterator<T> { LinkedList<T> list; public Stack() { list = new LinkedList<T>(); } public boolean isEmpty() { return list.isEmpty(); ...
In Java. What would the methods of this class look like? StackADT.java public interface StackADT<T> {...
In Java. What would the methods of this class look like?
StackADT.java
public interface StackADT<T>
{
/** Adds one element to the top of this stack.
* @param element element to be pushed onto stack
*/
public void push (T element);
/** Removes and returns the top element from this stack.
* @return T element removed from the top of the stack
*/
public T pop();
/** Returns without removing the top element of this
stack.
* @return T...
Using Java You are given a Node class and a List class: public class Node {...
Using Java
You are given a
Node class and a
List class:
public class
Node
{
int data;
Node
next;
}
public class
List
{
Node
first;
}
You are also given a Stack class.
The following functions are available for use:
public class Stack
{
public boolean
isEmpty(){};
public void push(int
n){};
public int
pop(){};}
Write a Java method
snglyRevToStck that pushes the data found
in a linked list t in reverse order into the stack...
Complete the implementation of the LinkedStack class presented in Chapter 13. Specifically, complete the implementations of...
Complete the implementation of the LinkedStack class presented in Chapter 13. Specifically, complete the implementations of the peek, isEmpty, size, and toString methods. See Base_A06Q1.java for a starting place and a description of these methods. Here is the base given: /** * Write a description of the program here. * * @author Lewis et al., (your name) * @version (program version) */ import java.util.Iterator; public class Base_A06Q1 { /** * Program entry point for stack testing. * @param args Argument...
how would I complete this code without calling any built-in java collection framework classes like ArrayList,...
how would I complete this code without calling any built-in java collection framework classes like ArrayList, LinkedList, etc? import java.util.Iterator; class CallStack<T> implements Iterable<T> { // You'll want some instance variables here public CallStack() { //setup what you need } public void push(T item) { //push an item onto the stack //you may assume the item is not null //O(1) } public T pop() { //pop an item off the stack //if there are no items on the stack, return...
Create a java class that implements BagInterface using singly linked data. Name this new class LinkedBag....
Create a java class that implements BagInterface using singly linked data. Name this new class LinkedBag. Be sure to include a default constructor to initialize the private members of the class. Test that your code works properly. BagInterface includes the methods: public int getCurrentSize(); public boolean isEmpty(); public boolean add(T newEntry); public T remove(); public boolean remove(T anEntry); public void clear(); public int getFrequencyOf(T anEntry); public boolean contains(T anEntry); public T[] toArray();
JAVA Implement a MyQueue class which implements a queue using two stacks. private int maxCapacity...
JAVA Implement a MyQueue class which implements a queue using two stacks. private int maxCapacity = 4; private Stack stack1; private Stack stack2; Note: You can use library Stack but you are not allowed to use library Queue and any of its methods Your Queue should not accept null or empty String or space as an input You need to implement the following methods using two stacks (stack1 & stack2) and also you can add more methods as well: public...
Java. Must not use Java API java.util.Stack /** A class of stacks whose entries are stored in an ...
Java.
Must not use Java API java.util.Stack
/**
A class of stacks whose entries are stored in an array.
Implement all methods in ArrayStack class using resizable
array strategy, i.e. usedoubleArray()
Must throw StackException during exception events in methods:
peek(), pop(), ArrayStack(int initialCapacity)
Do not change or add data fields
Do not add new methods
*/
import java.util.Arrays; public class Arraystack«Т> implements Stack!nterface«T> private TI stack;// Array of stack entries private int topIndex; /7 Index of top entry private static...
Suppose we decide to add a new operation to our Stack ADT called sizeIs, which returns...
Suppose we decide to add a new operation to our Stack ADT called sizeIs, which returns a value of primitive type int equal to the number of items on the stack. The method signature for sizeIS is public int sizeIs() a.) Write the code for sizeIs for the ArrayStack class b.) Write the code for sizeIs for the LinkedStack class (do not add any instance variables to the class; each time sizeIs is called you must "walk" through the stack...
Java. Must not use Java API java.util.Stack /** A class of stacks whose entries are stored...
Java.
Must not use Java API java.util.Stack
/**
A class of stacks whose entries are stored in an array.
Implement all methods in ArrayStack class using resizable
array strategy, i.e. usedoubleArray()
Must throw StackException during exception events in methods:
peek(), pop(), ArrayStack(int initialCapacity)
Do not change or add data fields
Do not add new methods
*/
import java.util.Arrays; public class Arraystack«Т> implements Stack!nterface«T> private TI stack;// Array of stack entries private int topIndex; /7 Index of top entry private...
In Java. What would the methods of this class look like?
StackADT.java
public interface StackADT<T>
{
/** Adds one element to the top of this stack.
* @param element element to be pushed onto stack
*/
public void push (T element);
/** Removes and returns the top element from this stack.
* @return T element removed from the top of the stack
*/
public T pop();
/** Returns without removing the top element of this
stack.
* @return T...
Using Java
You are given a
Node class and a
List class:
public class
Node
{
int data;
Node
next;
}
public class
List
{
Node
first;
}
You are also given a Stack class.
The following functions are available for use:
public class Stack
{
public boolean
isEmpty(){};
public void push(int
n){};
public int
pop(){};}
Write a Java method
snglyRevToStck that pushes the data found
in a linked list t in reverse order into the stack...
Java.
Must not use Java API java.util.Stack
/**
A class of stacks whose entries are stored in an array.
Implement all methods in ArrayStack class using resizable
array strategy, i.e. usedoubleArray()
Must throw StackException during exception events in methods:
peek(), pop(), ArrayStack(int initialCapacity)
Do not change or add data fields
Do not add new methods
*/
import java.util.Arrays; public class Arraystack«Т> implements Stack!nterface«T> private TI stack;// Array of stack entries private int topIndex; /7 Index of top entry private static...
Java.
Must not use Java API java.util.Stack
/**
A class of stacks whose entries are stored in an array.
Implement all methods in ArrayStack class using resizable
array strategy, i.e. usedoubleArray()
Must throw StackException during exception events in methods:
peek(), pop(), ArrayStack(int initialCapacity)
Do not change or add data fields
Do not add new methods
*/
import java.util.Arrays; public class Arraystack«Т> implements Stack!nterface«T> private TI stack;// Array of stack entries private int topIndex; /7 Index of top entry private...
Most questions answered within 3 hours.
-
Linear programming is an excellent technique yet is not applied
nearly enough in the “real world.”...
asked 7 minutes ago -
What three alkenes yield 3-methylpentane on catalytic
hydrogenation?
asked 7 minutes ago -
In JAVA Create a program with an array with the following
data:
50 12 31 76...
asked 10 minutes ago -
Using a hormone of the hypothalamic-anterior pituitary axis,
describe or diagram how negative feedback loops regulate...
asked 8 minutes ago -
1,1-dimethylcyclorohexane reacts with single bromine atom
asked 31 minutes ago -
The completed Lewis structure of CO2 contains a total
of 0,1,2,3,4,5,6,7,8 covalent bonds
and 0,1,2,3,4,5,6,7,8 lone pairs.
NOTE:...
asked 37 minutes ago -
A 0.0510 M solution of an organic acid has an
[H+] of 7.50×10-4M .
What is...
asked 34 minutes ago -
what is the profit-maximizing output condition that a
monopolistically competitive firm must satisfy? a) price charged...
asked 39 minutes ago -
Consider the set of ordered pairs shown below. Assuming that the
regression equation is y=3.513+0.429x and...
asked 1 hour ago -
1. (A) Write two
structural (constitutional)
isomers of C4H8F2?
Please show all of
the
asked 1 hour ago -
Objective: Practice converting a Boolean logic
expression into it’s truth table and to show the implementation...
asked 59 minutes ago -
1) Name the three holes located in the greater wing of the
sphenoid bone in order...
asked 1 hour ago