Mathematics for Computer Science (Fall 2010)
This course covers elementary discrete mathematics for computer science and engineering. It emphasizes mathematical definitions and proofs as well as applicable methods. Topics include formal logic notation, proof methods; induction, well-ordering; sets, relations; elementary graph theory; integer congruences; asymptotic notation and growth of functions; permutations and combinations, counting principles; discrete probability. Further selected topics may also be covered, such as recursive definition and structural induction; state machines and invariants; recurrences; generating functions.
Starts : 2010-09-01
-- no reviews yet -- make the first review
If you can suggest any prerequisite, please let us know.
See all Education Paths
If your company does certification for those who completed this course then register your company as certification vendor and add your exams to the Exams Directory.
People who learned this course or plan to learn. These people added the course to their Education Passport or their Personal Education Path.Daniel Pastushchak Derek FENG 冯策 Dmitrii Evgeniya Ibrahim Illya Somov Iordanis Kalaitzoglou Pavlo Rogov Kirill Varoon Silochan Vasia Khalaim Vyacheslav Boychenko Ольга Ларькина Рустем Жумагулов
If you learned this course or plan to learn then add it to your Personal Education Path or your Education Passport
Courses related to the course subject
Let us know when you did the course Mathematics for Computer Science (Fall 2010).
Add the course Mathematics for Computer Science (Fall 2010) to My Personal Education Path.
Successfully added to your path.View your path
Select what exam to connect to the course. The course will be displayed on the exam page in the list of courses supported for certification with the exam.