|
|
30043 CSC 3171A - 0 - AlgorithmsSpring 2007 |
This web page is http://www.bernstein-plus-sons.com/.dowling/CSC3171S07/CSC3171_Syllabus.html
Copyright © 2007 Herbert J. Bernstein and other parties. All rights reserved.
This is the syllabus for CSC 3171A for Spring 2007. As the course moves forward, students should return to this page frequently for updated material.
3 credits
Algorithmic development is a key ingredient to the development of computer based solutions for a wide variety of scientific and industrial problems. This course provides students with an opportunity to further develop their skills in developing and documenting methodologies for the solution of various problem classes. Topics include large systems development in a cooperative environment, the writing of understandable pseudo-code, techniques for estimating the efficiency of an algorithm, the use of advanced data structures, and the implementation of these techniques using a programming language like Pascal or C. Example problems may be drawn from a variety of areas in discrete and continuous Mathematics. The course will require cooperation and collaboration among students to complete more complex programming assignments.
Prerequisites: MTH 1017, CSC 2025.
Offered: 2006-2008.
This Spring 2007 section is:
| CRN | Subj | Crse | Sec | Credits | Title | Campus | ||
| Start Date | End Date | Days | Times | Bldg | Room | |||
| 30043 | CSC | 3171A | 0 | 3.00 | Algorithms | Oakdale | ||
| Jan 30, 2007 | May 14, 2007 | TR | 11:30 am - 02:20 pm | KSC | 022 | |||
| Instructor(s): Herbert J. Bernstein | ||||||||
Note that, in general, Dr. Bernstein will be at the Oakdale campus on Monday, Tuesday, Wednesday and Thursday afternoons. Meetings at the Brookhaven campus are by appointment only. If at all possible, please use email to schedule meetings in advance to avoid conflicts with other students and other obligations of the instructor.
For more information see http://www.bernstein-plus-sons.com/.dowling/HJB_Contact_Info.html.
Keeping clear written records is an important part of working in any scientific field. It is particularly important in Computer Science, where there are very complex, non-obvious decisions to make. In addition, 60% of your grade for this course will be in the final for which you will need a dense 2-page set of notes. A good notebook will help you to prepare those notes.
Students are expected to have their text books no later than the second week of class. Title:
Attendance will be taken at all class meetings. All absences must be explained in writing (or via email). Students who miss 2 or more lectures must meet with the instructor to review their progress in the course. Midterm warings will be issued for students who miss 2 or more lectures before the midterm. Grades will be reduced for unexcused absences (see grading policy, below).
Your objective in this course is to display a firm grasp of everything that is in Knuth. The final examination will be a closed book comprehesive examination that may draw on anything and everything in Knuth. The only grades that will be given will be A, B or I, and the only way to clear an incomplete is to take an even tougher closed book make-up examination that demonstrates a thorough understanding of everything in Knuth.
Students will be given daily brief quizzes related to help ensure regular attendance and attention to the material of the course.
In addition to routine reading assignments, students will have two kinds of special assignments: ones that will help them to explore algorithms in practice and ones that will help them to study a syllabus topic in depth. For this semster, the assignments will focus on two common threads: structural homology and the robot arm problem. The study assignment will be handled by each student presenting a lecture on that topic, making the course into a seminar.
Every student will be required to maintain a contemporaneous hardbound notebook recording all significant activities related to this course.
The work load for this course is very heavy. Students are encouraged to form study groups and to work together.
In general, no assignments will be accepted late and no makeups will be given for missed quizzes or examinations. Requests for exceptions to this policy will be considered only for the most pressing reasons (illness requiring hospitalization, death in the family, reserve call-up, etc.), must be submitted in writing in a timely manner, and will be granted only if the instructor has sound reason to believe that the student is highly likely to master the material of the course within the current semester.
The syllabus and the course objectives that follows are derived in part from the IEEE/ACM "Computing Curricula 2001 Computer Science" - Final Report - (December 15, 2001) by the Joint Task Force on Computing Curricula, Publisher:IEEE Computer Society, Association for Computing Machinery.
Please consult the course assigments page frequently.
Using VNC via SSH: vnc.html
If you're interested in joining with your fellow students in developing and maintaining a web site, or pursuing your exploration of computer hardware or software, you might want to consider joining the Dowling Computer Club. Just follow the link for further details:
Dowling College Computer Club Web Site