1. Overview CS113, Fall 2000 Gene Itkis

2. The Promise Heavy Fast-paced Challenging Rewarding

3. Areas covered “ Software ” Data Structures Algorithms analysis

4. Software Objects, classes Flow of control, iteration Function, recursion Templates Inheritance Polymorphism Encapsulation Re-use

5. Borderline: Software - Data Structures Arrays, Vectors Containers Pointers Memory management

6. Data Structures Link-lists Singly & Doubly linked Stacks Queues Trees Graphs

7. Algorithms Binary Search Sorting Graph exploration (spanning trees) DFS BFS Other graph algorithms (sketched only) Shortest Path Minimum Spanning Tree

8. Algorithms with Data Structures Heap & Heap-sort Searching Search trees Hash tables Analysis Performance big-O notation

9. Homeworks Root, Power (1,2) Application: babyRSA (3) BigNum Arithmetics (4,5), Sorting (5), Queues (6) NetworkNode (5) Communication with babyRSA Network 2-node (6); many nodes, 1round (7), many nodes, many rounds (8)

10. Problem Sets 1, 2 Roots, Powers, babyRSA Binary search Classes, functions, iteration Simple I/O

11. Problem set 3 mPower Repetitive squaring method Efficiency issues babyRSA Constructing building blocks and then building with the building blocks Levels of abstraction

12. Problem Set 4 BigNum Objects, methods, constructors Using vectors Scope/function concepts: friend functions babyRSA More objects, methods Baby version of some real world applications

13. Problem Set 5 More bignums Sorting Arithmetics – how math concepts … are used in real world applications how they may affect programs NetworkNode Using babyRSA String processing File IO

14. Problem Set 6 Bignum Queue Link-lists Queues Destructors 2-Node network Creating more complexity from our building blocks

15. Problem Set 7 Search Data Structure Search trees Templates Destructors Network Graph Using search ds many times Neighbors Dictionary

16. Problem Set 8 Network Hashing Inheritance “ True ” complex SW system Time simulation