![]() |
CSCE 270 -- Data Structures |
![]() |
CSCE 270 -- Data Structures |
| Home | Syllabus | Schedule | Assignments | Labs | Useful Links |
Schedule is tentative and may be changed according to course progress.
|
Dates |
Topic |
Text |
|
2/8-2/10 |
Introduction, OOP, Inheritance, UML, Eclipse |
1.1-1.3, Appendix B.1 |
|
2/13-2/17 |
Abstract Classes, Casting, JUnit Testing |
1.4-1.8, Appendix D.1 |
|
2/22-2/24 |
President's Day, Quiz 1, List Interface, ArrayList, ArrayList Implementation |
2.1-2.3 |
|
2/27-3/2 |
ArrayList, Efficiency and Big-O, Linked Lists |
2.3-2.5 |
|
3/5-3/9 |
Quiz 2, Iterator, ListIterator, Double-Linked List |
2.6-2.8 |
|
3/12-3/16 |
Collection Framework, Testing, Stacks |
2.9-2.11, 3.1-3.4 |
|
3/19-3/23 |
Queues, Catch up and Review, Mid-term |
4.1-4.5 |
|
3/26-3/30 |
Spring Break |
|
|
4/2-4/4 |
Queues, Recursive Thinking, Easter Break |
4.1-4.5, 5.1-5.2 |
|
4/11-4/13 |
Easter Break, Recursion, Tree Terminology, Tree Traversal, Quiz 3 |
5.3-5.4, 5.6, 6.1-6.2 |
|
4/16-4/20 |
BinaryTree, BST |
6.3-6.4 |
|
4/23-4/27 |
Catch up and Review, Quiz 4, Heaps |
6.5 |
|
4/30-5/4 |
Heaps and Priority Queues |
6.5 |
|
5/7-5/11 |
Simple Sorts, Merge Sort, Quiz 5 |
8.1-8.7 |
|
5/14-5/18 |
More Sorting, Sets and Maps, Hashing, Final Review |
8.8-8.9, 7.1-7.? |
|
5/21-5/25 |
Final Exam: Tuesday, May 22 from 8:00-9:50 |
|