|
Note: this syllabus will be updated as the semester progresses - make sure to check it regularly.
Week 1: |
Course intro, Interfaces, Java Objects and Generics |
|
|
Week 2: |
Lists (array-based), Iterators |
|
|
Week 3: |
Exceptions, Complexity |
|
|
Week 4: |
Primitive vs. Reference Types, Linked Lists |
|
|
Week 5: |
Stacks and Queues; Introduction to Recursion |
|
|
Week 6: |
Recursion, Searching, Intro to Trees, General Trees |
|
|
Week 7: |
Binary Trees, Intro to Binary Search Trees, Binary Search Trees |
|
|
Week 8: |
Priority Queues, Heaps, Intro to Red-Black Trees |
|
|
Week 9: |
Red-Black Trees, Mid-semester Review, Hashing |
|
|
Week 10: |
Sorting |
|
|
Week 11: |
Sorting |
|
|
Week 12: |
Introduction to Graphs |
|
|
Week 13: |
Graph applications, Computer Systems |
|
|
Week 14: |
Semester Review |
|
|
CS367 is a 3 credit course, which meets for two 75 minute lectures each week.
In addition to this time spent in lecture, it is expected that students spend a minimum of 6 hours per week outside of class reading,
completing programming assignments, and reviewing course topics and materials.
|
Last Updated: 1/18/2018 ©2018 Beck Hasti and Charles Fischer |