Sudhakar Atchala

13:50

Unification Algorithm || Knowledge Representation || Artificial Intelligence || Resolution

6:47

Uninformed Vs Informed Search in Artificial Intelligence | Search Strategies| Algorithms|Techniques

14:24

Resolution in Predicate logic || Is John like peanuts || Artificial Intelligence

9:33

Design a Moore Machine to find 2's Complement of a given Binary number || Theory of Computation

8:05

Knowledge Representation in First Order Predicate Logic ( FOL ) || John likes all kinds of food

13:16

Resolution in Predicate logic | Example 1 | Artificial Intelligence |Was Marcus hate(loyalty) ceaser

8:19

Resolution algorithm in Predicate Logic || Knowledge Representation || Artificial Intelligence

11:36

Resolution in Propositional Logic |Resolution Algorithm |Resolution Example |Artificial Intelligence

5:34

Steps for Converting First Order Predicate Logic Statements to CNF (Conjunctive Norm) || AI

9:51

Steps for Converting Propositional Logic Statements to CNF (Conjunctive Norm) Artificial Intelligenc

7:33

Knowledge Representation in First Order Predicate Logic ( FOL ) in Artificial Intelligence

9:50

Represent Facts or Statements as Well Formed Formulas using Predicate Logic Ex 2 |Artificial Intell

11:14

Represent Facts or Statements as Well Formed Formulas using Predicate Logic Ex1|Artificial Intellig

6:35

Predicate Logic in Artificial Intelligence |First Order Predicate Logic FOL|Knowledge Representation

13:47

Excess 3 Subtraction using 9’s Complement || 2 Examples || Digital Logic Design || DLD || DE

10:53

BCD Subtraction using 10’s Complement | 2 Examples | Digital Logic Design | DLD |Digital Electronics

12:40

BCD Subtraction using 9’s Complement | 2 Examples | Digital Logic Design | DLD | Digital Electronics

6:46

Means Ends Analysis Search Technique Algorithm in Artificial Intelligence with Simple Example

3:58

Generate and Test Search in Artificial Intelligence || Heuristic Search

5:08

Steepest Ascent Hill Climbing Algorithm in Artificial Intelligence || Gradient Search Algorithm

7:39

Hill Climbing Algorithm in Artificial Intelligence | Simple Hill Climbing | Limitations Hill climbi

11:04

Alpha Beta Pruning Search Algorithm with Solved Example in Artificial Intelligence || Game Playing

9:39

MiniMax Search Algorithm in Artificial Intelligence with Solved Example || Game Playing

12:52

AVL Tree Node Deletion in Data structures || with Example

14:08

AO* algorithm in AI (artificial intelligence) || AND OR Graph || Problem Reduction in AI

14:21

A* algorithm in AI (artificial intelligence) with example || A Star algorithm || Informed search

13:07

Constructing AVL Trees for Strings || AVL tree Example Step-by-Step Guide || AVL Trees Explained

11:44

8-Puzzle Problem in Artificial Intelligence without Heuristic Function | Example |Uninformed search

13:15

Best First Search Algorithm(BFS) in Artificial Intelligence || BFS Solved Example in AI

8:13

State Space Search in Artificial intelligence with Example

8:48

Bidirectional Search Algorithm in Artificial Intelligence || Uninformed || Artificial intelligence

17:22

AVL Tree Insertion || Solved Example || Construct AVL tree for the elements 60,1,40,30,10,100,70,80

4:24

Uniform Cost Search Algorithm || UCS Search Algorithm in Artificial Intelligence

10:58

Iterative Deepening Search(IDS) || Iterative Deepening DFS Algorithm || Artificial Intelligence

12:41

Depth Limited Search Algorithm || DLS Algorithm || Uninformed Search || Artificial intelligence

13:21

Depth First Search (DFS) with example || Uninformed Search || Artificial Intelligence

10:53

Breadth First Search (BFS) with example || Uninformed Search || Artificial Intelligence

12:07

Solve Non Homogeneous Recurrence Relation || S(K)-3S(K-1)-4S(K-2)=4^k || DMS || MFCS || DMGT

14:28

Solve Recurrence Relation using Generating Functions || a n + a n-1 -6a n-2=0|| DMS || MFCS || DMGT

21:34

Solve Non Homogeneous Recurrence Relation | a n+2 - 6 a n+1 +9 a n=3(2)^n+7(3)^n | DMS | MFCS | DMGT

6:16

Diagonalization Language in TOC || Universal Language in Theory of Computation || TOC || FLAT

3:31

Church-Turing Thesis in Theory of Computation || Turing Machine || TOC || Automata Theory

5:56

Decidable and Undecidable Problem || Decidability || Undecidability || Theory of computation

10:23

Solve Recurrence Relations using Generating Functions || a n+1 - a n=3^n || DMS || MFCS || DMGT

14:17

Solve Non homogeneous Recurrence Relation for b^n || a n + 4 an-1 + 4an-2=5(-2)^n

8:22

Solve Non homogeneous Recurrence Relation for b^n || a n+1 - 2 an=2^n for a0=1

7:38

Chomsky Normal Form | Converting CFG to CNF || TOC | FLAT | Theory of Computation | Automata Theory

13:16

Solve Non homogeneous Recurrence Relation for b^n || a n+2 + 3a n+1 + 2 an=3^n for a0=0 an d a1=1

18:28

Non homogeneous Recurrence Relation for 'n^2' value || DMS || DMGT || MFCS || Solved Example

21:07

Multinomial Theorem | 4 Examples |Find the coefficient of x^3y^3z^2 in the expansion of (2x-3y+5z)^8

23:58

Non homogeneous Recurrence Relation for 'n' value || DMS || DMGT || MFCS || 2 Solved Examples

10:26

Universal Turing Machine || Binary encoding of Turing machine || TOC || FLAT || Automata Theory

21:23

Non homogeneous Recurrence Relations with Constant Coefficients || DMS || DMGT || MFCS

16:04

Lattice in Discrete Mathematics | 2 Examples | Lattice Properties | Hasse Diagram is lattice or not

26:35

Hasse Diagram (15 Example Problems) || Hasse Diagram || How to Draw Hasse Diagram || DMS || MFCS

18:18

Hasse Diagram | How to Draw Hasse Diagram | Hasse Diagram in Discrete Mathematics | Procedure | DMS

5:47

Design a Turing Machine to accept Even number of 0's and Any number of 1's || TOC || FLAT ||Automata

4:20

Construct Turing machine for language of strings ending with ab || Automata Theory || TOC || FLAT

8:07

Subgraphs in Discrete Mathematics || Spanning Subgraphs || Induced Subgraphs || Types of Subgraphs

7:37

Design a Turing Machine for Incrementer || Decrementer || function f(x)=x+1 || f(x)=x+2 || f(x)=x-1

11:27

Show that ∀x(P(x) v Q(x)) = (∀x) (P(x)) v (Ǝx) ( Q(x)) || Logical Equivalences Involving Predicates

7:45

Show that Ǝx(P(x) ʌ Q(x)) = (Ǝx) (P(x)) ʌ (Ǝx) ( Q(x)) | Logical Equivalences Involving Predicates

13:17

Planar Graph Examples | K2,3 | K3,3 | K5 | A graph of oder 5 and size 8 | Order 6 & size 12 | DMS

15:49

Types of graphs in discrete mathematics | Regular | Cyclic | Complete | Bipartite|Complete Bipartite

11:10

Design of PDA for Language L=a^i b^j c^k | j=k || Theory of computation || TOC ||FLAT | PDA Examples

22:51

Inference Rules For Predicate Logic | Rules of Inference for Quantified Statements | DMS |3 Examples

9:44

Design of PDA for Language L=a^i b^j c^k | i=j || Theory of computation || TOC ||FLAT | PDA Examples

11:56

Construct PDA for the language L={a^2n b^n} || Pushdown Automata || TOC || FLAT || Theory of Comp

13:07

Negation Of a Quantified Statement in Discrete Mathematics || 3 Examples || Predicate logic

18:42

Composite Functions || Function Composition || 4 Examples || DMGT || DMS || MFCS || DM

13:06

Quantifiers in Predicate logic || Represent the Sentences(Statements) in Symbolic Form || DMGT ||DMS

8:28

[New] Convert Right Linear Grammar to Left Linear Grammar | Construction of Left Linear Grammar

8:48

Converting Finite Automata to Regular Grammar || Procedure || Example || Construction of Regular Gr

13:41

Converting Regular Grammar to Finite Automata || Procedure || 2 Examples || Construction || TOC

14:32

Greibach Normal Form || Converting CFG to GNF || TOC || FLAT || Theory of Computation || Example 3

18:47

Greibach Normal Form || Converting CFG to GNF || Ex2 || TOC || FLAT || Theory of Computation

13:18

Chomsky Normal Form || Converting CFG to CNF || Ex 2 || TOC || FLAT || Theory of Computation

11:01

Removal of Unit Productions || Simplification of CFG || TOC || Theory of Computation || FLAT

7:04

Conversion of Finite Automata to Regular Expression using Arden's Theorem | Construct | TOC | FLAT

14:55

Conversion of Finite Automata(DFA) to Regular Expression using Arden's Theorem || Construct || TOC

7:17

INFERENCE THEORY || VALID CONCLUSION USING TRUTH TABLE || THEORY OF INFERENCE || DMS

14:37

COLLAPSING FIND - DISJOINT SET OPERATION || DESIGN AND ANALYSIS OF ALOGORITHMS || DAA

14:35

WEIGHTED UNION - DISJOINT SET OPERATION || DESIGN AND ANALYSIS OF ALOGORITHMS || DAA

17:29

Minimization of Finite Automata(DFA) using Equivalence or Partition Method || Example 3

11:55

Disjoint Set Operations - Simple Union & Find Algorithms || DAA

16:06

Minimization of DFA(Finite Automata) using Equivalence or Partition method || Example 2

11:01

convert nfa with epsilon to nfa without epsilon || Example 2

6:31

DFA which accepts strings starting and ending with same symbol || FLAT || Theory of computation

10:21

Logical Equivalence with out using truth table examples or equivalent formulas || DMS || 3 examples

6:22

Design DFA that accepts language L={awa | w ∈ {a,b}*} || String starts with 'a' and ends with 'a'

7:38

DFA for atmost 2(two) a's || atmost 3(Three) a's || Not more than 2 a's || Not more than 3 a's

6:18

DFA of language with all strings starting with 'a' & ending with 'b' || DFA Example

6:47

DFA for number of a's are divisibly by 3 || DFA for a's always appears tripled

27:45

Reliability Design using Dynamic Programming || DAA || Design and Analysis of Algorithms

7:44

Acceptance of a String by a Finite Automata | Language accepted by Finite Automata || Acceptability

13:06

Strings in Automata Theory || Central(Basic) Concepts || Mathematical Notations|| String Operations

12:18

Language in Automata Theory | Central(Basic) Concepts | Mathematical Notations|Theory of Computation

5:20

1 to 8 Demultiplexer | 1 * 8 Demultiplexer | Working | Block Diagram |Truth Table|Boolean expression

15:17

Programmable Logic Devices | PLDs | PROM | PAL | PLA | Programmable Read Only Memory | Array Logic

5:21

PROM (Programmable Read Only Memory) || Implementing Full Adder using PROM || PROM Example2