CS206: Data Structures
Bryn Mawr College
|Office hours||Mondays and Tuesdays 10:00am - 11:00am, and by appointment|
|Class||Tuesdays and Thursdays 2:25pm - 3:45pm|
|Open Lab||Wednesdays 11:10am - 1:00pm Park Room 231 (Computer Science Lab)|
|Lab Assistants||Rachel Xu, Monday 8pm-10pm, Tuesday 8pm-10pm, Park Science 231|
Course Description: Introduction to the fundamental algorithms and data structures using Java. Topics include: Object-Oriented programming, program design, fundamental data structures and complexity analysis. In particular, searching, sorting, the design and implementation of linked lists, stacks, queues, trees and hash maps and all corresponding complexity analysis. In addition, students will also become familiar with Java’s built-in data structures and how to use them.
|1||Tues||1/19||Introduction to Java||Assignment01||Get accounts, create a notebook|
|Thur||1/21||Java Language: syntax||In-class activity; read Appendix A||functions (parameters/arguments, calling), booleans, control, etc.|
|2||Tues||1/26||Variables, Functions, and Loops, OOP||For Thursday, bring 3 questions of your own making based on the material from Appendix A|
|Thur||1/28||Data Structures||Assignment02||LinkedList, LinkedListSummary|
|3||Tues||2/2||Recursion and Stacks||Read Chapter 1, 5; Recursion: Chapter 5||Interfaces, and Inheritance|
|Thur||2/4||Abstractions, ADT, and Interfaces||Assignment03|
|4||Tues||2/9||BinaryTrees||Read Chapter 2|
|Thur||2/11||BinaryTrees||Read Chapter 2.4; Trees: Chapter 6|
|5||Tues||2/16||Sorting, Files, and Graphs||Assignment04||Sorting: Chapter 8; Graphs: Chapter 10; Files: Appendix A.10|
|Thur||2/18||Stacks and Queues||Chapter 3, 4|
|6||Tues||2/23||Service Day||No classes|
|9||Tues||3/15||Sets and Maps||Read Chapter 7|
|Thur||3/24||HashMaps and HashSets|
|11||Tues||3/29||AVL Trees||Read Chapter 9|
|Thur||3/31||Other Self-Balancing Search Trees|
|Thur||4/7||Graphs||Read Chapter 10|
|Thur||4/14||Hand out Review Sheet||Work on Projects|
|14||Tues||4/19||Review||Work On Projects: Game Design|
The final exam is self-scheduled during exam week.
|**Data Structures: Abstraction & Design Using Java, 2nd Edition**. Elliot B. Koffman & Paul A. Wolfgang, Wiley 2010.|
We will be using the Jupyter Java9 interpreter and compiler, installed on the Athena computer cluster:
You will received a password and username in class.
Attendance and active participation are expected in every class. Participation includes asking questions, contributing answers, proposing ideas, and providing constructive comments.
I am available to answer your questions, listen to concerns, and talk about any course-related topic (or otherwise). Please come to office hours! This helps me get to know you. You are welcome to stop by and chat. There are many more exciting topics to talk about that we won't have time to cover in-class.
Although computer science work can be intense, please stay in touch, particularly if you feel stuck on a topic or project and can't figure out how to proceed. Often a quick e-mail, phone call or face-to-face conference can reveal solutions to problems and generate renewed creative and scholarly energy. It is essential that you begin assignments early, since we will be covering a variety of challenging topics in this course.
There will be about seven assignments, weighted equally in the final grading. Assignments must be submitted according to the Assignment Submission instructions.
At the end of the semester, final grades will be calculated as a weighted average of all grades according to the following weights:
Incomplete grades will be given only for verifiable medical illness or other such dire circumstances.
All work must be turned in either in hard-copy or electronic submission, depending on the instructions given in the assignment. E-mail submissions, when permitted, should request a "delivery receipt" to document time and date of submission. Extensions will be given only in the case of verifiable medical excuses or other such dire circumstances, if requested in advance and supported by your Academic Dean.
No assignment will be accepted after it is past due.
No past work can be "made up" after it is due.
There will be three exams in this course. The exams will be closed-book and closed-notes. The exams will cover material from lectures, homeworks, and assigned readings (including topics not discussed in class).
We encourage you to discuss the material and work together to understand it. Here are our thoughts on collaborating with other students:
If you have any questions as to what types of collaborations are allowed, please feel free to ask.