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

All Instructors

B Average (2.916)Most Common: A (19%)

This total also includes data from semesters with unknown instructors.

292 students
WFDCBA

  • 4.85

    /6

    Recommend

  • 5.06

    /6

    Effort

  • 5.24

    /6

    Understanding

  • 4.84

    /6

    Interesting

  • 5.18

    /6

    Activities
      Contribute on our Github

      Gopher Grades is maintained by Social Coding with data from Summer 2017 to Spring 2025 provided by the University in response to a public records request

      Not affiliated with the University of Minnesota

      Privacy Policy