- Видео 12
- Просмотров 120 735
Data Structures & Algorithms
Добавлен 6 ноя 2011
LATHA JOTHI V
Видео
Converting infix Expression to Postfix Expression
Просмотров 3014 года назад
Converting infix Expression to Postfix using Stack
Backtracking
Просмотров 3584 года назад
This video explains backtracking technique and some problems that can be solved by backtracking technique
Optimal Binary Search Trees
Просмотров 91 тыс.4 года назад
To find an Optimal Binary Search Trees using Dynamic Programming Approach
Memory Functions
Просмотров 5 тыс.4 года назад
To solve a 0/1 Knapsack Problem using bottom-up Dynamic Programming approach
Finding the Binomial Coefficient using Dynamic Programming
Просмотров 4 тыс.4 года назад
Warshall Algorithm
Просмотров 11 тыс.4 года назад
Finding the transitive closure of a given graph using Warshall Algorithm
Implementation of Stack using Linked List
Просмотров 1304 года назад
The video describes how to push an item into the stack and how to pop an element from the stack in the linked list implementation of stack
Insertion into a Linked List
Просмотров 1804 года назад
The video describes how to insert an element into a list. An element can be inserted in the front / middle / end of the list. The pointer rearrangements to be done are explained in the video
Your explanation was good, thanks. However, it would help if you slowed down a bit. Oterhwise, it's difficult to listen at such fast pace.
Sure. I will take your suggestion in the next video. Thank you
Very bad teaching techniques
I'm sorry if my video didn't meet your expectations. I value your feedback and would love to improve. Could you please share what type of techniques you feel more comfortable with? Your input is really important to me
Convert the following infix expression to post fix notation ((a+2)*(b+4)) -1 mam wat to do for this question
Check out this new video ruclips.net/video/qTDBq3yzGZE/видео.html
Thank you teacher
Not understandable 😕
Message me at which point you are getting the doubt. I will try to clear
I usually watch Abdul Bari for algorithms lectures but for the OBST, your explanation is the best on RUclips to be honest. Straight forward, clear, concise, from Canada ❤❤❤❤
Thank you for your encouraging words
Very precise and good explanation
Glad it was helpful!
Really good and clear instruction
Thank you
Very helpful ma'am Thank you very much🙏🙏
Evet Vildan hocanın selamı var!🙋🏼♂ - END3991
Nice😊😊
Straight to the point. Thank you for the video.
Thank you so much maam..So useful for my DAA exam🙏
Thanks mam❤
trop génial, j'ai kiffé, recommande grandement, vive la baguette et vive la france
Thankyou Mam for this wonderful explanation 🙏❤️
If access time is asking in this question what is the answer
bhai geela kar diya tune ......aisa paa kar
Sharp and crisp .super.
Best explanation ever. Very concise. Thank you, my online teacher
Thank you my student
thinks .please put the ppt or pdf
Sure, post your mail ID here, I will send it to your mail
Thanks so much your video is super understable !!
👍👍
Tq so much mam 😙
Why are you going so fast. It just seems like you wanna hurry up and be done with it
Not me watching it in 2x 😂
Skill issue, get good
At 2:46 it should be i<n-1
As a begginer you made me waste 2h because I didn't understand i>n-1 at 2:46. It was supposed to be i<n-1. Be careful with mistakes like this
Thank You @PaulaX blank. I am sorry I overlooked it.
fantastic explanation
The textbook, "Introduction to Algorithms", tries to confuse me in this part by putting dummy variables but not showing the final BST. Thank you for your explanation!
👍🙏
You are getting pause by seeing data yourself...bad experience
explained perfectly thank u mam
Thank you so much tomorrow is my Exam and I'm glad I found your explanation 🤓
:) vtu
@@nithinreddy2944 😅
👍 All the best for your exams
@@datastructuresalgorithms4340 how did u find the average comparison value
@@sejalr.8692Top right corner value in the first table i.e. 1.7 is average number of comparisons needed. Also probability of occurrence of "A' is 0.1 as given in the problem and number of comparisons needed to identify "A' is 3. So average number of comparisons to identify A'is 0.1*3=0.3 Similarly for B it's 2*0.2=0.4, for D it's 2*0.3=0.6 and for'C' it's 1*0.4. Total comparisons =0.3+0.4+ 0.6+0.4=1.7
Thankuu
Super explaination
ur teaching way is exceptionally well mam NYC to watch this video
clear cut explanation
thanks madam. its really useful.
🙏🙏👍
The only great explanation for OBST concept!
Thank you
Mam, you explain excellently 🥰✨ thank you so much for the wonderful explanation 😘
My pleasure
thanks mam its really help full video for my exam tomorrow
Glad it was helpful. All the best for your exams
Madam very very super and it's very surprise for me
taught really well. Looking forward for more videos!!
Tqsm.....i understood the concept very clearly
Thank you
Perform Transitive Closure with 2 lines of code. shortest code ever ⚡️🌏🛰💯 🔗 rb.gy/6l9vlq 🧐Quora discussion 🔗 rb.gy/kusyif 💎Floyd Warshal's Algorithm is an example of dynamic programming and was published in its currently recognized form by Robert Floyd in 1962. It comprises 3 nested for loops used to find all pair shortest path problems, used to construct transitive closures. 💎Amazingly, TML (Tau Meta Language) can also do the same with only 2 lines of code. tc(?x ?y):-e(?x ?y). tc(?x ?y):-tc(?x ?z), e(?z ?y). 🧀Test it. 🔗 tml.idni.org regression tests/intro/09_TRANSITIVE_CLOSURE.tml 😼Published codes 🔗 github.com/IDNI/TML 🌐Website of tml 🔗 tau.net/ 📄Abstract: Draft for Community Review 🔗lnkd.in/gWJZj9sN 👨🏫Tutorial Videos of TML 🔗rb.gy/9ahenx
Very clear explanation.
Thank you....
Thankyou mam! ,Nice one
super mam
Thank you
Nice mam
Thank you
Thank you for this video!
Thank you for your encouragement and support