CMSC 12300 and CAPP 30123: Computer Science with Applications III

The University of Chicago, Spring 2016

Code snippets from lectures

• Lecture 1: 1-grams and using less memory
  • Memory-intense dictionary approach
  • O(1)-space approach (better)
• Lecture 3: Multi-process max
  • Code
• Lectures 5 & 6: Top k most frequent
  • Version that sorts all (slower)
  • Version that only tracks k best so far
• Lecture 7: Top k streaming
  • Code
• Lecture 7: Word count on MapReduce with mrjob
  • Code
• Lecture 9: MapReduce examples
  • Count all words using MapReduce
  • Average word length using MapReduce
  • Average unique word length using MapReduce
  • Max word length using MapReduce
  • Max length word using MapReduce
• Lecture 19: Concurrency
  • Threads example 1
• Lecture 20: Concurrency
  • Threads example 2
• Lecture 21: Synchronization
  • withdraw (mutex example)
• Lecture 22: Synchronization
  • withdrawer and depositer (condition variable example)