![MUEngineer](/img/default-banner.jpg)
- 52
- 153 010
MUEngineer
เข้าร่วมเมื่อ 16 ก.ย. 2013
Notes and Videos about various engineering subjects
Conversion of moore to melay | melay to moore conversion
Conversion of moore to melay | melay to moore conversion
มุมมอง: 26
วีดีโอ
Construction of moore and melay machine
มุมมอง 22หลายเดือนก่อน
Construction of moore and melay machine
Construct LLG - Regular Grammar - RG - Left Linear Grammar
มุมมอง 6K2 ปีที่แล้ว
Construct LLG - Regular Grammar - RG - Left Linear Grammar
Construct CFG - CFL to CFG - Context Free Grammar
มุมมอง 3K2 ปีที่แล้ว
Construct CFG - CFL to CFG - Context Free Grammar
CFG -string derivation- LMD- RMD- Derivation tree
มุมมอง 6562 ปีที่แล้ว
CFG -string derivation- LMD- RMD- Derivation tree
Regular grammar- RLG - String derivation
มุมมอง 4682 ปีที่แล้ว
Regular grammar- RLG - String derivation
Josephus problem using a circular linked list
มุมมอง 12K2 ปีที่แล้ว
Josephus problem using a circular linked list
BFS DFS implementation | C program to display graph using BFS and DFS
มุมมอง 37K2 ปีที่แล้ว
BFS DFS implementation | C program to display graph using BFS and DFS
BFS and DFS Algorithm | Graph Traversal Algorithms | Breadth First Search | Depth First Search
มุมมอง 7682 ปีที่แล้ว
BFS and DFS Algorithm | Graph Traversal Algorithms | Breadth First Search | Depth First Search
Graph data structure | Types of graph | graph representation | applications | adjacency matrix list
มุมมอง 3002 ปีที่แล้ว
Graph data structure | Types of graph | graph representation | applications | adjacency matrix list
AVL Tree implementation using C | AVL Tree Code | rotations in AVL Tree | LL RR LR RL rotation
มุมมอง 11K2 ปีที่แล้ว
AVL Tree implementation using C | AVL Tree Code | rotations in AVL Tree | LL RR LR RL rotation
B Tree | B+ Tree | M-way search Tree | Multiway search tree
มุมมอง 3912 ปีที่แล้ว
B Tree | B Tree | M-way search Tree | Multiway search tree
AVL Tree Introduction and Operations | insert in AVL | rotations in AVL Tree | LL RR LR RL rotation
มุมมอง 3672 ปีที่แล้ว
AVL Tree Introduction and Operations | insert in AVL | rotations in AVL Tree | LL RR LR RL rotation
Binary Search Tree Part 2 of 2 | BST | Implementation in C | Insertion | Deletion | code explained
มุมมอง 4252 ปีที่แล้ว
Binary Search Tree Part 2 of 2 | BST | Implementation in C | Insertion | Deletion | code explained
Binary Search Tree Part 1of 2 | BST | Implementation in C | Insertion | Deletion | code explained
มุมมอง 6812 ปีที่แล้ว
Binary Search Tree Part 1of 2 | BST | Implementation in C | Insertion | Deletion | code explained
Binary Tree Traversal | Inorder | Preorder | Postorder | Tree traversal techniques in Data Structure
มุมมอง 3202 ปีที่แล้ว
Binary Tree Traversal | Inorder | Preorder | Postorder | Tree traversal techniques in Data Structure
Queue using linked list | representation of queue| queue in c program | enqueue | dequeue
มุมมอง 4282 ปีที่แล้ว
Queue using linked list | representation of queue| queue in c program | enqueue | dequeue
Stack using linked list | linked list representation of stack | c program | stack in c program
มุมมอง 3502 ปีที่แล้ว
Stack using linked list | linked list representation of stack | c program | stack in c program
Queue using array | representation of queue | c program | queue in c program | implementation
มุมมอง 2762 ปีที่แล้ว
Queue using array | representation of queue | c program | queue in c program | implementation
Queue Introduction, operations and types | enqueue | dequeue | circular | deque | priority queue
มุมมอง 1892 ปีที่แล้ว
Queue Introduction, operations and types | enqueue | dequeue | circular | deque | priority queue
Linked list program using C - part 3 of 3 | delete a node | linked list code in C | implementation
มุมมอง 2082 ปีที่แล้ว
Linked list program using C - part 3 of 3 | delete a node | linked list code in C | implementation
Linked list program using C - part 2 of 3 | insert a node | linked list code in C | implementation
มุมมอง 2892 ปีที่แล้ว
Linked list program using C - part 2 of 3 | insert a node | linked list code in C | implementation
good explanation
last transition is not push its skip
Very helpful . Thanks for the wonderful explanation .
In a print Statement if we Want to print A number then What is the changes instead of start+65 .
19:02 f** top
Thankyou for presenting a very good content in a very good way. Truly appreciated. Thankyou from Pakistan
you explained the DFS code incorrectly just in order to increase your views and make money how much selfish you are shame on you
DFS code is also correct, because there can be multiple dfs output
legit the best one to explain finite automata and computation. easiest and the simple but descriptive way of teaching
Best ❤ Explanation ever🎉🎉
💯
this was so helpful!!
i think meanvalue function is not right
nice explanation in bfs or dfs 😋
thank you
You're the best. Please add more videos ❤
Thank You Mam🙏
THANK YOU SO MUCH MAMM
THANK YOU SO MUCH FOR THE EXPLANATION !!
A bit confused, for your example at 11:41 wouldn't the tree have been unbalanced even before adding D to B's right subtree
thank you so much mam! your explanation is crystal clear.
thank you ! you have done a great job explaining in simple terms. it has helped me a lot. thank you so much mam
For WcW Would it accept on Empty string c Empty string?
Where we can get this source code mam
Divisible by 4 or 6 has my whole heart 😭 What an amazing trick to remember❤ Thank you so much ma'am🙏
In dfs lack of backtracking
Incredible. Thanks you
Mam really great 🎉😢😢😢
We can use production rule like this B->bbbC
Thank you so much😊
🙏🏻
Please make a video for a Moore machine for binary subtractor
nice explanation
thankypu nice work
Very helpful thank you
Beautiful code with subroutines.....very nice!
Thanks mam for helping
Unable to run this code it's giving error
Thanks 👍
👏👌👌👌👌👌
Mam this video is very beneficial for me many thanks 😊😊😊 for such good notes and very helpful ❤
amazing explanation!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
Thank you.
Greet explanation
Nice explanation mam
Complete ur playlist mam
You should have implemented adjacency lists method also as you explained earlier
That was an awesome explanation from the point of implementation by adjacency lists. Couldn't find anything like this. Gr8
Thanks for teaching so well. All my concepts are clear now. Please teach at my college IIITD.
Thank you for the explanation. Really helpful.