This is a course covering a number of concepts and techniques of discrete mathematics. Topics covered: Counting: selections; inclusion-exclusion; generating functions; recurrence relations.

Description: The course covers mathematics useful in analyzing computer algorithms. Topics include recurrence relations; evaluation of sums; integer functions; elementary number theory; binomial ...

This is a course covering a number of concepts and techniques of discrete mathematics. Topics covered: Counting: selections; inclusion-exclusion; generating functions; recurrence relations. Graph ...

Covers topics in discrete mathematics with applications within computer science. Some of the topics to be covered include graphs and matrices; principles of logic and induction; number theory; ...

Taking derivative of our generating functions, we give partial differential equations and also functional equations. By using these equations, we derive recurrence relations and some formulas of our ...

This course will discuss fundamental concepts and tools in discrete mathematics with emphasis on their applications to computer science. Example topics include logic and Boolean circuits; sets, ...

MATH.2190 — Undergraduate Id: 008321 Offering: 1 Credits: 3-3 Description Presents propositional logic, combinatorics, methods of proof, mathematical systems, algebra of sets, matrix algebra, ...