12:301:45 TR Eppley 110 
Dr. David Reed
203D Hitchcock x2583 DaveReed@creighton.edu 
Prerequisite: CSC 222.
This course builds upon the fundamental programming concepts from CSC 221: Introduction to Programming and CSC 222: ObjectOriented 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:
Students will complete 68 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 810 module quizzes quizzes, one 75minute 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:
810 module quizzes  05 % 
68 programming assignments  45 % 
75minute midterm exam  20 % 
100minute final exam  30 % 
At the minimum, departmental grading cutoffs for the final average will apply. That is, 92100% guarantees an A, 8791% a B+, 8286% a B, 7781% a C+, 7176% a C, and 6070% 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.
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.
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, runtime stack, queues, scheduling, HW2 overview. 

HW2: due 9/25 
19 21 
Algorithm Analysis: (ppt/pdf) searching & sorting, analysis. 
S:2.32.4, 3 C&S:78 

26 28 
Linked Structures: (ppt/pdf) nodes, single vs. double links, 
S:4.14.3 

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 

17 19 
FALL BREAK  NO CLASS  
24 26 
midterm review Tree structures: 
S:2.6 

31 Nov 2 
trees, tree recursion, BinaryTree class, binary search trees, BinarySearchTree class. 
S:5.15.3 C&S:8 

7 9 
Balanced and other trees: AVL, redblack, TreeSet/TreeMap, heaps. 
S:5.45.7 

14 16 
Hash tables: 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:002:40 