CSC 024 - Discrete Structures for Computer Science II
Semester Hours:3Spring
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.