CS 3212: Algorithms - Spring 2025

Welcome to CSCI 3212.

In this course, students will engage deeply with core concepts in algorithms, data structures, and problem-solving techniques. They will tackle classic problems in computer science, such as searching, sorting, and optimization challenges like the Traveling Salesman Problem, using classic data structures like hashing and heaps. Through a mix of lectures, interactive lab assignments, and group projects, students will learn to write clean, efficient code and apply these concepts to real-world problems. Assessments will include a combination of assignments, projects, and exams. Pre-requisites include CS 1112, CS 1311 and CS 2113 (or equivalents) - see undergraduate curriculum. Working knowledge of Java. Resources will be available to support your learning journey. The course is designed to be inclusive and cater to diverse learning styles, with ample opportunity for one-on-one guidance during office hours.

Please be aware that many elements on the course website will change throughout the semester, including the course schedule.

It is your responsibility to review the course website periodically for updates.

We value any and all student feedback. Please be constructive in any comments so that we can adjust the course as best possible. This semester, we are using Blackboard to manage course grading and announcements.

Lecture Times:

Lab Times:

By the end of the course, we hope that you will have developed the following skills:

Grades will be weighted as follows:

The course does not need a textbook because all the needed material is available to you on this site. However, if you’d like to have one, I recommend one of the following OPTIONAL textbooks:
Algorithms, 4th Edition by Robert Sedgewick and Kevin Wayne: This comprehensive resource is available at Princeton's website. It covers a wide range of topics including fundamentals, sorting, searching, graphs, and strings. The site provides excerpts from the book, curated online videos suitable for remote instruction, Java code for the algorithms and clients in the textbook, selected exercises with solutions, and creative programming assignments.
Algorithms by Jeff Erickson: This textbook is a free electronic version of Jeff Erickson's self-published book. It is comprehensive and covers various topics in theoretical computer science. The full-color electronic version is available indefinitely on his website. It's worth noting that the book assumes knowledge of discrete math and basic data structures and algorithms.
Think Data Structures: Algorithms and Information Retrieval in Java by Allen Downey. This textbook is suitable for a CS course and is available in both PDF and HTML formats. It covers key topics commonly found in CS courses such as linked lists, stacks, queues, binary trees, graphs, searching, sorting, and complexity analysis. The book is very Java-centric and uses real Java code examples throughout. It adopts an applied approach to teaching data structures and algorithms, focusing on practical applications. The content is well-organized and clear, making it accessible for students with some background in Java programming​.
Algorithms. By S.Dasgupta, C.Papadimitriou and U.Vazirani (McGraw-Hill). This is an elegant, small-ish textbook with just the right material for a first course in algorithms. Explanations of algorithmic ideas use excellent examples and proofs are easy to follow. It is not, however, as comprehensive as the one below.
Introduction to Algorithms. T.H.Cormen, C.E.Leiserson and R.L.Rivest. (McGraw-Hill). This book covers much more material than can be handled in a single-semester course. It’s advantages are that it makes a useful desktop reference, algorithms are fleshed out in detail with examples and accurate pseudocode, and the book is up-to-date in most areas. Disadvantages: it’s bulky, and can initially be intimidating.
Foundations of Algorithms. R.Neapolitan and K.Naimpour (Jones and Bartlett). This book is a compromise between the sweeping coverage of the Cormen book and the tight, condensed Dasgupta book. The book covers some topics, such as backtracking and branch-and-bound, that are hard to find in other books. Overall, a nice book with solid coverage of topics that are well-presented.

Diversity, inclusion, and a mutual sense of belonging are all core values of this course. All participants in this course must be treated with respect by other members of the GW CS community. We must all strive, students and faculty both, to never make anyone feel unwelcome or unsafe in any way. Violations of these principles are viewed as unacceptable, and we take them very seriously. If you ever feel discriminated against or otherwise excluded, no matter how minor the offense, we encourage you to reach out to Xiaodong, or one of the college deans.

This course features bi-weekly lab assignments which are the largest component of your course grade.

Lab assignments will typically be due by midnight on Sunday. You are strongly encouraged to start early and to use TA office hours and Blackboard for possible questions.

You will submit your assignments electronically to Blackboard. You may submit your assignment multiple times, and a history of previous submissions will be saved. You are encouraged to submit your work regularly.

Academic honesty is required in all your work. Under no circumstances may you hand in work done with or by someone else under your own name. Discussing ideas and approaches to problems with others on a general level is encouraged, but you should never share your solutions with anyone else nor allow others to share solutions with you. You may not examine solutions belonging to someone else, nor may you let anyone else look at or make a copy of your solutions. This includes, but is not limited to, obtaining solutions from students who previously took the course or solutions that can be found online. You may not share information about your solution in such a manner that a student could reconstruct your solution in a meaningful way (such as by dictation, providing a detailed outline, or discussing specific aspects of the solution). You may not share your solutions even after the due date of the assignment.

In your solutions, you are permitted to include material which was distributed in class, material which is found in the course textbook, and material developed by or with an assigned partner. In these cases, you should always include detailed comments indicating on which parts of the assignment you received help and what your sources were.

When working on quizzes, exams, or similar assessments, you are not permitted to communicate with anyone about the exam during the entire examination period (even if you have already submitted your work). You are not permitted to use any resources to complete the exam other than those explicitly permitted by course policy. (For instance, you may not look at the course website during the exam unless explicitly permitted by the instructor when the exam is distributed.)

Failure to abide by these rules constitutes academic dishonesty and will lead to a hearing of the College Judiciary Committee. According to the Faculty Handbook:

This policy applies to all course work, including but not limited to code, written solutions (e.g. proofs, analyses, reports, etc.), exams, and so on. This is not meant to be an enumeration of all possible violations; students are responsible for seeking clarification if there is any doubt about the level of permissible communication.

The general ethos of this policy is that actions which shortcut the learning process are forbidden while actions which promote learning are encouraged. Studying lecture materials together, for example, provides an additional avenue for learning and is encouraged. Using a classmate’s solution, however, is prohibited because it avoids the learning process entirely. If you have any questions about what is or is not permissible, please contact your instructor.

If you believe you need accommodations for a disability or a chronic medical condition, please contact Disability Support Services (DSS) at GW to arrange an appointment to discuss your needs. As appropriate, the office will issue students with documented disabilities or medical conditions a formal Accommodations Letter. Since accommodations require early planning and are not retroactive, please contact Student Disability Services as soon as possible.

To receive an accommodation for a course activity, you must have an official accommodation letter from the Disability Support Services (DSS) at GW and you need to meet with course staff to work out the details of your accommodation at least two weeks prior to the activity.

You are also welcome to contact any of the course staff privately to discuss your academic needs. However, all disability-related accommodations must be arranged, in advance, through Disability Support Services (DSS) at GW.

Programming is not a dry mechanical process, but a form of art. Well written code has an aesthetic appeal while poor form can make other programmers and instructors cringe. Programming assignments will be graded based on style and correctness. Good programming practices usually include many of the following principles: