2. Suppose an Array based global Stack is implemented with a given maxSize. User is going to give a “lucky_number". Write a method 'int popNonLucky(int lucky_number)' which is going to pop all numbers except luck number. Finally, the Stack needs to be compact so that only luck_number present(s) in Stack. And the method should return total lucky_numbers found.

2. Suppose an Array based global Stack is implemented with a given maxSize. User is going to give a “lucky_number". Write a method 'int popNonLucky(int lucky_number)' which is going to pop all numbers except luck number. Finally, the Stack needs to be compact so that only luck_number present(s) in Stack. And the method should return total lucky_numbers found.

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

create a generic array stack and push/pop a million random ints using java.util.Random class. you also want to detect the time it takes to push and pop elements from the stack and you need to run the test multple times to see how the running time grows with increasing number of operations. use a outer loop that runs the program a million times (e.g. for(int i = 1; i<1000000; i+=1000000)).
Write a recursive function that finds the minimum value in an ArrayList. Your function signature should be public static int findMinimum(ArrayList<Integer>) One way to think of finding a minimum recursively is to think “the minimum number is either the last element in the ArrayList, or the minimum value in the rest of the ArrayList”. For example, if you have the ArrayList [1, 3, 2, 567, 23, 45, 9], the minimum value in this ArrayList is either 9 or the minimum value in [1, 3, 2, 567, 23, 45] Hint:The trick is to remove the last element each time to make the ArrayList a little shorter. import java.util.*; public class RecursiveMin{public static void main(String[] args){Scanner input = new Scanner(System.in);ArrayList<Integer> numbers = new ArrayList<Integer>();while (true){System.out.println("Please enter numbers. Enter -1 to quit: ");int number = input.nextInt();if (number == -1){break;}else {numbers.add(number);}} int minimum =…
Write a recursive function that finds the minimum value in an ArrayList. Your function signature should be public static int findMinimum(ArrayList<Integer>) One way to think of finding a minimum recursively is to think “the minimum number is either the last element in the ArrayList, or the minimum value in the rest of the ArrayList”. For example, if you have the ArrayList [1, 3, 2, 567, 23, 45, 9], the minimum value in this ArrayList is either 9 or the minimum value in [1, 3, 2, 567, 23, 45] ================================================ import java.util.*; public class RecursiveMin{public static void main(String[] args){Scanner input = new Scanner(System.in);ArrayList<Integer> numbers = new ArrayList<Integer>();while (true){System.out.println("Please enter numbers. Enter -1 to quit: ");int number = input.nextInt();if (number == -1){break;}else {numbers.add(number);}} int minimum = findMinimum(numbers);System.out.println("Minimum: " + minimum);}public static int…
Use an array and two index variables. Write functions or methods push, pop, and sizeof. Then write a main function or method that will allocate the stack at n=10 and push some strings in ii, print out the size, and then pop some strings from it. Note make stack be be able to hold string variable type. java
Write a program which should implement a circular queue using static array of size 10 (10 elements array), elements of array should be of integer (int) type. User will input values to be inserted at rear of circular queue (enqueue) and also number of elements to be removed from front of circular queue (dequeue). Your program should display the value of elements which are being removedfrom circular queue. Program should also calculate and display the average of elements which have been removed from circular queue. Implement the task using template class
Write a method that takes as parameters two sorted stacks of integers s1 and s2 (where the lowest value is at the top) and returns a sorted stack (lowest on top) that contains the values of both s1 and s2. You are allowed to use only the stack operations such as pop, push, and top. You are allowed to use only stacks as temporary storage. No other data structures such as arrays are allowed. The header of the method is: public static Stack mergeSortedStacks (Stack s1, Stack s2) Write a main method in which you create two sorted stacks and call the above method to test it.
Write a function that takes a string of words as an input, uses a stack to reverse the words and returns the reversed stringFor instance, if the user were to input “stacks are fun”, the function wouldreturn “fun are stacks”. Make sure you call the function to test it
Implement a simple stack in java using the scenario below. A company wishes to keep track of the order in which it employed staff. Users can enter either "f" to fire, "h" to hire or "e" to end the program. When a member of staff is employed, their employee number is added to the top of a stack when someone has to be made redundant, the last person to join the company is removed from the top of the stack. Hint: Use ArrayList
Write a method moveUp for the ArrayBoundedStack class. The method has a parm named item (type T). moveUp finds the first occurrence of item (the occurrence closest to the top of the ti ww stack) and moves it to the top. Throw NoSuchElementException if item is not in the stack. DO NOT USE ANY METHODS OF THE STACK CLASS. For example, here is the before and after if item is "blue". "red" "blue" "green" "red" before: "purple" after: "green" "purple" "yellow" "blue" "yellow" "blue" "blue"
Write a program that prompts the user to enter an integerm and find the smallest integer n such that m * n is a perfect square. (Hint:Store all smallest factors of m into an array list. n is the product of the factors thatappear an odd number of times in the array list. For example, consider m = 90,store the factors 2, 3, 3, and 5 in an array list. 2 and 5 appear an odd number oftimes in the array list. Thus, n is 10.) Here are some sample run: Enter an integer m: 1500 ↵EnterThe smallest number n for m * n to be a perfect square is 15m * n is 22500
A Java Program Write a method called samePosition in a class called StackExt that receives two parameters st1 and st2 of type ArrayStack and a third parameter pos of type int. The method returns true, if stack st1 and st2 contains the same value in position pos. Otherwise, the method returns false. Assume that both stacks st1 and st2 contain same number of elements. Assume that the position of the top element is 0 and increases by 1 for each subsequent element. The elements of both stacks st1 and st2 must remain in the original relative positions in the stacks at the end of the method. Use common stack operations only such as push, pop, peek, isEmpty, constructor and copy constructor. You can create temporary objects of type ArrayStack in your method. Example: top st1: 4 5 3 10 8 st1: 5 9 4 10 1 If the pos is 3, then both stacks contain 10 in position 3. The method returns true. If the pos is 1, then st1 contains 5 and st2…
You are given an array-like data structure Listy which lacks a size method. It does, however, have an elementAt ( i) method that returns the element at index i in 0( 1) time. If i is beyond the bounds of the data structure, it returns -1. (For this reason, the data structure only supports positive integers.) Given a Listy which contains sorted, positive integers, find the index at which an element x occurs. If x occurs multiple times, you may return any index. Write code with explanation