CS 260 Data Structures - Syllabus

Term and Credits

Summer 2020
3 Credits

Room and Time

Summer 2020 - All Classes held Aschronously
Section 001 - MW 9:30AM-10:50AM Prof. Augenblick
Section 002 - MW 11:00AM-12:20PM Prof. Augenblick
Section 006 - TR 2:00PM-3:20PM Prof. Boady
Section 008 - TR 5:00PM-6:20PM Prof. Boady

Instructor

Dave Augenblick
Electronic Mail Address: augenbdh@drexel.edu
Office: 3675 Market Street Room 1161
Extention: 215-895-2494
Office Hours: 10AM-12PM Wednesday

Mark Boady
Electronic Mail Address: mwb33@drexel.edu
Office: 3675 Market Street Room 1058 (near snack machine)
Extention: 215-895-2347
Office Hours: Tuesday/Thursday 2PM-3:20PM and 5-6:20PM
Wednesday 3-4PM

Teaching Assistant(s)

Joel Pepper
Electronic Mail Address: jcp353@drexel.edu
Office: CLC 3675 Market Room 1066
Office Hours: Monday 2PM-4PM, Wednesday 4PM-6PM

Sanskriti Seernami
Electronic Mail Address: ss4288@drexel.edu
Office: CLC 3675 Market Room 1066
Office Hours: Thursday 8-10PM

Nicki Barari
Electronic Mail Address: nb895@drexel.edu
Office: CLC 3675 Market Room 1066
Office Hours: Tuesday 12PM-2PM

Course Description

Data structures form the basics for the programmer's toolbox. You will become familiar with the basic common data structures, and learn to modify them or create your own. Further, the notion of data abstraction is important from several aspects. You will start down the road of separating interface from implementation, to viewing a problem simply in terms of functional requirements and dependencies (or lack of). On the flip side, we will explore various issues involved in implementing a given interface.

Course Objective and Goals

1. Understand what an algorithm is.
2. Master the ability to analyze the complexity of programs and algorithms. Understand recurrence relations and sums and basic asymptotic analysis.
3. Understand algorithms and abstract data types. In particular, understand sets, stacks, queues, priority queues, dictionaries, binary search trees, hash tables, arrays, linked lists, trees, graphs, and heaps.
4. Understand what basic operations each data structure supports and why one might choose one over another.
5. Understand data abstraction and recursion, both in the context of procedures and of data types.

Topics

1. Arrays
2. Trees
3. Graphs
4. Dictionaries/ Hash Tables
5. Algorithm Analysis

Audience and Purpose within Plan of Study

This is required course for CS BS students and CS Minor Students. It is generally taken sophomore year.

Prerequisites
CS265

What Students Should Know Prior to this Course

1. Students should be able to program in a high level language (C++, Java, Python, etc)
2. Familiarity with basic data structures such as vectors and arrays.
3. Familiarity with object oriented design principles.

What Students will be able to do upon Successfully Completing this Course: Statement of Expected Learning

1. Students will be able to analyze data structures.
2. Students will understand a set of fundamental algorithms and how to apply them.
3. Students will understand basic data structures and how to apply them to different situations.

Textbook

Online Textbook from ZyBooks

1. Sign in or create an account at learn.zybooks.com
2. Enter zyBook code: DREXELCS260Summer2020
3. Subscribe

Grading and Policies

• Readings: 15%
• Assignments: 35%
• Midterm: 25%
• Final Exam: 25%

Final grades will be determined by your total points weighted according to this distribution. Grades may be curved but are generally computed via the formula below. It may be modified at the instructor's sole discretion, but letter grades will generally not be lower than those shown here.

• [100-97]A+
• (97-93] A
• (93-90]A-
• (90-87]B+
• (87-83] B
• (83-80]B-
• [80-77]C+
• (77-73] C
• (73-70]C-
• (70-67]D+
• (67-60]D
• (60-0]F

Course Material

Late Policy

• Assignments/Readings
  • You may submit assignments/Readings at a penalty for a few days.
  • Penalties:
    1. -10% 1 day late
    2. -20% 2 days late
    3. -30% 3 days late
    4. -40% 4 days late
    5. Not Accepted after 4 days
• Special Exceptions: In exceptional circumstances, the Professor may wave additional penalties or accept work past the cut-off. Please message the Professor directly to request a special exception. Documentation (Doctor Note, Police Report, Athletics Approval, etc) is generally preferred.
• Family Friendly Policy: We understand that some students have family obligations. If you need to miss class for a family emergency please use the Special Exceptions policy. Small children are allowed in class, but please do your best to keep classroom distruptions to a minimum.

Academic Honesty Policy

The CCI Academic Honesty policy is in effect for this course. Please see the policy at http://drexel.edu/cci/resources/current-students/undergraduate/policies/cs-academic-integrity/.

Academic Honesty Violations will be reported to the University. Punishment will be determined by the severity of the incident. Punishments include, but are not limited to,

• Failing grade for class
• Deduction of one letter grade
• Zero on Assignment/Exam Violation took place on

Componentes

Readings

• Readings are to be completed in ZyBooks.

Assignments

• There will be two assignments each week.
• Some will be written, some will be programming.

Exams

• There will be two in class exams this term.
• A midterm Exam during Week 5
• Final Exam during Exam Week (Week 11)

Slack Channel

• We will be using a Slack channel as our primary communication tool.
• Our Slack Space is https://join.slack.com/t/cs260summer2020/signup
• You must use your @drexel.edu address to sign up.

Computer/Software Help
iCommons: http://drexel.edu/cci/about/our-facilities/rush-building/iCommons/

University Policies
In addition to the course policies listed on this syllabus, course assignments or course website, the following University policies are in effect:

• Academic Honesty: http://www.drexel.edu/provost/policies/academic_dishonesty.asp
• Judicial Affairs Academic Integrity: http://drexel.edu/studentlife/community_standards/facultystaff/integrity/
• Official Final Exam Schedule: http://www.drexel.edu/registrar/scheduling/exams/
• Students with Disability Statement: http://drexel.edu/oed/disabilityResources/overview/
• Course Drop Policy: http://www.drexel.edu/provost/policies/course_drop.asp
• The instructor may, at his/her/their discretion, change any part of the course during the term, including assignments, grade brakdowns, due-dates, and the schedule. Such changes will be communicated to students via the course web site Announcements page. This page should be checked regularly and frequently for such changes and announcements. Other announcements, although rare, may include class cancellations and other urgent announcements.
• Drexel Student Learning Priorities: http://www.drexel.edu/provost/irae/assessment/outcomes/dslp/

Tentative Course Schedule

Please see the appropriate assignment webpages for a detailed description of course deliverables.