COMPUTER SCIENCE 206

DATA STRUCTURES IN ADVANCED PROGRAMMING

Fall 2002

 

Teacher: R. P. Webber

Office and hours: Barlow 204, MWF  10:00 - 10:50, MTRF 2:00 – 2:50, and by appointment or coincidence

Phone and email: 395-2192, rwebber@longwood.edu 

Text: Peden's manuscript. Available from Dr. Peden's website.

Course Description: A one semester course in advanced programming utilizing data structures and models. The course emphasizes advanced programming techniques in the manipulation of data structures. Prerequisite: Computer Science 204. 3 credits.

Course Objectives:

  1. The student will demonstrate programming proficiency using recursion, stacks, queues, linked lists, and trees.
  2. The student will understand and be able to explain basic searching and sorting algorithms.
  3. The student will be able to use classes and template classes.

Grades and assignments:  There will be a midterm test and a final exam. Each will count 15% of your final grade. There will be approximately 12 assignments, which together will count 70% of your final grade.

            Midterm test - - - - - - - - - - 15%

            Final exam - - - - - - - - - - - 15%

            Assignments- - - - - - - - - - 70%

All or part of the final exam may be oral.

The grading scale will be: 90-100, A; 80-90, B; 70-80, C; 60-70, D; below 60, F.

Each assignment will have a due date. It is due by the beginning of class on that date. Late assignments will be penalized 25% per class day, regardless of the reason for being late.  Unless otherwise specified, assignments are to be done individually.  You may help each other debug work, but each person is to key in his or her own program, and each person must submit each assignment individually.  For programs, hand in

 

-         a printed copy of the program and output

-         a listing of any input used

-         external documentation as appropriate, including pseudocode and an account of testing

 

Click here to read the rubric for grading programs.

Honor Code: The teacher subscribes to the Longwood Honor Code and assumes you do, too. Infractions will be dealt with harshly. If you are convicted of any Honor Code offense involving this course, your course grade will automatically be F, regardless of the penalty imposed by the Honor Board. 

Tentative Weekly Schedule

Week

Dates

Topics

1

Aug 27-29

Documentation requirements; classes

2

Sep 3-5

Classes

3

Sep 10-12

Classes; Recursion

4

Sep 17-19

QuickSort; Stacks

5

Sep 24-26

Stacks and queues

6

Oct 1-3

RPN notation; Hash tables

7

Oct 8-10

Review; TEST

Fall Break

 

 

8

Oct 17

Template classes

9

Oct 22-24

Templates; Big-O

10

Oct 29-31

Linked lists

11

Nov 5-7

Linked lists

12

Nov 12-14

Trees

13

Nov 19-21

Tree traversals

14

Nov 26

Search trees

Thanksgiving break

 

 

15

Dec 3-5

Search trees; Review

 

The final examination in this course is scheduled for Wednesday, December 11, 8:00 – 10:30 a.m.