Prerequisite: C- or better in
3450:221 Analytic Geometry and Calculus I C- or better in
3460:210 Data Structures and Algorithms I
Objectives
To reinforce problem solving and programming skills
through programming in C++
To introduce intermediate and advanced data structures and algorithms that
are needed for more advanced courses
To understand the basis upon which various algorithms are compared with
respect to resource needs
Required Text
Clifford Shaffer, A Practical Introduction to Data
Structures and Algorithm Analysis, 2nd Edition (Used in 3460:210:
DSA-I). You may use the first edition if you already have it. These links will get you to the author's
collection of transparencies
and source
code examples.
Grading Policies Your grade will be based on 2 exams (20% each), a
final exam (30%), 4-6 programs, quizzes, and
homework (30%). Exams are closed book, closed notes;
notify your instructor in advance if you think you might
miss an exam. The final is comprehensive. Each program is
worth roughly the same amount. Late homework
will not be accepted. Late programs will be penalized 10%
per day late. Quizzes (if any) may be unannounced.
Grading scale (+/- grades may be assigned at
instructor's discretion): A 90-100
B 80-89 C 70-79 D 60-69
F 0-59
Program Submissions
All programs will be submitted via email. You will also need to
submit a printed and signed copy of your source code. Be sure you
have a UANET ID and are comfortable using an email client and a zip
utility. Programs may be submitted for grading only if
all previous programs have been assigned a grade. DO NOT
submit programs that are not reasonably correct!
To be considered reasonably correct, a program
must be completely documented (see documentation
guidelines) and work correctly for sample data provided
with the assignment. Programs failing to meet these
minimum standards will be returned ungraded and a 30%
penalty assessed. Late points will be added on top of
this penalty. Many programs will be tested against
additional "hidden" data. A minimum
requirement for passing this course is the completion of
all programming assignments (each must be reasonably
correct).
Honesty
All programming assignments must be your own work. Do not
work with others to complete them. Past students have
found that this ensures the best learning experience.
Duplicate or similar programs, plagiarism, cheating,
undue collaboration, or other forms of academic
dishonesty will be reported to the Student Disciplinary
Office as a violation of the Student Honor Code.
Final Exam:
Tuesday, May 7 at 2:00 - 3:55 pm
Last day to drop this class: Friday, Mar 8 (You do not need your
instructor's signature to drop by this date. In general, instructors will
not sign drop forms.)
Special Notice:Students
whose names do not appear on the university’s class list by January 28, 2002 will not be permitted to participate (attend class, take exams,
or receive credit.)