कोर्स · College

Discrete Mathematics

Logic, proof, induction, relations, counting, recurrences, graphs, automata and complexity: the discrete maths of a first university course.

8 इकाई 124 सबक 150 प्रश्न 180 मिनट अंतिम

A complete first university course in discrete mathematics, in the order it is usually taught: propositional and predicate logic and the standard proof techniques; induction in all its forms; sets, relations and functions, including countable and uncountable sets; counting with the product rule, bijections and the pigeonhole principle; recurrence relations and how to solve them; graphs, trees, Euler and Hamilton paths and colouring; Boolean algebra, circuits and finite automata; and finally algorithms, asymptotic analysis, the master theorem, satisfiability and polynomial-time reductions.

It is for anyone comfortable with school algebra who wants to reason precisely about finite and countable structures, and it is the mathematical core of a computer science degree. Each unit ends with a quiz mixing computation, concepts and short proofs; the final exam covers the whole course.

के बाद आता है: Algebra

कोर्स

अंतिम परीक्षा

हर इकाई से सवाल, पिछले. टाइप करने वाले जवाब कुल शक्ति प्रणाली से चिह्नित हैं; सबूतों और फोटो कार्य मॉडल द्वारा पढ़ा जाता है, फिर एक व्यक्ति आपके परिणाम के बाद पूरे कागज पर पुनर्विचार करता है. अब आप अपने लिंक के साथ एक प्रमाणपत्र प्राप्त कर सकते हैं. पास चिह्न: 70%.

इसमें हस्ताक्षर करें