- Видео 68
- Просмотров 118 520
Arup Baruah
Индия
Добавлен 8 окт 2012
Logical Equivalence, Deduction Theorem, Proof by Refutation, and Inference Rules
Logical Equivalence, Deduction Theorem, Proof by Refutation, and Inference Rules, Valid Sentence, Satisfiable, Tautologies, Inference Rules, Modus Ponen, And-Elimination, Biconditional Elimination, Contraposition, Implication elimination
Просмотров: 1 308
Видео
Master Slave D Flip-Flop
Просмотров 10 тыс.3 года назад
Master Slave D Flip-Flop built using two D latches, Explanation using a timing diagram, Difference between flip-flops and latches, level sensitive, edge sensitive, positive edge, negative edge, positive edge triggered flip-flop, negative edge triggered flip-flop
Logisim: Implementation of Basic SR Latch, Gated SR Latch, and D Latch
Просмотров 2 тыс.3 года назад
Logisim implementation of basic SR latch using NOR gates, basic SR latch using NAND gates, gated SR latch using NOR gates, gated SR latch using NAND gates, and D latch.
Inference in Propositional Logic
Просмотров 2,2 тыс.3 года назад
Propositional logic, Inference, Model Checking, Knowledge base, entailment, Enumerate all models, Recursive algorithm
Latches
Просмотров 2273 года назад
Basic SR latch using NOR gates, Basic SR latch using NAND gates, Gated SR latch using NOR gates, Gated SR latch using NAND gates, D latch, Oscillation
Optimality of A* Search
Просмотров 3,1 тыс.3 года назад
A* Search, Admissible heuristic, Consistent heuristic, Optimal, Complete, Optimally efficient, F(n) value along any path is non-decreasing, If a node is selected for expansion the optimal path to it has been reached, A* selects node in non-decreasing order of f(n), All nodes having f(n) value less than optimal cost are selected
BCD to Seven Segment Display Decoder
Просмотров 2,7 тыс.3 года назад
BCD to Seven Segment Display Decoder, Don't care conditions, Incompletely Specified Function, BCD to Seven Segment Display Decoder implementation in Logisim, Minimization with Don't Care Conditions
Minimization Using Karnaugh Maps (Four Variable Boolean Functions)
Просмотров 2273 года назад
Minimization of 4 variable Boolean Functions using Karnaugh maps, Sum of Product expression
Admissible and Consistent Heuristics
Просмотров 11 тыс.3 года назад
Heuristic functions, Admissible Heuristics, Consistent Heuristics, Straight Line Distance, Number of misplaced tiles, Manhattan Distance
Karnaugh Maps (Three Variables)
Просмотров 1903 года назад
Three variables Karnaugh Maps, Sum of Product expression, Minimization using Karnaugh maps
8-Puzzle Problem - Heuristic Functions
Просмотров 19 тыс.3 года назад
8-Puzzle Problem, 15-Puzzle Problem, Heuristic functions, Misplaced Tiles, Manhattan Distance
A* Search
Просмотров 1,2 тыс.3 года назад
Informed search, A* Search, Heuristic function, Evaluation function, f(n) = g(n) h(n)
Karnaugh Maps (2 Variables)
Просмотров 2013 года назад
Minimization using Karnaugh maps, 2-variable Karnaugh maps
Prolog - Detecting if path exists between two nodes in a Graph
Просмотров 4,5 тыс.3 года назад
How to represent graphs in Prolog, Does path exist between StartNode and EndNode, Nodes reachable from a given StartNode, Depth First Search, Infinite Loops in Depth First Search, Stack overflow
Uninformed Search - Bidirectional Search
Просмотров 9 тыс.4 года назад
Uninformed search, Bidirectional search, Forward Search, Backward search
Depth First Search - Performance Evaluation
Просмотров 9304 года назад
Depth First Search - Performance Evaluation
Uninformed Search - Depth First Search
Просмотров 1,1 тыс.4 года назад
Uninformed Search - Depth First Search
Breadth First Search - Performance Evaluation
Просмотров 9304 года назад
Breadth First Search - Performance Evaluation
How Prolog Answers Questions - Part 02
Просмотров 4354 года назад
How Prolog Answers Questions - Part 02
Problem Solving Using Search - Tree Search, Graph Search
Просмотров 4,6 тыс.4 года назад
Problem Solving Using Search - Tree Search, Graph Search
How Prolog Answers Questions - Part 01
Просмотров 1 тыс.4 года назад
How Prolog Answers Questions - Part 01
Really helpful video
Really helpful video. Thankyou sir
Thank you :)
Thank you
Really helpful video. Thankyou
Nicely Explained even better than that Neso Academy Video
Helal olsun
This is not very clear to me. It would have been nice if you drew the gltich you are attempting to explain.
best mic sir
Thank you
Thanks🎉😊
Great explanation thank you But for better videos try to keep your mouth away from the microphone I can hear you breathing
This is great, thanks a ton for this!
saved me in exam!!!!!!!!!!!!!!!
Horrible sound
বহুতেই ধুনীয়া ভিডিঅ'বোৰ বনাইছে
if KB is false, why do we return true?
Thank you very much sir , i was confused on this topic for a very long time .
very useful thanks sir
great please upload other chapter also
❤️
why cant we go to node c from a ? Is it because of the depth first search?
In 3:16, isn't the last sentence supposed to be there is a breeze in square [2,1]?
I have also noticed that the "NOT" sign has been missed in R5 :
11:15
What is that?
Thanks for your explanation.
thank you very much sir, for creating this video for us to resolve the conceptual problem of linker , loader and many more. according to my opinion it is best conceptual video to clear all doubt about linker, loader in the hole RUclips.
jet
jed
Amazing
Mann! You and your presentations are top notch 🥇
Good one, thumbs up
exactly what i needed! thanku 🙏🙏
Thanks sir.
Very neat way of explanation ....
Thank you
Unweighted BFS is guaranteed to find shortest path at each level. Therefore it is NOT necessary to store previous nodes in memory. At each level just replace the previous queue with next queue.
Thank you!
Wonderful explanation, Thanks !!!
Thanks!
Great explanation thank you!
Great video, thank you!
It's really helpful
That was very useful, thanks. Your video about backtracking is good too. Very interesting! I'm just starting to learn about ProLog and your explanation was clear and detailed.
Very clear explanation. Thank you!
please give us the full pdf of the course(AI)
great explanation!
very detailed and good explanation - thank you
Wonderfully explained!
Thank you sir. Your videos are very clear and basic.
Bro you have saved me! You have been most helpful.
this is very nice .thank you so much