Write a program that reads a list of integers and outputs those integers in reverse. The input begins with an integer indicating the number of integers that follow. For coding simplicity, follow each output integer by a comma, including the last one. Assume that the list will always contain fewer than 20 integers. Ex: If the input is: 5 2 4 6 8 10 the output is: 10,8,6,4,2, To achieve the above, first read the integers into an array. Then output the array in reverse.

Write a program that reads a list of integers and outputs those integers in reverse. The input begins with an integer indicating the number of integers that follow. For coding simplicity, follow each output integer by a comma, including the last one. Assume that the list will always contain fewer than 20 integers. Ex: If the input is: 5 2 4 6 8 10 the output is: 10,8,6,4,2, To achieve the above, first read the integers into an array. Then output the array in reverse.

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

2 Write a java program. call it sortWords. Read from the command line a list of words, any number, from 1 to as many as the user wants. Store the words (strings) in an arraylist. Sort the list in alphabetical order. Print the list with a comma and space between each word. Words should be output in the SAME case as the user gives them. For an A make the sort be case insensitive AND remove the , from after the last word. example: java sortWords book car tree apple house --> apple, book, car, house, tree (The already existing answer on Chegg failed the codePost tests)
import java.util.ArrayList;import java.util.Arrays;public class PS{/*** 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…
import java.util.ArrayList;import java.util.Arrays; public class PS07A{/*** 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…
Add a void instance method replaceAll(E oldE, E newE) in the MyLinkedList class to replace the occurrence of all oldE value with the specified newE value. Implement this method in O(n) time. import java.util.*; public class PExamCh24 { public static void main(String[] args) { new PExamCh24();}public PExamCh24() { // Create a list for strings MyLinkedList<String> list = new MyLinkedList<>(); // Add elements to the list list.add("America"); // Add America to the list System.out.println("(1) " + list); list.add(0, "Japan"); // Add Canada to the beginning of the list System.out.println("(2) " + list); list.add("Russia"); // Add Russia to the end of the list System.out.println("(3) " + list); list.addLast("Japan"); // Add France to the end of the list System.out.println("(4) " + list); list.add(2, "Japan"); // Add Germany to the list at index 2 System.out.println("(5) " + list); list.add(5, "Norway"); // Add Norway to the list…
in java language import java.util.ArrayList;import java.util.Arrays; 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.*…
Java // Complete the missing code in the main function in the Main class below import java.util.ArrayList; import java.util.Iterator; import java.util.List; class Student { private int studentId; private String studentName; private String course; public Student(int studentId, String studentName, String course) { super(); this.studentId = studentId; this.studentName = studentName; this.course = course; } @Override public String toString() { return "Student Details:\n" + "studentId:"+studentId + "\nstudentName:" + studentName + "\ncourse:" + course; } } public class Main { public static void main(String[] args) { List<Student> studentList =new ArrayList<>(); studentList.add(new Student(1,"Alex","Java with DS")); studentList.add(new Student(2,"Albert","Java with DS")); studentList.add(new Student(3,"Samson","Spring Api"));…
Consider the interface below:import java.util.NoSuchElementException; public interface MyList<E> {   public int getSize();   public void insert(E data) throws ListOverflowException;   public E getElement(E data) throws NoSuchElementException;   public boolean delete(E data); // returns false if the data is not deleted in the list   public boolean search(E data); // returns index of data, else -1 is return}a. Use an array object to store the elements of the list object. The program should be able to show its size, get element, delete, and search from the array. b. This array object will have a fixed size of five (5) and that an attempt to insert an element into the array when full will result to a ListOverflowException.
Consider the interface below:import java.util.NoSuchElementException; public interface MyList<E> {   public int getSize();   public void insert(E data) throws ListOverflowException;   public E getElement(E data) throws NoSuchElementException;   public boolean delete(E data); // returns false if the data is not deleted in the list   public boolean search(E data); // returns index of data, else -1 is return}a. Use an array object to store the elements of the list object. The program should be able to show its size, get element, delete, and search from the array. b. If the array is full and an element is to be inserted, a new array object with a size that is twice than the “old” array will be created. All the elements of the “old” array will be copied to the new array before inserting the new element.
public class CustomLinkedList {    public static int findMax(IntNode headObj) { /* Type your code here */         }    public static void main(String[] args) { IntNode headObj;   IntNode currObj; IntNode lastObj; int i;   int max;     // Create head node headObj = new IntNode(-1);   lastObj = headObj;     // Add nodes to the list for (i = 0; i < 20; ++i) {   currObj = new IntNode(i);     lastObj.insertAfter(currObj);   lastObj = currObj; }        max = findMax(headObj); System.out.println(max); }}
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.
Implement given operations in java : * Removes the first instance of the specified element from this * list and returns it. Throws an EmptyCollectionException * if the list is empty. Throws a ElementNotFoundException if the * specified element is not found in the list. * param targetElement the element to be removed from the list * return a reference to the removed element * throws EmptyCollectionException if the list is empty * throws ElementNotFoundException if the target element is not found
Create a Java program that collects 3 animal types from the user, stores them to an Linked List andthen outputs/displays the contents of the Linked List to the user after the third animal type isentered. (Capturing data, use of a loop, use of a linked list, 3 animal types, stringvalue).