Все публикации

0:15:08

Lesson 131 Part I: Finite-State Machines with No Output | Language Recognized by Finite Automata

0:24:49

Lesson 130: Finite-State Machines with Output | Finite-State Machine | Deterministic Finite Automata

0:26:53

Lesson 129 Part II: Languages and Grammars | Leftmost and Rightmost Derivation | Types of Grammars

0:16:46

Lesson 128 Part I: Languages and Grammars | Phrase-Structure Grammars | Automata VS TOC

0:17:06

Lesson 127: Minimization of Circuits | The Quine–McCluskey Method

0:14:56

Lesson 126: Minimization of Circuits | Don't Care (X) Conditions in K-Maps

0:31:16

Lesson 125: Minimization of Circuits | Karnaugh Map - K Map for 2, 3 and 4 Variables

0:25:42

Lesson 123: SOP vs POS | Min-term vs Max-term | Functional Completeness

0:14:53

Lesson 122: Identities of Boolean Algebra | Duality and Abstract Definition of a Boolean Algebra

0:19:20

Lesson 121: Boolean Algebra | Boolean Expressions | Boolean Functions in Discrete Mathematics

0:23:11

Lesson 119: Depth-First Search VS Breadth-First Search | Backtracking Applications

0:14:33

Lesson 120: Kruskal's and Prim's Minimum Spanning Tree (MST) Algorithms

0:14:51

Lesson 118: Spanning Trees | Kirchhoff's Matrix Tree Theorem | Minimum Spanning Tree

0:14:11

Lesson 117: Tree Traversal | Infix Prefix and Postfix Notation with Examples

0:25:02

Lesson 116: Tree Traversal | Inorder Preorder Postorder Traversal of Binary Trees

0:20:13

Lesson 115: Applications of Trees | Prefix Codes | HUFFMAN CODING

0:30:35

Lesson 114: Introduction to Trees | Properties of Trees | FULL & BALANCED m-ARY TREES

0:11:00

Lesson 113: Introduction to Trees | TREE vs GRAPH | Tree terminology and its basic Types

0:23:12

Lesson 112: Graph Coloring | THE FOUR COLOR THEOREM | Applications of Graph Colorings

0:19:23

Lesson 111: Planar Graphs in Discrete Mathematics | EULER’S FORMULA | Kuratowski’s Theorem

0:08:35

Lesson 110: Travelling Salesman Problem | Traveling Salesperson Problem in Discrete Mathematics

0:17:17

Lesson 109: Shortest-Path Problems | Dijkstra’s Algorithm in Discrete Mathematics

0:13:42

Lesson 108: Understanding Mohammed's Scimitars | Fleury's Algorithm

0:12:54

Lesson 107: Hamilton Paths and Circuits | Applications of Hamilton Circuits