Skip to main content

CSCI 311-02, Spring 2025

Algorithm Design and Analysis Description This course is an introduction to standard patterns and techniques in algorithm design and tools for analyzing algorithmic performance. Students learn to evaluate algorithms, design new algorithmic solutions, and communicate the correctness and usefulness of their solutions. Learning Outcomes By the end of this course, students will be able to: Instructor information A long time ago, I was a CS major at Bucknell!  (I also majored in Religion.)  After graduation, I went to graduate school for CS at The College of William and Mary.  My research was in the design and analysis of online algorithms. […]

Continue reading »

CSCI 311.01 – Spring ’25

Description An introduction to standard patterns and techniques in algorithm design and tools for analyzing algorithmic performance. Students learn to evaluate algorithms, design new algorithmic solutions, and communicate the correctness and usefulness of their solutions. Prerequisite: MATH 241 or (MATH 240 and MATH 280) and CSCI 204. Schedule Section Time Location 01: Lecture MWF 10-10:50AM Dana 137 R40: Recitation Th 1-10:5PM Dana 117 02: Lecture (Prof. Havill) MWF 11-11:50AM Dana 319 R41: Recitation (Prof. Havill) Th 2-2:50PM Dana 117 If you are looking for Prof. Havill’s course page, go here. Syllabus Syllabus PDF Lecture Notes

Continue reading »