**Term and Credits**

Summer 2015-2016

3 Credits

**Room and Time**

Monday 6:00pm-8:50pm PISB 104

Tuesday 6:30pm-9:20pm PISB 106

**Instructor**

Mark Boady

*Electronic Mail Address:* mwb33@drexel.edu

*Office:* University Crossings 138

*Extention:* 215-895-2347

*Office Hours:* Monday 4-5pm, Tuesday 4-5pm

**Teaching Assistant(s)**

Alexander Duff (Grader)

*Electronic Mail Address:* amd435@drexel.edu

*Office:* Drexel CLC UC 152

*Office Hours:* Tuesday 4pm-6pm, Thursday 2-4pm

Prasanna Prakash (Office Hours Only)

*Electronic Mail Address:* pp468@drexel.edu

*Office:* Drexel CLC UC 152

*Office Hours:* Monday 4pm-6pm

**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**

- Understand what an algorithm is.
- Master the ability to analyze the complexity of programs and algorithms. Understand recurrence relations and sums and basic asymptotic analysis.
- 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.
- Understand what basic operations each data structure supports and why one might choose one over another.
- 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**

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

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

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

**Textbook**

Data Structures and Algorithms

Alfred V. Aho, Jeffrey D. Ullman, John E. Hopcroft

ISBN-10: 0201000237

ISBN-13: 978-0201000238

See it on Amazon

**Grading and Policies**

- Attendence: 10%
- Homework Assignments (8) 50%
- Midterm Exam 20%
- Final Exam 20%

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.

- A range (A+, A, A-) is a course average [90, 100)
- B range is a course average [80, 90)
- C range is a course average [70, 80)
- D range is a course average [60, 70)
- F range is a course average [0, 60)

**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/ .

**Submitting Assignments**

Assignments will be submitted to learning.drexel.edu by 11:59PM on the date they are due. Grades will be reported via learning.drexel.edu.

You may test your submissions in http://autogradr.com

Assignments and exams will be returned on a regular basis to provide feedback to students.

Assignments may be submitted late at 10% penalty per day UNTIL 6pm on the first Monday following the due date. Selected assignment answers will be reviewed in class. Once the answers have been shown in class, the homework may no longer be submitted.

Special Circumstances: If you have a documented reason why you cannot submit a homework by the cut-off deadline, a special exception may be made. The Professor may also wave the late submission penalty for documented special exceptions.

**Topics**

- Arrays
- Trees
- Graphs
- Dictionaries/ Hash Tables
- 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/

**Tentative Course Schedule**

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

Week | Topic | Reading | Assignment |

1 | Intro to Python and Latex. Asymptotic Behavior (Big-O, Dominance) | Python 3 Tutorial Look Over 1-4.3 Latex Basics |
HW1 Assigned |

2 | Arrays (review), lists; stacks and queues; maps, Searching | Chapter 1,2 | HW1 Due July 1 11:59PM |

3 | Trees; Huffman coding | Chapter 3 | HW2 Due July 8 11:59PM< |

4 | Sets, hash tables, dictionaries | Chapters 4 | HW3 Due July 15 11:59PM |

5 | BSTs, Tries, Heaps (Priority Queues) | Chapter 4,5 | HW4 Due July 22 11:59PM |

6 | Midterm - In Class at Regular Time/Room | ||

7 | Intro to Graphs, DFS, Dijkastra (SSSP), Floyd-Warshall (APSP) | Chapter 6 | HW5 Due August 5 11:59PM |

8 | Graphs - Minimum Spanning Trees (Prim, Kruskal) - Midterm Review | Chapter 6,7 | HW6 Due August 12 11:59PM |

9 | Sorting, Solving Recurrence Relations | Chapter 8,9 | HW7 Due August 19 11:59PM |

10 | Graphs - BFS, Dag, SCC, Topological Sort, Bipartite Matching | Chapter 6,7 (Skipped Topics) | HW8 Due August 26 11:59PM |

11 | Final - In Class at Regular Time/Room |