Channel Avatar

Sudhakar Atchala

414K subscribers

This channel contains educational videos which helps the students for their self learning. ...


15:52
Conceptual Dependency in Artificial Intelligence with Examples | Knowledge Representation | AI
04:51
Frames in Artificial Intelligence with Examples | Knowledge Representation | AI
09:42
Semantic Networks in Artificial Intelligence with Examples | Knowledge Representation | AI
09:33
Forward Chaining and Backward Chaining in Artificial Intelligence | Propositional Logic | AI
34:13
CPU Scheduling Algorithms One-Shot | FCFS, SJF, SRTF, Round Robin & Priority | OS | Operating System
07:42
Convert Regular Expression to ε-NFA Using Thompson’s Construction Method | TOC | FLAT
19:57
Binary Search Using Divide and Conquer in DAA | Algorithm, Example & Time Complexity Explained
21:45
Articulation Points & Biconnected Components in DAA | Algorithm to Find Articulation Points with Ex
16:00
What is an Articulation Point in DAA? | Algorithm to Find Articulation Points with an Example
09:10
Articulation Points & Biconnected Components in DAA | Graph Algorithms
24:55
Top Operating System Interview Questions on Process Synchronization | Interview & Placement Preparat
24:16
Disk Scheduling Algorithms One-Shot | FCFS, SSTF, SCAN, C-SCAN, LOOK & C-LOOK with Examples | OS
05:24
Epsilon Closure (ε-Closure) in Automata Theory | NFA with Epsilon Transitions | TOC | FLAT
03:52
Map Coloring Problem in Constraint Satisfaction Problem | Artificial Intelligence
10:04
Connected Components in DAA | How to Find Connected Components Using BFS & DFS | Graphs
05:15
Epsilon NFA (ε-NFA) in TOC | Formal Definition & NFA with Epsilon Transitions | Automata Theory
05:52
Linear vs Non-Linear Data Structures in Data Structures | Differences with Examples | DSA
10:28
PDA to CFG Conversion in TOC | Pushdown Automata to Context-Free Grammar |FLAT|Theory of Computation
22:52
Top OS Interview Questions on CPU Scheduling | Process Scheduling| Interview & Placement Preparation
11:02
Cryptarithmetic Problems in AI | BASE + BALL = GAMES Solved | CSP | Constraint Satisfaction Problem
09:21
Cryptarithmetic Problems in AI | CROSS+ROADS=DANGER Solved | Constraint Satisfaction Problem (CSP)
15:16
Cryptarithmetic Problems in AI | SEND+MORE=MONEY & TWO+TWO=FOUR | Constraint Satisfaction Problems
11:49
Constraint Satisfaction Problem (CSP) Using Backtracking | Backtracking Search in AI
15:06
Constraint Satisfaction Problem (CSP) in AI with Examples | Map Coloring, Cryptarithmetic & Sudoku
24:14
Regular Expression to DFA Conversion | Example 2 | Convert RE to DFA | Solved Example | TOC | FLAT
19:41
Regular Expression to DFA Conversion | Example 1 | Convert RE to DFA | Solved Example | TOC | FLAT
20:52
Top Operating System Interview Questions on Process Management |OS Interview & Placement Preparation
10:52
Conversion of Epsilon-NFA to DFA | ε-NFA to DFA Conversion | Solved Example | TOC | FLAT
15:07
NFA to DFA Conversion | Subset Construction Method | Solved Example 2 | FLAT | Theory of computation
02:46:21
Top Data Structures Interview Questions | Placements & Interviews | DSA
10:14
NFA to DFA Conversion | Subset Construction Method | Solved Example 1 | FLAT | Theory of computation
15:18
Top Data Structures Interview Questions | Introduction to Data Structures | Interview Preparation
24:30
LR(0) Parser | LR(0) Parsing Table | Input String Parsing | Check Whether Grammar is LR(0) or Not
18:25
Top Graph Interview Questions | Data Structures Interview & Placement Preparation
14:23
What is Parsing & Types of Parsers | Top-Down & Bottom-Up Parsers | Compiler Design
08:44
Leading & Trailing in Operator Precedence Parsing | Compiler Design | Explained with Examples
14:38
Operator Precedence Parser in Compiler Design`
21:59
Top Trees Interview Questions | Data Structures Interview & Placement Preparation
10:05
Shift-Reduce Parser in Compiler Design with Example | Bottom-Up Parsing | SR Parser
07:42
Genetic Algorithm in Artificial Intelligence | Machine Learning &Soft Computing |Flowchart Explained
07:22
Lexical Analysis in Compiler Design | Roles, Functions & Counting Tokens with Examples
10:24
Recursive Descent Parser in Compiler Design | Top-Down Parsing | Parse Tree with Example
04:44
Greedy Best-First Search Solved Example | Informed Search & Heuristics | Artificial Intelligence
08:30
Master-Slave JK Flip-Flop | Circuit, Working & Waveforms | Race Around Condition|Digital Electronics
13:39
LALR(1) Parser in Compiler Design | Parsing Table | Check Whether Grammar is LALR(1) or Not
31:21
Top Queue Interview Questions in Data Structures | Placement Preparation | Queue Interview Questions
19:06
RBFS (Recursive Best First Search) Algorithm | Solved Example Step-by-Step | Artificial Intelligence
17:58
CLR(1) Parser in Compiler Design | CLR(1) Parsing Table | LR(1) Items | Bottom-Up Parser
17:08
SLR(1) Parser in Compiler Design | SLR(1) Parsing Table | LR(0) Items | Bottom-Up Parser
35:31
Top Data Structures Interview Questions on Stacks | Placement Preparation |Stack Interview Questions
25:28
LR(0) Parser | LR(0) Parsing Table | Parsing Input String | Step-by-Step | Compiler Design
11:31
Priority Queue in Data Structures | Types, Operations & Implementation | Max Heap & Min Heap
05:41
How to Check Whether a Grammar is LL(1) or Not | LL(1) Grammar | Compiler Design
20:26
Top Data Structures Interview Questions & Answers | Placement Preparation | Part 3: Linked List
15:20
LL(1) Parser in Compiler Design | Predictive Parser | Non-Recursive Parsing | Example 2
22:38
LL(1) Parser in Compiler Design | Predictive Parser | Non-Recursive Parsing | Example 1
10:05
Heap Tree Explained | Max Heap & Min Heap | Insertion, Deletion & Time Complexity | Data Structures
03:31
Elimination of Left Factoring in CFG | TOC | FLAT | Compiler Design
06:15
Elimination of Left Recursion in CFG | TOC | FLAT | CD | Compiler Design
23:23
Top Data Structures Interview Questions & Answers | Placement Preparation|Part 1: Algorithm Analysis