Search - DFS and BFS

  Рет қаралды 69,467

nptelhrd

nptelhrd

Күн бұрын

Пікірлер: 30
@nicolasbrenden1484
@nicolasbrenden1484 8 жыл бұрын
HE IS GOOD PROFESSOR AND HIS KNOWLEDGE WILL HELP ME PASS MY PAPERS ON MONDAY
@blahblah-pl2qd
@blahblah-pl2qd 6 жыл бұрын
indeed he is he is a lecturer from one of the best universities in india im glad this channel is of help for people other than me too
@firstyfirst
@firstyfirst 3 жыл бұрын
Did u pass on Monday
@sundresh_
@sundresh_ 2 жыл бұрын
Did you passed?
@vinamrasangal5064
@vinamrasangal5064 Жыл бұрын
hi! where are you working now ?
@zenicv
@zenicv 4 жыл бұрын
I came here looking for some supplementary materials while reading AIAMA. I find these lectures very helpful to deepen the knowledge. For those who criticize the video: 1) Too dry -- This topic won't be as entertaining as a music video. Not the fault of the lecturer. 2) Exercises left to the students -- Aim of a college lecture is to stimulate interest in the topic by approaching it in a subtle manner so that knowledge sticks. If you want a 10 minute quicktorial about DFS and BFS, this is the wrong place.
@souvikpal6262
@souvikpal6262 8 жыл бұрын
16:20 - Sir, what will i do if a node has two parents in closed list. That would provide us two paths to the start node.. Please clarify. Thank you.It would be helpful if you reply.
@namanwadhwa462
@namanwadhwa462 8 жыл бұрын
As one node is being added AT MOST once in the "Closed list", there's no chance of finding two instances of a node.
@phil_ka
@phil_ka 2 жыл бұрын
if you meant adding to the OPEN list, then at the time of adding the node in the open list, we are also checking if it is in the OPEN or CLOSED already, and if it is, we don't add that
@felixnavas8808
@felixnavas8808 6 жыл бұрын
Fantastic tutorial
@oshokeokolo8852
@oshokeokolo8852 4 ай бұрын
This is amazing to watch
@denishsuhagiya7333
@denishsuhagiya7333 4 ай бұрын
great expalantion!!!
@abhragupta5014
@abhragupta5014 6 жыл бұрын
TC of BFS is O(V)
@poulomipatra8167
@poulomipatra8167 3 жыл бұрын
BEAUTIFUL
@gurudattasahoo2302
@gurudattasahoo2302 3 жыл бұрын
very nice and useful
@yolob2116
@yolob2116 8 жыл бұрын
too many exercises
@astikjain
@astikjain 4 жыл бұрын
nice lecture sir
@tapanjeetroy8266
@tapanjeetroy8266 6 жыл бұрын
Thanks a lot sir
@rishabh-shah
@rishabh-shah 6 жыл бұрын
The Lectures are very good but a tad bit boring. No complains there. But just stop giving exercises for the students as the ones at home can't verify the solution. Hope you'll keep this in mind future lecture series.
@ShubhamYadav-re9cp
@ShubhamYadav-re9cp 6 жыл бұрын
thanks sir
@umairalvi7382
@umairalvi7382 5 жыл бұрын
why dont you leave entire course as an excercise.....
@zenicv
@zenicv 4 жыл бұрын
not sure what you mean. The aim of a lecture is to stimulate interest in the material..not to give you precise solution to every problems
@loveypannuartworks3020
@loveypannuartworks3020 7 жыл бұрын
boring aa bai
@WaseemAhmad-bf2mw
@WaseemAhmad-bf2mw 5 жыл бұрын
No creativity in IITs either.....
@user-zo9ye6de5e
@user-zo9ye6de5e 5 жыл бұрын
Bcoz u r madrassa chap go and study there
@WaseemAhmad-bf2mw
@WaseemAhmad-bf2mw 5 жыл бұрын
U are an absolute slum boy who doesn't know who his father is....
@WaseemAhmad-bf2mw
@WaseemAhmad-bf2mw 5 жыл бұрын
Go and ask ur mother who ur father is.... Poop like u tend to sound like man but don't worry I got u, u r just a gobdaw....
@WaseemAhmad-bf2mw
@WaseemAhmad-bf2mw 5 жыл бұрын
Wooops honurable sir!!!!! haha change it to bellend tht will suit u...
Search DFID
51:10
nptelhrd
Рет қаралды 31 М.
Lecture 13: Breadth-First Search (BFS)
50:48
MIT OpenCourseWare
Рет қаралды 708 М.
$1 vs $500,000 Plane Ticket!
12:20
MrBeast
Рет қаралды 122 МЛН
Sigma girl VS Sigma Error girl 2  #shorts #sigma
0:27
Jin and Hattie
Рет қаралды 124 МЛН
Вопрос Ребром - Джиган
43:52
Gazgolder
Рет қаралды 3,8 МЛН
Heuristic Search
55:49
nptelhrd
Рет қаралды 53 М.
Depth First Search
7:16
John Levine
Рет қаралды 107 М.
A* Algorithm
49:32
nptelhrd
Рет қаралды 52 М.
Game Playing- Minimax Search
45:59
nptelhrd
Рет қаралды 19 М.
Terence Tao at IMO 2024: AI and Mathematics
57:24
AIMO Prize
Рет қаралды 708 М.
State Space Search - Introduction
54:03
nptelhrd
Рет қаралды 102 М.
Recursive Best First Search, Sequence Allignment
49:46
nptelhrd
Рет қаралды 40 М.
Breadth First Search - Part 1
8:17
John Levine
Рет қаралды 87 М.
5. Search: Optimal, Branch and Bound, A*
48:37
MIT OpenCourseWare
Рет қаралды 258 М.
$1 vs $500,000 Plane Ticket!
12:20
MrBeast
Рет қаралды 122 МЛН