CS14: Data Structures
Fall
2001
Class
meets on TR 11:10 - 12:30 in Watkins 1000
|
Instructor: |
Deganit Armon |
|
Office: |
341 SURGE |
|
Office hours: |
W 11-2 |
|
Phone: |
787-2604 |
|
email: |
|
TAs |
|
Office |
Office hours |
|
Nikhil Aggarwal |
282 Surge |
TW 2-3:30 |
|
|
Jessica Lin |
282 Surge |
M 2-3 TR 5-6 |
|
|
Anil Reddy |
282 Surge |
M 4:30-5:30, W 5:30-6:30, F 11:30-12:30 |
Text
Frank
Carrano/Data Abstraction and Problem Solving with C++, Walls and Mirrors.
Topics
Topics
to be covered will include recursion, linear data structures (lists, stacks,
queues), trees, heaps, sorting, hashing, and space/time complexity analysis of
the algorithms involved. Other topics may be added if time permits. You are
responsible for everything that is covered in the lecture.
Grading
|
Programming
projects: |
45% |
|
Written
assignments: |
20% |
|
midterm: |
15% |
|
final:
|
20% |
Grading
is on a straight curve (A 90% and above, B 80-89%, C 70-79%, D 60-69%, F below
60%). Please note that projects make up 45% of the grade. This means it is not
possible to pass the class without doing the projects, even if you ace the
tests. The final is comprehensive, with more emphasis on the second half of the
course.
Each
student will be assigned a random code, which will be mailed to your account.
Grades will be posted to the website, as they become available, sorted by this
code. This way you can not only see your own grade, but also compare your
progress with the rest of the class.
All
course material will be posted to the class website. Programming assignments
are turned in electronically. Partial
projects will be given to partially completed projects. However, programs that
do not compile will be penalized heavily. Written assignments are due in class
on the due date. Extra credit opportunities will abound.