
Compsci 330 is a 3-credit course that covers the fundamental concepts of algorithms, including time and space complexity, and data structures such as arrays, linked lists, and stacks.
The course is designed for undergraduate students and is a prerequisite for more advanced computer science courses. It's a challenging but rewarding class that will help you develop problem-solving skills and a deeper understanding of computer science principles.
You can expect to spend around 12-15 hours per week on coursework, which includes lectures, homework assignments, and a final exam.
A fresh viewpoint: Loebner Prize
Learning Materials
For Compsci 330 at Duke, you'll want to have a solid foundation in algorithms, which is where these textbooks come in.
S. Dasgupta, C. Papadimitriou, and U. Vazirani's "Algorithms" is a great resource, published by McGraw Hill in 2006.
J. Kleinberg and E. Tardos's "Algorithm Design" is another excellent choice, released by Addison Wesley in 2005.
If you're looking for a comprehensive introduction to algorithms, T. Cormen, C. Leiserson, R. Rivest, and C. Stein's "Introduction to Algorithms" from MIT Press in 2009 is a great option.
Assessment and Schedule
You can expect two mid-term exams, one on February 14th and another on April 2nd, both in-class exams that will cover all previous materials.
Homework is assigned regularly, with a total of 8 assignments throughout the semester, each with a specific topic and references.
Here's a breakdown of the homework schedule:
The final exam is scheduled for May 3rd, from 2:00 to 5:00 PM, covering all material except bipartite matching and amortized analysis.
Tentative Schedule
The tentative schedule for this course is laid out in the provided table. It's a packed schedule, but don't worry, you'll have time to absorb the material.
The first week starts on January 10th, where you'll be introduced to algorithms and asymptotic notations. You can expect to find the slides, board notes, and scribe notes online.
Homework is assigned on January 17th, and you'll have another one on January 24th.
Here's a breakdown of the schedule:
The schedule continues with more topics, including graph algorithms, linear programming, and randomized algorithms.
Grading
In this course, your grades will be determined by a combination of homework assignments, midterm exams, and a final exam.
Homework assignments make up 35% of your grade, and you'll have to complete 11 required assignments, but one of them is for practice only, so you won't submit it.
The two midterm exams will also count for 35% of your grade, and they'll be in-class, closed-book exams.
The final exam, which accounts for 30% of your grade, will also be an in-class, closed-book exam.
Assignments and Work
In Compsci 330 at Duke, assignments and work are a big part of the course. Homework is released on specific dates and must be submitted by 11:59 pm Durham (Eastern) time on the due date.
You'll be using the Sakai website for homework submission, and it's strongly encouraged that you prepare your submissions in LaTeX. This will make it easier for you to format your work and ensure it meets the instructor's requirements.
Here's a breakdown of the homework schedule:
Remember, late submissions will not be accepted, so be sure to plan ahead and submit your work on time.
Recitations
Recitations are a key part of the learning process, and in this course, they're a regular occurrence.
Recitations are typically held on Fridays, with the first one taking place on January 12th. We'll be discussing induction and big-Oh notation that day.
The topics covered in recitations vary, but we can expect to see a mix of algorithmic techniques, including divide and conquer, greedy algorithms, and dynamic programming.
Here's a breakdown of the recitation schedule:
We'll have the opportunity to review and practice our understanding of these topics in recitations, which will be a great chance to ask questions and clarify any doubts.
Homework
To do well on homework, it's essential to understand the guidelines and deadlines. Collaborations and honesty are key, so make sure to review the detailed guidelines on collaboration to avoid any issues.
Late submissions are not tolerated, and you'll get no credit if you submit your homework after 11:59 pm Durham (Eastern) time on the due date. This means you should submit your work sufficiently early to avoid any last-minute stress.
If you need an extension, you can contact the instructor before the submission deadline, but be aware that requests are at their discretion. You'll need to send a clear email explaining your reason for the request, and only the instructor's written consent will be considered valid.
We'll be using Sakai for homework submission, so make sure you're familiar with the platform. Your submissions should be typed, and it's strongly encouraged to prepare them in LaTeX.
Here's a schedule of the homework assignments:
Frequently Asked Questions
What are the prerequisites for Duke CS 330?
To enroll in Duke CS 330, you must have completed Computer Science 201 and 230 (or approved substitutions). Check the course details for more information on approved substitutions and course requirements.
Is Duke good for Compsci?
Duke's computer science program is highly regarded, consistently ranking among the top 10 in the U.S. However, its reputation may not be as strong as some other top programs.
What is Duke ranked for CS?
Duke University's Computer Science graduate program is ranked #20 in the country. Discover how our interdisciplinary approach and 50+ years of experience are shaping the future of tech and society.
Featured Images: pexels.com





