This is my personal learning record for CS61A-Fall-2021 of UC-Berkeley. I once heard that it's an amazing cs course and it's very helpful for those who are new to programming, so I decided to take this course to see if I could learn something new.
To be honest, this is the best introductory computer programming class I've ever taken. Even for me, a CS student, some of the problems are still challenging. How I wish I could take a class like this when I was an undergraduate
The official website: https://inst.eecs.berkeley.edu/~cs61a/fa21/. If you want a better reading experience, you may visit my blog.
All materials can be found on this offical page: https://inst.eecs.berkeley.edu/~cs61a/fa21/
- lab01. Variables & Functions, Control
- lab02. Higher-Order Functions, Lambda Expressions
- lab03. Midterm Review
- lab04. Recursion, Tree Recursion, Python Lists
- lab05. Python Lists, Trees
- lab06. Mutability and Iterators
- lab07. Object-Oriented Programming
- lab08. Linked Lists, Mutable Trees
- lab09. Midterm Review
- lab10. Scheme
- lab11. Interpreters
- lab12. Regular Expressions, BNF
- lab13. SQL
- lab14. Final Review
- hw01. Control
- hw02. Higher-Order Functions
- hw03. Recursion, Tree Recursion
- hw04. Data Abstraction, Trees
- hw05. Iterators and Generators
- hw06. Object Oriented Programming, Linked Lists
- hw07. Scheme
- hw08. Scheme Lists
- hw09. Regular Expressions
- hw10. BNF, SQL
- High order functions 👍
- Recursion 👍 I really like this one
- Scheme language 👍 This is brand new knowledge for me
- BNF 👍
- Abstraction 👍 The most import concept in CS in my opinion.
🤗 Welcome to check my repo cs-courses.
Join me and enjoy the journey 🚀