عال
just for keep
-
-
CHAPTER 1: Logic Theory
- Proposition - Negation 20:06
- Logical Connectives ( Conjunction and Disjunction ) 13:42
- Logical Connectives ( Exclusive Or and Conditional Statement ) 30:20
- Converse, Inverse and Contrapositive 10:56
- Logical Connectives ( Bio-conditional Statement ) 10:11
- مراجعة جداً مهمه عن الروابط المنطقية (Logical Connectives) 06:06
- Truth Table of Compound Proposition ( ملاحظة: طريقة ترتيب جدول الصواب عند البنات تختلف عن الأولاد ، اللي شرحتها طريقة الأولاد ) 20:14
- Well-Formed Formula - Precedence Order 10:56
- Logic and Bit Operation 10:22
- Translating English Sentence 15:23
- Propositional Equivalences 19:57
- Logic Equivalence (Laws) 13:09
- Predicate 25:11
- Universal Quantification 23:47
- Existential Quantification 10:31
- Quantified with Restricted Domain 13:02
- Negating Quantified Expression 20:42
- Translating English into Logical Expression 21:55
- The Argument 21:59
- Example of Valid Argument 18:23
- Rules of Inference 15:36
- Show that an Argument is Valid Using Rules of Inference 28:34
- Equivalent Propositions (عال ١١٤ بنات +عال ١٠٤) 15:16
- Nested Quantifies (فقط لطلاب عال ١٠٤) 39:11
- tutorial 1 ( عبارة عن حل مجموعة تمارين من الكتاب عن جابتر ١) 01:07:11
- Rules of Inference (Examples) 15:16
- tutorial 2( عبارة عن حل مجموعة تمارين من الكتاب عن جابتر ١) 53:54
- ملخص + مراجعة شاملة لجابتر ١ 31:03
- Distribution Property of Universality (فقط عال 104) 02:59
- بث لمراجعة جابتر 1 الجزء الثاني 01:22:02
-
CAPTER 2: Fundamental Structure
- What is Discrete Structure? 06:40
- Sets 21:56
- Equal Sets - Empty Set - Singleton Set - Venn Diagram 13:31
- Subset - Superset - Proper Subsets 23:33
- Important Examples about Subset and Prober Subset 15:37
- Cardinality and Cartesian Product 20:25
- Power Set 12:48
- Union - Intersection - Disjoint - Difference 23:41
- Complement - Set Identities 23:52
- Inclusion- Exclusion Theory 14:41
- Computer Representation of Sets 27:49
- Relations 28:31
- Functions and Relation on a Set 24:50
- Properties of Relations 20:14
- Example about Properties of Relation 29:57
- Another Example about Properties of Relation 13:30
- Equivalence Relation 27:53
- Partial Ordering- Comparable Elements- Total Order - Well Ordered 27:56
- Functions 23:55
- More Examples about Function 17:56
- Injection Function 21:30
- Surjection and Bijection Function 22:49
- Inverse Function 16:20
- Composite of Two Functions 26:46
- The Graph - Familiar Function 18:49
- Prove set Identities by Vin Diagram and Membership Table (عال ١٠٤ فقط) 20:27
- Tutorial 3 (عبارة عن حل مجموعة تمارين من الكتاب عن جابتر ١) 01:20:19
- ملخص + مراجعة لجابتر ٢ 01:04:13
- Examples about Partial Ordering 17:46
-
CHAPTER 3: Proof Techniques
- Introduction to proof 13:36
- Introduction to Proof (Direct Proof Part 1) 34:02
- Introduction to Proof (Direct Proof Part 2) 39:26
- Vacuous and Trivial proof 29:57
- Proof by Contradiction (part 1) 30:08
- Proof by Contradiction (part 2) 14:53
- More Examples about Proof by Contradiction 12:24
- Counterexample 13:17
- Proof by Contrapositive (عال 104 وبعض شعب عال 114) 26:38
- Proof of Equivalence (عال ١٠٤) 11:01
- Proof by Cases (عال ١٠٤) 25:48
- Existence Proof (عال ١٠٤) 15:12
- Uniqueness Proof (عال ١٠٤)
- Introduction to Mathematical Induction (عال ١١٤ ) 06:53
- Principle of Mathematical Induction 18:52
- Example about Mathematical Induction Part1 16:49
- Example about Mathematical Induction Part2 23:42
- Many Example about Principle of Mathematical induction 33:38
- Strong Induction (عال ١١٤ فقط) 28:32
- Well Ordering Property (فقط عال ١١٤) 23:02
- Recursive Definition Part1 18:57
- Recursive Definition Part 2 20:36
- Structural Induction (عال ١١٤ فقط) 34:47
- Structural induction - Well Formed Formula (عال ١١٤ فقط) 27:57
- تتوريال ٤ 44:10
- Recursive Algorithm (عال ١٠٤ فقط) 10:56
- Example about Proof by Contrapositive (عال 104 وبعض شعب عال 114) 06:11
- Tutorial 5 (Induction and Recursion) 02:21:45
- Explain Strong Induction Again with More Examples (عال 114 فقط) 01:03:22
- Example 5: Mathematical Induction 08:19
-
CHAPTER 4: Machine Level Representation of Data (عال ١١٤ فقط)
- Number System 09:04
- More Information about Binary System 17:16
- Convert From ( Binary, Octal, Hexadecimal) to Decimal 33:32
- Convert From Decimal to (Binary, Octal, Hexadecimal) 33:53
- Convert (From Octal to Binary) and (From Binary to Octal) 11:46
- Convert (From Binary to Hexadecimal) and (From Hexadecimal to Binary) 08:50
- Convert (From Hexadecimal to Octal) and (From Octal to Hexadecimal) 10:58
- Introduction to Signed Binary Numbers (Signed Magnitude) 36:57
- 1's Complement and 2's Complement 20:24
- Binary Addition and Subtraction 33:23
- Examples of Adding and Subtracting Binary Numbers - Overflow 25:40
- Floating Point Representation 30:47
- BCD Code 11:58
- Tutorial 6 (Machine Level Representation of Data) 50:09
-
Chapter 4: Counting (عال ١٠٤ فقط)
- Product Rule 16:49
- Generalized Product Rule 21:38
- Sum Rule 16:03
- Principle of Inclusion-Exclusion (Subtraction Rule) 20:29
- Counting Using Tree Digram 17:36
- Pigeonhole Principle 19:51
- Generalize Pigeonhole Principle 17:52
- Permutation 29:24
- Combination 15:01
- Binomial Theorem 25:08
- Proving corollary by Using Binomial Theorem 07:29
- Tutorial 4 (Counting ) 32:00
- CHAPTER 5: Graph (عال ١٠٤ فقط)
-
Problem Set (عال 104)
- Problem Set #1 41:50
- Problem Set #2 37:41
- Problem Set #3 52:45
- Problem Set #4 01:16:15
-
Exam
- Quiz 1 (أسئلة من أ. هديل) 21:35
- Mid 1 ( النموذج الأول ) 33:43
- Mid 1 ( النموذج الثاني ٢٠٢٠ ) 34:58
- Mid 1 (النموذج الثالث) 35:02
- Mid 2 (النموذج الأول) 41:22
- Final (النموذج الأول) 01:47:17
- Quiz 1 (النموذج الأول عام 2021) 08:40
- Quiz 1 (النموذج الثاني عام 2022) 07:18
- Quiz 2 (النموذج الأول) - عال 114 32:55
- Mid 1 (النموذج الرابع 2021) 28:46
- Mid 2 (النموذج الثاني) 51:09
- Quiz 1 (تجميعات كويز 1 لعام 2023 الترم الثاني ) 39:44
- Quiz 3 (2023 2end term) 01:07:43
- Mid 1 (النموذج الخامس 2022) 58:10
- نموذج كويز 5 عال 114 (ch 4 : machine level representation) 30:58
- Mid 1 ( النموذج السادس 1444 الترم الثاني ) - عال 114 59:29
- Final (عال 114 عام 1444 الترم الاول) 01:27:14
-
تتوريال
- tutorial 1 (Propostion) 01:07:11
- Tutorial 2 (Predicate - Quantifier - Inference rule) 53:54
- tutorial 3 (Set - Relation - Function) 01:20:19
- Tutorial 4 (Introduction to proof) 44:10
- Tutorial 5 (Induction and Recursion) 02:21:45
- tutorial 4: counting (عال 104) 32:00
- Tutorial 6 : Machine Level Representation of Data (عال 114 فقط) 50:09
- Tutorial 5: Graph (عال 104) 41:59
-
live
- live for mid 1 52: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
-
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
- 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.4 closures of relations part1 13:38
- 9.4 closures of relations part2 10:42
- 9.5 equivalence relation 48:34
- 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
- 9.6 partial ordering 16:20
- 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
- 5.2 Strong induction Part 2 39:00
- 9.3 Representing Relations (by Matrices) 30:34
-
CHAPTER 2: Functions, Sequences and Sums
- Definition of Functions 22:19
- Domain and Codomain 15:13
- Exercise about Domain, Codomain and range 15:56
- One to One , Onto and Bijection Function 24:31
- Prove or Disprove Onto and One to One Function 26:39
- Examples about Bijection Function 23:20
- The Domain of Function 16:56
- The Inverse Function 12:22
- Composite of Two Functions 21:47
- More Examples about Composite Functions 14:33
- Sequences 23:06
- Exercises about Sequences 19:45
- Summation 25:42
- ملخص + مراجعة شاملة لجابتر ٢ 45:29
-
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 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
- 9.3 Representing Relation by Matrix 26:57
- 9.3 Represent union , Intersection and Composition by Matrix 36:37
-
CHAPTER 1: Logic Theory
-
just for keep -
• 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
5Course Rating
التقسيط متاح
500 SAR
Lectures
227 Videos
Duration
101:30:54
Assignments
No
Labs
No
Project
No
Certificate
Not Applicable
Reviews (0)
Real reviews from real students.
No reviews yet.