« Back to James's CS61A page. CS61A: Spring 2000

Week 16 Discussion/Lab Notes


Well, it's that time of year.

I've spent a lot of time going over details to various things. In the long-run, these details aren't very important. (Most of you probably won't use Lisp ever again, except possibly in CS188.) Take a step back and think about the big ideas what we've covered! You'll encounter them again in later CS courses. I remember Professor Hilfinger, during a CS164 lecture, saying "Everything you need to know you already learned in 61A."

Course Topics
CS61B (Data Structures) OOP, data abstraction, efficiency/running time
CS162 (Operating Systems) concurrency
CS164 (Programming Languages and Compilers) evaluators, code analysis, environment diagrams, non-determinism, parsing, pattern matching
CS170 (Algorithms) efficiency/running time
CS184 (Computer Graphics) picture language (Project 2), hierarchical data
CS186 (Databases) query language
CS188 (Artificial Intelligence) non-determinism, natural language, logical inference, unification

One of those unfortunate things about CS61A is that it's an introductory course, but most people probably won't appreciate it fully until they gain more programming experience.

Contrary to what some people may think, CS61A is not about learning Scheme. (If it's not about Scheme, then why do we use it?) Nevertheless, in my opinion, Scheme is a superior language to most of the other ones out there, so it's good that we learned it along the way.

One of the things we try to teach you (indirectly) is how to write good code. What is good code? What is good style?


Here are some links some of you may find useful in your futher misadventures in the world of computer science:


« Week 15
« Back to James's CS61A page. CS61A: Spring 2000

Last Modified: Tuesday, 30-Dec-2014 11:58:34 PST