You must be logged in to take this course → LOGIN | REGISTER NOW
The aim of the course is to give an introduction to discrete applied mathematics. Topics include probability, counting, linear programming, number-theoretic algorithms, sorting, data compression, and error-correcting codes. This is a Communication Intensive in the Major (CI-M) course and thus includes a writing component. If students are looking forward to get some knowledge regarding this filed then this is the right course for them.
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 need 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 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 | |||
Probability Theory | 00:21:00 | ||
Pigeonhole Principle | 00:21:00 | ||
Probabilistic Method – Van der Waerden’s Theorem | 00:20:00 | ||
Chernoff Bounds | 00:25:00 | ||
Sequential Choice | 00:25:00 | ||
Counting, Coding, Sampling | 00:22:00 | ||
Generating Functions | 00:24:00 | ||
Module: 02 | |||
Linear Programming | 00:23:00 | ||
Network Flows | 00:23:00 | ||
Sorting | 00:23:00 | ||
Median Finding | 00:22:00 | ||
Median Finding and QUICKSORT | 00:24:00 | ||
Sorting Networks | 00:23:00 | ||
Modular Arithmetic and Elementary Algebra | 00:21:00 | ||
Module: 03 | |||
Cryptography | 00:23:00 | ||
Factoring | 00:21:00 | ||
FFT (Fast Fourier Transform) | 00:23:00 | ||
Shannon’s Noiseless Coding Theorem | 00:24:00 | ||
Huffman Codes | 00:24:00 | ||
Lempel-Ziv Codes | 00:21:00 | ||
Shannon’s Noisy Coding Theorem | 00:24:00 | ||
Linear Codes | 00:23:00 | ||
Assessment | |||
Submit Your Assignment | 00:00:00 | ||
Certification | 00:00:00 |
Course Reviews
No Reviews found for this course.