Fall 2023


Listed in: Computer Science, as COSC-311


Kristy Gardner (Sections 01 and 02)


This course addresses the design and analysis of computer algorithms. Topics include: set algorithms such as sorting and searching, graph algorithms, string algorithms, and matrix algorithms. Algorithm design paradigms, including the divide-and-conquer, dynamic programming, and greedy paradigms, will be emphasized. The course will end with a discussion of the theory of NP-completeness and its implications.

Requisite: COSC 112 and COSC 211. Admission with consent of the instructor. Fall semester: Professor Gardner.

How to handle overenrollment: null

Students who enroll in this course will likely encounter and be expected to engage in the following intellectual skills, modes of learning, and assessment: (none specified)

COSC 311 - LEC

Section 01
M 2:00 PM - 2:50 PM SCCE A131
W 2:00 PM - 2:50 PM SCCE A131
F 2:00 PM - 2:50 PM SCCE A131

Section 02
M 3:00 PM - 3:50 PM SCCE A131
W 3:00 PM - 3:50 PM SCCE A131
F 3:00 PM - 3:50 PM SCCE A131

This is preliminary information about books for this course. Please contact your instructor or the Academic Coordinator for the department, before attempting to purchase these books.

Section(s) ISBN Title Publisher Author(s) Comment Book Store Price
All Savvich, Victor TBD


Other years: Offered in Fall 2022, Fall 2023, Fall 2024