CSCI3041: Introduction to Discrete Structures and Algorithms

4 Credits

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


  • Samyok Nepal

    Website/Infrastructure Lead

  • Kanishk Kacholia

    Backend/Data Lead

  • Joey McIndoo

    Feature Engineering

Contribute on our Github

Gopher Grades is maintained by Social Coding with data from Summer 2017 to Fall 2024 provided by the Office of Institutional Data and Research

Privacy Policy