CMSC 12300 and CAPP 30123: Computer Science with Applications III

University of Chicago, Spring 2015

Code snippets from lectures

• Lecture 1: 1-grams and using less memory
  • Memory-intense dictionary approach
  • O(1)-space approach (better)
• Lectures 4 & 5: Multi-process max
  • Code
• Lectures 6 & 7: Top k most frequent
  • Version that sorts all (slower)
  • Version that only tracks k best so far
• Lecture 7: Top k streaming
  • Code
• Lecture 8: Word count on MapReduce with mrjob
  • Code
• Lecture 9: MapReduce examples
  • Count all words using MapReduce
• Lecture 10: MapReduce examples
  • Average word length using MapReduce
  • Average unique word length using MapReduce
• Lecture 13: MapReduce examples
  • Max word length using MapReduce
  • Max length word using MapReduce
• Lectures 14 & 15 & 16: C++: Complex class
  • complex.h
  • complex.cpp
• Lectures 16 & 17: C++: FrequentFlyer classes
  • BaseFrequentFlyer.h
  • BaseFrequentFlyer.cpp
  • FrequentFlyer.h
  • FrequentFlyer.cpp
  • SilverFrequentFlyer.h
  • SilverFrequentFlyer.cpp
  • GoldFrequentFlyer.h
  • GoldFrequentFlyer.cpp
  • main.cpp
  • BaseFrequentFlyer.cpp, abstract version with pure virtual method
• Lecture 18: C++: Templates & STL
  • new and delete
  • swap
  • pair
  • vectors
• Lecture 19: Concurrency
  • Threads example 1
  • Threads example 2
• Lectures 21 & 22 & 23 & 24: Synchronization
  • withdraw (mutex example)
  • withdrawer and depositer (condition variable example)
  • Producer-consumer problem
  • Reader-writer locks