Harvard CS50: Introduction to Computer Science

Lecture 0: Scratch

Starter:

• What is Computer Science?

Binary & Information:

• Binary, Bits, & Bytes
• Representing Letters in Binary (ASCII)
• Possible Ways of Representing __ in Binary:

Other Definitions / Introductions:

• Algorithm
• Pseudocode
• Scratch.mit

Lecture 1: C

Starter:

• Last Lecture
• Learning New Languages

On Tools:

• Integrated Desktop Environments
• Compiler
• This Class’s Tools
• Make
• Unix

C:

• C
• Functions
  • int main void
• Header File
  • CS50 Library
• Types
  • Bit Limitations
  • Type Conversion
• Operators
• Syntactic Sugar
• Comment
• Conditionals
  • and or
• Common Bug: Magic Number
• Quotes
• Loops
  • do while loop
• Scope
• Overflow
  • Floating Point Imprecision

Lecture 2: Arrays

Compiling & Debugging:

• Make
• Compiling Process
• Debugging Process

Arrays:

• Array

Args and Exit Codes:

• Command-line Arguments
• Exit Status

Misc:

• Readability
• Cryptography

Lecture 3: Algorithms

Starter:

• Recall
• Visualizing Arrays
• Searching (Problem Statement)

Measuring Efficiency:

• Determining Efficiency

Search Algorithms:

• Search Algorithms
• Code Examples: Linear Search

Data Structures:

• Data Structures

Sorting Algorithms I:

• Sorting Algorithms

Recursion:

• Recursion

Sorting Algorithms II:

• Merge Sort

Lecture 4: Memory

Starter:

• Starter
• Image

Memory & Pointers:

• Counting Memory
  • Hexadecimal
• Pointers
  • Strings Revisited
  • Pointer Arithmetic
• Dynamic Memory Allocation

Memory Debugging:

• Valgrind
• Garbage

Heap & Stack:

• Physical Memory
• Example: Function Variable Scope
• 4 - heap and stack

Input & Output:

• Scanf
• File Pointers

Lecture 5: Data Structures

Lecture 6: Python

Lecture 7: Sql

Lecture 8: HTML, CSS, Javascript

Lecture 9: Flask

Lecture 10: Emoji

Emoji