Data Structures and Algorithms

CSCI 223, Section 01
Spring Semester 2011


John I. Moore, Jr. Phone:  843-953-7882
Office:  Thompson Hall 230       E-mail:


Course Description

Formal specification and implementation of abstract data types, and analysis of algorithms. Topics include list and set representation methods, sorting, trees, and graphs. Data structures used include arrays, queues, binary trees, hash tables, priority queues, search trees, balanced trees.

Prerequisites: CSCI 202 and MATH 206

Learning Outcomes

Upon successful completion of this course, a student will be able to


Elliot B. Koffman and Paul A. T. Wolfgang, Data Structures: Abstraction and Design Using Java (Second Edition), John Wiley & Sons, Inc., 2010. (ISBN: 978-0470128701)

Recommended Reference: Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein, Introduction to Algorithms (Third Edition), MIT Press, 2009. (ISBN: 978-0262033848)

Also:  Course Notes and Handouts

Class Schedule

Monday-Wednesday-Friday, 10:00-10:50 a.m., Thompson Hall 216.


The final grade for the course is based on 8 grades as follows:

Miscellaneous Grading Policies

  1. This course will contain a number of graded programming assignments. Except for explicitly assigned joint projects, students are required to work individually on all graded work done outside of class. Assistance from anyone other than the instructor is forbidden.
  2. Each programming assignment is due one week after it is assigned unless noted otherwise by the instructor. A late program, for whatever reason, will have its grade lowered by one letter, and programs more than one week late will not be accepted, resulting in a grade of zero for that assignment. Program grades will be based on the following factors: correctness of programming logic, overall design and structure, style, and enhancements.

    Please note: Correctness of programming logic is the most important factor. It is usually better to turn a program in late than to turn it in on time with logic errors. Also, turning in a program that does not compile will result in a grade of zero for that project.
  3. Homework will be assigned daily but not collected. Unless otherwise noted, daily quizzes will come directly from the material covered in the previous day’s class, often from the homework assignments.
  4. Class attendance and participation can influence borderline grades.
  5. A total of nine absences will result in a course grade of F. With respect to this policy, three lates count as an absence. In addition, if you are late by 15 minutes or more, you will be considered absent.
  6. Incomplete grades are given only in unusual circumstances. Consult the catalog for policy on incomplete work.

Office Hours

Monday 1:00-3:00 p.m.
Tuesday 1:00-3:00 p.m.
Wednesday  1:00-3:00 p.m.
Thursday 1:00-3:00 p.m.

Other times by appointment

Important Dates

Jan. 17 Martin Luther King, Jr. Holiday (no classes)
Feb. 16 Test #1: Chapters 1-4
Mar. 16 Test #2: Chapters 5-7
Mar. 16 Last day to withdraw with a grade of “W”
Mar. 28-Apr. 1 Spring Break (Take book home to study during break!)
Apr. 15 Test #3: Chapters 8-9
Apr. 29 Final Exam 1:00-4:00 p.m. (Friday)



  1. Do not miss an assigned test without a valid excuse! Missing an assigned test without a valid excuse will result in a grade of zero for that test. The instructor gets to determine whether or not an excuse is valid. In particular, guard duty is not an acceptable excuse for missing an assigned test. When possible, students should notify the instructor in advance if they will be unable to take an assigned test. All make-up tests will be given outside of normal class time. Once a test has been given in class, any subsequent make-up tests may differ significantly.
  2. Show up for class on time and prepared. That means that you have read the appropriate sections from the book plus any handouts, and you have worked all assigned homework. If a test has been assigned, you should be prepared to take the test. If you were late to class or absent from the previous class meeting, you are responsible for getting class notes and assignments from another student in the class or from the instructor.
  3. If you are late to class, it is possible that you have already been marked absent by the time you arrive. It is your responsibility to notify the instructor after class that you were late rather than absent.
  4. Take care of any personal needs outside of class time. Except for emergencies, you should not need to go to the bathroom, get a drink of water, etc. If you need to leave the room at any time while class is in session, you should ask for permission.
  5. There should be no personal conversations or moving around during class without explicit permission. These actions are disturbing to other students and to the instructor. Be courteous and respect the rights of others.
  6. Cell phones must be kept in book bags and programmed in a silent or vibrate setting during class.
  7. You should respect the property of your college. No eating, drinking (other than water), smoking, dipping, chewing tobacco, etc. in the classrooms. Also, no writing or carving on the desks, chairs, podium, etc. Any willful vandalism or destruction of Citadel property will be dealt with severely.

Daily Schedule

Dates Topics Covered
Jan. 12 Review of Basic Java (Appendix A)
Jan. 14 Object-Oriented Programming in Java (Chapter 1)
Jan. 17 Martin Luther King, Jr. Holiday (no classes)
Jan. 19 Lists and the Collections Framework (Chapter 2)
Jan. 21 Lists and the Collections Framework (Chapter 2)
Jan. 24 Lists and the Collections Framework (Chapter 2)
Jan. 26 Lists and the Collections Framework (Chapter 2)
Jan. 28 Stacks (Chapter 3)
Jan. 31 Stacks (Chapter 3)
Feb. 2 Stacks (Chapter 3)
Feb. 4 Queues (Chapter 4)
Feb. 7 Queues (Chapter 4)
Feb. 9 Queues (Chapter 4)
Feb. 11 Review
Feb. 14 Recursion (Chapter 5)
Feb. 16 Test #1 (Chapters 1-4)
Feb. 18 Recursion (Chapter 5)
Feb. 21 Recursion (Chapter 5)
Feb. 23 Trees (Chapter 6)
Feb. 25 Trees (Chapter 6)
Feb. 28 Trees (Chapter 6)
Mar. 2 Trees (Chapter 6)
Mar. 4 Sets and Maps (Chapter 7)
Mar. 7 Sets and Maps (Chapter 7)
Mar. 9 Sets and Maps (Chapter 7)
Mar. 11 Sets and Maps (Chapter 7)
Mar. 14 Review
Mar. 16 Test #2 (Chapters 5-7)
Mar. 18 Sorting (Chapter 8)
Mar. 21 Sorting (Chapter 8)
Mar. 23 Sorting (Chapter 8)
Mar. 25 Sorting (Chapter 8)
Mar. 28-Apr. 1 Spring Break (Take book home to study during break!)
Apr. 4 Self-Balancing Search Trees (Chapter 9)
Apr. 6 Self-Balancing Search Trees (Chapter 9)
Apr. 8 Self-Balancing Search Trees (Chapter 9)
Apr. 11 Self-Balancing Search Trees (Chapter 9)
Apr. 13 Review
Apr. 15 Test #3 (Chapters 8-9)
Apr. 18 Graphs (Chapter 10)
Apr. 20 Graphs (Chapter 10)
Apr. 22 Graphs (Chapter 10)
Apr. 25 Review/Course Evaluations
Apr. 29 Final Exam 1:00-4:00 p.m. (Friday)