Welcome to Data Structures (and Algorithms)!
You're in the right place if you want to improve your Java programming skills and learn lots about the various ways to organize data efficiently for your applications.
Basics
Catalog Description: This course covers the design and implementation of data structures including arrays, stacks, queues, linked lists, binary trees, heaps, balanced trees (e.g. 2-3 trees, AVL-trees) and graphs. Other topics include sorting, hashing, memory allocation, and garbage collection. Course work involves both written homework and Java programming assignments.
Prerequisite(s): 600.107: Introduction to Programming in Java (preferred) or 600.109: Introduction to Programming in C/C++; 600.120: Intermediate Programming can be helpful as well.
Academic Honesty: It is your responsibility to adhere to the Department Integrity Code and other applicable university regulations. Feel free to email us your questions or concerns.
Coordinates
Lecture:
Wednesday & Friday, noon – 1:15 pm
Location:
2
Shaffer Hall
Midterm:
Friday, October 10, noon – 1:15 pm
Final Exam:
Thursday, December 18, 2:00 pm – 5:00 pm
