2. Array Competency: Count how many scores are between the highest odd score and the average even score
3. Overview and Summary: Know List: Model in the Middle
4. Transistors: Diagram and how they work
5. Making the 3 Gates: Not, And, Or
6. How the Computer Adds and Subtracts (Compares) ——— Binary Numbers (Practice) ——— Adding ——— 2’s Compliment and Subtraction (COMPARE)
7. ON COMPUTERS: ——- Adder Circuits ——- Machine Language ——- How do you know ENGLISH == Programming Language??
8. How do you make a computer HARDWARE FAST? ——– Clock ——– Bus ——– Word ——– Parallel
9. How do you ma ke SOFTWARE FAST? —— Solve like TTT? Works, BUT —— Solve by Exhaustion like MM, BUT.. —— BIG O and Scale ————– Examples: O(n), O(n^2) O(logN) O(1) ( Practice) ————– Examples: Searches and Sorts (Hashing) ————— Data Structures, Stacks, Queues, and TREES (Practice) —————- Make BST, BST
–————– Recursion (PROLOG, LISP) ———————- FibboFibbo MultFactorial
11. So where are we? Understand Brain or Not, What we DO is in jeopardy ———-Expert Systems: ————— Campbell, Mycin, and Politics ————— What else can save your job? ————— Relationship and Choice
