The field of Mathematics is applied to different disciplines such as computer science. Learning an interactive way to discrete mathematics will help you gain expertise in computer science and engineering.
You will gain skills and knowledge in this [course_title] on the fundamental concepts of mathematics such as the definitions, proofs, sets, functions, etc. You will also learn the discrete structures and probability theory to know about graphs, modular arithmetic, etc.
Assessment
This course does not involve any written exams. Students need to answer 5 assignment questions to complete the course, the answers will be in the form of written work in pdf or word. Students can write the answers in their own time. Each answer needs to be 200 words (1 Page). Once the answers are submitted, the tutor will check and assess the work.
Certification
Edukite courses are free to study. To successfully complete a course you must submit all the assignment of the course as part of the assessment. Upon successful completion of a course, you can choose to make your achievement formal by obtaining your Certificate at a cost of £49.
Having an Official Edukite Certification is a great way to celebrate and share your success. You can:
- Add the certificate to your CV or resume and brighten up your career
- Show it to prove your success
Course Credit: MIT
Course Curriculum
| Module: 01 | |||
| 1.1.1 Welcome to 6.042 | 00:02:00 | ||
| Proof By Contradiction | 00:08:00 | ||
| Well Ordering Principle 1 | 00:06:00 | ||
| Propositional Operators | 00:09:00 | ||
| Predicate Logic 1 | 00:13:00 | ||
| Sets Definitions | 00:12:00 | ||
| Relations | 00:25:00 | ||
| Module:0 2 | |||
| Induction | 00:22:00 | ||
| State Machines Invariants | 00:26:00 | ||
| Recursive Data | 00:13:00 | ||
| Cardinality | 00:13:00 | ||
| GCDs & Linear Combinations | 00:10:00 | ||
| Congruence mod n | 00:13:00 | ||
| Modular Exponentiation Euler’s Function | 00:06:00 | ||
| Module:0 3 | |||
| RSA Public Key Encryption | 00:22:00 | ||
| Digraphs: Walks & Paths | 00:04:00 | ||
| DAGs | 00:11:00 | ||
| Partial Orders | 00:11:00 | ||
| Degrees | 00:11:00 | ||
| Coloring | 00:16:00 | ||
| Trees | 00:08:00 | ||
| Module:0 4 | |||
| Stable Matching | 00:11:00 | ||
| Arithmetic Sums | 00:04:00 | ||
| Asymptotic Notation | 00:08:00 | ||
| Sum And Product Rules | 00:07:00 | ||
| Generalized Counting Rules | 00:10:00 | ||
| The Pigeonhole Principle | 00:04:00 | ||
| Tree Model | 00:25:00 | ||
| Module: 05 | |||
| Conditional Probability Definitions | 00:15:00 | ||
| Independence | 00:04:00 | ||
| Bigger Number Game | 00:12:00 | ||
| Expectation | 00:19:00 | ||
| Deviation From The Mean: Video | 00:08:00 | ||
| Law Of Large Numbers | 00:14:00 | ||
| Random Walks | 00:11:00 | ||
| Assessment | |||
| Submit Your Assignment | 00:00:00 | ||
| Certification | 00:00:00 | ||
Course Reviews
No Reviews found for this course.
Related Courses
