Make a flowchart of the code below. Ps. I am using Java as my programming language. Multiplication table using nested for loop1.public class Multiplication_Table6{2.public static void main (String args[]){3.System.out.print("Multiplication table'n"):4.for(int i=1; i<=10; i++){for(int j=1; j<=10; j++){5.6.System.out.print(i*j+"\t");7.}8.System.out.println();9.10.}11.}12.

public class Multiplicaton_Table6{ public static void main(String[] args){…

Answered: Make a flowchart of the code below.…

Engineering

Computer Science

Make a flowchart of the code below. Ps. I am using Java as my programming language.

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

Similar questions

Rewrite the private static int recurseMax method without using Java API public class Recursion{   public static void main(String[] args){       // My tests (DO NOT MODIFY!)       int[] a = {3,2,6,4,15,7,9,8,6};       p(recurseSum(a));               // Sum should be 60       p(recurseMax(a));               // Max should be 15       // End of tests!   }     // Recursive methods below here...   public static int recurseSum(int[] a){       // TODO: This is the wrapper method. You must complete this AND implement helper method       int total = recurseSum(a, a.length);       return total;   }   private static int recurseSum(int[] a, int i){       if (i <= 0)            return 0;        return (recurseSum(a, i - 1) + a[i - 1]);   }     public static int recurseMax(int[] a){             int max = recurseMax(a, a.length);       return max;   }   private static int recurseMax(int[] a, int i){       if(i == 1)           return a[0];       return Math.max(a[i-1], recurseMax(a, i-1));   }   //…
Complete the private combinations method. Modify the code so that it is possible to compute combinations(“ABCD”,2) with fewer than 20 calls and combinations(“ABCDE”,3) with fewer than 30 calls. import static org.junit.Assert.*; import java.util.ArrayList; import org.junit.Test; /** * Recursive computation of all combinations of k characters from a string s. * */public class Combinations { private static int recusiveCalls = 0; /** * Generate all combinations of the characters in the string s with length * k. *   * @param s * a string. * @param k * the length of the combinations * @return a list of all of the combinations of the strings in s. */ public static ArrayList<String> combinations(String s, int k) { return combinations("", s, k); } /** * Recursive Problem Transformation: *   * Generate all combinations of length k of the characters in rest prefixed * with the characters in…
I need help with fixing this java program as described in the image below: LablProgram.java: import java.util.Scanner; public class LabProgram {    /* TODO: Write recursive printLinkedList() method here. */       public static void main(String[] args) { Scanner scnr = new Scanner(System.in); int size; int value;     size = scnr.nextInt(); value = scnr.nextInt(); IntNode headNode = new IntNode(value); // Make head node as the first node IntNode lastNode = headNode; // Node to add after IntNode newNode = null; // Node to create     // Insert the second and the rest of the nodes for (int n = 0; n < size - 1; ++n) { value = scnr.nextInt(); newNode = new IntNode(value); lastNode.insertAfter(newNode); lastNode = newNode; }     // Call printLinkedList() with the head node printLinkedList(headNode); }} intNode.java: public class IntNode { int dataVal; private…
For any element in keysList with a value greater than 40, print the corresponding value in itemsList, followed by a semicolon (no spaces). Ex: If the input is: 32 105 101 35 10 20 30 40 the output is: 20;30; import java.util.Scanner; public class Compare { public static void main(String args[]) {final int SIZE_LIST = 4;int[] keysList = new int[SIZE_LIST];int[] itemsList = new int[SIZE_LIST];int i;Scanner input = new Scanner(System.in); keysList[0] = input.nextInt();keysList[1] = input.nextInt();keysList[2] = input.nextInt();keysList[3] = input.nextInt(); itemsList[0] = input.nextInt();itemsList[1] = input.nextInt();itemsList[2] = input.nextInt();itemsList[3] = input.nextInt(); /* Your code goes here */ System.out.println();} }
Complete the isPalindrome method to recursively determine whether the parameter str is a palindrome. import java.util.*; public class PalindromeDetector{ public static boolean isPalindrome(String str){ /*********************************** WRITE THIS METHOD **********************************/ return false; //temporary statement to allow compilation } public static void main(String[] args){ List<String> allWords = new ArrayList<String>(); Scanner input = new Scanner(System.in); System.out.println("Enter a string, 0 to quit"); String str = input.nextLine(); while (!str.equals("0")){ allWords.add(str); System.out.println("Enter a string, 0 to quit"); str = input.nextLine(); } List<String> palindromes = new ArrayList<String>(); for (String test : allWords) { if (isPalindrome(test.toUpperCase())){ palindromes.add(test); } } Collections.sort(palindromes); if (!palindromes.isEmpty()){ System.out.println("Your palindromes are:");…
For any element in keysList with a value smaller than 50, print the corresponding value in itemsList, followed by a space. Ex: If the input is: 32 105 101 35 10 20 30 40 the output is: 10 40 import java.util.Scanner; public class Compare { public static void main(String args[]) { final int SIZE_LIST = 4; int[] keysList = new int[SIZE_LIST]; int[] itemsList = new int[SIZE_LIST]; int i; Scanner input = new Scanner(System.in); keysList[0] = input.nextInt(); keysList[1] = input.nextInt(); keysList[2] = input.nextInt(); keysList[3] = input.nextInt(); itemsList[0] = input.nextInt(); itemsList[1] = input.nextInt(); itemsList[2] = input.nextInt(); itemsList[3] = input.nextInt(); //answer// System.out.println(); } }
For any element in keysList with a value greater than 50, print the corresponding value in itemsList, followed by a comma (no spaces). Ex: If the input is: 32 105 101 35 10 20 30 40 the output is: 20,30, mport java.util.Scanner; public class Compare { public static void main(String args[]) {final int SIZE_LIST = 4;int[] keysList = new int[SIZE_LIST];int[] itemsList = new int[SIZE_LIST];int i;Scanner input = new Scanner(System.in); keysList[0] = input.nextInt();keysList[1] = input.nextInt();keysList[2] = input.nextInt();keysList[3] = input.nextInt(); itemsList[0] = input.nextInt();itemsList[1] = input.nextInt();itemsList[2] = input.nextInt();itemsList[3] = input.nextInt(); /* Your code goes here */ System.out.println();} }
import java.util.*;class Arraylist{public static void main(String args[]){ArrayList obj = new ArrayList();obj.add("A");obj.add("B");obj.add("C");obj.add(1, "D");System.out.println(obj);}} What will the given code prints on the output screen.
import java.util.Arrays; import java.util.Random; public class Main { public void Start(){ int[] array = {3, 6, 1, 4, 2, 9, 7, 8, 5, 0}; int key = 1; Arrays.sort(array); //sort array int result = binarySearch(array,key); //Print values in array after sort System.out.println(result); } int binarySearch(int arr[], int key){ // put your code here. } public static void main(String[] args) { Main main = new Main(); main.Start(); } } --------------------------------------------------------------------------------------------------------------------------------------------------------- Given a sorted array named arr of n elements, write a function to search for a given element x in arr. If the element is present, return the index of x in the array. If the element is not present, return -1. Don't forget that arrays are 0-base-indexed, meaning that the first element in…
Write Java statements to add the integers 1001, 1100, and 1110 to the resulting ArrayList import java.util.*;public class test { public static void main(String[] args) { //Set n =25 int n = 25; //ArrayList of Integer type with size,n=25   ArrayList<Integer> list = new ArrayList<Integer>(n);   for(int i = 0;i<n;i++){ //Assign -1 to all the objects of the array list,list list.add(-1); }     //Add 1001 to the list list.add(1001); //Add 1100 to the list list.add(1100); //Add 1110 to the list list.add(1110); //Reset the number of elements in the list becomes 28 //Use size() method to get the size of the list. n=list.size(); //for loop to print the list for(int i = 0;i<n;i++){ System.out.print(list.get(i) + " "); } }} 1. Write the Java statement to display the size of the resulting ArrayList from above.
JAVA In order to compute a power of two, you can take the next-lower power and double it. For example, if you want to compute 2^11 and you know that 2^10=1024, then 2^11=2×1024=2048. Write a recursive method public static int pow2(int n) where n is the exponent, that is based on this observation. If the exponent is negative, return -1. import java.util.Scanner; public class PowerTwo{ public static int pow2(int n) { /* code goes here */ }    public static void main(String[] args) { Scanner in = new Scanner(System.in); while (in.hasNextInt()) { int exponent = in.nextInt(); System.out.println(pow2(exponent)); }    }}
Beginner Java import java.util.Arrays;import java.util.Scanner; Arrays and scanner required. Suppose that a Scanner object contains a bunch of tokens all on a single line separated by spaces. For example:               100.5 65 pizza 100 45.75 70 5.8 5 Also suppose that you have two integers n and m that are both positive. For example: n = 5 and m = 10 Write a static method: public static double partialSum(Scanner s, int n, int m) that takes a Scanner and two integers n and m as arguments and returns the sum of the integers read by the Scanner that are divisible by n and not divisible by m. In the above example, the integers divisible by 5 and not divisible by 10 are 65 and 5, so the result would be 70. If the Scanner is empty, or no tokens are valid integers, the result should be 0. You can assume the Scanner is not null. It is probably easiest to test your method by creating a Scanner with a String instead of System.in. The starter code for an example of how to do this is…