50% of your grade comes from exams. 50% of your grade comes from
the laboratory and classwork. To pass the course, you must average at least 50% on
the exams. The final will not be given early.
Instructor
Hunter Lloyd
Office: EPS 357
Phone: 994-5959
Email: hunterl - at symbol - cs.montana.edu
Textbooks
Objects, Abstraction, Data Structures and Design Using Java,
by Koffman & Wolfgang.
Algorithm Design by Kleinberg, Tardos
Course Outcomes
At the end of the course, students should be able to
Use the Java Collections available in the library.
Understand and implement different data structures, including:
Hash tables
Balanced binary search trees
Priority queues implemented as heaps
Graphs
Implement and know the efficiency of many of the common algorithms, including
Searching and sorting algorithms
Floyd's, Prim's, Kruskal's, and Dijkstra's algorithms
Understand when to use some of the algorithm design techniques, including: