- 58
- 923 788
Ritesh Chauhan
India
เข้าร่วมเมื่อ 16 พ.ค. 2020
Quick Sort Algorithm | Quick Sort Solved Example | Data Structure
Quick Sort Solved Example Asked in Exam
มุมมอง: 55
วีดีโอ
Prim's Algorithm for Minimum Spanning Tree | Solved Examples | Data Structures
มุมมอง 26510 หลายเดือนก่อน
Minimum Cost Spanning Tree Prim’s Algorithm (Greedy approach) find the minimum spanning tree of the following graph using prim's method GTU exam solved example
AVL TREE | How to Create AVL tree | Rotation in AVL | Solved Example | Data Structure
มุมมอง 1K10 หลายเดือนก่อน
AVL TREE - Rotations in AVL tree Explain rotation rules for AVL tree Construct AVL tree for following sequences: (i) 1, 2, 3, 4, 8, 7, 6, 5, 11, 10, 12 (ii) 10, 20, 30, 40, 50, 60, 70, 80 #gtu example solved at 21:55 its 1 at node 20 instead of -1 LAPS: 0:00 INTRODUCTION 06:52 Rotations in AVL tree 29:50 Construct AVL tree for 1, 2, 3, 4, 8, 7, 6, 5, 11, 10, 12 44:54 Construct AVL tree for 10, ...
Construct Binary Search Tree(BST) | Delete node/element from (BST) with Example | Data Structure
มุมมอง 23410 หลายเดือนก่อน
Data Structure. Construct binary search tree. Construct binary search tree for the following data and find it's Inorder, Preorder, and Postorder Traversal for following data. 10, 3, 15, 22, 6, 45, 65, 23, 78, 34, 5 Try: 38, 13, 51, 10, 12, 40, 84, 25, 89, 37, 66, 95 Try: 14,10,17,12,10,11,20,12,18,25,20,8,21,11,23 Delete node from Binary Search Tree. Delete element from Binary Search Tree. Dele...
Construct Binary Tree from PREORDER / POSTORDER and INORDER Traversal | DATA STRUCTURE | GTU SOLVED
มุมมอง 49811 หลายเดือนก่อน
Construct Binary Tree from Preorder / POSTORDER and INORDER Traversal | DATA STRUCTURE | GTU SOLVED EXAMPLES Given Inorder and Preorder traversal, find Postorder traversal. Inorder:Y B K C F A G X E D H Z Preorder:G B Y A C K F X D E Z H Construct a binary tree having the following traversal sequences: Preorder traversal: A B C D E F G H I Inorder traversal: B C A E D G H F I Construct a Binary...
Preorder, Inorder and Postorder Short Cut Method Solve in 5 Minute| Tree Traversal | Data Stucture
มุมมอง 35111 หลายเดือนก่อน
Tree Traversal There are three ways of traversing a binary tree. 1. Preorder Traversal 2. Inorder Traversal 3. Postorder Traversal Gtu solved Example with Short Cut Method Solve in 5 Minutes
STACK AND QUEUE GTU(EXAM) ASKED NUMERICAL #DATASTRUCTURE
มุมมอง 25811 หลายเดือนก่อน
LAPS: 0:00 INTRODUCTION 10:23 Convert Infix Expression into Postfix expression using stack 33:37 Evaluation of postfix expression 46:55 Example of Queue Insert and Delete 53:19 Example of Circular Queue Insert and Delete 59:26 Outro GTU IMPORTANT NUMERICALS FROM STACK AND QUEUE Convert Infix Expression: A (B*C D) into Postfix expression using stack. Convert the following Infix Expression into P...
Dijkstra Algorithm (Single Source Shortest Path)
มุมมอง 670ปีที่แล้ว
Dijkstra Algorithm (Single Source Shortest Path) example
UNIT-5 Functions | Function in c | Recursive function
มุมมอง 12K3 ปีที่แล้ว
What is user defined function? Explain with example. Define the syntax of function in C. Different categories of functions. Actual argument and formal argument with example Call by value (pass by value) and call by reference (pass by reference) Recursive function
Python for Data Science UNIT 1: Overview of Python and Data Structures (Part-1)
มุมมอง 1.6K3 ปีที่แล้ว
Introduction to Python Why Python? Installing Python Data types in Python Variables in Python User input Comment
PPS: UNIT-4 Array & String
มุมมอง 23K3 ปีที่แล้ว
What is an array? Advantages of an Array Types of an Array Initialization of one dimensional and two-dimensional array String String In-built Functions
AI Unit:5 Representing Knowledge Using Rules
มุมมอง 15K3 ปีที่แล้ว
AI Unit:5 Representing Knowledge Using Rules
AI Unit:10 ITERATIVE DEEPENING DFS (IDDFS)
มุมมอง 12K3 ปีที่แล้ว
AI Unit:10 ITERATIVE DEEPENING DFS (IDDFS)
AI Unit:10 MIN-MAX SEARCH AND ALPHA-BETA CUT-OFF
มุมมอง 3.1K3 ปีที่แล้ว
AI Unit:10 MIN-MAX SEARCH AND ALPHA-BETA CUT-OFF
AI Unit:14 Introduction to Prolog (Part-4)
มุมมอง 14K3 ปีที่แล้ว
AI Unit:14 Introduction to Prolog (Part-4)
AI Unit:14 Introduction to Prolog (Part-3)
มุมมอง 7K3 ปีที่แล้ว
AI Unit:14 Introduction to Prolog (Part-3)
AI Unit:14 Introduction to Prolog (Part-2)
มุมมอง 9K3 ปีที่แล้ว
AI Unit:14 Introduction to Prolog (Part-2)
AI Unit:14 Introduction to Prolog (Part-1)
มุมมอง 48K3 ปีที่แล้ว
AI Unit:14 Introduction to Prolog (Part-1)
TOC: Unit 3 Context Free Grammar (CFG) (Part-3)
มุมมอง 1.4K3 ปีที่แล้ว
TOC: Unit 3 Context Free Grammar (CFG) (Part-3)
TOC: Unit 3 Context Free Grammar (CFG) (Part-2)
มุมมอง 2.2K3 ปีที่แล้ว
TOC: Unit 3 Context Free Grammar (CFG) (Part-2)
TOC: Unit 3 Context Free Grammar (CFG) (Part-1)
มุมมอง 6K3 ปีที่แล้ว
TOC: Unit 3 Context Free Grammar (CFG) (Part-1)
PPS: UNIT-3 Control Structure in C (PART -3)
มุมมอง 11K3 ปีที่แล้ว
PPS: UNIT-3 Control Structure in C (PART -3)
PPS: UNIT-3 Control Structure in C (PART -2)
มุมมอง 10K3 ปีที่แล้ว
PPS: UNIT-3 Control Structure in C (PART -2)
PPS: UNIT-3 Control Structure in C (PART -1)
มุมมอง 46K3 ปีที่แล้ว
PPS: UNIT-3 Control Structure in C (PART -1)
PPS: UNIT-2 Fundamentals of C (PART -2)
มุมมอง 25K3 ปีที่แล้ว
PPS: UNIT-2 Fundamentals of C (PART -2)
PPS: UNIT-2 Fundamentals of C (PART -1 ) | Structure of C Program, Header files, Data types in C
มุมมอง 38K3 ปีที่แล้ว
PPS: UNIT-2 Fundamentals of C (PART -1 ) | Structure of C Program, Header files, Data types in C
Thank you sir
Best explanation - Still Relevant, Still helpful even in job.🫡🫡
jordar sir
Thank you 🙏🙏🙏👅👅👅
Great explanation sir
solid explanation sir 👏👏
Excellent lecture! Just wanted to add that Forward chaining is Data-driven and Backward Chaining is goal driven.
Sir notes mil sakta hai kya please
how many states will be there in total for a(b | c)*a*c following your method i got 15 states in total but chat gpt says it will be 16 because you have to add an epsilon transition from end state of a* to start state of c. but in your example (a|b)*abb you have not added any epsilon transition after (a|b)* to a please clarify
13 states are produced according to thomsan method
bhai bahout easy way me samjaya hai aapne.......thank you so much bhai❤❤🔥❤🔥❤🔥
Thank you very much sir!
Sir , how to get this PDF 😅
very nice sir. may i get these ppts for reference?
Very Helpful
Sir write a c program to find factorial of a given number in this question's answer we write this question' answer program that write a c program to find factorial of a given number using recursion so we will get full marks?
Yes you can write...
Finally somebody explained thomson rule .
Great explanation sir❤🙏
kfueit se prhne k bad yahn ana farz hai ap per ,, compiler itna mushkil nhi jinta hmy btaya gya tha ,,
nice explanation ❤
please provide the pdf as well of this
why is there a null in some of the expressions ?
For (a | b)*a(a | b) does I have to draw ( a | b) two times or only one time while concetenation
Have to draw 2 Times
Thanks... Nobody not posted this unit..
what will be the answer of leftrecursion 3rd question
S--> A | B A--> aA' | aaA' A' --> BCA' | cdA' | € B--> bB' B' --> eeB' | €
Please sir give me a pdf all pps lecture 🙏
great explanation
Thank you so much, unable to find any clear video in compiler designer for this topic. This one is one of the best!
Thank you so much 🎉
❤
Notes pdf ??
Y=b+c-d+20
wow keep uploading you are a gem teacher
❤❤❤
Thank you May God bless you sir
Thank you May God bless you sir
Thanks sir
Now perfectly understand sir... Thank you😊
what happened in this a=(b+c)*(b+c)*2 please help
Send your email id
very helpful... thank you
Great lecture Appreciate for your efforts sir ❤
Sir please upload video on turing machine
Thank you sir
Thank you sir . Explaination was really good Can you provide me solution for while loop.
thnkuhh so muuch sirr this is much needed😭🫀
Thankyou sir..
👍👍👍
sir on 22:36 what if the string given like id + id * id * id ? then how can I do it ?
id+id*id*id E+T*F*F <+ <*> * reduce T-->T*F <+ <*> reduce T-->T*F, <+>. Reduce E--> E+T
Still one of the best out there…..
postfix 3452**+ answer tell am i correct or not
Correct answer is 34*52*+ Watch that example again
the answer of the homwork quesiton is 34*52*+