Problem B Write a Java application CountryList. In the main method, do the following: 1. Create an array list of Strings called countries. 2. Add "Canada", "India", "Mexico", "Peru" in that order. 3. Use the enhanced for loop to print all countries in the array list, one per line. 4. Add "Spain" at index 1 5. Replace the element at index 2 with "Vietnam". You must use the set method. 6. Replace the next to the last element with "Brazil". You must use the set method. You will lose one point if you use 3 in the set method. Do this in a manner that would replace the next to the last element, no matter the size of the array list. 7. Remove the object "Canada" Do not remove at an index. Your code should work if "Canada" was at a different location. There is a version of remove method that will remove a specific object. 8. Get and print the first element followed by 9. Call method toString() on countries to print all elements on one line. 10. Use the enhanced for loop to print all countries in the array list, one per line. 11***11

Problem B Write a Java application CountryList. In the main method, do the following: 1. Create an array list of Strings called countries. 2. Add "Canada", "India", "Mexico", "Peru" in that order. 3. Use the enhanced for loop to print all countries in the array list, one per line. 4. Add "Spain" at index 1 5. Replace the element at index 2 with "Vietnam". You must use the set method. 6. Replace the next to the last element with "Brazil". You must use the set method. You will lose one point if you use 3 in the set method. Do this in a manner that would replace the next to the last element, no matter the size of the array list. 7. Remove the object "Canada" Do not remove at an index. Your code should work if "Canada" was at a different location. There is a version of remove method that will remove a specific object. 8. Get and print the first element followed by 9. Call method toString() on countries to print all elements on one line. 10. Use the enhanced for loop to print all countries in the array list, one per line. 11***11

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 Java program that uses ArrayList and Iterator. It should input from user the names and ages of your few friends in a loop and add into ArrayList. Finally, it should use an Iterator to display the data in a proper format. ( Sample run of the program:-) List of my Friends Enter name and age [friend# 0] Khalid Al-shamri 22.5 Do you want to add another friend (y/n)? y Enter name and age [friend# 1] Rahsed Al-anazi 21.1 Do you want to add another friend (y/n)? y Enter name and age [friend# 2] Salem Al-mutairi 23.7 Do you want to add another friend (y/n)? n Here is the data you entered: 0. Khalid Al-shamri, 22.5 1. Rahsed Al-anazi, 21.1 2. Salem Al-mutairi, 23.7
in java language Write a program in which you create an object of type ArrayList named BZ and then add 3 elements in this object and then copy the elements of the object in another object QZ and then cancel the elements of the object BZ and then write the necessary print statements to show it?
How to use multithread in ArrayList? The ArrayList contains 100 Element. but the program only load 10 Element while it done 10 elemnt it continue load 10 element next until the program load all 100 Element.
Write a program that reads words into two ArrayLists list1 and list2 and then creates a third ArrayList that contains words which are common to both list1 and list2.
Provide a different implementation of ChoiceQuestion. Instead of storing the choices in an array list, the addChoice method should add the choice to the question text. For this purpose, an addLine method has been added to the Question class. Use the following files: Question.java /** A question with a text and an answer.*/public class Question{ private String text; private String answer; /** Constructs a question with empty text and empty answer. */ public Question() { text = ""; answer = ""; } /** Sets the answer for this question. @param correctResponse the answer */ public void setAnswer(String correctResponse) { answer = correctResponse; } /** Checks a given response for correctness. @param response the response to check @return true if the response was correct, false otherwise */ public boolean checkAnswer(String response) { return response.equals(answer); } /** Add a line of text to…
4. Now examine the ArrayList methods in the above table, a) Which method retrieves elements from the ArrayList? b) Which method replaces the value of an element that already exists in the ArrayList? c) Which two methods initializes the value of an element? d) How do the two methods in (c) differ? Which method(s) would be appropriate in the above Java program (after we convert it to work with ArrayLists)?
Rewrite the following piece of java code using iterator pattern. And change the operation inside the for loop to another operation of your own. And What was the advantage of using the iterator ? import java.util.Iterator String[ ] originalData = { "one", "two", "three", "four", "five" }; List<String> strings = new ArrayList<>(Arrays.asList(originalData)); for ( int i=0; i<strings.size(); i++) { // process strings.get(i): here, just printSystem.out.println(strings.get(i));}
Your activity: write a same java program that will accept 20 integer in a list and returns the index of the first occurrence of the smallest element in the array. Also, write a program to test your method. Write a Java method, smallestIndex, that takes as its parameters an int array and its size, and returns the index of the (first occurrence of the) smallest element in the array. public class Array_labExercise2 { public static void main(String[] args) { int[] list = {56, 34, 67, 54, 23, 87, 66, 92, 15, 32, 55, 15, 88, 22, 30}; System.out.print("List elements: "); printArray(list); System.out.println(); System.out.println("Index of the (first occurenc of the) " + "smallest element in list is: " + smallestIndex(list)); System.out.println("Smallest element in list is: " + list[smallestIndex(list)]); } public static void printArray(int[] list) { int counter; for (counter = 0; counter < list.length; counter++) System.out.print(list[counter] + " ");…
Write a java program that uses an ArrayList object to store the following set of names in memory: [Steve, Tim, Lucy, Pat, Angela, Tom] Now write some more code so that the same ArrayList object is augmented with the name 'Steve' after the name 'Lucy' After the ArrayList object has been augmented with the new name, display the original and new lists on the console (as shown below), to verify that the new name is positioned correctly in the list.
Implement a mergeUniqueValues(arr1, arr2) method. When passed two arrays of strings, it will return an array containing the strings that appear in either or both arrays in sorted order. And the returned array should have no duplicates. For example, if you have two string arrays: arr1: {“Bear”, “Elephant”,”Fox”}arr2: {“Panda”, “Elephant”,”Eagle”} Calling mergeUniqueValues(arr1, arr2) should return a merged and sorted array like: Bear, Eagle, Elephant, Fox, Panda
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.
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.