https://wiki.kram.nz/index.php?action=history&feed=atom&title=Apra102Apra102 - Revision history2026-05-12T13:43:40ZRevision history for this page on the wikiMediaWiki 1.45.3https://wiki.kram.nz/index.php?title=Apra102&diff=549&oldid=prevMark: 20 revision(s)2008-11-03T05:07:54Z<p>20 revision(s)</p>
<p><b>New page</b></p><div>==Minutes==<br />
Minutes taken by [[User:Apra102|Apra102]].<br />
<br />
==Review on yesterday's lab==<br />
In today's lecture we went through yesterday's lab-10.<br />
<br />
Task 1 is just a mathe mathematical calculation.<br />
<br />
Task 2 is read code and describe most of them dint get it and skipped to task 3 which is a bit more interesting. Only one line of code changes from bredth first to depth first search.<br />
<br />
Important points we covered in todays lec is '''Bredth first search''' and '''Debth first search'''<br />
<br />
Bredth first search is better than depth first search, And depth first search has memory efficient.<br />
<br />
Depth goes down untill it reaches an end.<br />
<br />
Bredth grows wide.<br />
<br />
==Bredth first search and Depth first search==<br />
In bredth first search we have got the following: <br />
<br />
number of nodes in level 'i' can be b^i<br />
<br />
number of nodes at depth <= k can be written as ∑_(i=0)^k▒〖b^i =〖(b〗^(k+1)-1〗)/(b-1) ( i tried in Microsoft but dint work)<br />
actually it says that sigma from i=0 to k (b power i) = b power(k+1) - 1 divided by (b-1) <br />
<br />
where k is depth with branching factor b.<br />
<br />
==Iterative deepening==<br />
Number of nodes examining by '''iterative deepening'''<br />
<br />
1+(1+b)+(1+b+b^2)-------(1+b+----+b^k). Here as k grows the depth grows.<br />
Here total number of nodes are less than the number of nodes in the lowest level.<br />
<br />
==Conclusion==<br />
Then concluded that bredth first search is very quick and not going have any problem with memory.<br />
Bredth search is more efficient when we take in time point of view thats why bredth first search is good.<br />
<br />
==Thursday and Friday's lectures==<br />
Today was the last lecturing, on thursday and friday we are going to go through previous years papers..... so get a couple of previous years question papers Mark will go through the paper and students can ask any specific doubts from those. In exam multi choice questions has 5 choices.<br />
<br />
==Accessing the Notes==<br />
Finally he showed us where is posted the lecture slides that he has, the site is:<br />
[https://www.se.auckland.ac.nz/courses/SOFTENG250/lectures/BST.pdf link Lecture sildes]</div>Mark