CSC300: Syllabus

Contact Information

Instructor:James Riely
Home Page:
Address: School of Computing, DePaul University
243 South Wabash Avenue
Chicago, IL 60604-2301
Office:CDM 845
Class Page:
Class Hours: Tue/Thu 10:10am-11:40am in ONLINE

Course Homepage for Lectures

Course homepage:

Mailing List

We will use zoom for live discussion during class hours. To join a meeting, use the link listed on the D2L calendar of events.

We will use discord as a discussion forum for class.

The discussion forum is an extension our time in class. This is particularly great for students that miss the live lecture. If you are watching the class online, you should write down any questions that arise, including the time from the recording for reference. Then send the list of questions to me, and I will post a reply to the group.


This is the first course in a two-course sequence on data structures using Java. The course introduces basic Java programming, reviews recursion, introduces asymptotic notations, and focuses mainly on linear data structures including arrays, linked lists and their variants, stacks and queues, and data structures supporting disjoint-set operations. The implementation of the basic operations on each data structure are discussed and analyzed in terms of their efficiency. The applications covered highlight and exploit the unique characteristics of the data structures, and emphasize problem solving and recursive thinking.


Programs are not just for computers: We use them to communicate to other people.


A data structure is a concrete implementation of an abstract type

Lecture Plan

The following lecture plan is tentative and subject to change as the course progresses.

Lecture slides will be available after each lecture. They will not normally be available before the lecture.


A prior programming class.


If you are delayed in getting the texts, you can view them online at O'Reilly.

Required Books

Core Java SE 9 for the Impatient, 2nd Edition [Amazon, Indiebound]

by Cay Horstmann (Addison-Wesley, 2017)

Available as Ebook

(Online version)

Companion site.

Older edition is fine.

Algorithms 4e [Amazon, Indiebound]

by Robert Sedgewick and Kevin Wayne (Addison-Wesley, 2011)

Available as Ebook

(Online version)

(Author videos) These are also for sale as an Ebook

Companion site.

Do not get an older edition. They are completely different books.

Recommended Books

Schaum's Outline of Data Structures with Java 2e [Amazon, Indiebound]

by John Hubbard (Schuams, 2009)

This book is a good source of example problems with solutions.

Available as Ebook

More Books

How to Think Like a Computer Scientist

by Allen B. Downey.


An good introduction to Java.

Skip the GridWorld chapters, which are intended to help with the AP exam in CS.

See also these lecture notes from MIT. The first three lectures are particularly useful.

Java for Python Programmers

by Brad Miller.


See also here.

Introduction to Programming in Java (Chapter 1)

by Robert Sedgewick and Kevin Wayne


This is the first chapter of the introductory text written by the authors of our primary textbook.

It presents the same material as section 1.1 of the primary text, but at a slower pace.

Effective Java 3e [Amazon, Indiebound]

by Joshua Bloch (Addison-Wesley, 2008)

Available as Ebook

(Online version)

The algorithms text describes all of the Java that is required for the class. The discussion is terse, making it an excellent reference. If you would like a longer discussion of Java, you might want a supplementary text. In this case, you might consider one of the following.


We will discuss concepts in class.

You will have weekly programming assignments.

Getting the homework correct is not enough. More Later.


You must attend class!


Grades will be determined as follows.

Programming assignments that do not compile will receive zero points.

Exams will be given on paper, in person. There are no online exams. You must appear physically in front of a proctor (either teh instructor or someone else, as described in the policy linked below.)

You must pass the final exam in order to pass the course.

DePaul's academic integrity policy

All students are expected to abide by the University's Academic Integrity Policy which prohibits cheating and other misconduct in student coursework. Publicly sharing or posting online any prior or current materials from this course (including exam questions or answers), is considered to be providing unauthorized assistance prohibited by the policy. Both students who share/post and students who access or use such materials are considered to be cheating under the Policy and will be subject to sanctions for violations of Academic Integrity.

On exams, you must work alone, without any external resources.

It is your responsibility to ensure that you can complete any given homework or quiz question in about five minute, working alone, without using external sources.

To solve the weekly homeworks and quizzes, you may find it useful to consult external resources at first. That's fine. However, it is then incumbent on you to repeat those problems until you can do them yourself, starting from scratch, in a reasonable amount of time (about five minutes).