back to the AP homepage 
  | APCS - Second Semester
We will now be covering the AB material of the curriculum. While its actual 
  difficulty is a subjective matter, it is definitely new material for us, and 
  it can get complicated. With that, here is an outline of the units and the approximate 
  classes that will be covering it.
Below is a working outline. This means 
  that it is subject to multiple revisions as we proceed through the material. 
  You will also receive practice exams as homework on many of the days below that 
  do not have something else mentioned.
-------------------- PREP --------------------------- 
Class 42: 2/3/09
Take questions on the HW
  Midterm: Midterm Stat Sheet | 
  Midterm 
  Exam | Midterm Key
Labs 
  5-7 You can find the BlueJ file in the Public Folder if you don't 
  already have it.
  Should be done by the end of class Thursday.
  For lab 7: TRACE THE CODE using the array {12, 9, 18, 31, 5} on paper with a 
  PENCIL. 
(Labs 8 and 9 and the Concentration Lab can be found in my public folder.)
  
    | TWO-DIMENSIONAL ARRAYS (Mid-February) | 
  
    |  | 
Foo List Code
 
   
    | LINKED LISTS (Late Feb to Early 
      March) | 
   
    | 
         
          | Class # | Topics | Homework |   
          | 47 | Discuss Linked Lists and its usage, Lab 
            10 | Finish any backwork (old labs) Create a list of AT least 4 CDs per lab 10 requirements
 |   
          | 48 | Work 
            on Lab 10 | "Be Prepared"1. Read pages 113-129
 2. Practice Exam A-2 - All part 1 questions
 3. Practice Exam AB-1, Part 2, question 1: Page 287
 |   
          | 49 | LL 
              Worksheet Discuss doubly linked lists and circular lists
 Go over the HW
 
 |  |   
          | 50 | LL 
            Worksheet Finish Lab 10 + Linked List Labs
 | Read 20.3 and 20.4 Linked List Quiz
 |  | 
   
    | QUEUES AND STACKS (Early March) | 
   
    |  | 
   
    | SETS AND MAPS (Mid March) | 
   
    |  | 
   
    | TREES/FINAL AB TOPICS (Late 
      March/Early April) | 
   
    | 
         
          | Class # | Topics | Homework |   
          | 56 | Handout on Binary Trees Tree 
            Powerpoint | Inorder/pre/post
 Begin 
            Labs 15 and 16 | treeData.txt
 | Read 21.6 and 21.7 Tree Powerpoint
 FINISH THE POWERPOINT (from page 41)
 |   
          | 57 | Tree Powerpoint | Inorder/pre/post Continue working on Labs 15 and 16
 | Test #5 |   
          | 58 | Tree Exercise 
            - Finish labs Check 
            your Tree Exercise work when done
 Also - Create a new class 
            in Lab 15/16 called BSTTest - Populate a BST with ints and test these 
            answers.
 |  |   
          | 58a | Work in your "BSTTest" class to test your answers to the 
            exercises from last class. Once you get those working, click 
            here. | Study for test (sorts, trees, general A) |   
          | 59 | 30 Week Exam17 Multiple Choice questions
 Some fill-in/short response
 An AB Exam Part 2 Question
 
 | Read 21.8, 21.9, and 21.10 (Priority Queues and Heaps)
 |   
          | 60 | Discuss the Reading Powerpoint on PriorityQueues
 Labs 17 and 18
 | Test #7 - PriorityQueues/Heaps 
 |   
          | 61 | Go over the 30 Week 
			 | Question 22 
              | AB Part 2Continue Labs 17 and 18
 | Practice AP ExamBe Prepared AB -1
 ENTIRE EXAMQuestions 1-40
 (all 4 part 4s)
 |  | 
   
    | Final Push to the AP - 8 Classes 
      to go... | 
   
    |  | 
Previous AP Part 2 Answers 
  
   
    |  | Powerpoints on AB Topics | 
   
    | 
         
          | AB TOPICS YOU NEED 
              TO KNOW 
               
                | 
                    Maps, sets, hashcode, equalsQuicksort2d ArraysLinked Lists (singly, double, circular) | 
                    StacksQueues (and Priority Queues)TreesHeaps |  |  | 
 Comparable, List, Set, Map, Iterator, ListIterator, LinkedList, HashSet, TreeSet, 
  HashMap, TreeMap