CSC 350 - Data Structures and Algorithms
Spring 2002, CSC 350 70 2, M 7:00-9:30, ADM 11
Instructor
Norman Lippincott, Asst. Professor, Computer Science
Office: Curtis Hall, Room 105
Phone: 610-606-4666 ext. 3697
E-mail:
nlippinc@cedarcrest.edu (home: nl@acm.org)
Course Description
A study of the storage structures used for data organization and manipulation: linear lists, stacks, queues, heaps, graphs, binary and general trees, with an emphasis on the use of abstract data types; a comparative analysis of various sorting and searching algorithms: insertion sort, heapsort, mergesort, quicksort, binary search, hashing, breadth-first and depth-first search. The student will complete an independent programming project on a level appropriate to a senior computer science major. Prerequisite: CSC 134.
Course Objectives
Textbook
Drozdek, A., Data Structures and Algorithms in C++, 2 ed., Brooks/Cole, 2001. ISBN: 0-534-37597-9.
Grading
Grades for the course will be based on the following grade components:
Assignments (5) 50%
Tests (2) 25%
Term Project 20%
Class Participation 5%
A final grade percentage will be computed according to the weights above and rounded to the nearest full percent. Final grades will be awarded based on that percentage as follows:
93-100 A 80-82 B- 67-69 D+
90-92 A- 77-79 C+ 60-66 D
87-89 B+ 73-76 C 0-59 F
83-86 B 70-72 C-
Grade Components
Assignments
Assignments for the course will require programming and may also include a written component. Acceptable programming languages for assignments are C++ and Java. Microsoft Visual C++ is available on-campus in Curtis 104, 201, and 208, and in Admin 4 and 10. Any other standard C++ compiler may be used as well.
Programs should be well documented using comments. Please include, at the beginning of your program, a comment block with your name, course number, assignment number, date, a brief description of the problem, and an overview of your approach to the problem. Also include comments throughout the program to clearly describe all steps in your algorithm. Each function should have a comment block describing the function, all parameters, and return value. Further, code should be indented to enhance readability.
Tests
Tests will be written and will consist of problems and short answer questions. Tests will be open-book and open-notes.
Term Project
The term project is an independent project, chosen by the student, with a level of complexity "appropriate to a senior computer science major" (see course description). The student will write a project proposal and will submit a detailed design outlining the problem and the approach that will be taken for implementation. The instructor may accept the proposal and/or design, or may return it to the student for rework. The project is to be implemented using C++ or Java (use of any other language requires approval in advance from the instructor). At the end of the semester, the student will present her/his project to the class in a 10-15 minute formal presentation. The grade for the term project will be distributed as follows: written design, 20%; implementation, 50%; presentation, 30%.
Class Participation
Students who are active and attentive members of the class may receive up to 5 points for class participation. Students who engage in side conversations during class time should expect no more than 3 points for class participation. For classes held in a computer lab, students who engage in web browsing, e-mail, instant messaging, or non-class related activity during class time should expect no more than 2 points.
Due Dates and Late Work
Assignments are due at the beginning of class on the day they are due. By turning in assignments on time your work will be graded and returned in a timely manner (usually by the next class meeting), and with comments as appropriate.
Work turned in late will be subject to any or all of the following:
Honor Philosophy
The Cedar Crest College Student Handbook, Honor Philosophy (pp. 10-12) part III, Community Standards for Academic Conduct, includes the following:
"As a student at Cedar Crest College, each student shall:
Unless specifically designated by the instructor, assignments for this course are individual assignments, not group projects. It is reasonable and appropriate for students to discuss an assignment outside of class, particularly for programming projects. However, the actual assignment work, whether programming or written, is to be one’s own. It is not appropriate to collaborate on programming assignments, nor is it appropriate to copy another student’s program (or other assignment), alter the program’s (or assignment’s) appearance (e.g. changing formatting, variable names, output text), and present it as your own individual work. Evidence of such behavior will be considered a violation of the Honor Philosophy and will result in a grade of zero for the assignment. A second offense will result in a grade of "F" for the course.
Attendance
Attendance will be taken for each class, however record of attendance does not directly affect the student’s grade. The student is responsible for all material covered in class. If a student has excessive absence and is not showing responsibility for the course material, an academic performance notice will be issued to the Advising Center. If a student will be absent on the day of a test, arrangements for a makeup must be made in advance of the test. Failure to do so will result in a grade of zero for the test.
Classroom Protocol
Appropriate classroom behavior is implicit in the Cedar Crest Honor Code. Such behavior is defined and guided by complete protection for the rights of all students and faculty to a courteous, respectful classroom environment. That environment is free from distractions such as late arrivals, early departures, inappropriate conversations, and any other behaviors that might disrupt instruction and/or compromise students’ access to their Cedar Crest College education.
Students with Disabilities
Students with documented disabilities who may need academic accommodations should discuss these needs with their professors during the first two weeks of class. Students with disabilities who wish to request accommodations should contact the Advising Center.
Computer Classrooms
When classes are conducted in computer classrooms, the computers are to be used only for activities directly related to the class. Use of class computers for other activities, such as web browsing, e-mail, games, instant messaging, and so on, is not permitted. Be aware that such activity not only distracts you from the class, but distracts other students as well. Students who engage in such activity during class will receive a reduced class participation grade.
Course Schedule
The following is a tentative schedule for the course and may be adjusted as necessary during the semester. Use this schedule a guide for reading material in preparation for class.
|
Date |
Topic (Reading) |
|
1/14 |
Course Intro. Object-Oriented Programing using C++ (Ch. 1) |
|
1/28 |
Sorting (Ch. 9) |
|
2/4 |
Complexity Analysis (Ch. 2) |
|
2/11 |
Linked Lists (Ch. 3) Stacks and Queues (Ch. 4) |
|
2/18, 2/25 |
Recursion (Ch. 5) |
|
2/25 |
Test 1 |
|
3/11, 3/18, 3/25 |
Binary Trees (Ch. 6) Multiway Trees (Ch. 7) |
|
4/2*, 4/8 |
Graphs (Ch. 8) |
|
4/15 |
Hashing (Ch. 10) |
|
4/15 |
Test 2 |
|
4/22, 4/29 |
Project Presentations |
* Tuesday April 2 follows a Monday schedule.
Assignments
Assignments for the course are planned for the following schedule. This is provided so that you can plan your semester accordingly. This schedule may change slightly depending on the dynamics of the course.
|
Assigned |
Due |
|
|
Lab #1 |
1/14 |
1/28 |
|
Lab #2 |
1/28 |
2/11 |
|
Lab #3 |
2/11 |
2/25 |
|
Lab #4 |
3/11 |
3/25 |
|
Lab #5 |
4/2 |
4/22 |
Course Resources
Resources for the course will be posted on the campus network in the following location:
T:\users\nlippinc\CSC350