5/19

1.  Review:  Credit email,  OOP,  Event vs Procedural programming

2.  Presentations

3.  Mastermind:

4.  Competency Exam

5.  Computer Science  (Chapter 10)
               -Why CS?   pro and con
               -Encryption
               -time share and multi-tasking
               – Artificial Intelligence (AI)   and Databases (if time)

6.  Programming:   Tell vs Show:   Other paradigms
                -Web editors,   Rapid prototype Languages

7.  Recursion:  Define
               -Replace Loops
              – good (Show vs Tell)  vs.   bad (HARD to figure out)
              – fibonacc1 numbers:    Base case,  Recursive call, work towards base case
              – Do:   Factorial,  Sum of all numbers.  3 fibbo,  combo

8.  Trees:
              -Binary Search Trees:  (BST)
                        -Make as tree
                        -Store as array
                        -Traverse:  Recursion
              -Heaps
                         -Make as tree
                         -Store as array

9.  8 puzzle:  Overview
                     -Solution:  Breadth First Search
                             -How it works
                             -How to expand:  paper
                             –With Backtrack

10  Problem??    A* Algorithm and Heuristics
                   -Best First Search  (vs Breadth and Depth first)

11.  Teams:
                 -Leader,  GUI (Input and Output),  Manage Array functions,  Heuristic function,  etc..

12.  To Do List             

13.  Work Time