CS 61B Sections 19 & 21

Spring 2000

[ Announcements | Section Notes | Other Files | Other TAs ]

• 5/8 (Mon) 4-5 PM. Normal discussion time/place (6 Evans). Question and Answer session. I may go over the review sheet given in class.
• 5/10 (Wed) 3:30-5 PM. CS 61B Lab (277 Soda).
• 5/15 (Mon) 2-4 PM. CS 61B Lab (277 Soda).
• 5/16 (Tue) 3-4:30 PM. CS 61B Lab (277 Soda). Bring any last minute questions.

• (5/19) Final grades has been entered, and should be available on glookup now. The mean for the class was 32.96, while for my section was 33.75. Good work! Hopefully you'll have a nice summer -- I enjoyed having all of you in my section :)
• (5/10) Lab 14 and 15 scores should be available on glookup now.
• (5/6) Important My office hours during the final are indicated above. If you want to setup special meeting times, email me.
• (5/6) Important Final location has moved to Wheeler Auditorium. It is still at 5 PM, on May 16th (Tue).
  Review time has been changed to 11 AM, May 14th (Sun).
• (5/3) Final will be on 5/16 (Tue) 5-8 PM, 100 Haas Pavillion. Final Review will be on 5/14 (Sun), 12-2 PM, 155 Dwinelle.
• (4/24) Lab 13 scores should be available now.
• (4/19) Lab 10, 11, and 12 scores, as well as Midterm 2 scores should be available on glookup now. Let me now of any discrepancies.
• (4/13) You should start on Project 3 by now. Lab 13 will be project 3 checkoff. Make sure you have something to show me by then.
• (4/9) My BinaryTree.java from Lab 11.
• (4/2) Midterm II will be on 4/10 (Mon). Review will be on 4/8 (Sat), 5 - 7 PM, 10 Evans.
• (4/2) Grades for labs 7, 8, and 9 should be available now.
• (3/15) This weeks lab is project checkoff. Make sure to read the lab before hand, and have something to show me by then.
• (3/14) Monday discussion on 3/13 has been moved to Tu 2-3 PM at 320 Soda. This only affects this week. Office hours are at normal time/place.
• (3/2) You should start on project 2 by now. I'll cover Game Trees, Minimax, and Alpha-Beta pruning next week, so please be familiar with the project by then.
• (2/28) Lab 6 and midterm grades should be available now.
  Project 2 is out. You probably want to start soon.
• (2/22) Lab 5 grades should be available now. Lab 6 will be about Exceptions; please read about Exceptions.
• (2/21) Midterm Reviews: Mon 1-3 PM, 306 Soda, and Tu 5-7PM, 50 Birge.
  I will be at the Monday review, so if you have any questions, you can ask me afterwards. The notes I used for the review is available here. (Note: this note covers only what I covered in the review, hence only contains the first two weeks material.)
• (2/16) Exams are open book/notes, not closed book as I hinted in Monday section.
• (2/15) Lab 4 grades should be available now.
• (2/7) Lab 3 grades should be available now.
• (2/7) Lab 4 will be checking off Project 1 Part I. Make sure you have something interesting to show me by then.
• (2/7) My solution to Lab 3 is available here.
• (2/3) My office hours has changed to Tu 5-6 (and later if necessary), and Wed 1-2, at 283/277 Soda.
  Hopefully my office hours stay at that time for the rest of the semester. Other T.A.'s office hours are listed here.
• (2/3) Lab 1 & Lab 2 grades should be avalable in glookup now. Let me know of any discrepancies.
• (2/2) You should be able to start project 1 (at least part I) by now.

• Note 1 (ps) -- Classes, Static, Constructors.
  (Note: I covered different items in Monday section. I'll try to cover same topics in the two sections from now on.)
• Note 2 (ps) -- Conditionals, Loops, Switches, Arrays.
• Note 3 (ps) -- Break, Continue, Abstract Data Types, Linked Lists. My SList.java from Lab 3.
• Note 4 (ps) -- Activation Records, Recursion, Inheritance.
• Review 1 (ps) -- Notes I used for Monday review.
  Note: This note only contains what I covered; it only contains the first two weeks' material.
• Note 5 (ps) -- Review. More Inheritance, Interface.
• Note 6 (ps) -- Packages, Exceptions.
• Note 7 (ps) -- Game Trees, Minimax, Alpha-Beta Pruning.
• Note 8 (ps) -- Asymptotic Notations, Hashtables, Stacks, Queues.
• Note 9 (ps) -- Priority queues, Trees.
• Note 10 (ps) -- Binary Trees, 234 Trees, Graphs
• Note 11 (ps) -- MergeSort, QuickSort, Comparison Based Sorting.
• Note 12 (ps) -- Midterm, Union-Find, Sorting.
• Note 13 (ps) -- Splay Trees, C/C++.
• Note 14 (ps) -- Memory Management, C/C++.

• SList.java (Lab 3)
• BinaryTree.java (Lab 11)
• DList.java (HW 4)
• LockDList.java (HW 4)
• Set.java (HW 5)
• HashTableChained.java (HW 6)