- Видео 181
- Просмотров 109 812
FISTS Academy
Индия
Добавлен 5 фев 2023
Failure Is Step To Success - FISTS Academy is a holistic platform for Computer Science or Information Technology crew who is interested to study subjects like Computer Networks, Operating Systems, Database Management Systems, Algorithm Design, Theory of Automata and many more, in order to achieve a successful career ahead.
Along with above mentioned curriculum based subjects, we also help students prepare for IT industry by teaching subjects like Data Structures, Algorithms, C++, Java from industry stand point.
Our vision is to take every failure as a step towards success and keeping that in mind we welcome all the students to our channel, who wish to achieve milestones in their career. Stay tuned for upcoming videos, lectures and tech discussions.
To contact us:
Call us on 09953653027
Mail us at: fistsacademy@gmail.com
Along with above mentioned curriculum based subjects, we also help students prepare for IT industry by teaching subjects like Data Structures, Algorithms, C++, Java from industry stand point.
Our vision is to take every failure as a step towards success and keeping that in mind we welcome all the students to our channel, who wish to achieve milestones in their career. Stay tuned for upcoming videos, lectures and tech discussions.
To contact us:
Call us on 09953653027
Mail us at: fistsacademy@gmail.com
Lec 38 | Dynamic Programming | Algorithm Design Techniques | @fistsAcademy
This video will cover Dynamic Programming which is an important Algorithm Design technique along with the explanation of its major application i.e., Fibonacci Series.
Просмотров: 194
Видео
Lec 37 | Knapsack Problem | Greedy Methods | Algorithm Design Techniques | @fistsAcademy
Просмотров 1978 месяцев назад
This video will cover Knapsack problem which is an important problem which follow Greedy Methods. It will explain step by step algorithm for solving the problem along with time complexity for the same.
Lec 36 | Bellman-Ford Algorithm | Greedy Method | Algorithm Design Techniques | @fistsAcademy
Просмотров 2288 месяцев назад
This video will give an overview about Bellman-Ford algorithm which is an example of Greedy methods in Algorithm Design techniques. It will explain the complete process with example graphs along with time complexity of this algorithm as well.
Lec 35 | Greedy Method | Algorithm Design Techniques | @fistsAcademy
Просмотров 1428 месяцев назад
This video will explain about one of the Algorithm Design Techniques i.e., Greedy Method. It will also explain Optimisation problems and various applications of Greedy Approach.
Lec 34 | DIJKSTRA Algorithm | Algorithm Analysis | @fistsAcademy
Просмотров 37110 месяцев назад
This video will give an overview of DIJKSTRA Algorithm with the help of example graph.
Lec 33 | PRIM'S Algorithm | Algorithm Analysis | @fistsAcademy
Просмотров 30610 месяцев назад
This video will give an overview of PRIM'S Algorithm with the help of example graph.
Ledc 32 | Strassen's Algorithm for Matrix Multiplication | Algorithm Analysis | @fistsAcademy
Просмотров 30310 месяцев назад
This video will cover two approaches for Matrix Multiplication which are Divide & Conquer Algorithm and Strassen's Algorithm along with the Time Complexity of each approach.
Lec 31 | Binomial Heap Extract Min Operation | Binomial Heap | Algorithm Analysis | @fistsAcademy
Просмотров 20710 месяцев назад
This video will given an overview about the process of extracting minimum element from a given Binomial Heap.
Lec 30 | Binomial Heap Insertion Operation | Binomial Heap | Algorithm Analysis | @fistsAcademy
Просмотров 26610 месяцев назад
This video will explain the process of inserting keys in a given Binomial Heap with the help of an example question.
Lec 29 | Union of Two Binomial Heaps | Binomial Heap | Algorithm Analysis | @fistsAcademy
Просмотров 40410 месяцев назад
This video will give an overview of the union process of two Binomial Heaps with the help of an example question. It will provide step by step detail of entire procedure.
Lec 28 | Binomial Tree and Heap | Binomial Heap | Algorithm Analysis | @fistsAcademy
Просмотров 30510 месяцев назад
This video will give an overview of Binomial Tree and Binomial Heaps along with the explanation of its properties.
Lec 27 | Insertion in Red-Black Tree | Red Black Tree | Algorithm Analysis | @fistsAcademy
Просмотров 39710 месяцев назад
This video will give an overview of Insertion process of Red Black Tree in step by step fashion. It will explain the insertion of every key from given set with the help of an example Red-Black Tree.
Lec 26 | Height of Red-Black Tree | Algorithm Analysis | @fistsAcademy
Просмотров 30610 месяцев назад
This video will explain the proof of height of Red Black Tree.
Lec 25 | Red-Black Tree | Algorithm Analysis | @fistsAcademy
Просмотров 33110 месяцев назад
This video will give an overview of Red-Black Tree along with the explanation of its important properties.
Lec 24 | Minimum Keys in B-Tree | B Tree | Algorithm Analysis | @fistsAcademy
Просмотров 17210 месяцев назад
This video will give an overview of the process to figure out minimum keys in given B Tree.
Lec 23 | Maximum Keys in B-Tree | B Tree | Algorithm Analysis | @fistsAcademy
Просмотров 21810 месяцев назад
Lec 23 | Maximum Keys in B-Tree | B Tree | Algorithm Analysis | @fistsAcademy
Lec 22 | Deletion In B-Tree | B-Tree | Algorithm Analysis | @fistsAcademy
Просмотров 38110 месяцев назад
Lec 22 | Deletion In B-Tree | B-Tree | Algorithm Analysis | @fistsAcademy
Lec 21 | Insertion In B-Tree | B-Tree | Algorithm Analysis | @fistsAcademy
Просмотров 33910 месяцев назад
Lec 21 | Insertion In B-Tree | B-Tree | Algorithm Analysis | @fistsAcademy
Lec 19 | Counting Sort | Algorithm Analysis | @fistsAcademy
Просмотров 29410 месяцев назад
Lec 19 | Counting Sort | Algorithm Analysis | @fistsAcademy
Lec 20 | B Tree | Generalised BST | Algorithm Analysis | @fistsAcademy
Просмотров 31810 месяцев назад
Lec 20 | B Tree | Generalised BST | Algorithm Analysis | @fistsAcademy
Lec 18 | Height of Binary Heap | Binary Heap | Algorithm Analysis | @fistsAcademy
Просмотров 17710 месяцев назад
Lec 18 | Height of Binary Heap | Binary Heap | Algorithm Analysis | @fistsAcademy
Lec 17 | Heap Sort Algorithm | Binary Heap | Algorithm Analysis | @fistsAcademy
Просмотров 33010 месяцев назад
Lec 17 | Heap Sort Algorithm | Binary Heap | Algorithm Analysis | @fistsAcademy
Lec 16 | Build Heap and Heapify Procedure | Binary Heap | Algorithm Analysis | @fistsAcademy
Просмотров 33010 месяцев назад
Lec 16 | Build Heap and Heapify Procedure | Binary Heap | Algorithm Analysis | @fistsAcademy
Lec 15 | Binary Heap | Algorithm Analysis | @fistsAcademy
Просмотров 28510 месяцев назад
Lec 15 | Binary Heap | Algorithm Analysis | @fistsAcademy
Lec 14 | Time Complexities of Quick Sort Algorithm | Algorithm Analysis | @fistsAcademy
Просмотров 20111 месяцев назад
Lec 14 | Time Complexities of Quick Sort Algorithm | Algorithm Analysis | @fistsAcademy
Lec 13 | Quick Sort Algorithm | Algorithm Analysis | @fistsAcademy
Просмотров 30411 месяцев назад
Lec 13 | Quick Sort Algorithm | Algorithm Analysis | @fistsAcademy
Lec 12 | Master Method |Subtract & Conquer Recurrences |Algorithm Analysis |Algorithms @fistsAcademy
Просмотров 22411 месяцев назад
Lec 12 | Master Method |Subtract & Conquer Recurrences |Algorithm Analysis |Algorithms @fistsAcademy
Lec 11 | Master Method |Divide & Conquer Recurrences |Algorithm Analysis |Recurrence @fistsAcademy
Просмотров 24311 месяцев назад
Lec 11 | Master Method |Divide & Conquer Recurrences |Algorithm Analysis |Recurrence @fistsAcademy
Lec 10 | Recursion Tree Ex |Recurrence Relation method|Algorithm Analysis |Algorithms @fistsAcademy
Просмотров 21411 месяцев назад
Lec 10 | Recursion Tree Ex |Recurrence Relation method|Algorithm Analysis |Algorithms @fistsAcademy
Lec 9 |Recursion Tree Method |Recurrence Relations |Algorithm Analysis |ADA |Algorithm @fistsAcademy
Просмотров 25511 месяцев назад
Lec 9 |Recursion Tree Method |Recurrence Relations |Algorithm Analysis |ADA |Algorithm @fistsAcademy
Sir complete the playlist
Thank you so much sir ❤❤
So nice of you
Ur teaching just amazing sir❤
Keep watching
Thank you sir
excellent explanation
Glad you liked it!
Keep it up sir❤
awsm sir
very nice explanation
Thanks for liking
best teacher of tafl on youtube
sir, you are superb 😇...
Thank you so much 😀
sir 2nd question mai agar 2 baar a ko push krke dekhe tb toh pda se solve kr skte hai?
Not possible...by pushing a two times you can assure the sum of b and c equal to a but the equalization of b and c can not be assured
clear explanation 👏
Sir, I'm an AKTU student can I watch this playlist for my semester exams?
Yes
Very good explanation but why people not watch support please 😊
nice
Sir initial state q0 pr self Loop nhi lga skte kya first question m ?
No.
@@fistsAcademy sir why ?
very nice explain tafl
Thanks for liking
👌👌👌
very nice sir explain
Nice explanation
Thanks for liking
is it enough for semester?
Yes
Great Explanation.. Thanks Sir
You are welcome
is it necessary to remove common state ? can i solve without reducing the states.
best
the underrated one keep this consistent sir i wish you get what you deserve ❤❤
thanku sir
sir pumping lemma for cfl p lecture bnao
Sir , DFA ak question k alg alg ho skte h kya ?
Such a quality content loving to watch your videos and actually having so much of interest .....keep uploading such edu videos Thank you sir ❤️❤️
Thank you so much 😀
Awesome sir.. Watching from NIT SRINAGAR
So nice of you
Great explanation sir, Just mind blowing, I had so much trouble learning this but watching your simple and easy explanation helps me ease this topic! Thank you sir.
Glad to hear that
Sir your explanation is very good and understandable. Keep making lectures like this. ~Your 351th subscriber
Thanks
Great
sir , example mein DFA ke Q tuple mein {AB} na hoke {A,B} nahi hoga?
Great content 💯
Great video sir 💯
Great...It helped me alot💯
csit 4th sem hola pakkai🤣
Easily explained 😇
It's was very difficult for me thanks for the easy explanation 🙏🏻🙏🏻
Thanks sir 🙏🏻
Clear explanation 🔥
Sir your videos helped a lot in PUT. THANK YOU 🙏🏻 Wishing you luck.
acha bhai
@@narayanmishra9153 Haan bhai
Thanks sir your way of teaching is very interesting😊 Maine Kai sari videos skip ki lekin aapki video per Aakar ruk gaya😅
Excellent sir 👍
Thank you Sir, Your explanation is superb....👍
The number of Internal nodes for a subtree rooted at X is [(2 raise to the power bh(X)) - 1] and not [twice of bh(X) - 1], it has been mentioned as latter one by mistake at few places in this video. Please don't get confuse.
best explanation!!!!!!!!.
Great explanation!
Thank you so much.
No worries!
Sir please upload next lectures