Course objective: Common data structures for abstract data types and algorithms, including trees, heaps, sorting, hashing, disjoint set find-union and basic graph algorithms; their performance comparison.
Prerequisites: CS 26 or 110, CS 64 or Math 52 or 54.
Textbook: Mark A. Weiss, Data Structures and Algorithm Analysis in Jav a (3rd ed.), Addison Wesley, 2012.
|4 Assignments (due on 2/8, 3/14, 4/4, & 4/27)||20%|
|2 Mid-Term Exams (close-book and close-notes): Feb. 24 and Apr. 6|
(Study Guidelines: Mid-Term 1 and Mid-Term 2)
|Class Quizzes (5)||10%|
|Final Exam (close-book and close-notes):
May 13, 13:30 - 16:15, Stafford Hall 101|
Academic honesty: You may discuss an assignment with other people, refer to other literature, or search the Internet for better understanding of and more insight into the assignment. But you must provide all answers for yourself. Plagiarism will be handled according to the University Code of Academic Integrity (http://www.uvm.edu/~uvmppg/ppg/student/acadintegrity.pdf).
Special needs: If you need any special accommodations for a reason of disability, please inform the instructor at the beginning of the course so an appropriate arrangement can be made.