How would one go about pushing the error literal :error: to a Stack in Java? I can't just push the String ":error:", as that is different. Can someone give me an example of as simple as possible a way to push the error literal :error: onto a stack? Thanks.
solution
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.Scanner;
import java.util.Stack;
public class ErrorStack {
public static void main(String[] args) {
Stack stack = new Stack<Object>();
Scanner scanner = new Scanner(System.in);
System.out.println("enter how many you want to push in the stack");
int no = scanner.nextInt();
for (int i = 0; i < no; i++) {
System.out.println("enter the input");
String input = "";
try {
input = scanner.next();
try{
Integer a=Integer.valueOf((String) input);
if(a instanceof Integer)
stack.add(input);
else
stack.add("error");
}catch(InputMismatchException e)
{
stack.add("error");
}
} catch (Exception e) {
stack.add("error");
}
}
System.out.println(Arrays.toString(stack.toArray()));
}
}
output
enter how many you want to push in the stack
3
enter the input
2.5
enter the input
2
enter the input
1
[error, 2, 1]
enter how many you want to push in the stack
3
enter the input
1
enter the input
2
enter the input
df
the stack values are[1, 2, error]
enter how many you want to push in the stack
3
enter the input
sdgd
enter the input
1
enter the input
dfg
the stack values are[error, 1, error]
How would one go about pushing the error literal :error: to a Stack in Java? I...
C++
Carefully review Program 19-2 in your textbook,
MathStack. This is a static stack, meaning that the size
of the stack is set at the beginning of the program (see line 11):
MathStack stack(5).
I would like you to modify this program as follows:
1. Implement it as a dynamic stack (do not use a static
stack as it is designed in the book). Use a linked list to
implement this. There's code in the book.
2. Add functionality for...
Stacks and Java 1. Using Java design and implement a stack on an array. Implement the following operations: push, pop, top, size, isEmpty. Make sure that your program checks whether the stack is full in the push operation, and whether the stack is empty in the pop operation. None of the built-in classes/methods/functions of Java can be used and must be user implemented. Practical application 1: Arithmetic operations. (a) Design an algorithm that takes a string, which represents an arithmetic...
I have a java project that I need help trying to finish. I have most of it completed but the issue I am running into is adding numbers with different lengths. Project requirements: . Use a Stack ADT with the implementation of your choice (Array or Link), it should not make a difference 2.Read two “integer” numbers from the user. Hint: You don’t need to use an int type when you read, it may be easier to parse the input...
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...
**TStack.py below**
# CMPT 145: Linear ADTs
# Defines the Stack ADT
#
# A stack (also called a pushdown or LIFO stack) is a compound
# data structure in which the data values are ordered according
# to the LIFO (last-in first-out) protocol.
#
# Implementation:
# This implementation was designed to point out when ADT operations are
# used incorrectly.
def create():
"""
Purpose
creates an empty stack
Return
an empty stack
"""
return '__Stack__',list()
def is_empty(stack):
"""...
Here is the code I have so far. I'm trying to figure out how to
implement a boolean and use precedence. The 2nd expression should
be 14 but it comes out as 28 so I'm definitely not
understanding.
#include <stack>
#include <iostream>
#include <string>
using namespace std;
// Function to find precedence of
// operators.
int precedence(char op) {
if (op == '+' || op == '-')
return 1;
if (op == '*' || op ==...
hello there, i have to implement this on java processing. can someone please help me regarding that? thanks War is the name of a popular children’s card game. There are many variants. After playing War with a friend for over an hour, they argue that this game must never end . However! You are convinced that it will end. As a budding computer scientist, you decide to build a simulator to find out for sure! You will implement the logic...
In Java plz due today Assignment 4 - Email, Shwitter and Inheritance Select one option from below. All (both) options are worth the same number of points. The more advanced option(s) are provided for students who find the basic one too easy and want more of a challenge. OPTION A (Basic): Message, EMail and Tweet Understand the Classes and Problem Every message contains some content ("The British are coming! The British are coming!"). We could enhance this by adding other...
could you please help me with this problem, also I
need a little text so I can understand how you solved the
problem?
import java.io.File; import java.util.Scanner; /** *
This program lists the files in a directory specified by * the
user. The user is asked to type in a directory name. * If the name
entered by the user is not a directory, a * message is printed and
the program ends. */ public class DirectoryList { public static...