Given the array list of primes below, write a loop to print its elements in reverse order, starting with the last element. Place a space after every element. PrimesDemo.java 1 import java.util.ArrayList; 2 3 public class PrimesDemo 4 { public static void main(String[] args) { ArrayList primes = new ArrayList<>(); primes.add(2); primes.add(3); primes.add(5); primes.add(7); primes.add(11); 6 7 8 9 10 11 12 13 14 for (. .) 15 System.out.print(. . .); } System.out.println(); } 16 17 18 19

Given the array list of primes below, write a loop to print its elements in reverse order, starting with the last element. Place a space after every element. PrimesDemo.java 1 import java.util.ArrayList; 2 3 public class PrimesDemo 4 { public static void main(String[] args) { ArrayList primes = new ArrayList<>(); primes.add(2); primes.add(3); primes.add(5); primes.add(7); primes.add(11); 6 7 8 9 10 11 12 13 14 for (. .) 15 System.out.print(. . .); } System.out.println(); } 16 17 18 19

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

using arrays or Arraylist in java language Write the method named nOdds().* * Given an ArrayList of positive Integers, return a new list * of length "count" containing the first odd numbers from * the original list. The original will contain at least * "count" odd numbers.* * Examples:* nOdds([3, 2, 4, 5, 8], 2) returns [3, 5]* nOdds([3, 2, 4, 5, 8, 9], 3) returns [3, 5, 9]* nOdds([3, 1, 2, 4, 5, 8], 3) returns [3, 1, 5]* * @param list the ArrayList of Integers to search.* @param count the number of odd numbers to copy.* @return the first "count" odd numbers from the list.*/// TODO - Write the nOdds method here. // A utility method for testing@SuppressWarnings("unchecked")public static <T> ArrayList<T> al(T...o){ArrayList<T> result = new ArrayList<T>();for (T s : o) result.add(s);return result;}
using arrays or Arraylist in Java language Write the method filterBySize().* * Given an ArrayList of String, return a new list where only * strings of the given length are retained.* * Examples:* filterBySize(["a", "bb", "b", "ccc"], 1) returns ["a", "b"]* filterBySize(["a", "bb", "b", "ccc"], 3) returns ["ccc"]* filterBySize(["a", "bb", "b", "ccc"], 4) returns []* * @param list the list of Strings to process.* @param n the size of words to retain.* @return a new list of words with the indicated size retained.
Write a program in java that randomly fills in 0s and 1s into an n-by-n matrix, prints the matrix, and finds the rows and columns with the most 1s. (Hint: Use two ArrayLists to store the row and column indices with the most 1s.)
Given an ArrayList of integers, return an ArrayList where all the odds are before the evens in the order that they occur. import java.util.ArrayList;public class EvenAfterOdds{public static ArrayList<Integer> solution(ArrayList<Integer> nums){// ↓↓↓↓ your code goes here ↓↓↓↓return new ArrayList<>();}}
Using arrays or ArrayList in java language Write the method named mesh.* * Start with two ArrayLists of String, A and B, each with * its elements in alphabetical order and without any duplicates. * Return a new list containing the first N elements from the two * lists. The result list should be in alphabetical order and without * duplicates. A and B will both have a size which is N or more. * Your solution should make a single pass over A and B, taking * advantage of the fact that they are in alphabetical order, * copying elements directly to the new list.* * Remember, to see if one String is "greater than" or "less than" * another, you need to use the compareTo() method, not the < or > * operators. * * Examples:* mesh(["a","c","z"], ["b","f","z"], 3) returns ["a","b","c"]* mesh(["a","c","z"], ["c","f","z"], 3) returns ["a","c","f"]* mesh(["f","g","z"], ["c","f","g"], 3) returns ["c","f","g"]* * @param a an ArrayList of String in alphabetical order.* @param b an ArrayList of…
java In this assignment you will swap a position in an array list with another. swap() gets 3 arguments, an Arraylist, a position, and another position to swap with. Example swap(["one","two","three"],0,2) returns:["three","two","one"] public static ArrayList<String> swap(ArrayList<String> list,int pos1,int pos2) public static void main(String[] args) { Scanner in = new Scanner(System.in); int size = in.nextInt(); int pos1 = in.nextInt(); int pos2 = in.nextInt(); ArrayList<String> list = new ArrayList<>(); for(int i=0; i < size; i++) { list.add(in.next()); } System.out.println(swap(list, pos1, pos2)); } }
Using JAVA, write a method that modifies an ArrayList<String>, moving all strings starting with an uppercase letter to the front, without otherwise changing the order of the elements. Write a test program to demonstrate the correct operation of the method.
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.
You are given a non-negative number in the form of list elements. For example, the number 123 would be provided as [1, 2, 3]. Add one to the number and return the output in the form of a new list. import java.util.ArrayList;public class AddOneToArrayList{public static ArrayList<Integer> solution(ArrayList<Integer> list){// ↓↓↓↓ your code goes here ↓↓↓↓return new ArrayList<>();}}
Given an ArrayList of Integers, find a subarray with the maximum sum of any potential subarray within the ArrayList. A subarray is any combination of consecutive numbers. The subarray can be of any length n, where the size of n >= 0. import java.util.ArrayList;public class MaxSubArray{public static ArrayList<Integer> solution(ArrayList<Integer> nums){// ↓↓↓↓ your code goes here ↓↓↓↓return new ArrayList<>();}}
Write a method that removes adjacent duplicates from an array list. Complete this code. import java.util.ArrayList; public class ArrayListUtil{/**Removes adjacent duplicates from an array list of strings.@param word an array list of strings*/public static void removeAdjacentDuplicates(ArrayList<String> words){. . .}}
FOR JAVA Write a method that takes a one dimensional integer array, an integer (as index) and another integer (as number). Your program must insert the number into the given index, shift the rest of the elements to the right, and return the new array. For instance, if we want to insert the number 0 into position 3 of {1, 2, 3, 4, 5}, your method must return {1, 2, 3, 0, 4, 5}.