2. Complete the following program, trace and give the output.1 import java.util.*;2 public class stackProgram{30 public static void main(String[] args) {Stack stack1 =;//insert "A", "B", "C", "D", in the stack2349510116__);13// Prints the top of the stack ("D")System.out.println("Top element is: "// search from the top of the stackSystem.out.println("C is present at " + stack1.search("C")+"positions from top");stack1.pop(); // removing the top ("D")157// removing the next top ("C")1718// Returns the number of elements present in the stackSystem.out.println("Stack size is " + stack1.size());// check if stack is empty1920if (8System.out.println("Stack is Empty");elseSystem.out.println("Stack}نis not Empty");

push method is used to insert the element on top of Stack pop method is used to remove the last…

2. Complete the following program, trace and give the output. import java.util.*; public class stackProgram{ public static void main(String[] args) { Stack stack1 = 1 ; //insert "A", "B", "C", "D", in the stack 2 3 4 5 // Prints the top of the stack ("D") System.out.println("Top element is: // search from the top of the stack 6 ); System.out.println("C is present at " + stack1.search ("C")+"positions from top"); stack1.pop(); // removing the top ("D") 7 // removing the next top ("C") // Returns the number of elements present in the stack System.out.println("Stack size is " + stack1.size()); // check if stack is empty if ( ) 8 System.out.println("Stack is Empty"); else System.out.println("Stack } } is not Empty");

2. Complete the following program, trace and give the output. import java.util.*; public class stackProgram{ public static void main(String[] args) { Stack stack1 = 1 ; //insert "A", "B", "C", "D", in the stack 2 3 4 5 // Prints the top of the stack ("D") System.out.println("Top element is: // search from the top of the stack 6 ); System.out.println("C is present at " + stack1.search ("C")+"positions from top"); stack1.pop(); // removing the top ("D") 7 // removing the next top ("C") // Returns the number of elements present in the stack System.out.println("Stack size is " + stack1.size()); // check if stack is empty if ( ) 8 System.out.println("Stack is Empty"); else System.out.println("Stack } } is not Empty");

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

java dont use others answers please follow thw istructions on the photo Thank you!!!
Please show Stack.h, Stack.cpp and main.cpp
RPN.java import java.util.Scanner; /** * Reverse Polish Notation calculator. It evaluates * a string with expressions in RPN format and prints * the results. Exampel of a stack use. */public class RPN{ /** * Given a string, return an integer version of * the string. Check if the string contains only * numbers, if so, then does the conversion. If * it does not, it reurns 0. * @param t string with numeric token * @return int version of the numeric token in t */ public int getValue(String t) { if (t.matches("[0-9]+")) { return Integer.parseInt(t); } else { return 0; } } /** * Evaluates a single token in an RPN expression. If it is * a number, it pushes the token to the stack. If it is an * operator, then it pulls 2 numbers from the stack, performs * the operation and pushes back into the stack the result. * @param token to be evaluated * @param stack holding values for…
Write a Java program using Stack class to demonstrate the following activities: Create three empty stacks named stack1, stack2 and stack3 respectively. Push the numbers [6,4,9] into stack1 and [1,2,3] into stack2. Pop the top number of stack1 and top number of stack2 and multiply them. Then, push the multiplication result into stack3. Pop the top number of stack1 and top number of stack2 and divide them. Push the result of division into stack3. Print Stack1, stack2 and stack3. Print the largest number in stack3
Continue the attached code(MainStack.java) so that it will ask the user to enter a choice: (1) Is empty? ----- checks if the stack is empty, returns a text "empty" otherwise "not empty" (2) Search an Item It should ask the item you're looking for from stack and return its location(l-based location). If the item is not present, it will return "No such Item" text. (3) Clear All empty. This makes the stack
Develop a java code to save the following string {"Lab", "Assessment", "total" "Marks", "is 5"} in Stack then: + Display the content of the stack 4 Delete one element of the stack
Write a C++ program that : Create a stack of integers called age. Fill the elements a 10 elements. Output the elements inserted. Output the size of the stack. Delete the first 3 elements. Re print the size.
Please help with the following in Java Write a Java program create a stack with elements pushed 1, 2, 3, 4 and 5, removes the middle element. Note that you may use only push(), pop(), peek() and empty() methods of the stack.
do not use the work of others
Question 4 4.1 Write a Java program called StackDemo for the following Stack pseudocode and show the output for the remaining elements in the Stack.: Plan: 1. Create stack st 2. Add the element "Fundamentals" to the stack 3. Add the element "of" to the stack 4. Add the element "Programming" to the stack 5. Remove the last item in the stack 6. Print stack st 4.2 Refer to the plan in question 4.1, create a program called Queue_demo that includes a Queue structure called Q1 based on the plan.
Java code
This is java. Write the java code that takes the contents of a stack and places it in a queue and takes the contents of a queue and puts it in a stack. Your code can only use stack and queue data structure. swapStackAndQueue(stack, queue) //method call This is java.