1. CS206 Spring 2006

This is the homepage for the CS206 Data Structures course at Bryn Mawr College.

You can find this page on the web at http://cs.brynmawr.edu/~dblank/ and click on the course name.

1.1. Overview

This course is the introduction to the fundamental algorithms and data structures of computer science: sorting, searching, recursion, backtrack search; lists, stacks, queues, trees, graphs, dictionaries. It also introduces the student to the analysis of algorithms.

Instructor	Douglas S. Blank
Email	dblank@cs.brynmawr.edu
Homepage	cs.brynmawr.edu/~dblank/
Office	Park Science, room 246B
Phone	610-526-6501
FAX	610-526-6535
Office hours	TBA

Protected downloads, grades, list of classmates, teams, and write-ups can be accessed through  Edventure (on the web at http://edventure.brynmawr.edu).

Textbook: Data Structures & Algorithms in Java Second Edition, by Robert Lafore.

Textbook applets: cs.brynmawr.edu/cs206/lafore.html

Class: TR 2:30am-4, Park Science 337

Lab hours: TBA, in Park Science 231

CS206 TA: Julia Ferraioli, jferraio[at]brynmawr[dot]edu

TA hours:

Sunday: 3-4pm, Tuesday: 4-5pm, Wednesday: 12noon-1pm, Thursday: 4-5pm

1.2. Helpful Course-related Links

• GettingWiredWithJavaLinux - On-line Java manual for CS110
• BrynMawrComputing - some pages on computing at BMC
• bubo.brynmawr.edu/ - Homepages for the course
•  Putty - ssh for Windows
•  FTP - a secure ftp client for Windows
•  BMC Dorm Software
• BrynMawrFileEditing - editing files
• BrynMawrComputerScience - about CS
• BrynMawrRemoteAccess - notes about remote access
• bluepig.brynmawr.edu/ - Remote access computer

1.3. Schedule

                               2006

       January               February                 March
Su Mo Tu We Th Fr Sa   Su Mo Tu We Th Fr Sa   Su Mo Tu We Th Fr Sa
 1  2  3  4  5  6  7             1  2  3  4             1  2  3  4
 8  9 10 11 12 13 14    5  6  7  8  9 10 11    5  6  7  8  9 10 11
15 16 17 18 19 20 21   12 13 14 15 16 17 18   12 13 14 15 16 17 18
22 23 24 25 26 27 28   19 20 21 22 23 24 25   19 20 21 22 23 24 25
29 30 31               26 27 28               26 27 28 29 30 31

        April
Su Mo Tu We Th Fr Sa
                   1
 2  3  4  5  6  7  8
 9 10 11 12 13 14 15
16 17 18 19 20 21 22
23 24 25 26 27 28 29
30

			CS206 Schedule
Week	Day/Date	Topic	Reading	Lab
1	Tue Jan 17	Introduction and Review		Assigned: CS206Lab01
	Thr Jan 19	Arrays	Chapter 2	Assigned: CS206Lab02
2	Tue Jan 24	Logarithms and Big O	Chapter 2	Assigned: CS206Lab03
	Thr Jan 26	Simple Sorting	Chapter 2
3	Tue Jan 31	Stacks and Queues	Chapter 2
	Thr Feb 2	Stacks and Queues	Chapter 3
4	Tue Feb 7	Parsing	Chapter 3
	Thr Feb 9	Linked Lists	Chapter 3	Assigned: CS206Lab04
5	Tue Feb 14	Linked Lists	Chapter 3
	Thr Feb 16	Recursion	Chapter 5
6	Tue Feb 21	Recursion	Chapter 5
	Thr Feb 23	Recursion	Chapter 5
Review
Midterm Exam
Spring Break!
			Spring Break!
9	Tue Mar 14	Go over exam, Discuss Final Project	Design	CS206Lab05
	Thr Mar 16	Recursion; Files	Chapter 6; JavaFiles, JavaParse	CS206Lab06
10	Tue Mar 21	Recursion	Chapter 6
	Thr Mar 23	Recursion	Chapter 6	CS206Lab07
11	Tue Mar 28	Advanced Sorting	Chapter 7
	Thr Mar 30	Hashing	Chapter 11
12	Tue Apr 4	Graphs	Chapter 13	CS206Lab08
	Thr Apr 6	Binary Trees	Chapter 8
13	Tue Apr 11	Binary Trees	Chapter 8
	Thr Apr 13	Hash Tables	Chapter 11
14	Tue Apr 18	Hash Tables	Chapter 11
Catch up
Review		CS206FinalReview
Presentations

Self-scheduled final exam.

1.4. Assessment

Grading will be based on the following:

Homework assignments	45%
Midterm Exam	20%
Final Project	15%
Final Exam	20%

Students who think they may need accommodations in this course because of the impact of a disability are encouraged to meet with either course instructor early in the semester. Students should also contact Stephanie Bell, Coordinator of Access Services, at 610-526-7351 in Canwyll House, as soon as possible, to verify their eligibility for reasonable accommodations. Early contact will help to avoid unnecessary inconvenience and delays.