Introduction to Computer Science I

Course Description

Introduction to Computer Science I is a first course in computer science at Harvard College for concentrators and non-concentrators alike. More than just teach you how to program, this course teaches you how to think more methodically and how to solve problems more effectively. As such, its lessons are applicable well beyond the boundaries of computer science itself. That the course does teach you how to program, though, is perhaps its most empowering return. With this skill comes the ability to solve real-world problems in ways and at speeds beyond the abilities of most humans.

Lectures

1. favorites

   Lecture 1 - How Computers Work, Binary

2. favorites

   Lecture 2 - Introduction to Programming and Scratch

3. favorites

   Lecture 3 - Threads and Programs with Multiple Scripts

4. favorites

   Lecture 4 - Binary Numbers, Programming Languages, Working in Linux, and Programming in C

5. favorites

   Lecture 5 - Secure File Transfer, Variable Types, and Arithmetic Operators

6. favorites

   Lecture 6 - Standard Input Functions, Boolean Expressions, and Loops

7. favorites

   Lecture 7 - Cryptography, Bugs, Integer Casting, and Functions

8. favorites

   Lecture 8 - Local and Global Variables, the Stack, Return Values, and Arrays

9. favorites

   Lecture 9 - Strings as Arrays, Command-Line Arguments, and more Cryptography

10. favorites

    Lecture 10 - Run Times and Algorithms, Recursion

11. favorites

    Lecture 11 - Sorting: Bubble Sort, Selection Sort, and Merge Sort

12. favorites

    Lecture 12 - Hardware, Processors, and Implications for Software

13. favorites

    Lecture 13 - Greedy Algorithms, Software Design and Debugging

14. favorites

    Lecture 14 - Pointers

15. favorites

    Lecture 15 - Pointers and Arrays, Dynamic Memory Allocation

16. favorites

    Lecture 16 - Pointer Arithmetic, Structures, File I/O

17. favorites

    Lecture 17 - Linked Lists

18. favorites

    Lecture 18 - Inserting and Deleting Elements in Linked Lists, Doubly-Linked Lists

19. favorites

    Lecture 19 - Hash Tables, Dealing with Collisions

20. favorites

    Lecture 20 - Pointers to Pointers, Binary Search Tree, Tries, Heaps

21. favorites

    Lecture 21 - Heapsort, Jeopardy!

22. favorites

    Lecture 22 - Huffman Coding Theory

23. favorites

    Lecture 23 - Bitwise Operators, Underneath the Hood - From Code to Executable File

24. favorites

    Lecture 24 - Dangerous Functions, Secure Code

25. favorites

    Lecture 25 - The Internet and Webpages - HTTP and XHTML

26. favorites

    Lecture 26 - Introduction to PHP

27. favorites

    Lecture 27 - User Input, Setting up a Login Page, SQL

28. favorites

    Lecture 28 - Threats, Part 1

29. favorites

    Lecture 29 - Threats, Part 2

30. favorites

    Lecture 30 - Introduction to LISP

31. favorites

    Lecture 31 - Brief Introduction to System Programming and Machine Organization

32. favorites

    Lecture 32 - Conclusions