| Week | Lecture # | Topics Covered | Text Book Readings | |
|---|---|---|---|---|
| 1 | 1 | Syllabus |
1 - 25 | |
| 2 | The Algorithmic Model Programming Langauges Data/Assigments/Arithmetics Input & Output |
27 - 71 | ||
| 2 | 3 | Conditionals Writing simple algorithms Software Engineering principles Cheating, academic misconduct |
71 - 86 | |
| 4 | Intro. to procedural abstraction Procedures & Functions |
87 - 103 | ||
| 3 | 5 | Module invocation Parameters Tracing |
103 - 121 | |
| 6 | Intro. to recursion |
121 - 140 | ||
| 4 | 7 | Advance recursion Documentation Data abstraction (records) |
131 - 148 | |
| 8 | Dynamic memory and pointers Linked List intro. |
148 - 162 | ||
| 5 | 9 | Linked List inseration Linked List deletion |
162 - 177 | |
| 10 | TEST |
|||
| 6 | 11 | Stack Queue Trees |
177 - 186 | |
| 12 | BST basic traversal BST insertion BST deletion |
186 - 190 | ||
| 7 | 13 | Graphs Arrays Iteration Combining data structures |
190 - 219 | |
| 14 | Traversing a linked list BST traversals Array traversals Breadth/Depth -first traversals |
221 - 232 | ||
| 8 | 15 | Simple search Binary search Data structure conversions Helper modules |
232 - 235 | |
| 16 | TEST |
|||
| 9 | SPRING BREAK | |||
| SPRING BREAK | ||||
| 10 | 17 | Java 1 Intro to OOP Abstraction Compiling |
||
| 18 | Jave 2 Syntax Control Modules |
|||
| 11 | 19 | Java 3 Simple Programs |
||
| 20 | Java 4 Dynamic Data Classes |
|||
| 12 | 21 | Java 5 Intializing Objects Static |
||
| 22 | TEST |
|||
| 13 | 23 | Java 6 Debugging Linked List Class |
||
| 24 | Java 7 Arrays and Sorting Bubble Sort Merge Sort |
|||
| 14 | 25 | Java 8 References Inheritance |
||
| 26 | Java 9 Abstract CLasses Intro to Polymorphism |
|||
| 15 | 27 | Algorithm cost Algorithm complexity (Big-oh intro.) |
317 - 331 | |
| 28 | Structures Reasonable vs. Unreasonable Algorithms |
331 - 350 | ||
| 16 | 29 | Computing |
||
| 30 | Review |
|||