https://wiki.kram.nz/index.php?action=history&feed=atom&title=SE250%3AJune_5SE250:June 5 - Revision history2026-06-04T16:16:40ZRevision history for this page on the wikiMediaWiki 1.45.3https://wiki.kram.nz/index.php?title=SE250:June_5&diff=3796&oldid=prevMark: 23 revision(s)2008-11-03T05:18:29Z<p>23 revision(s)</p>
<p><b>New page</b></p><div>===Minutes===<br />
* sshi080<br />
<del>* tsen009</del><br />
<br />
==== Exam Information ====<br />
Exam is comprised of two parts:<br />
<br />
70/120 Mark Wilson<br />
50/120 John Hamer<br />
<br />
Notes have to be hand written - but maybe it can be printed? Mark will check.<br />
<br />
Mark Wilson's part of the exam will be multichoice, and will be more likely to relate to the actual algorithm/structure than specifically for C.<br />
<br />
Someone pointed out: http://www.cplusplus.com is a good resource for C study.<br />
<br />
==== Last year questions ====<br />
<br />
Looked over last year's exam questions<br />
<br />
'''Binary search trees:'''<br />
<br />
-Describing algorithm, theory, not code.<br />
<br />
-Deleting node e: find largest node on the left sub tree, e will be replaced by c with d as child, then f on the right.<br />
<br />
'''Parsing:'''<br />
<br />
-Hard to do multichoice with multiple code fragments - so maybe just theory?<br />
<br />
-The semi-colon in the question, maybe just separator instead of line ender.<br />
<br />
'''State-space search:'''<br />
<br />
-Initial search space HHHTTT<br />
<br />
-Immediate Children: TTHTTT, HTTTTT, HHTHTT, HHHHHT, HHHTHT<br />
<br />
-State space: 64 states, 2^6<br />
<br />
-Breadth-first, easy to implement, guarantee to find in smallest number of moves.<br />
<br />
-Now consider 2^50 states, now use a guided, informed search.<br />
<br />
-Maybe rank on how many already in correct state<br />
<br />
-Also, check how many marks the question is worth, don't spend too much time on questions aren't worth much<br />
<br />
'''Rotations'''<br />
<br />
-It is a binary search tree, it has ordering property and two child nodes each parent.<br />
<br />
-Can't rotate so 11 is root, because 17 is bigger than 11.</div>Mark