CSCI3041: Introduction to Discrete Structures and Algorithms

Overview of strategies and techniques for the design and analysis of algorithms. Logic and proof techniques, asymptotic notation, recurrences, graphs, and relations. Algorithm design strategies and examples from graph algorithms, greedy, divide-and-conquer, and dynamic programming. This course is intended for non-CS Majors. prerequisite: CSci 2081 OR (upper class standing AND CSci 2081 as a co-requisite)

View on University Catalog