CS 260 Data Structures - Syllabus

Term and Credits

Spring 2019
3 Credits

Room and Time

Section 001 - Tuesday/Thursday 11:00am-12:20pm (3675 Market Street Room 1103)

Instructor

Mark Boady
Electronic Mail Address: mwb33@drexel.edu
Office: University Crossings 138
Extention: 215-895-2347
Office Hours: Tuesday 2PM-5PM, Wednesday 3PM-4PM

Teaching Assistant(s)

Patrick Brinich
Electronic Mail Address: pjb338@drexel.edu
Office: Drexel CLC UC 152
Office Hours: See CLC Website

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.

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 https://learn.zybooks.com
2. Enter zyBook code DREXELCS260BoadySpring2019
3. Subscribe

Grading and Policies

• Readings: 10%
• Homeworks: 15%
• Labs: 15%
• Midterm: 30%
• Final Exam: 30%

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

In Class Lab Exercises

• Each class with have at least 1 in class Lab.
• The exercise is due during the class period.
• Exercises will be completed in small groups (1-2).
• If need to miss class, contact your instructor to make up the exercise.

Readings

• Readings are to be completed in ZyBooks.
• No late submissions will be accepted.

Homeworks

• Homeworks will be completed in ZyBooks.
• No late submissions will be accepted.

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

• This term, we will be using a Slack channel instead of a discussion board.
• Our Slack Space is https://join.slack.com/t/cs260spring2019/signup
• You must use your @drexel.edu address to sign up.

Special Circumstances

• If you have a documented reason why you cannot submit an assignment by the deadline, a special exception may be made. The Professor may also wave the late submission penalty for documented special exceptions.

Course Policies

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

Topics

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

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/