CMSC 12300: Computer Science with Applications III

The University of Chicago, Spring 2021

Code snippets from lectures

• Lecture 2: 1-grams and using less memory
  • Memory-intense dictionary approach
  • O(1)-space approach (better)
• Lecture 4: Top k most frequent
  • Version that sorts all (slower)
  • Version that only tracks k best so far
• Lecture 5-6: Multi-process max
  • Code
• Lectures 8-9: Word count on MapReduce with mrjob
  • Code
• Lecture 9: MapReduce examples
  • Count all words using MapReduce
  • Average word length using MapReduce
• Lecture 10: More MapReduce examples
  • Average unique word length using MapReduce
  • Max word length using MapReduce
  • Max length word using MapReduce
• Lectures 11-12: C example
  • Factorial in C
• Lectures 12-13: Leap Year (C conditionals)
  • Leap year versions in C
• Lecture 13: School types (C conditionals)
  • School versions in C
• Lecture 14: Loops in C
  • Factorial as while loop, two versions in C
• Lectures 15-16: Arrays in C
  • Summing an Array
  • Squaring an Array "Destructively"
  • Generating a New Array of Squares
  • Finding Evens
• Lecture 17: Strings in C
  • emphasize function
• Lecture 17: Multidimensional arrays in C
  • Printing 2-D array example
• Lecture 18: structs in C
  • Euclidean distance function
  • Midpoint function
• Lectures 18-19: Multithreading
  • Threads example 1
  • Threads example 2
• Lecture 21: Synchronization
  • withdraw (mutex example)
  • withdrawer and depositer (condition variable example)
• Lectures 22-23: MPI
  • Code