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

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter18: Stacks And Queues

Section: Chapter Questions

Problem 16PE: The implementation of a queue in an array, as given in this chapter, uses the variable count to...

See similar textbooks

Similar questions

Write a non-recursive Java method for printing all permutations of the numbers {1,2, ..., n}Hint: use an explicit stackpublic class QueueByStack<E> {Stack<E> a = new Stack<>();Stack<E> b = new Stack<>(); public int size() {//write code here} public boolean isEmpty() {//write code here} public void eneque(E e) {//write code here} public E deque() {//write code here} public E first() {//write code here} @Overridepublic String toString() {//write code here}}
Write a java code that sorts a list of n items by dividing it into three sublistsof about n/3 items, sorting each sublist recursively and merging the threesorted sublists. Analyze your algorithm, and give the results under ordernotation.
Consider class IntArrayStack that has two instance variables: int[] data and int top. Implement an instance method inside the IntArrayStack, called popBottom(),that extracts and returns as output the element at the bottom of the stack. All other elements in the stack must remain unchanged and in the same order.
Write a Java program that allow the user 1.Implement a queue in an array2. Enter the following number 3,4,6,7,2,1,0) in the queue 3. Reverse the queue element using a stack to display them in this order (i.e. 0,1,2,7,6,4,3).
For given two sorted stacks (of integer type) A (maximum value on top) and B (minimum value on top), write a Java method that creates a stack that is sorted (minimum value on top). Allowable stack operations are pop(), push(), size() and top(). Using arrays is not allowed.
Write a java program which follows conditions written below: Consisting of four (4) book titles entered by the user. Pop the stack's elements one by one; each popped element will be added to a queue. Then, print the content of the queue. Input: Enter four book titles. Book 1: Ibong Adarna Book 2: Florante at Laura Book 3: Ilustrado Book 4: ABNKKBSNPLAko?! Expected Output: New order of books: [ABNKKBSNPLAko?!, Ilustrado, Florante at Laura, Ibong Adarna]
Write a java program that allows the user: 1- Implement a queue in an array. 2- Enter the following numbers 3,4,6,7,2,1,0 in the queue. 3- Reverse the queue elements using a stack to display them in this order (i.e. 0,1,2,7,6,4,3).
Write a program in Java to implement a Singly linked list with two fields: String name and Integer Age. a) Then, Program ask user to enter name and age of a student, and add the node in the link list b) Store name and age of 5 students c) Then, traverse the link List to print all the nodes
The implementation of a queue in an array, as given in this chapter, uses the variable count to determine whether the queue is empty or full. You can also use the variable count to return the number of elements in the queue. On the other hand, class linkedQueueType does not use such a variable to keep track of the number of elements in the queue. Redefine the class linkedQueueType by adding the variable count to keep track of the number of elements in the queue. Modify the definitions of the functions addQueue and deleteQueue as necessary. Add the function queueCount to return the number of elements in the queue. Also, write a program to test various operations of the class you defined.
Apply the methods in the ListIterator interface to write a Java program in NetBeans that creates a LinkedList of four elements of type string, namely: Java, C#, PHP and Python.The program should then print out the elements initially in the original order, and then afterwards in reverse order using the ListIterator methods. In this case, the following is the expected output: Run: original order of strings: Java C# PHP Python Reverse order of strings: Python PHP C#Java BUILD SUCCESSFUL
Apply the methods in the ListIterator interface to write a Java program in NetBeans that creates a LinkedList of four elements of type string, namely: Java, C#, PHP and Python. The program should then print out the elements initially in the original order, and then afterwards in reverse order using the ListIterator methods. In this case, the following is the expected output:
Write a JAVA program that will maintain a phone directory using a Linked-List. The program should be able to perform the following operations: 1) Add persons details (first name, last name, phone number, city, address, sex and email) to the phone directory, where phone numbers in the directory have to be unique. (Note: each person record will store in one node in the linked-list and insert each person to the last) 2) Delete any person details by a given phone number. 3) Update telephone number by providing person first name. 4) Display all details of persons from a phone directory. 5) Search telephone number based on person first name. (Note: use sequential search to find all telephones for the given first name) 6) Sort all persons in the phone directory ascending based on person first name. (Note: use bubble or selection sort to arrange the entire phone directory) Project Outputs The output has to display a menu of choices. Then the user can select which operation want to perform.…