تراكيب محددة - ريض 151
logical equivalence, arguments, methods of proof. Relations, equivalence relations, order relations. Boolean algebras, logic circuits, simplification of circuits. Graphs, connectedness, isomorphisms,
-
-
Chapter 1 The Foundations: Logic and Proofs
- 1.1 Propositional Logic 19:23
- 1.1 connectives part 1 - conjunction and disjunction 17:15
- 1.1 connectives part 2 - conditional statement 23:33
- 1.1 connectives part 3 - biconditional statement 11:36
- 1.1 precedence of logical operator 25:34
- 1.3 tautology, contradiction and contingency 05:20
- 1.3 Logical Equivalences 06:12
- 1.3 Logical Equivalences 2 22:15
- 1.3 Logical Equivalences 3 29:18
- 1.3 Logical Equivalences 4 24:26
- 1.4 Predicates 15:51
- 1.4 Quantifiers 26:36
- 1.4 examples about quantifier 33:37
- 1.6 argument and rules of inferences 17:10
- 1.6 rules of inference 27:29
- 1.6 examples of rules of inference 18:06
- 1.6 is this argument valid or invalid ? 28:12
- 1.6 fallacies 12:29
- 1.7 introduction to proof 15:13
- 1.7 proof methods 26:07
- 1.7 example of proof 1 11:58
- 1.7 example of proof 2 05:58
- 1.7 example of proof 3 16:19
- 1.7 disproving by counterexample 06:54
- 1.7 proof of equivalence 16:59
- 1.7 vacuous and trivial proof 19:33
- 1.7 mistakes in proof 18:53
- 1.8 exhaustive proof and proof by cases 19:24
- 1.8 existence and uniqueness proof 23:26
-
Chapter 2 Basic Structures: Sets
- 2.1. Sets 28:10
- 2.1 equal sets and Venn diagram 09:11
- 2.1 subset 27:40
- 2.1 cardinality and power set 21:20
- 2.1 Cartesian product 21:41
- 2.1 intervals 08:46
- 2.2 union , intersection and disjoint set 13:26
- 2.2 difference and complement 10:59
- 2.2 examples 10:14
-
Chapter 5 Induction and Recursion
- 5.1 mathematical induction 08:48
- 5.1 the meaning of mathematical induction 09:45
- 5.1 examples part 1 23:41
- 5.1 examples part 2 24:43
- 5-2 Strong Induction 23:07
- 5.2 Example about Strong Induction 13:51
- Exercise 5.1 Mathematical Induction part 1 17:30
- Exercise 5.1 Mathematical Induction part 2 13:31
- Exercise 5.1 Mathematical induction part 3 28:28
- Exercise 5-2 Strong Induction Part 1 15:34
- Exercise 5.2 Strong induction Part 2 39:00
-
Chapter 9 Relations
- 9.1 introduction to relation 12:23
- 9.1 relation on a set 12:05
- 9.1 properties of relation 28:19
- 9.1 more examples 20:54
- 9.1 combining relations 13:41
- 9.1 composite 23:30
- 9.3 Representing Relation by Matrix 26:57
- 9.3 Represent union , Intersection and Composition by Matrix 36:37
- 9.3 representing relation By Diagraph 19:09
- 9.4 closure 31:50
- 9.4 connectivity relation 19:05
- 9.5 equivalence relation 24:42
- 9.5 equivalence classes 15:33
- 9.5 partition 14:38
- 9.6 partial ordering 15:34
- 9.6 hasse diagram 12:55
-
CHAPTER 10 graphs
- 10.1 graphs 12:16
- 10.2 graph terminology 17:18
- 10.2 handshaking theorem 16:16
- 10.2 special simple graph 12:18
- 10.2 bipartite graph 26:41
- 10.2 subgraph 12:57
- أسئلة إضافية في الخطة درس 10.2 16:47
- 10.3 graph isomorphsim 28:04
- 10.3 Adjacency and Incidence Matrices (تم إضافته بعد التحديث) 13:53
- 10.4 path and connected graph 31:25
- 10.4 Cut Vertex - Cut Eage - Pathes and Isomorphism (للأولاد فقط) 22:39
- 10.7 planar graphs part 1 15:08
- 10.7 planar graphs part 2 14:11
-
chapter 11 trees
- 11.1 introduction to tree 10:50
- 11.1 rooted tree 24:16
- 11.1 balanced tree 25:54
- 11.2 application of trees 15:23
- 11.4 spanning tree 07:44
- 11.4 Depth and Breadth First Search 33:36
-
chapter 12 boolean algebra
- 12.1 introduction to boolean algebra 12:08
- 12.1 boolean function 32:17
- 12.1 duality 09:24
- 12.2 representing boolean function 24:50
- 12.2 Product of sum Expansion CPS 25:15
- 12.3 logic gates 11:53
- 12.3 example 3 11:30
- 12.4 minimization of circuits part 1 13:00
- 12.4 minimization of circuits part 2 18:35
- 12.4 minimization of circuits part 3 26:15
- 12.4 minimization of circuits part 4 05:43
- 12.4 minimization of circuits part 5 19:04
- 12.4 minimization of circuits part 6 21:09
-
Homework
- Solving Homework 1 19:17
- Solving Homework 2 06:50
-
Exercises of math 151
- 1.1 propositional logic 35:51
- 1.3 propositional equivalence 50:55
- 1.4 Predicates and Quantifiers 30:03
- 1.6 Rules of Inference 17:31
- 1.7 Introduction to Proofs 27:56
- 1.8 Proof Methods and Strategy 26:58
- 2.1 Sets 23:12
- 2.2 Set Operations 11:32
- 5.1 Mathematical Induction part 1 17:30
- 5.1 Mathematical Induction part 2 13:31
- 5.1 Mathematical induction part 3 28:28
- 5-2 Strong Induction Part 1 15:34
- 5.2 Strong induction Part 2 39:00
- 9.1 Relations and their Properties part 1 35:44
- 9.1 Relations and their Properties part 2 47:05
- 9.1 Relations and their Properties part 3 09:32
- 9.3 representing relation 18:56
- 9.3 Representing Relations (by Matrices) 30:34
- 9.4 closures of relations part1 13:38
- 9.4 closures of relations part2 10:42
- 9.5 equivalence relation 48:34
- 9.6 partial ordering 16:20
- 10.1 graphs 09:09
- 10-2 Graph Terminology and Special Types of Graphs part1 13:38
- 10-2 Graph Terminology and Special Types of Graphs part2 31:12
- 10.3 graph isomorphsim 16:54
- 10.4 connectivity 09:49
- 10.7 planar graphs 10:03
- 11.1 introduction to tree 14:08
- 11.2 application of trees 10:59
- 11.4 spanning tree 08:21
- 12.1 boolean function 24:07
- 12.2 representing boolean function 14:37
- 12.3 logic gates 10:35
- 12.4 minimization of circuits 44:47
-
Exam
- Quiz 1 33:11
- Quiz1-Boy-2021 16:57
- حل نموذج ميد ١ عام ٢٠٢٠ 01:17:40
- review - ch1 19:33
- review - ksu - mid1 - part1 29:25
- review - ksu - mid1 - part2 15:17
- review - ksu - mid1 - part3 01:20:32
- review - ksu - mid2 - part1 39:01
- review - ksu - mid2 - part2 17:06
- review - ksu - mid2 - part3 10:33
- review - ksu - mid2 - part4 18:08
- final review part 1 36:02
- final review part 2 23:07
- final review part 3 25:25
- حل نموذج فاينل كامل 01:18:00
-
tutorial math151
- tutorial 1 - 1.1. Propositional Logic 16:30
- tutorial 2 - 1.3. Propositional Equivalences 15:37
- tutorial 3 - 1.4. Predicates and Quantifiers 16:21
- tutorial 4 - 1.6. Rules of Inference 12:26
- tutorial 5 - 1.7. Introduction to Proofs 09:03
- tutorial 6 - 1.8. Proof Methods and Strategy 03:59
- tutorial 7 - 2.1 and 2.2 20:17
- tutorial 8 - ch 9 relations part 1 26:27
- tutorial 9 - ch 9 relations part 2 09:06
-
Chapter 1 The Foundations: Logic and Proofs
- logical equivalence, arguments, methods of proof. Relations, equivalence relations, order relations. Boolean algebras, logic circuits, simplification of circuits. Graphs, connectedness, isomorphisms, planar graphs, trees, applications
-
• Hadeel Mohammed Almadiny. • Lecturer in Vision Academy. • Specialty in mathematics. • Graduated from (KSU)with calss honor. ~ Experiences: • teacher in international school. • English language. • Strategic teaching course. ~ Achievements: • Title of scientific meeting leader in KSU.
-
Student feedback
4.00Course Rating
300 SAR -200SAR
Original Price 500 SAR - Hurry up!
Lectures
158 Videos
Duration
54:54:17
Material
16 Files
Assignments
No
Labs
No
Project
No
Certificate
Not Applicable
Reviews (9)
Real reviews from real students.
شرح جميل وواضح في وقت قصير ماشاء الله الله يوفقك استفدت كثير
شرح مبسط وممتاز للماده ، وطريقة شرح التمارين ممتازه وبالخطوات يعطيك العافيه
الشرح كان مرة وااااضح وكان منقذي + المقاطع مدتها معقولة الله يسعدها بفضل الله ثم هي طلعت بقريد عالي
شرح واضح وممتاز والمقاطع قصيره أشكرك جزيل الشكر
شوح مرتب وجميلل بس بالتشابتر الاول ياليت تحطي ارقام الدروس
ممتازة جدًا
حلو شرحها، بس اذا عندي سؤال وما عرفت تجاوب تسفه🥰
شرحها مزعج وما اعجبني حرفيا المعادلة تحلها من قبل واذا جت تشرح تقرأها قدامك وماتكتب شي !! اشوفها كارثه واذا انت ولد ماراح تستفيد شي لان المسائل حقتنا مختلفة والاختبارات السابقة شارحه الاشياء القديمة والخاصة بالبنات
في البدايه الشرح كان ممتاز بس بعدين ما ادري شصار ما استفدت شي