CSC 321: Data Structures
Fall 2017



12:30-1:45 TR
Eppley 110
Dr. David Reed
203D Hitchcock      x2583
DaveReed@creighton.edu


Free Online Texts:
Data Structures and Algorithm Analysis, Edition 3.2 (Java Version), Clifford A. Shaffer, 2013.
An Active Introduction to Discrete Mathematics and Algorithms (v. 2.6), Charles A. Cusack and David A. Santos, 2016.

Prerequisite: CSC 222.

Course Description

This course builds upon the fundamental programming concepts from CSC 221: Introduction to Programming and CSC 222: Object-Oriented Programming. It provides an introduction to fundamental data structures used in solving problems, including the programming and mathematical concepts required to implement and analyze data structures. Specific data structures include lists, sets, maps, and linked structures. Supporting concepts include logic, proof techniques, and basic graph theory.

The specific goals of this course are:


Required Work

Students will complete 6-8 assignments throughout the semester. Most assignments will involve the design and implementation of Java programs that appropriately utilize data structures. Assignments may also contain written components, for example, justifying data structure choices or analyzing program behavior. Late assignments will be accepted up to 7 days after their due date, with a 25% penalty. Beyond 7 days, late submissions will not be accepted. There will be 8-10 module quizzes quizzes, one 75-minute midterm exam, and a cumulative final exam.

There is no specific attendance policy for the course, although it is expected that absences will leave the student unprepared for tests and assignments. Quizzes and tests will not be rescheduled except in extreme circumstances. However, the lowest quiz grade will be dropped. The final grade for the course will be based on the following weightings:

8-10 module quizzes 05 %
6-8 programming assignments 45 %
75-minute midterm exam 20 %
100-minute final exam 30 %

At the minimum, departmental grading cutoffs for the final average will apply. That is, 92-100% guarantees an A, 87-91% a B+, 82-86% a B, 77-81% a C+, 71-76% a C, and 60-70% a D. Depending on class performance, some shifting of grades (in an upward direction only) may occur as final letter grades are assigned.

It is expected that all students check their Creighton email accounts regularly. Official announcements, such as assignment revisions or class cancellations, will be distributed through Creighton email.


Policy on Collaboration

Creighton's policy on cheating and plagiarism is spelled out in the the Student Handbook, with college procedures available online. In addition to this, the following guidelines hold pertaining to programs. Unless the assignment explicitly states otherwise, programs are to be the sole work of the student -- collaboration on the design or coding of a program is not allowed. Questions regarding homework assignments should be directed at the instructor only. Students may seek debugging assistance or clarifications on assignments using the class mailing list. Repeat: All student interactions regarding homework assignments must take place via the class mailing list!

Violations of this collaboration policy will be dealt with severely, with possible outcomes including failure in the course. In the case of programming assignments, you are encouraged to start early so that there is time to seek help from the instructor as the need arises.


Daily Schedule (check regularly for updates)

Date Topic Readings Homework
Aug 24
Course overview. (ppt/pdf)   HW1: due 9/6 & 9/11
29
31
Java Review: (ppt/pdf)
   classes, OO, data structures, efficiency.
222 material
S:1
 
Sep 5
7
Lists, Stacks & Queues: (ppt/pdf)
   List, ArrayList code, HW1 review,
S:4
 
 
 
12
14
   stacks, delimiter matching, run-time stack,
   queues, scheduling, HW2 overview.
 
 
HW2: due 9/27
 
19
21
Algorithm Analysis: (ppt/pdf)
   searching & sorting, analysis.
S:2.3-2.4, 3
C&S:7-8
 
26
28
Linked Structures: (ppt/pdf)
   nodes, single vs. double links,
S:4.1-4.3
 
 
HW3: due 10/8
Oct 3
5
   LinkedList implementation, iterators.
Counting/analysis techniques: (ppt/pdf)
 
C&S:6
 
 
10
12
   sequences, permutations, proof techniques.
MIDTERM EXAM
C&S:2
 
 
HW4: due 11/3
17
19
FALL BREAK - NO CLASS
24
26
midterm & HW review
Tree structures: (ppt/pdf)
 
S:2.6
 
 
31
Nov 2
   trees, tree recursion, BinaryTree class,
   binary search trees, BinarySearchTree class.
S:5.1-5.3
C&S:8
HW5: due 11/20
 
7
9
Balanced and other trees: (ppt/pdf)
   AVL, red-black, TreeSet/TreeMap, heaps.
S:5.4-5.7
 
 
 
14
16
Hash tables: (ppt/pdf)
   collisions, probing, chaining.
S:9
 
 
 
21
23
   HashSets & HashMaps, hashCode.
THANKSGIVING - NO CLASS
S:11
 
 
 
28
30
Graphs:
   simple vs. directed, adj. matrix vs. list,
C&S:10
 
 
 
5
7
   graph searches, finite automata.
course overview
   
 
Dec 14
FINAL EXAM    Thu, 1:00-2:40

Sample code from class



In the event of disruption of normal classroom activities due to a flu outbreak or other emergency, the format for this course may be modified to enable completion of the course. In that event, you will be provided an addendum to this syllabus that will supersede this version.