Course Objectives

Upon successful completion of this course with a passing grade, students will need to demonstrate knowledge of the following skills:

• Develop a computational solution to a problem over the entire software lifecycle
  • Know how to specify & design acceptable computational solutions
  • Know how to implement & test acceptable computational solutions
  • Know how to use & implement data structures
• Know the operational details of computer languages & systems
  • Understand file structures, storage, and indexes
  • Perform Boolean logic & arithmetic
• Know the theoretical foundations of computing
  • Know how to develop and analyze algorithms
  • Know how to use greedy and recursive algorithms
  • Understand computational limits and be familiar with partial proofs of correctness

Prerequisites/Corequisites

• Students must have passed both CSC 212 & CSC 212L
• Students must be enrolled in both CSC 213 and CSC 213L

Textbook

Michael T. Goodrich and Roberto Tamassia, Data Structures and Algorithms in Java, 4th Edition, Wiley, 2006.

Attendance

Class attendance is mandatory. Since all students are present, the instructor will not take attendance. Students are responsible for all material covered and announcements made in class. Class absences or late arrivals are not acceptable excuses.

Late Work

Each student has 2 "virtual extensions" for the term. Students can use each extension to submit a weekly assignments or project 24-hours late without penalty (they may also be combined to turn something in 48-hours late). Without a "virtual extension" late work will not be accepted.

Help!

In any course, all students experience some difficulties and frustration and everyone (instructor included) makes mistakes. Nearly all students will fall behind and have some difficult catching up. Everyone needs help sometimes.When it is your turn to have problems, do not suffer in silence! Asking for help is a sign of strength and maturity. Talk to your instructor immediately, before things become serious. You can do this via phone, e-mail, after class, or stopping by his office. He wants to help you solve these problems and does not make any judgments. Because he cannot always know who is having trouble, you must take the initiative of making initial contact.

Grading

Grades will be computed from a weighted average of the following items:

Midterms	32%
Final	25%
Portfolio	7%
Weekly Exercises	9%
Daily Activities	6%
Programming Projects	21%

Initial cutoffs for each letter grade.

93%+	A
90-92	A-
87-89	B+
83-86	B
80-82	B-
77-79	C+
73-76	C
70-72	C-
60-69	D
0-59	F

Final grades will reflect students’ effort and performance. If necessary, these may be revised downward