CSC 383: Syllabus

Course description

From the course catalog: "[This course is about the]  [d]esign, implementation, application, and analysis of algorithms on a variety of data structures, including stacks, queues, lists, trees, binary heaps, hash tables, and graphs. Algorithmic analysis includes computation of running times and asymptotic analysis. Prerequisite: CSC212 or CSC224."

Textbook

Our required textbook is Data Structures and Algorithms in Java, 5th edition, Goodrich & Tamassia (John Wiley & Sons, 2010; ISBN: 978-0470383261).

The first two chapters of the text review what you should have learned in previous Java courses (e.g., CSC 211 and CSC 212).  I suggest at least skimming them to review and refresh your knowledge.

We will begin the quarter in chapter 5, then back to chapters 3 and 4.      

Important dates

Some important dates:

Participation policy

Section 401 (in-class section): Even though the lecture is recorded, this is not an on-line section.  Attending every class is required.  Missing class may drop your final grade by a full letter.  If you registered for this section intending not to attend and believing that you can watch it all on COL, either switch to the distance learning section or drop now.  Attendance includes the final exam.  Do not ask to take the final exam at a time other than what's listed above.

Section 410 (distance learning section): Students in this section are not expected to come to class but are welcome to do so anytime, as long as seats are available.  Note that it is important that I be able to reach you.  If you receive email from me, please respond within 48 hours so that I know you're still out there.  Arrangements for taking the final exam will be made later in the quarter.

Grading policy

All assignments must be submitted through COL.  Assignments emailed to me are not considered submitted.  An assignment loses 10% every 12 hours it is late, which means that an assignment's value goes to 0 five days after the due date.