CS2050: Introduction to Discrete Mathematics for Computer Science

3 Credits

Proof methods, strategy, correctness of algorithms over discrete structures. Induction and recursion. Complexity and order of growth. Number theoretic principles and algorithms. Counting and computability. Credit not allowed for both CS 2050 and CS 2051.

Requisites

All Instructors

GPA: 3.24Most Common: A (49.0%)

This total includes data from semesters with unknown instructors

10175 students
WSFDCBA


  • Vince Kim

    Website Lead

Buzz Grades is maintained by Donghyun "Vince" Kim · Data: LITE (2016-2025), Course Catalog & OSCAR

Copyright

2025 Donghyun Kim, Buzz Grades

Privacy Policy

·

Feedback