COMP_SCI 212: Mathematical Foundations of Computer Science

The main focus of the course is to discuss fundamental concepts and tools in discrete mathematics with emphasis on their applications to computer science.

Prof. Aravindan Vijayaraghavan is the recommended course instructor for Fall, and Prof. Eric Evert is the recommended course instructor for Winter.

The recommended texts for COMP_SCI 212 are not provided in the given text.

<p>The course objectives are for students to develop mathematical thinking and problem-solving skills associated with writing proofs, be exposed to a wide variety of mathematical concepts used in the Computer Science discipline, and to include concepts drawn from the areas of Number Theory, Graph Theory, Combinatorics, and Probability.</p> Signup and view all the answers

<p>Some example topics covered in COMP_SCI 212 include logic and Boolean circuits, sets, functions, relations, databases, and finite automata; deterministic algorithms and randomized algorithms; analysis techniques based on counting methods and recurrence equations; trees and more general graphs.</p> Signup and view all the answers

<p>COMP_SCI 110 or COMP_SCI 111</p> Signup and view all the answers

<p>Prof. Aravindan Vijayaraghavan</p> Signup and view all the answers

<p>Mathematical thinking and problem-solving skills associated with writing proofs</p> Signup and view all the answers

<p>Concepts drawn from the areas of Number Theory, Graph Theory, Combinatorics, and Probability</p> Signup and view all the answers

<p>Logic and Boolean circuits; sets, functions, relations, databases, and finite automata; deterministic algorithms and randomized algorithms; analysis techniques based on counting methods and recurrence equations; trees and more general graphs</p> Signup and view all the answers