Office Hours, Grader

Thank you

Tests

• Midterm: Thur, March 7. In class. Histogram
• Final: Tue, May 7, 5:00-7:30

Lectures

• Review of programming
  • Loop Invariants
  • Assertions, Preconditions, Postconditions
  • Data Structure Invariants
  • Test suites
• Review of Java.
  • Review 0: Java Syntax.
  • Review 1: Classes and Objects.
  • Review 2: Inheritance and Overriding.
  • Review 3: Types, Widening and Narrowing.
  • Review 4: Static fields and Methods.
  • Review 5: Interfaces.
  • Review 6: Exceptions.
  • Review 7: Strings and Text.
  • Review 8: IO and the Java Class Library.
• Analysis of Algorithms
  • The runtime of programs.
  • Big O notation (ex. O(n), O(n^2), O(n log n)).
  • Asymptotic analysis of programs.
• Stacks, Queues, and Deques
  • ArrayStack
  • ArrayQueue (just interface and pseudocode)
  • Linked Lists
    • My First Linked List
    • Inserting to end of lists
    • Reversing a linked list
• Trees
  • Data Structure Invariants for Search Trees.
  • TreeOne
  • TreeTwo
  • TreeThree
• Priority Queues
• Dictionaries; Hashing; Skip Lists
  • Implementation of HashComparator (See class text page 354.)
  • Example hashing classes
• Self-Balancing Trees (for fun!)
  • AVL Trees
  • Simple Trees
  • Red-Black Trees
  • Splay Trees
• Text Processing
• Advanced topics in Java
  • Graphical User Interfaces
  • Inner classes
  • Sockets
  • Threads
  • Synchronization
  • Object Serialization

Homeworks

• Remarks on homeworks.
• Homework 1: Review of Java
  • Read: Chapters 1-2 in Goodrich and Tomassia.
  • Program: R-1.3, R-1.4, R-1.5, R-1.8, R-1.10, R-1.12 and R-1.14.
  • Due: Midnight, Tue Jan 29. Place in submit/R-1.3 folder, etc.
• Homework 2: Review of Object Oriented Design
  • Read: Chapters 1-2 in Goodrich and Tomassia.
  • Program: C-2.2, C-2.3, P-2.2.
  • Due: Midnight, Tue Feb 5. Place in submit/C-2.2, etc., folders
• Homework 3: Analysis tools
  • Read: Chapter 3 in Goodrich and Tomassia.
  • Do: Problems R-3.2, R-3.3, R-3.4, R-3.6, R-3.9, R-3.10.
  • Due: Midnight, Tue Feb 12. Try to do writeup in a plaintext file and place in submit/R-3.2, etc., folders
  • If you hand in paper in class, the paper must be neat. If not, the paper will be rejected and you will have one day to resubmit.
  • Hints
• Homework 4: Stacks and Queues
  • Read: Chapter 4 in Goodrich and Tomassia
  • Program: Problems P-4.3, P-4.4, P-4.5 and P-4.6.
  • Due: Midnight, Tue Feb 26.
• Homework 5: Vectors, Lists and Sequences
  • Read: Chapter 5 in Goodrich and Tomassia
  • Program: Problem P-5.2.
  • Due: Midnight, Tue Mar 5.
  • Hint
• Homework 6: Trees
  • Read: Chapter 6 in Goodrich and Tomassia
  • Program: Problem P-6.9
  • Due: Midnight, Tue April 2 (extended!).
  • Hint
• Homework X: Priority Queues
  • Read: Chapter 7 in G & T.
  • Due: Mid-April.
• Homework 7: Hash Tables
  • Read: Chapter 8 in G & T.
  • Program: MyHashTable.java
  • Due: Midnight, Thur April 11.
• Homework Y: Search Trees
  • Read: Chapter 9 in G & T.
  • Due: Mid-April.

Resources

• The Java Language Specification (PDF).
• Java 2 API, SDK v1.3.
• JBuilder 5 and 6

All materials on this and subordinate pages are
(c) 2001 Burton Rosenberg. All rights reserved.