CSC 024 - Discrete Structures for Computer Science IISemester Hours: 3
Functions, including surjections, injections, bijections. Continued study of computational complexity, theta and big-O notation. Recursive definitions and algorithms, recurrence relations and their solution, divide and conquer algorithms. Graphs: terminology, representations of graphs (including applications of matrix multiplication), complexity of graph problems.
CSC 014 . (Formerly Discrete Mathematics II.)
Click here for Fall 2019 course offering(s).
Click here for January 2020 course offering(s).
Click here for Spring 2020 course offering(s).
[Add to Personal Catalog]