Explanation of Solution
Modified last loop in Listing 7.8:
The last loop in Listing 7.8 is modified by using “for” loop with method “getNumberOfEntries” which is given below:
/* Compute the number of entries in the list using method "getNumberOfEntries" */
int count = toDoList.getNumberOfEntries();
/* Finally display the number of items in list using "for" loop */
for(int position = toDoList.START_POSITION; position <= count; position++)
//Display the list of items
System.out.println(toDoList.getEntryAt(position));
Explanation:
The modified loop is used to display the each item in the list using method “getNumberOfEntries”.
- • First compute the number of entries in the list using method “getNumberOfEntries” and store it to an integer variable “count”.
- • Then display the item one by one in the list by using “for” loop.
Complete code after changing the given loop:
The complete executable code for given program after changing the last loop in Listing 7.8 is given below:
File name: “OneWayNoRepeatsList.java”
public class OneWayNoRepeatsList
{
//Refer the textbook Listing 7.9 of chapter 7.
}
File name: “ListDemo.java” (Listing 7.8)
//Import required package
import java.util.Scanner;
//Define "ListDemo" class
public class ListDemo
{
//Initializes required variable
public static final int MAX_SIZE = 3; //Assumed > 0
//Define main function
public static void main(String[] args)
{
//Create object "toDoList" from "OneWayNoRepeatsList" class
OneWayNoRepeatsList toDoList = new OneWayNoRepeatsList(MAX_SIZE);
//Prompt statement for user
System.out.println("Enter items for the list, when prompted.");
//Initializes Boolean variable
boolean moreEntries = true;
//Assign string variable
String next = null;
//Create object for scanner class
Scanner keyboard = new Scanner(System.in);
//Read an item from user
while (moreEntries && !toDoList...
Want to see the full answer?
Check out a sample textbook solutionChapter 7 Solutions
Java: Intro. to Prob. Solv... (Looseleaf)
- Rewrite the following loops, using the enhanced for loop construct. Here, values is an array of floating - point numbers. a. for (int i = 0; i < values.length; i++) { total = total + values[i]; } b. for (int i = 1; i < values.length; i++) { total = total + values[i]; } c. for (int i = 0; i < values.length; i++) { if (values[i] == target) { save = i; }.arrow_forwardIn your essay, you should talk about both the benefits and the drawbacks of skipping the skip list.arrow_forwardRewrite 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));}arrow_forward
- in java Add a foreach loop at the end of the main method to print all the list elements side by side, separated by single spaces. Include a brief description so the output shows that these are the list elements printed with the foreach loop.arrow_forwardThe for loop iterates across the elements in a given list. Hence, it runs forever, provided there are still objects to process. Will this prove to be a true or untrue statement?arrow_forwardCan you show me how you would implement Step 3 within the code please? Step 3: a=int(input()) b=int(input()) starting_point=[] starting_point.append(a) starting_point.append(b) remaining_points=[] for i in range(n): temp=[] a=int(input()) b=int(input()) temp.append(a) temp.append(b) remaining_points.append(temp) #appending each point as a listarrow_forward
- The for loop iterates across the elements in a given list. So long as there are objects to process, it will keep going. In what way does this statement hold true or false?arrow_forwardcreate a program that takes a nested list and flattens the nested list without using recursion.arrow_forwardBody of the Loop: A reasonable step would be: Choose some nodeu from foundNotHandled, and handle it. This involves following all the edges from u. Newly found nodes are now added to the set foundNotHandled (if they have notbeen found already). u is moved from foundNotHandled to foundHandled.arrow_forward
- I am getting errors from this part for (int i = 0; i < integerList.size(); i++) { System.out.println(integerList.get(i)); } i am not getting the list outputarrow_forwardWrite a program that prompts the user for five integers from the keyboard and stores them in a list. (use a for loop). Using a while loop, display each integer in the list that is less than the last one. Ex: If the input is: 5 150 60 140 90 the output is: 5 60arrow_forwardCan I have some help making a program that has the user append 5 names into a list using a loop? The names need to be in the format LastName-FirstName, with the – separating first/last. Then, using a second loop, split each name based on -.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