Algorithms

Fall 2021

Listed in: Computer Science, as COSC-311

Faculty

John E. Rager (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.

Requisite: COSC 112 and COSC 211. Fall semester: Professor Rager.

Expectations

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) Students with documented disabilities who will require accommodations in this course should be in consultation with Accessibility Services and reach out to the faculty member as soon as possible to ensure that accommodations can be made in a timely manner.

Course times and locations

COSC 311 - LEC

Section 01
M 10:00 AM - 10:50 AM KECC 200
W 10:00 AM - 10:50 AM KECC 200

COSC 311 - LAB

Section 01
F 10:00 AM - 10:50 AM KECC 200

COSC 311 - L/D

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

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: Not offered
Other years: Offered in Fall 2017, Fall 2018, Fall 2019, Fall 2020, Fall 2021

Section Navigation