Algorithms

Fall 2022

Listed in: Computer Science, as COSC-311

Moodle sites: Course (Login required) | Section 01 (Login required) | Section 02 (Login required)

Faculty

Will Rosenbaum (Sections 01 and 02)

Description

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.

Course times and locations

COSC 311 - LEC

Section 01
M 11:00 AM - 11:50 AM STIR 115
W 11:00 AM - 11:50 AM STIR 115
F 11:00 AM - 11:50 AM STIR 115

Section 02
M 02:00 PM - 02:50 PM SCCE Room
W 02:00 PM - 02:50 PM SCCE Room
F 02:00 PM - 02:50 PM SCCE Room

Textbooks

Below are the textbooks used in this course, along with pricing information and availability at local bookstores. The price range shown is based upon queries to multiple online booksellers; click on the the price field to see detailed pricing information.

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	Price
All	Algorithms in Action			Savvich, Victor		TBD

Offerings

2022-23: Offered in Fall 2022
Other years: Offered in Fall 2022, Fall 2023