CSC 301/Data Structures II
Syllabus


Course meeting details

Our class meets every Tuesday and Thursday from March 27th to May 31st, 11:50am to 1:20pm. At the moment the class is listed as meeting in Lewis 1110 (25 E. Jackson) but please check that shortly before the first class as room assignments sometimes change at the last minute.

Course description

From the course catalog: "This is the second course in a two-course sequence on data structures using Java. The course focuses mainly on the following data structures, their analysis, and their applications: trees (search trees, balanced search trees), heaps, associative arrays, hash tables, and data structures for representing graphs. The implementation of the basic operations on each data structure are discussed and analyzed in terms of their efficiency. The applications discussed highlight and exploit the unique characteristics of the different data structures, and emphasize problem solving and recursive thinking. Prerequisite(s): CSC 300 (Data Structures I)"

More specifically, this is a fourth programming course, following the introductory courses, CSC 241 and CSC 242, and the first data structures course, CSC 300.

Course web site

Except for the textbooks, all course materials will be available through DePaul's D2L web site.

Textbooks

There is one required textbook that comes in two forms. The book's title is Algorithms, 4th edition, by Robert Sedgewick and Kevin Wayne (Addison-Wesley, 2011). There is a version with videos (ISBN 978-0134384689) and one without (ISBN 978-0321573513). Many of you already have one of these as it's the same text as used in CSC 300. There is a good companion site. An on-line version is also available through Safari and that can be accessed through DePaul's library site.

There are also two free textbooks, available on-line, that you should consult. They are:

Important dates

Learning outcomes

To be posted....

Grading

The work in this class will consist of programming assignments and an in-class final exam. Please check the university's final exam schedule for when ours will take place. The assignments will be worth a total of 75% of the final grade, with the final exam making up the other 25%.

Late assignment policy

An assignment loses 20% of the total score each day or part of a day it's late. This means that a 0 is automatically assigned five days after an unsubmitted assignment is due.

Topics

Week (date) Topic Sections
1 (3/27, 3/29) Symbol tables, binary search trees 3.1, 3.2
2 (4/3, 4/5) Binary search trees, balanced BSTs (AVL trees) 3.2, 3.3
3 (4/10, 4/12) Balanced BSTs: AVL trees, 2-3 trees, Red-black trees 3.3
4 (4/17, 4/19) Balanced BSTs, Hash tables 3.3, 3.4
5 (4/24, 4/26) Hash tables 3.4
6 (5/1, 5/3) Undirected graphs 4.1
7 (5/8, 5/10) Undirected graphs, directed graphs 4.1, 4.2
8 (5/15, 5/17) Directed graphs 4.2
9 (5/22, 5/24) String sorts, Tries 5.1, 5.2
10 (5/29, 5/31) Data compression, course review 5.5
Final exam: 6/5, 11:30am-1:45pm

Participation policy

For students in the in-class section, attending every class is required. Students in the distance learning section must send me an email each week when they've finished viewing the class recording.

Academic Integrity Policy

This course will be subject to the academic integrity policy passed by our faculty. More information can be found at http://academicintegrity.depaul.edu/.  I strongly recommend that you read this!  It explains both your rights and your responsibilities as a student on matters of academic integrity.

Communication

All communication will be done in one of three ways:

You may call my office phone and leave a voice message but I'm more likely to respond to it with an email than with a return call.

Before sending me email, please read email guidelines. When you do send the message, two requirements:

  1. Please have the subject line begin with CSC 301:
  2. Make sure your full name appears somewhere in the message.

Office location and hours

My office is room 747 in the CDM building, 243 S. Wabash. My office hours can be found from a link on my CDM homepage. My phone number is 312-362-8334 (dial 2-8334 from the 7th floor lobby phone).

Plagiarism

The university and school policy on plagiarism can be summarized as follows: Students in this course should be aware of the strong sanctions that can be imposed against someone guilty of plagiarism. If proven, a charge of plagiarism could result in an automatic F in the course and possible expulsion. The strongest of sanctions will be imposed on anyone who submits as his/her own work any assignment which has been prepared by someone else. If you have any questions or doubts about what plagiarism entails or how to properly acknowledge source materials consult the instructor.

Incomplete

An incomplete grade is given only for an exceptional reason such as, for example, a death in the family or a serious illness.  Any such reason must be documented. Any incomplete request must be made at least two weeks before the final and approved by the Dean of the College of Computing and Digital Media. Any consequences resulting from a poor grade for the course will not be considered as valid reasons for such a request.

Resources for Students with Disabilities

Students who feel they may need an accommodation based on the impact of a disability should contact the instructor privately to discuss their specific needs. All discussions will remain confidential.

To ensure that you receive the most appropriate accommodation based on your needs, contact the instructor as early as possible in the quarter (preferably within the first week of class) and make sure that you have contacted either the PLuS Program, for Learning Disabilities and/or AD/HD, or the Office for Students with Disabilities, for all other disabilities, at:

Student Center, LPC, Suite #370
Phone number: (773) 325-1677
Fax: (773) 325-3720
TTY: (773) 325-7296

Document last updated on March 14th, 2018.