Dr. RAMESH KUMAR THAKUR

Here you will find every special thing in a simple way.

Discrete Math(L-14.1)|Solving Homogeneous Recurrence Relation with Characteristic Equation & Example
Discrete Math(L-14.1)|Solving Homogeneous Recurrence Relation with Characteristic Equation & Example
Discrete Math(L-14)| Function(Domain,Codomain,Range,Image)| Sequence| Recurrence Relation & Solution
Discrete Math(L-14)| Function(Domain,Codomain,Range,Image)| Sequence| Recurrence Relation & Solution
Discrete Math(L-24)| Minimum Spanning Tree (MST), Prim’s Algorithm, Kruskal’s Algorithm with Example
Discrete Math(L-24)| Minimum Spanning Tree (MST), Prim’s Algorithm, Kruskal’s Algorithm with Example
Discrete Math(L-18)| Path & Circuit, Walk, Trail, Shortest Path Problem, Dijkstra’s Algorithm
Discrete Math(L-18)| Path & Circuit, Walk, Trail, Shortest Path Problem, Dijkstra’s Algorithm
Discrete Math(L-6)| Proof | Direct | Indirect (Contraposition, Contradiction, Exhaustive, By Cases)
Discrete Math(L-6)| Proof | Direct | Indirect (Contraposition, Contradiction, Exhaustive, By Cases)
Discrete Math(L-5)| First-Order Logic, Atomic & Complex Sentence, Example of FOL, Rules of Inference
Discrete Math(L-5)| First-Order Logic, Atomic & Complex Sentence, Example of FOL, Rules of Inference
Discrete Math(L-4)| Propositional Equivalences, Predicates & Quantifiers (∀, ∃), Nested Quantifiers
Discrete Math(L-4)| Propositional Equivalences, Predicates & Quantifiers (∀, ∃), Nested Quantifiers
Discrete Math(L-17) |Graph, Types of Graph, Basic Terminology, Special Graph, Bipartite Graphs
Discrete Math(L-17) |Graph, Types of Graph, Basic Terminology, Special Graph, Bipartite Graphs
Discrete Math(L-3)| Propositions, Compound Propositions, Truth Tables & Logical Operator, Precedence
Discrete Math(L-3)| Propositions, Compound Propositions, Truth Tables & Logical Operator, Precedence
Discrete Math(L-2)|Cardinality of Set, Countable & Uncountable Sets, Countable Infinite Set,Example
Discrete Math(L-2)|Cardinality of Set, Countable & Uncountable Sets, Countable Infinite Set,Example
Discrete Math(L-1)| ISet, Subset, Power Set, Union, Intersection, Complement, Difference, Product
Discrete Math(L-1)| ISet, Subset, Power Set, Union, Intersection, Complement, Difference, Product
Module-1_Lec-1:Introduction to AI|Turing Test| Acting, Thinking Humanly| Acting, Thinking Rationally
Module-1_Lec-1:Introduction to AI|Turing Test| Acting, Thinking Humanly| Acting, Thinking Rationally
Module-5_Lec-3: ALPHA BETA PRUNING| PRUNING CONDITION| ALPHA| BETA| EXAMPLE OF α - β PRUNING
Module-5_Lec-3: ALPHA BETA PRUNING| PRUNING CONDITION| ALPHA| BETA| EXAMPLE OF α - β PRUNING
Module-3_Lec-4: Uniform Cost Search (UCS) | Example | Artificial Intelligence (AI) | Properties
Module-3_Lec-4: Uniform Cost Search (UCS) | Example | Artificial Intelligence (AI) | Properties
Module-3_Lec-10: Greedy Best First Search| Example | Artificial Intelligence (AI) | Properties
Module-3_Lec-10: Greedy Best First Search| Example | Artificial Intelligence (AI) | Properties
Module-3_Lec-11: A* Search (Informed Search)| Example | Artificial Intelligence (AI) | Properties
Module-3_Lec-11: A* Search (Informed Search)| Example | Artificial Intelligence (AI) | Properties
DIP(L-41)| Lempel-Ziv-Welch (LZW) Coding| Numerical on Lempel-Ziv-Welch (LZW) Coding
DIP(L-41)| Lempel-Ziv-Welch (LZW) Coding| Numerical on Lempel-Ziv-Welch (LZW) Coding
DIP(L-42)| Run-length coding| Bit-plane Coding| Combining Huffman Coding with Run-length Coding
DIP(L-42)| Run-length coding| Bit-plane Coding| Combining Huffman Coding with Run-length Coding
DIP(L-40)| Shannon Fano Coding | Metric for Comparing Compression Methods
DIP(L-40)| Shannon Fano Coding | Metric for Comparing Compression Methods
DIP(L-39)| Arithmetic Coding| Numerical on Arithmetic Coding
DIP(L-39)| Arithmetic Coding| Numerical on Arithmetic Coding
DIP(L-38)| Huffman Coding| Numerical on Huffman Coding
DIP(L-38)| Huffman Coding| Numerical on Huffman Coding
DIP(L-37)| Image Compression| Data Redundancy, Fidelity Criteria and Types (Lossy, Lossless)
DIP(L-37)| Image Compression| Data Redundancy, Fidelity Criteria and Types (Lossy, Lossless)
DIP(L-36)| Thinning, Thickening | Numerical on Thinning and Thickening
DIP(L-36)| Thinning, Thickening | Numerical on Thinning and Thickening
DIP(L-35)| Convex Hull | Numerical on Convex Hull
DIP(L-35)| Convex Hull | Numerical on Convex Hull
DIP(L-34)| Hit-Miss Transform | Numerical on Hit-Miss Transform
DIP(L-34)| Hit-Miss Transform | Numerical on Hit-Miss Transform
DIP(L-33)| Connected Component Extraction | Numerical on Connected Component Extraction
DIP(L-33)| Connected Component Extraction | Numerical on Connected Component Extraction
DIP(L-32)| Region Filling| Numerical on Region Filling
DIP(L-32)| Region Filling| Numerical on Region Filling
DIP(L-31)| Boundary Extraction| Numerical on Boundary Extraction
DIP(L-31)| Boundary Extraction| Numerical on Boundary Extraction
DIP(L-30)| Opening and Closing| Numerical on Opening and Closing
DIP(L-30)| Opening and Closing| Numerical on Opening and Closing
DIP(L-29)| Dilation| Erosion| Combining Erosion and Dilation| Numericals on Dilation and Erosion
DIP(L-29)| Dilation| Erosion| Combining Erosion and Dilation| Numericals on Dilation and Erosion