(Algebra: perfect square) Write a
Enter an integer m: 1500
The smallest number n for m * n to be a perfect square is 15
m * n 1s 22500
Enter an integer m: 63
The smallest number n for m * n to be a perfect square is 7
m * n is 441
Want to see the full answer?
Check out a sample textbook solutionChapter 11 Solutions
Introduction to Java Programming and Data Structures, Comprehensive Version (11th Edition)
Additional Engineering Textbook Solutions
C How to Program (8th Edition)
Web Development and Design Foundations with HTML5 (8th Edition)
Java: An Introduction to Problem Solving and Programming (7th Edition)
Digital Fundamentals (11th Edition)
Java How to Program, Early Objects (11th Edition) (Deitel: How to Program)
Introduction To Programming Using Visual Basic (11th Edition)
- 7). (Sum ArrayList) Write the following method that returns the sum of all numbers in an ArrayList: public static double sum(ArrayList<Double> list) Note:- Please write a java code and also need an output for this program. (Also, let me know with what name file should be saved to get output)arrow_forwardAnswer in C++ Programming Language. C++, Array Write a program that will ask the user to enter a set of numbers and outputs all the subsets of that set. The size of the array is 5. Ask the user if he wants to repeat the program by pressing y/Y.arrow_forward(Maximum element in an array) Implement the following method that returns the maximum element in an array . public static > E max (E[] list) Write a test program that prompts the user to enter 10 integers, invokes this method to find the max. Sample Run Enter 10 integers: 3 4 12 7 3 4 5 6 4 7 The max number is 12arrow_forward
- Indicate true or false for the following statements: Every element in an array has the same type. The array size is fixed after it is declared. The array size declarator must be a constant expression. The array elements are initialized when an array is declared.arrow_forwardComplete my C++ program: Instructions: You have to continue on implementing your Array List namely the following functions: Example ArrayList: [10, 30, 40, 50] void addAt(int num, int pos) This method will add the integer num to the posth position of the list. Performing addAt(20, 2) in the example list will add 20 at the 2nd position and the array will now look like this: [10, 20, 30, 40, 50] When the value of pos is greater than the size + 1 or less than one, output "Position value invalid" void removeAt(int pos) Removes the number in the posth position of the list. Performing removeAt(3) in the example list will remove the 3rd element of the list and the updated array will be: [10, 30, 50] When the value of pos is greater than the size or less than one, output "Position value invalid" void removeAll(int num) Removes all instances of num in the array list. In this array [10, 10, 20, 30, 10], performing removeAll(10) will remove all 10's and the list will look like this: [20,…arrow_forward(Maximum element in an array) Implement the following method that returns the maximum element in an array . public static > E max (E[] list) Write a test program that prompts the user to enter 10 integers, invokes this method to find the max.arrow_forward
- Q2: Write a C# program that read an array A(4x4) of float numbers, and do the following: 1- Print the average of prime numbers in the overall array. 2- Print the summation of odd numbers in the even column and even numbers in the odd row. 3- Replace the first row with the last row and print the new array row by row. Don't use class or functions.arrow_forwardDo the following in the most efficient way possible in C Language: 1. Take an Array of 10 integer values (automatically should be converted to ascending order). 2. Insert Values - Value should be inserted automatically as per the ascending order. If array is {1,7,28,45,67,81} and the user inserts 31; the program should automatically insert at the 3rd index and array size should increase by 1. 3. Delete Values by Range - the user will be asked to two indexes (<sizeofArray) and all values in between those indexed should be deleted. E.g. If array is {1, 7, 28, 45, 67,81} and user enters the indexes 2,4. Then the values 28, 45, 67 should be deleted.arrow_forwardDo the following in the most efficient way possible in C Language: 1. Take an Array of 10 integer values (automatically should be converted to ascending order). 2. Insert Values - Value should be inserted automatically as per the ascending order. If array is {1,7,28,45,67,81} and the user inserts 31; the program should automatically insert at the 3rd index and array size should increase by 1. 3. Delete Values by Range - the user will be asked to two indexes (<sizeofArray) and all values in between those indexed should be deleted. E.g. If array is {1, 7, 28, 45, 67,81} and user enters the indexes 2,4. Then the values 28, 45, 67 should be deleted. Note: If at any time, the array becomes unsorted, then; some values need to be deleted at runtime to make the array sorted again. At any given time, the array shouldn't be unsorted. Please do not use Pointers and only use Array as a Data Structure.arrow_forward
- Q1: Write a program in Java that reads 10 integers and store them in AN ArrayList. Then, do the following : a) Print the ArrayList in the reverse order b) Sort the ArrayList, and display the data after sorting c) Print the largest and the smallest element in the ArrayListarrow_forwardExample: - Write a program that reads from the user an array with one dimension n and sort the numbers inside the array in descending order.arrow_forwardWrite a recursive function named “oddRec” that takes the address of the array and the number of elements as a parameter and returns the number of odd numbers in the array. (Do not use global variable)arrow_forward
- Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill EducationStarting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSONDigital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
- C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSONDatabase Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage LearningProgrammable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education