Discrete Mathematics Lecture 16/20: The pigeonhole principle and examples. The inclusion/exclusion theorem and advanced examples. A combinatorial card trick.Posted in Conferences, Companies, Broadcasting, Science, Techtalks, Google, Lectures, Math
This course covers the mathematical topics most directly related to computer science. Topics include: logic, relations, functions, basic set theory, countability and counting arguments, proof techniques, mathematical induction, graph theory, combinatorics, discrete probability, recursion, recurrence relations, and number theory. Emphasis is placed on providing a context for the application of the mathematics within computer science.
|Level: any||Date: June 08, 2007||Votes: 0||User: scoundrel||Comments: 0|