Introduction to Computer Science      COMP 250       Fall 2017

Instructor: Professor Michael Langer

Lectures:     Sec. 001       MWF  10:35-11:25     MCMED 522                
     Sec. 002       MRF  14:35-15:25     MDHAR G-10

LECTURES EXERCISES (with solutions)
  1. introductions (slides)
  2. grade school algorithms for arithmetic  (notes)   (slides)
  3. binary numbers  (notes)   (slides)
  4. Eclipse IDE and debugging tutorial   (example code)   (slides)

Exercises 1: grade school arithmetic, number representations (PDF)
Linear Data Structures
  1. array list (notes)   (slides)
  2. singly linked lists  (notes)   (slides)  
  3. doubly linked lists  (notes)   (slides)  
  4. list sorting algorithms (notes)   (slides)  
    bubble, selection, & insertion sort
  5. stacks (notes)   (slides)  
  6. queues (notes)   (slides)
    + ADTs, Java API, interfaces

Exercises 2: arrays and array lists (PDF)

Exercises 3: linked lists (PDF)   (code)  

Exercises 4: O(n^2) sorting (PDF)

Exercises 5: stacks and queues (PDF)
Induction and Recursion
  1. mathematical induction (notes)   (slides)
  2. recursion 1 (notes)   (slides)
    factorial & Fibonacci, reverse/sort list, Tower of Hanoi; call stack
  3. recursion 2 (notes)   (slides)
    power, binary search
  4. recursion 3 (notes)   (slides)
    mergesort, quicksort

Exercises 6: induction and recursion (PDF)
Mathematical Tools for Analysis of Algorithms
  1. recurrences 1 (notes)   (slides)
    back substitution method, examples, brief review of logarithms
  2. recurrences 2 (notes)   (slides)
    mergesort, quicksort
  3. big O   1 (notes)   (slides)
    analogy to limits in Calculus, formal big O definition
  4. big O   2 (notes)   (slides)
    rules for big O, big Omega, some incorrect proofs
  5. big O   3 (notes)   (slides)
    big Theta, best and worst case, limits rules

Exercises 7: recurrences (PDF)

Exercises 8: big O (PDF)
Non-linear Data Structures
  1. rooted trees (notes)   (slides)
  2. tree traversal (notes)   (slides)
  3. binary trees e.g. expression trees (notes)   (slides)
  4. binary search trees (notes)   (slides)
  5. priority queue, heaps 1 (notes)   (slides)
  6. heaps 2 (notes)   (slides)
  7. heaps 3 (notes)   (slides)
  8. maps, hash codes (notes)   (slides)
  9. hash maps (notes)   (slides)  
  10. graphs (notes)   (slides)
  11. graph traversal (breadth vs depth first) (notes)   (slides)

Exercises 9: trees (PDF)

Exercises 10: heaps (PDF)

Exercises 11: hashing (PDF)

Exercises 12: graphs (PDF)
Object Oriented Design in Java
  1. inheritance (notes)   (slides)
  2. interfaces, abstract classes (notes)   (slides)
  3. examples of interfaces (notes)   (slides)
    Comparable, Iterable, Iterator
  4. type conversion, polymorphism, Class class (notes)   (slides)
  5. garbage collection (notes)   (slides)
    mark and sweep
  6. coding tutorial on OOD (Caitrin)
  7. modifiers (notes)   (slides)

Exercises 13: object oriented design (PDF)
  1. why (or why not) go to grad school ?
  2. beyond COMP 250, final exam (slides)