Javadont use others answers pleasefollow the directions on the photo 1. For a given integer n> 1, the smallest integer d > 1 that divides n is a primefactor. We can find the prime factorization of n if we find d and then replace nby the quotient of n divided by d, repeating this until n becomes 1. Write a javaprogram that uses a stack to print the prime factors of a positive integer indescending order. For example, for n = 3960, your program should produce11 * 5 * 3 * 3 * 2* 2 * 2

The given problem is related to programming that needs to be solved using Java. The program will…

1. For a given integer n> 1, the smallest integer d > 1 that divides n is a prime factor. We can find the prime factorization of n if we find d and then replace by the quotient of n divided by d, repeating this until n becomes 1. Write a javo program that uses a stack to print the prime factors of a positive integer in descending order. For example, for n = 3960, your program should produce

1. For a given integer n> 1, the smallest integer d > 1 that divides n is a prime factor. We can find the prime factorization of n if we find d and then replace by the quotient of n divided by d, repeating this until n becomes 1. Write a javo program that uses a stack to print the prime factors of a positive integer in descending order. For example, for n = 3960, your program should produce

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 program that reads 10 integers anddisplays them in the reverse of the order in which they were read. If two consecutivenumbers are identical, then only display one of them. Implement yourprogram using only stack and not arrays or queues.
Im trying to figure out a java homework assignment where I have to evaluate postfix expressions using stacks and Stringtokenizer as well as a isNumber method. when I try to run it it gives me an error. this is the code I have so far: static double evaluatePostfixExpression(String expression){ // Write your code Stack aStack = new Stack(); double value1, value2; String token; StringTokenizer tokenizer = new StringTokenizer(expression); while (tokenizer.hasMoreTokens()) { token = tokenizer.nextToken(); if(isNumber(expression)) { value1 = (double)aStack.pop(); value2 = (double)aStack.pop(); if (token.equals("+")) { aStack.push(value2+value1); } else if (token.equals("-")) { aStack.push(value2-value1); } else if (token.equals("*")) { aStack.push(value2*value1); } else if (token.equals("/")) { aStack.push(value2/value1); } } }…
Given a stack of positive integers, write a Java method called movePrimes that rearranges elements of the stack such that all prime numbers are below none primes regardless to the order of primes. Note: You are allowed to create only one other stack. You can not use other data structures such as array, arraylist, queue, ....etc. Consider the following example:
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.
Write a program that uses a stack to test input strings to determine whether theyare palindromes. A palindrome is a sequence of words that reads the same as thesequence in reverse: for example, noon. Use this Python Example : class Stack:'''TODO: Remove the "pass" statements and implement each methodAdd any methods if necesssaryDON'T use any builtin stack class to store your items'''def __init__(self): # Constructor functionpassdef isEmpty(self): # Returns True if the stack is empty or False otherwisepassdef len(self): # Returns the number of items in the stackpassdef peek(self): # Returns the item at the top of the stackpassdef push(self, item): # Adds item to the top of the stackpassdef pop(self): # Removes and returns the item at the top of the stackpassdef palindrome(input_str):isPalindrome = False#TODO: Your work here# Return if input_str is palindrome or notreturn isPalindromeif __name__ == "__main__":my_str = "noon"print(palindrome(my_str)) # Correct Output: True#TODO…
Please solve this problem in Java. It should read the elements of the stack as integers from a text file. n = 18 (number of elements/integers)
Use a stack to reverse the words of a sentence. Keep reading words until you have a word that ends in a period, adding them onto a stack. When you have a word with a period, pop the words off and print them. Stop when there are no more words in the input. For example, you should turn the inputMary had a little lamb. Its fleece was white as snow.intoLamb little a had mary. Snow as white was fleece its.Pay attention to capitalization and the placement of the period. This is what I have so far: import java.util.Scanner;import java.util.Stack; /** Class for reversing the order of a sentence.*/public class SentenceReverser{ /** Reverses the given sentence. @param sentence Sentence to be reversed. @return Reversed sentence. */ public static String reverse(String sentence) { String reversed = ""; Scanner scanner = new Scanner(sentence); Stack<String> stack = new Stack<String>(); // put your work below // ... return…
java /* Practice Stacks and ourVector Write a java program that creates a stack of integers. Fill the stack with 30 random numbers between -300 and +300. A)- With the help of one ourVector Object and an additional stack, reorganize the numbers in the stack so that numbers smaller than -100 go to the bottom of the stack, numbers between -100 and +100 in the middle and numbers larger than +100 in the top (order does not matter) B)- (a little harder) Solve the same problem using only one ourVector object for help C)- (harder) Solve the same problem using only one additional stack as a helper */ public class HWStacks { public static void main(String[] args) { // TODO Auto-generated method stub } }
Write a program that prompts the user to enter apositive integer and displays all its smallest factors in decreasing order. Forexample, if the integer is 120, the smallest factors are displayed as 5, 3, 2, 2,2. Use the StackOfIntegers class to store the factors (e.g., 2, 2, 2, 3, 5) andretrieve and display them in reverse order.
Write a program that reads a list of integers from input and identifies the mode (the value that appears most often). The input is a sequence of integers that ends with -1. Total number of integers in the list is unknown. Output the mode and end with a newline. Assume that the list is not empty and only one mode exists. Ex: If the input is: 5 9 2 -3 -5 -3 2 1 4 5 5 -1 the output is: 5 import java.util.Scanner; import java.util.ArrayList; public class LabProgram { public static void main(String[] args) { Scanner scnr = new Scanner(System.in); /* Type your code here. */ }}
Answer the given question with a proper explanation and step-by-step solution. Hello team, Need some help with problems below using the langauge JAVA. I need to modify the CalcParser class provided below. I need this to produce a string containing commands to evaluate the expression on a stack machine. For example, if you give the command java CalcParser 1+2*3, the output should be a sequence of stack commands such as this: push 1.0 push 2.0 push 3.0 multiply add 7.0 For the command java CalcParser (1+2)*3, on the other hand, it should print a sequence like this: push 1.0 push 2.0 add push 3.0 multiply 9.0 CODE:public class CalcParser { private CalcLexer lexer; private String errorMessage = null; private double value; public CalcParser(String s) { lexer = new CalcLexer(s);errorMessage = lexer.getErrorMessage();if (errorMessage != null) return; value = parseExpression();if (errorMessage != null) return; match(CalcLexer.EOLN_TOKEN);if (errorMessage != null) return; } public String…
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…