CS 223 Advanced Data Structures
and Algorithms
Spring 2008
Time & Location:
Lecture:
TR,11:00-12:15AM,EPS 103
Lab-02:
F,9:00-10:50 AM,EPS 254
Lab-03:
F,12:10-14:00PM,EPS 254
Instructor:
Neil Tang
tang@cs.montana.edu
EPS 360
(406) 994-4810
Office Hours:
MW,1:00PM-3:00PM
TA:
Aaron Hall
halla@cs.montana.edu
Office Hours & Location:
Tue 3:30-5:00PM,
Thu 12-1:30PM
EPS 346
Course Information
Credit: 4 credits, 3 lectures, 1 lab
Prerequisites: CS 221 Data Structures (Advanced Programming) and CS222 Discrete Math
Course Webpage: www.cs.montana.edu/courses/223/
The Instructor's schedule for Spring'2008 (DOC)
Course Description
This course covers the advanced data structures and the related algorithms,and the basic algorithm design and analysis techniques. After taking this course,
the students are expected to be able to apply these data structure and algorithms
to solve practical problems and analyze their performance. Topics include:
- Algorithm Complexity Analysis
- Tree: Representations, Traversals, Binary Search Tree, AVL Tree, Red-Black Tree.
- Heap: Representations, Binary Heap, Heap Sort.
- Hashing: Hash Functions, Hash Tables, Collision and Resolution.
- Graph: Representations, Searching Algorithms, Topological Sort Algorithms,
Minimum Spanning Trees Algorithms, Shortest Path Algorithms, Network Flow Algorithms. - Greedy Algorithms
- Divide and Conquer
- Dynamic Programming
Textbooks:
-
Data Structures and Algorithm Analysis in Java (2nd Edition),
by Mark A. Weiss
Addison Wesley, 2006, ISBN: 0123705487 (Required). -
Introduction to Algorithms
by Thomas H. Corman et al.
The MIT Press, 2001, ISBN: 0262032937 (Recommended).
Grading:
| Midterm | 20% |
| Final | 30% |
| Homework | 20% |
| Labs | 25% |
| Class Participation | 5% |
| 93 - 100 | A |
| 90 - 92 | A- |
| 87 - 89 | B+ |
| 83 - 86 | B |
| 80 - 82 | B- |
| 77 - 79 | C+ |
| 73 - 76 | C |
| 70 - 72 | C- |
| 67 - 69 | D+ |
| 63 - 66 | D |
| 60 - 62 | D- |
Course Policies :
- If you decide not to attend a lecture or lab, you are still responsible for all information
contained therein and for any assignments. - No late submission will be accepted and no make-up assignment or exam will be given.
- You are required to do your own work, and submit for grading only your own work on any
homework or lab assignment. Cheating in any form will not be tolerated and will be punished
according to related university policies. - The university has a Student Conduct Policy that defines the meaning of cheating in its
various forms and the rights and responsibilities of the students and faculty. If you are in
doubt about them, please read it.
 |
 |
Copyright © Montana State University |