CompSci 201

Data Structures and Algorithms

Menu

Skip to content
  • Home
  • Calendar
  • Assignments
    • Hangman
      • Hangman — Full Writeup
    • Jotto
      • Jotto — Full WriteUp
    • Markov
      • Markov — Full Writeup
      • Markov — Background
    • DNA
      • DNA — Full Writeup
      • DNA — Background
    • 20 Questions
      • 20 Questions — How To
      • 20 Questions — Background
    • Boggle
      • Boggle – How To
    • Huffman
      • Huffman — How To
  • Recitations
    • Recitation 1 – Getting Started
    • Recitation 13 — Huffman
  • APTs
  • Logistics
  • People
  • Class Slides
  • Help

Class Slides

Lecture videos

Class Overview, Java intro

Compsci201_8_26_13_Welcome

Compsci201_8_28_13_Java

Arrays, Lists, Sets, and Maps

Compsci201_9_02_13_Arrays

Compsci201_9_04_13_SetsAndMaps

 Performance/Interfaces

Compsci201_9_09_13_Big-Oh

Compsci201_9_11_13_Big-Oh2

Compsci201_9_16_13_Hashing

Compsci201_9_18_13_Interfaces

Linked Lists, Stacks, Queues

Compsci201_9_23_13_LinkedLists

Compsci201_9_25_13_Markov

Exams

exam1Help

Midterm 1 Solutions

Midterm2_Solutions

Recursion

Compsci201_10_7_13_Recursion

Compsci201_10_16_13_RecursionII

Trees

Compsci201_10_21_13_Trees

Compsci201_10_23_13_TreesII

Backtracking

Compsci201_10_28_13_Backtracking

Compsci201_10_30_Boggle

Sorting

Compsci201_11_4_Sorting

Recurrence Relations

Compsci201_11_6_RecuranceRelations

Huffman

Compsci201_11_18_Huffman

Graphs

Compsci201_11_20_Graphs

Compsci201_12_2_GraphsII

Useful Links

Sakai
Piazza
Submit grade errors
Request assignment extensions
Class Code

Proudly powered by WordPress