You must be logged in to take this course → LOGIN | REGISTER NOW

In this **[course_title]** you will learn about the different proof techniques and how to use them for solving different kind of problems. It will introduce graphs and show how graphs can be used for modeling of different problems and how this can help in solving problems. You will learn how to count the number of possibilities that can arise in different situations. The course covers include fundamentals, logic, counting, relations and digraphs, trees, topics in graph theory, languages and finite-state machines, and groups and coding.

**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: Open Culture

### Course Curriculum

Lecture 1 – Propositional Logic | 00:57:00 | ||

Lecture 2 – Propositional Logic (Contd.) | 00:58:00 | ||

Lecture 3 – Predicates & Quantifiers | 00:58:00 | ||

Lecture 4 – Predicates & Quantifiers (Contd.) | 00:59:00 | ||

Lecture 5 -Logical Inference | 00:59:00 | ||

Lecture 6 -Resolution Principles & Application to PROLOG | 00:55:00 | ||

Lecture 7 – Methods of Proof | 00:55:00 | ||

Lecture 8 – Normal Forms | 00:58:00 | ||

Lecture 10 – Sets | 00:55:00 | ||

Lecture 12 – Set Operations on Strings Over an Alphabet | 00:58:00 | ||

Lecture 14- Graphs | 00:56:00 | ||

Lecture 15 – Graphs (Contd.) | 00:56:00 | ||

Lecture 16 – Trees | 00:57:00 | ||

Lecture 17 – Trees and Graphs | 00:57:00 | ||

Lecture 18 – Special Properties of Relations | 00:57:00 | ||

Lecture -19 – Closure of Relations | 00:57:00 | ||

Lecture 20 – Closure of Relations (Contd.) | 00:57:00 | ||

Lecture 21 – Order Relations | 00:56:00 | ||

Lecture 22 – Order and Relations and Equivalence Relations | 00:58:00 | ||

Lecture 23 – Equivalence relations and partitions | 00:56:00 | ||

Lecture 24 – Functions | 00:55:00 | ||

Lecture 25 – Functions (Contd.) | 00:56:00 | ||

Lectures 26 – Functions (Contd.) | 00:58:00 | ||

Lecture 27-Pigeonhole Principle | 00:57:00 | ||

Lecture 28 – Permutations and combinations | 00:57:00 | ||

Lecture 29 – Permutations and Combinations(Contd…) | 01:00:00 | ||

Lecture 30 – Generating Functions | 00:58:00 | ||

Lecture 31- Generating Functions | 00:56:00 | ||

Lecture 32 – Recurrence Relations | 00:57:00 | ||

Lecture 33 – Recurrence Relations | 00:56:00 | ||

Lecture 34-Recurrence Relations(contd..) | 00:54:00 | ||

Lecture 35-Algebras | 00:57:00 | ||

Lecture 36-Algebras(contd…) | 00:57:00 | ||

Lecture 37-Algebras(contd…) | 00:56:00 | ||

Lecture 38-Finite State Automaton | 00:57:00 | ||

Lecture 39-Finite State Automaton(contd….) | 00:57:00 | ||

Lecture 40-Lattices | 00:57:00 | ||

Assessment | |||

Submit Your Assignment | 00:00:00 | ||

Certification | 00:00:00 |

### Course Reviews

No Reviews found for this course.

**8 STUDENTS ENROLLED**