Park Science Building
gtowell at brynmawr dot edu
Lecture Hours: Tuesday / Friday 1:10-2:30
Room: Park 25
Lab: Friday 2:40-4:00
Office Hours: 4-6pm Wednesday and Thursday
Office hours will be by zoom. Meeting code: 232 840 6920. I have provided the password in email
Course Description: An introduction to the fundamental data structures of computer science: lists, stacks, queues, trees, Binary Search Trees, graphs, sets and their accompanying algorithms. Principles of algorithmic analysis and object reasoning and design will be introduced using mathematical techniques for the notions of both complexity and correctness.
- Sep 8, First lecture
- Oct 6, First Midterm
- Nov 3, Second Midterm
3 points for the first issue reported 2 points for the second issue reported 1 point for the third issue reportedOrdering is based on date of email recipt. One bonus per person per assignment.
All assignments must abide by the following standards
In addition, all assignments must be accompanied by a README file. See the file for a description of the expected contents.
- Getting started Due
Sep 17, 11:59 pmSep 18, 11:59pm due to issues with Lab.
- Zip Codes using Arrays Due Sep 24, 11:59pm
- Week 0
Slides from Course overview
Lecture 1; Sept 8
- Lecture slides We only got to slide 22. Do not do anything with the homework/quizlet on slide 26.
- StringEquals class We did not get to this.
- Recorded session
- During the lecture I mentioned "Visual Studio Code" as the IDE (integrated development environment) I will expect you to be using this semester. This is not a requirement. If you are installing Java, get Java 11. Any version is OK, but I will assume Java 11. (The default on a Mac is Java 8, it is worth the effort to upgrade to Java 11.
- Lecture 2; Sep 11
- Lecture 3; Sep 15
- Lecture 4; Sep 18; ArrayList
- Lecture 5; Sep 22; HashTables
Attendance and active participation are
expected in every class. Participation includes asking questions,
contributing answers, proposing ideas, and providing constructive
Please stay in touch with me, particularly if you feel stuck on a topic or assignment and can't figure out how to proceed. Often a quick e-mail, or face-to-face (via zoom in fall 2020) conference can reveal solutions to problems and generate renewed creative and scholarly energy. It is essential that you begin assignments early.
GradingGrades will be awarded based on the number of points earned and according to the percentage breakdowns shown.
Mid-terms will be in class (or possibly take-home). If take-home then the time to complete will be no more than 2 hours. Closed book, closed notes, no electronic devices unless otherwise instructed.
Incomplete grades will be given only for verifiable medical
illness or other such dire circumstances.
ALL work submitted for grading should be entirely YOUR OWN (or that of a group if you are working in a group). Sharing of programs, code snippets, etc. is not permitted under ANY circumstances. That said, I encourage you to discuss assignments at an algorithmic level with other students.
Submission, Late Policy, and Making Up Past Work
No assignment will be accepted after it is past due.
No past work can be "made up" after it is due.
Learning AccommodationsStudents requesting accommodations in this course because of the impact of disability are encouraged to meet with me privately early in the semester with a verification letter. Students not yet approved to receive accommodations should also contact Deb Alder, Coordinator of Accessibility Services, at 610-526-7351 in Guild Hall, as soon as possible, to verify their eligibility for reasonable accommodations. Early contact will help avoid unnecessary inconvenience and delays.
This class may be recorded.
Created on July 2020. Subject to constant revision.