ITEC 120 2008fall aaray, ejderrick, ibarland, jmdymacek

home—info—labs—hws—exams
textbook—java.lang docs—java.util docs—archive

lect11a
Loops-over-lists galore

import java.util.LinkedList;
import java.util.Scanner;

class Lect11 {

• A function which takes in a non-empty list of strings, and returns the alphabetically-last string.
• A function which takes in a non-empty list of strings, and returns the alphabetically-first string.
• A function which takes in nothing, and returns a list of words form the keyboard. Note that once these two above methods have been written, it's easy to combine them to (say) find the largest word typed at the keyboard:

  largestWord( allWordsKbd() )

  Or, if we want to find that largest word but also remember all the words typed in, we can use a local variable to remember all those words:

  LinkedList<String wordsEntered; wordsEntered = allWordsKbd(); largestWord( wordsEntered ); smallestWord( wordsEntered );

• Modify (overload) the previous: A function which takes in a Scanner, and returns a list of words. Now, go back and get rid of repeated code.
• A function makeList: It takes in n and a String, and returns a list containing that String n times.

---

• A function which takes in int n, and returns a list containing 0,1,2,4,9,16,...(n-1)^2.

• A function doubleAll, which takes in a list of numbers and changes the contents of that list so that every number is doubled.

• A function which reverses a list of (anything!).

• A function which takes in a list of Strings, and returns a new list with all those strings in alphabetical order. Use selection sort: Repeatedly: - Find the biggest string; - remove it from the list while inserting it into a new list.

• A function which takes in two parallel lists of numbers, and returns a list of their differences.
  Show newspaper graphic, of voter-demographic-shift by county. Discuss: other ways to organize the data?

  }  // End of class Lect11

home—info—labs—hws—exams
textbook—java.lang docs—java.util docs—archive

©2008, Ian Barland, Radford University Last modified 2008.Nov.17 (Mon)

Please mail any suggestions (incl. typos, broken links) to iba�rlandrad�ford.edu