As you study for Test 3 (which is Monday Nov 25th at 9:30AM), be aware of the following:


1) There is a section of links on our course web page entitled
   "List Processing Algorithms" -- containing links to my web sites
   concerning the searching algorithms and the three sorting algorithms.
   This section of links occurs right above the "Homework" section.

2) There is a section of links entitled "Solutions to Recent Homeworks", 
   located right below the "Homework" section.  Here you will find my solutions
   to Homeworks 8, 9, and 10.

3) The test will have 24 points on sorting algorithms.  
   If you practice with these using my web sites, you should "max out" on this part.
   Each of the sorting algorithms will have an 8-point question in which you indicate how a list is arranged
   after one more pass (for selection or bubble sort) or one additional insertion (for insertion sort).
   Obviously, you can give yourself lots of practice using my sorting web sites.

   For example, here's the Bubble Sort question I used once on a Test:
              
      Suppose Bubble Sort is given the list
                85 45 55 30 90 25 40 35
      After one pass, it will have changed the list to
                25 85 45 55 30 90 35 40

      Show the list after one MORE pass:


4) The test will be roughly 30 points on searching algorithms.
   For the searching algorithms, know about the worst case, best case, average case
   # comparisons for both sequential search and binary search.  Know also how 
   to trace the values of first, last, and mid during a particular binary search problem.
   In other words, track them in a table just as you did for Homework 11.  
   Know how to draw a binary search tree for small N (for example N = 7,  N = 15).

5) The remainder of Test 3 will test Javascript programming -- so you should know 
   how 'if' statements and 'while' loops work and be able to trace programs to determine
   the PRECISE output of the alert statements.  You also need to do this for programs with arrays.
   There is a link called 'Some Practice Problems for Test 3' that you can practice with.
   We will go over these in class.
   If I can think of more practice problems, I will send them along.

   You also need to complete programs that use loops (like in HW 9) and that process arrays (like in HW 10).
   Study any relevant handouts (including the one I just mentioned) as well as solutions to HW 8, 9, 10.
   You'll see that there are certain types of problems (finding largest/smallest/longest,
   summing, averaging, counting, ...) that occur a lot.