Apra102

Minutes

Minutes taken by Apra102.

Review on yesterday's lab

In today's lecture we went through yesterday's lab-10.

Task 1 is just a mathe mathematical calculation.

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.

Important points we covered in todays lec is Bredth first search and Debth first search

Bredth first search is better than depth first search, And depth first search has memory efficient.

Depth goes down untill it reaches an end.

Bredth grows wide.

Bredth first search and Depth first search

In bredth first search we have got the following:

number of nodes in level 'i' can be b^i

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) actually it says that sigma from i=0 to k (b power i) = b power(k+1) - 1 divided by (b-1)

where k is depth with branching factor b.

Iterative deepening

Number of nodes examining by iterative deepening

1+(1+b)+(1+b+b^2)-------(1+b+----+b^k). Here as k grows the depth grows. Here total number of nodes are less than the number of nodes in the lowest level.

Conclusion

Then concluded that bredth first search is very quick and not going have any problem with memory. Bredth search is more efficient when we take in time point of view thats why bredth first search is good.

Thursday and Friday's lectures

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.

Accessing the Notes

Finally he showed us where is posted the lecture slides that he has, the site is: link Lecture sildes