CS230 Handouts - Spring 2007

CS230 Home Page | Syllabus | Lectures | Assignments | Handouts | Documentation | CS Dept

• #01 Course Information
• #02 Lecture 01: Introduction to CS230
• #03 Linux, X, Emacs,and Java
• #04 Introduction to Unix and the X Window System (Scott Anderson)
• #05 Introduction to the Emacs Editor (Scott Anderson)
• #06 GNU Emacs Reference Card
• #07 Concurrent Versions System
• #08 Problem Set 1 (Dice Poker and Palindromes)
• #09 Lecture 02: Arrays
• #10 Lecture 03: Text Processing in Java
• #11 Lecture 04: Java Input/Ouput
• #12 Lecture 05: Extensible Arrays: Vectors and String Buffers
• #13 Problem Set 2 (Stock Portfolio System)
• #14 Lecture 06 and 07: Object-Oriented Programming: Classes, Inhertitance, and Interfaces
• #15 Problem Set 1 Solutions
• #16 Lecture 08: Abstract Data Types
• #17 Problem Set 3 (IntVector and QueueCircular)
  
• #18 Lecture 09: Queues and List-Based ADT implementations
  
• #20 Take-Home Exam 1
  
• #21 Lecture 11: Ordered Structures
  
• #22 Lecture 12: Priority Queues
  
• #23 Lecture 13: Sets, Bags, and Tables
  
• #24 Problem Set 2 Solutions
• #25 Problem Set 3 Solutions
• #26 Final Project
• #27 Problem Set 4
• #28 Lecture 17: Binary Trees
  
• #29 Lecture 18: More Binary Trees
  
• #30 Lecture 19: Binary Search Trees
  
• #31 Problem Set 5
• #32 Algorithm Analysis
  
• #33 Recurrences
  
• #34 Exam 1 Solutions
• #35 2-3-Trees
• #36 Problem Set 6
• #37 Heaps
• #38 CS230 Jeopardy Game (Exam 2 Review)
• #39 Problem Set 4 Solutions
• #40 Problem Set 5 Solutions
• #41 Problem Set 6 Solutions
• #42 Exam 2 Review Problems
• #43 Hashing