Bucknell University Computer Science

Archive for the 311 Category

CSCI 311 – Fall ’26

Algorithm Design & Analysis Catalog 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 Lecture MWF 9-9:50AM Dana 137 Recitation T 1-1:50PM BRKI 066 Syllabus Syllabus PDF Here Lecture Notes These notes closely follow Cormen, Leiserson, Rivest, and Stein’s Introduction to Algorithms. I was also influenced by my notes from taking Prasad Jayanti’s course at Dartmouth College. If […]

Continue reading »

CSCI 311 – Spring ’26

Algorithm Design & Analysis Catalog 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 11-11:50AM Dana 115 02: Lecture MWF 9-9:50AM Dana 115 R40: Recitation Th 9-9:50AM Dana 115 R41: Recitation Th 11-11:50AM Dana 115 Syllabus Syllabus PDF Here Lecture Notes

Continue reading »

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 »

CSCI 311.01 – Fall ’24

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 1-1:50PM Dana 132 R40: Recitation Th 10-10:50AM Dana 134 02: Lecture (Prof. Gutekunst) MWF 3-3:50PM BRKI 165 R41: Recitation (Prof. Gutekunst Th 3-3:50PM Dana 134 Syllabus Syllabus PDF Lecture Notes These notes closely follow CLRS (Cormen et al.’s Introduction to Algorithms), and also rely on other […]

Continue reading »

CSCI 311- Spring ’24

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 319 02: Lecture MWF 11-11:50AM Dana 319 R40: Recitation Th 10-10:50AM Dana 137 R41: Recitation Th 2-2:50PM Dana 137 Syllabus Syllabus PDF Lecture Notes These notes closely follow CLRS (Cormen et al.’s Introduction to Algorithms), and also rely on other sources such as Kleinberg […]

Continue reading »

Fall 2022 – Algorithm Design & Analysis

CS 311: Algorithm Design & Analysis 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.  Lecture Each section number links to the respective class’ website (if available). Section Date/Time Location Instructor 01 MWF 8:00 AM – 8:50 AM Dana 115 Edward Talmage 02 MWF 9:00 AM – 9:50 AM Dana 115 Edward Talmage 03 MWF 10:00 AM – 10:50 AM Dana 227 Jessen Havill Recitation Section Date/Time Location Instructor TA 40 R 8:00 AM – […]

Continue reading »

Want to learn more about Bucknell?

Request information