CS 223 Advanced Data Structures

and Algorithms

Spring 2008

 

Home

Schedule

Labs

Announcements

 

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

5/1/08: The schedule:

May 05(Mon): Final Exam, 2:00-3:30pm, EPS103

May 07(Wed): Check your scores, 10:00am-12:00pm&1:00-3:00pm, EPS 360

The final is a close-book, close-note and no-cheating-sheet exam. But you are
allowed to use the calculator. For those who have not completed the course and
faculty survey, PLEASE DO SO BY THIS SAT.

4/24/08: I made a very very important correction to the recursive equation
in Lab 11: change (f(n-1)*f(n-2)) to (f(i-1)*f(i-2)). Please check the
updated file in our website. In addition, please take several minutes to
complete the course survey right after the lab tomorrow.

4/22/08: The solution key for HW3 is posted.

4/14/08: The deadline of Lab 10 is extended to April 25, next Friday.

4/11/08: For Q6 in HW3, just give the sequences in which the nodes are visited.
You do not have to justify them.

3/17/08: The midterm will be on 11:00am-12:15pm, March 18. It is a close-note, close-book,
no-cheating-sheet exam. But you can use the calculator in the exam.

3/7/08: HW2-Key has been posted. Note that for rehashing in Q4&5, the algorithms
are supposed to go through the old table and re-insert the existing the elements
one by one. This order may be different from the original order of the given sequence.
In addition, for Q4, the new element should always be inserted to the front of the
corresponding linked list instead of the end. The textbook makes a mistake on this
in the corresponding source code, as pointed out by a student.

Feel free to contact me anytime by email if you have any concerns about the HWs or midterm.
Have a nice spring break and Good luck on your exam!

2/28/08: For Problem 1 in Lab 6, your algorithm is supposed to generate the adjacency
matrix for a graph given by an INPUT FILE. That means you have to parse the input file
and then generate the matrix based the given information. The two input files are posted
in the website now . The input files are txt files. Lab6-Graph1.txt corresponds to the first
graph and Lab6-Graph2.txt corresponds to the second graph. Each file tells you the number
of vertices and the number of edges in the graph first and then lists all the edges. For example,
0-1 just means there is an edge between vertex 0 and 1. I also posted the updated lab
assignment statement.

2/26/08: I made a correction to Q2 in HW2 (Change "32" to "57"). The corrected version
has been posted.

2/12/08: A correction has been made to Q4 in HW1 (pay attention to the equation).
Please download the new version of HW1 in our website.

1/17/08: It turns out that both CS221 Advanced Programming and CS222 Discrete Math
are the prerequisites of our course CS223. If this requirement is not satisfied for you, please
be sure to talk with me about that in this week. In addition, there is no lab for this week.
The first lab assignment will be given in the next week.