2. Write a complete Java program that provides two methods named randominteger() and subtractPairs(). The first method should generate a stack of random integer numbers in the range of [120]. Then pass the stack to the second method that replaces every 2 consecutive elements (starting from the top) with their difference and returns the stack containing the difference values only. If the number of elements is odd, the last element in the stack should be kept as it is. For example, suppose a stack storing the following elements: Before: Bottom[15, 1, 6, 4, 12] Top Then the stack should store the following values after calling the method sumpairs(): After: Bottom[15, 5, 8] Top The number of random integers to be generated should be read from the user. Sample Output: Enter # of elements: 5 Before: Bottom[15, 1, 6, 4, 12] Top After: Bottom[15, 5, 8] Top You may use any of the following to generate the random numbers: Random class Math.random

2. Write a complete Java program that provides two methods named randominteger() and subtractPairs(). The first method should generate a stack of random integer numbers in the range of [120]. Then pass the stack to the second method that replaces every 2 consecutive elements (starting from the top) with their difference and returns the stack containing the difference values only. If the number of elements is odd, the last element in the stack should be kept as it is. For example, suppose a stack storing the following elements: Before: Bottom[15, 1, 6, 4, 12] Top Then the stack should store the following values after calling the method sumpairs(): After: Bottom[15, 5, 8] Top The number of random integers to be generated should be read from the user. Sample Output: Enter # of elements: 5 Before: Bottom[15, 1, 6, 4, 12] Top After: Bottom[15, 5, 8] Top You may use any of the following to generate the random numbers: Random class Math.random

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

Related questions

Q: Write a complete program that reads two stack of integers from a data file and calls a method isSame…

A: Java Code:- package bankAccount; import java.util.Stack; public class StackEqual { // Function to…

Q: "red" "blue" "green" "red" "purple" after: "green" "purple" "yellow" "blue" "yellow" "blue". "blue"

A: To add data in stack, or to delete data fro stack,both are done from top of the stack. i.e from same…

Q: public boolean bubbleIns ( double element ); /* Another form of ins operation. In this one, we look…

A: Step 1 : Start Step 2 : Declare the list and the length of the list in which the element is to be…

Q: In Java: Write a program that reads a list of integers, and outputs the two smallest integers in…

A: CODE: import java. util. Scanner ;public class LabProgram{public static void main(String[] args)…

Q: Given a stack myData: Tom, Sam (top is Tom), what is the output after the following operations?…

A: As per data, tom , sam is in myData stack (tom is on top) Stack follows the principle last in…

Q: IN JAVA Implement the method public void display() which displays the entries in a stack starting…

Q: Write a program that first gets a list of integers from input. The input begins with an integer…

A: The JAVA code is given below with code and output screenshots All the best ?

Q: Given main.py, complete the Stack class in Stack.py by writing the push() and pop() methods. The…

A: # TODO: Write a method to push a value into the stack method push(self, element )// takes self and…

Q: In Java Write a method splitStack that takes a stack of integers as a parameter and splits it into…

A: Actually, Java is a programming language originally developed by James Gosling at Sun Microsystems…

Q: JavaTimer.java: import java.util.Arrays; import java.util.Random; public class JavaTimer { //…

A: Algorithm: Define a class named "SortTimer" and import the necessary libraries. Define a method…

Q: The next question asks you to draw a stack. To draw it in Canvas, simply list the numbers in the…

A: Required:

Q: Use stack concepts to write a program. The program will convert any number in the decimal system…

A: Introduction of the Program: The Java Program takes the decimal number from the user as input then…

Q: 1. The maximum difference between any two subsequent (right next to each other) numbers in the list…

Q: Write a code in Java programming You are working in a company, and your new task is creating an…

A: The method encode() first checks for null and empty strings and returns appropriate values. It then…

Q: Write a method “removeBottomItemStack” that takes a stack of integers and removes the first item…

A: Step 1 : Start Step 2 : Define a method removeBottomItemStack which removes the Bottom Element of…

Q: JAVA programming I have to finish the "remove" method which is supposed to remove element e at…

A: PROGRAM EXPLANATION: Define the remove method, this method will take an index as an input argument.…

Q: Write a Java program that allow the user 1.Implement a queue in an array 2. Enter the following…

A: Given: Write a Java program that allows the user 1. Implement a queue in an array2. Enter the…

Q: javaprogram that uses an array with ten random integers to prints four lines of output, containing…

A: Answer :

Q: Write a Java program for Evaluating Postfix Expression 1. Input a postfix expression from user.

A: The time complexity of the evaluation algorithm is O(n) where n is a number of characters in the…

Concept explainers

Depth First Search

Depth-first search (DFS) also known as Depth First traversal is an algorithm used to traverse or search the nodes in a tree or graph data structure. Traversal usually means visiting all the nodes of a graph. DFS performs in a depth-ward manner. It uses a stack to remember the vertices it has visited. The search starts from the root node, where any arbitrary node is selected as a root node in a graph, and then each node is explored along each branch before performing backtracking. The DFS algorithm uses a recursive technique by following the idea of backtracking. DFS algorithm does this by performing an in-depth search of all the nodes by traversing in a forward direction. If the required node is not found, it starts backtracking to previously visited nodes.

Question

2. Write a complete Java program that provides two methods named randomInteger() and
subtractPairs(). The first method should generate a stack of random integer numbers in the
range of [120]. Then pass the stack to the second method that replaces every 2
consecutive elements (starting from the top) with their difference and returns the stack
containing the difference values only. If the number of elements is odd, the last element in
the stack should be kept as it is. For example, suppose a stack storing the
following elements:
Before:
Bottom[15, 1, 6, 4, 12] Top
Then the stack should store the following values after calling the method sumPairs():
After:
Bottom[15, 5, 8] Top
The number of random integers to be generated should be read from the user.
Sample Output:
Enter # of elements: 5
Before:
Bottom [15, 1, 6, 4, 12] Top
After:
Bottom[15, 5, 8] Top
You may use any of the following to generate the random numbers:
Random class
• Math.random

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

SEE SOLUTION Check out a sample Q&A here

Step 1

VIEW

Step 2

VIEW

Step by step

Solved in 2 steps with 1 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

Write a Java program to input a list of names (strings) from the user and store them in an ArrayList. The input can be terminated by entering the empty string or b yentering the string “quit”.
examine a very simple task: reversing a word. When you run the program, it asks you to type in a word. When you press Enter, it displays the word with the letters in reverse order. A stack is used to reverse the letters. First the characters are extracted one by one from the input string and pushed onto the stack. Then they’re popped off the stack and displayed. Because of its last-in-first-out characteristic, the stack reverses the order of the characters.
In Java: Write a program that first gets a list of integers from input. The input begins with an integer indicating the number of integers that follow. Then, get the last value from the input, which indicates a threshold. Output all integers less than or equal to that last threshold value. Assume that the list will always contain fewer than 20 integers. Ex: If the input is: 5 50 60 140 200 75 100 the output is: 50 60 75 The 5 indicates that there are five integers in the list, namely 50, 60, 140, 200, and 75. The 100 indicates that the program should output all integers less than or equal to 100, so the program outputs 50, 60, and 75. For coding simplicity, follow every output value by a space, including the last one. import java.util.Scanner; public class LabProgram {public static void main(String[] args) {Scanner scnr = new Scanner(System.in);int[] userValues = new int[20]; // List of integers from input
It's a very nice application of stacks. Consider that a freight train has n railroad cars. Each to be left at different station. They're numbered 1 through n & freight train visits these stations in order n through 1. Obviously, the railroad cars are labeled by their destination. To facilitate removal of the cars from the train, we must rearrange them in ascending order of their number (i.e. 1 through n). When cars are in this order, they can be detached at each station. We rearrange cars at a shunting yard that has input track, output track & k holding tracks between input & output tracks (i.e. holding track). The figure shows a shunting yard with three holding tracks H1, H2 & H3, also n = 9. The n cars of freight train begin in the input track & are to end up in the output track in order 1 through n from right to left. The cars initially are in the order 5,8,1,7,4,2,9,6,3 from back to front. Later cars are rearranged in desired order. To rearrange cars, we…
Write a Java program to implement a stack using an array. The program should have methods to push an element onto the stack, pop an element from the stack, and check if the stack is empty. Additionally, implement a method to return the size of the stack. Provide an explanation of the code and its time and space complexity.
Need help with this Java problems. Java files are attached. Add your code to the file ArrayStack2Lab.java. Add your tests to the main() method. Submit ArrayStack2Lab.java. Problem 1 Implement the method public void display() which displays the entries in a stack starting from the top. If the stack is empty, print “The stack is empty”. Add the method to ArrrayStack2Lab.java. You do not need to modify StackInterface.java. Problem 2 Implement the method public int remove(int n) The method removes the n top most entries for a stack . If the stack contains less than n items, the stack becomes empty. The method returns the number of items removed. Add the method to ArrrayStack2Lab.java. You do not need to modify StackInterface.java.
THIS IS IN JAVA Write a program that first gets a list of integers from input. The input begins with an integer indicating the number of integers that follow. Assume that the list will always contain fewer than 20 integers. That list is followed by two more integers representing lower and upper bounds of a range. Your program should output all integers from the list that are within that range (inclusive of the bounds). For coding simplicity, follow each output integer by a comma, even the last one. The output ends with a newline. Ex: If the input is: 5 25 51 0 200 33 0 50 then the output is: 25,0,33, (the bounds are 0-50, so 51 and 200 are out of range and thus not output). To achieve the above, first read the list of integers into an array. Please write code.
Write a Java program that generates randomly a list of N integers, sorts the generated list using each of the three sorting algorithms: mergesort sort, quicksort that use the first element as a pivot, and quicksort that use the middle element as pivot and prints as output the execution time for each of the algorithms for randomly generate lists of size N = 40000, 100000 and 200000 and sorted lists as shown in the table.
Java programming homework please help
Write a program for Stack (Array-based or linked list-based) in Python. Test the scenario below with the implementation and with the reasoning of the answer. Make comments with a short description of what is implemented. Include source codes and screen-captured outputs. Stack: A letter means doing a push operation and an asterisk means doing a pop operation in the below sequence. Give the sequence of letters that are returned by the pop operations when this sequence of operations is performed on an initially empty stack. A*BCE**F*GH***I*
Write a Java program and screenshot of the output using Stack class to show the following points: a. Create three empty stacks named stackOne, stackTwo and stackThree respectively. b. Push the numbers [a, b, c, d] "for example [7, 5, 8, 22]" into stackOne and [w, x, y, z] "for example [5, 4, 2, 11]” into stackTwo. (Note: value of the numbers [a,b,c,d, etc] for each of the student should be different) c. Pop the top number of stackOne and top number of stackTwo and add them. Then, push the addition result into stack Three. d. Pop the top number of stackOne and top number of stackTwo and subtract them. Push the result of subtraction into stackThree. e. Print StackOne, stackTwo and stackThree. f. Print the largest number in stack Three
JAVA: Write a recursive method named threeSum that accepts a list of integers and prints all combinations of three integers in the list that sum to 0. For example, if given the list [-1, 0, 1, 2, -1, -4], print the following lines of output: [-1, 0, 1] [-1, 2, -1] [0, 1, -1] You may print the lines of output in any order. The elements in each three-element sublist should appear in the same relative order that they appeared in the original list. Do not print duplicate lists; if the same exact sublist can be made in multiple ways, print it only once. If there are no combinations of three elements that sum to 0, print no output. The list passed to your method must be back to its original state at the end of the call. Either do not modify it, or if you modify it, fully undo your modifications before the method returns. Constraints: Do not declare any global variables. You can use any data structures you like, and your code can contain loops, but the overall algorithm must be recursive and…