Summer 2014 Exam 1
From CS 61A Wiki
Revision as of 20:41, 8 July 2014 by Andrew
Time and Location
2050 VLSB, 7pm Thursday (July 10, 2014)
- Python Basics
- Higher-order functions
- Linked lists (ignore tuples and OOP); Also known as
rlistsin other semesters.
- Tree Recursion
- Environments / Environment diagrams
- Abstract data types
- Trees (We haven't covered BSTs or Trees in Scheme)
- Deep lists
- Orders of growth
- Newton's method
- Halting problem (Extra Credit)
Bolded topics are going to have in-depth questions.
How to study
Here is an old algorithm for studying for tests: For each topic on the exam, find problems on them and do them. If you can solve them on your own, move on. Else if you are stuck, look at the solution and figure out if you are missing a trick or if you do not understand the concepts. If the problem is that you are stuck on some random trick, just learn the trick. Stare at the solutions, ask Piazza, your TA, etc. Questions you should ask at this stage: What is the problem asking me to do? How was I suppose to follow the instructions to solve the problem? What part of the problem do I not understand? What is the fastest way to clear up that misunderstanding? Then if you think you are still stuck conceptually, review and learn the concept, however you learn best. Suggestions for picking up concepts quickly (~1-2 hours): Discussion notes typically have a very concise recap of the thing they are going over. There are guides for particularly tricky things on the wiki, like Hanoi, powerset, etc. Find them and go over them. Ask a TA: "what is the best way to learn X?" If these do not work and you are still shaky after an hour or two, it might be worth watching a lecture or reading the notes. Be sure to try out some more problems as you're learning!