• Course outline
• Java Resorces

Lecture demos

• Week 2 lectures, The numeric input example: version 1 with standard Java input, and version 2 which utilizes the Keyboard class from the book . As defined in the book, the Keyboard class must be stored in the directory named cs1.
• Week 2 lectures, The ADD operator example.
• Week 2 lectures, Inputing floating point values example.
• Week 3 lectures, Example on coversions between data types (using casting).
• Week 3 lectures, The Right Triangle example (if - else statement).
• Week 3 lectures, Computing factors example (while statement).
• Week 3 lectures, Find avarage and highest grades example (while statement).
• Week 3 lectures, How long money should stay in a bank example (while statement).
• Week 4 lectures, Conditional operator example with a double-nested while loop.
• Week 4 lectures: Rolling a dice example (do-loop).
• Week 4 lectures: The dice applet example.
• Week 4 lectures: Generating random numbers applet.
• Week 4 lectures: While loops vs do loops vs for loops (a comparison example).
• Week 4 lectures: Example on switch statement.
• Week 5 lectures: Command line arguments example.
• Week 5 lectures, the StringTokenizer example version 1, and version 2.
• Week 5 lectures: Flipping a coin example.
• Week 5 lectures: The date verification example problem description and pseudo code and the code.
• Week 6 lectures: The parameter passing example.
• Week 6 lectures: Creating your own classes, Selecting a computer example.
• Week 6 lectures: The CD example from Lewis & Loftus, first edition.
• Week 6 lectures: The Circle example (OO version).
• Week 6 lectures: The Rectangles example
• Week 6 lectures: The Bank example, which uses a static method.
• Week 6 lectures: The URL example, using the StringTokenizer class.
• Week 6 lectures: The Triangle problem from homework 3: More than just a hint.
• Week 6 lectures: The Casino example illustrating method overloading.
• Week 7 lectures: An example using a text file version 1 , version 2 , version 3 , version 4 , and the data file that goes with them.
• Week 7 lectures: The Salary Update example, and the data file that it uses.
• Week 7 lectures: An array example using a text file find the largest element and the data file that goes with it.
• Week 7 lectures: An array example find the avarage.
• Week 7 lectures: Find the smallest array entry example.
• Week 8 lectures: The Monthly Sales example.
• Week 8 lectures: The Membership example.
• Week 8 lectures: An array of objects example.
• Week 8 lectures: Representation of multidimentional arrays example 1, example 2, example 3.
• Week 8 lectures: The Selection sort example and the data file that goes with it.
• Week 9 lectures: Book, page 315 project 6.1 - the program and the data file that goes with it.
• Week 9 lectures: Vector with different data types example
• Week 9 lectures: StringBuffer class example
• Week 9 lectures, A simple linked list example.
• Week 9 lectures, A more interesting linked list example
• Week 9 lectures, The Library example from Lewis and Loftus.
• Week 10 lectures: Inheritance example.
• Week 10 lectures: The Inheritance example modified.
• Week 10 lectures: The Bank account example modified.
• Week 10 lecture: Inheritance example demonstrating overriding a supperclass method.
• Week 10 lectures: The Bank account example extended.
• Week 11 lectures: Polymorphism example.
• Week 11 lectures: Example illustrating the polymorphic nature of a Vector.
• Week 11 lectures: The Food example illustrating abstract methods
• Week 11 lectures: The RoundShape example illustrating nested classes and abstract methods
• Week 12 lectures: The Balance applet illustrating the use of interfaces
• Week 12 lectures: The Teacher assistant applet illustrating the use of interfaces
• Week 12 lectures, The sorting interface example.
• Week 12 lectures, L&L notes on exceptions-- chapter 11.
• Week 13 lectures, L&L notes on recursion -- chapter 12.
• Week 13 lectures, Finding the largest example: iterative version and recursive version and the data file.
• Week 13 lectures, The Factorial example: iterative version and recursive version.
• Week 13 lectures, The Fibonacci example: iterative version and recursive version.
• Week 14 lectures, The Tower of Hanoi example.
• Week 14 lectures, The Maze Search example from Lewis and Loftus.
• Week 15 lectures, The Stack ADT implemented as an array.
• Week 15 lectures: A Stack ADT (array implentation) with exceptions.
• Week 15 lectures, The Decode example from Lewis and Loftus modified to illustrate user-defined stack implemented as an array.
• Week 15 lectures: The Queue ADT implemented as an array.
• Week 15 lectures: The Queue ADT (array implementation) with exceptions.
• Week 15 lectures, The Linked List ADT revisited.
• Week 15 lectures, The Stack ADT implemented as a linked list.
• Week 15 lectures, The Decode example from Lewis and Loftus modified to illustrate user-defined stack implemented as a linked list.
• Week 15 lectures: The Queue ADT implemented as a linked list.
• Week 16 lectures: The Binary Tree ADT implemented as a linked list.

Assignments and announcements

• Get started and test your jdk installation by compiling and running the following application program and applet.

Lab exercises

• Lab 1 problems.
• Pool program, version 1.
• Pool program, version 2.
• Pool program, version 3 (uses the Keyboard class).
• Yard program, version 1.
• Yard program, version 2.
• Yard program, version 3 (uses the Keyboard class).
• Lab 2 problems.
• Lab 2, problem 1.
• Lab 2, problem 2.
• Lab 2, problem 3.
• Lab 3 problems.
• Lab 3, problem 1.
• Hints for Lab 3, problem 2: (1) string input utilizing standard Java input, (2) string input utilizing the Keyboard class from the book, (3) character input (version 1), (4) character input (version 2), and (5) string input utilizing a method from the String class. Use options (1) or (5). Do NOT use options (3) and (4) -- their limitations will be discussed in class. A complete program for this problem will be offered after discussing student versions.
• Lab 3, problem 3.
• Lab 3, problem 4, basic version.
• Lab 3, problem 4 with formatted output.
• Lab 3, problem 4: applet version.
• Lab 3, problem 5.
• Lab 3 problem 6.