same here, received SMS, phone call and e-mail about the new time: 11 Feb @ 14:00. strongs for the exam to everyoneby nobbie - COS408D
I think it's this way: beta-cut: Max nodes; value is compared to beta to determine whether to prune beta-cut: Min nodes; value is compared to alpha to determine whether to pruneby nobbie - COS351D
Liezl-Mia, thanks for that nice explanation ! * edited * all text removed, mistake found.by nobbie - COS351D
yes, sorry .... have edited the above X5 = Pby nobbie - COS351D
Here's something that helps me work through the AlphaBeta algorithm when checking a tree, maybe it will help someone else. It's a summation of the algorithm on pg170. If you're in a MAX node, follow the sequence in the red block for each child If you're in a MIN node, follow the sequence in the blue block for each child pruning returns v ending possibly updates a or Bby nobbie - COS351D
I think there's a error in the model answer for Ass3Q4. can someone confirm ? The right node of the root node should have Beta change sequence: inf/6/1by nobbie - COS351D
*chanting* Study guide *chant* *chanting* Study guide *chant* *chanting* Study guide *chant* *chanting* Study guide *chant* etc....by nobbie - COS351D
Strongs, hope you all do well (but not better then me, then i'll just look badby nobbie - COS351D
Course Prerequisites: COS211 and (COS161 or LGC101 or COS261) i passed COS211 and COS161 but looong ago. time to wipe the dust of that textbook.by nobbie - COS351D
to determine whether you can omit an attribute, check whether _all_ occurances of a set of attributes with set values always have the same outcome. ie, in all cases where hair=blond, lotion=no; sunburn=yes; and no other attributes affect the outcome.by nobbie - COS351D
got 10%, and 46% for the aegrotat. so close, just needed 4 more percent =(by nobbie - COS351D
The module lacks something. too much theory, too little info on how to practically apply it. WTF is resolution refutation ? anyone know where's an example of a model answer?by nobbie - COS351D
According do another post, it required the constraint graph. I don't remember myself, it was too long ago and too painful.by nobbie - COS351D
found a solution at http://answers.yahoo.com/question/index?qid=1006021711052 HOCUS + POCUS = PRESTO 92836 + 12836 = 105672by nobbie - COS351D
The square boxes indicate constraint: all variables connected to the same square box impose some restriction on each other. Finally found a solution by working backwards from P: If no leading zero is allowed, P must be non-zero and can at most be 1. so P=1 That means, H has to be 8 or 9 in order to carry a 1 and make X5=P=1. If "H" is 8, then "O" has to be: 1) someby nobbie - COS351D
Thanks, otherwise i would've probably received it in the post in time for next year.by nobbie - COS351D
Hi, Inc Oct 2007, the CSP given in the exam was: HOCUS +POCUS ------ PRESTO How would you go about solving that during the exam other then brute force guessing ? Using the text book, i can get to these conclusions: S+S = O + 10*X1 X1 + U+U = T + 10*X2 X2 + C+C = S + 10*X3 X3 + O+O = E + 10*X4 X4 + H+P = R + 10*X5 X5 = P constraint graph:by nobbie - COS351D
Hi,r Where is this Mock exam you are referring to ? i've gone through the tuts for this module and couldn't find it.by nobbie - COS351D
What i've just discovered works very well when drawing FA/TG/Moore/Mealy is a CD =) the inner hole is a nice size for the states and the outer edge draws nice directed edges. there we go, an easy stencil for neat diagrams. just make sure it has no information on which could be considered as "cryp notes" (sp?)by nobbie - COS201V
From: http://www.unisa.ac.za/Default.asp?Cmd=ViewContent&ContentID=16878 " Warning Answer books that contain illegible writing will not be marked, and no points will be awarded for illegible answers or for answers written in pencil. ... " Those are exam procedures for the centre of business management, but I wouldn't write in pencil. You are allowed to do rough workby nobbie - COS201V
Hi, While preparing for the exam, i came across these problems with the model answers for Assignment 1: Question 7 and 12. Question 7: Pg16 of Cohen states that the closure of the empty language contains the null string. Model answer for Q16 (option1) of assignment 1 also states this; which contradicts the model answer for Q7. Question 12: The model answer lists the 3rd option as correby nobbie - COS201V
if we don't understand a word you 2 are saying, are we in trouble for the exam ?by nobbie - COS201V
Who has tried the CAI (computer aided instruction) for COS201 ? Is it worth buying ? If so, would someone be willing to send me an electronic copy of the software if i can show proof that i've paid for one - if i order it now, it won't get here in time.by nobbie - COS201V
" <tag1><tag2></tag2></tag1> becomes: tag1 tag2 " yes, but the last tag: <include src="blahblah.blah"/> wouldn't print: include instead, the QXmlSimpleReader would die because it can't parse self-terminated elements. That's with Qt 4.4.3 though, i haven't tested on the old version UNISA ship on their 2008 diby nobbie - COS3114
The question about "how to these 3 items ease heap memory management" 1) QObject 2) Qt containers 3) auto_ptr was pretty brutal, unless if the 1 fact i could conjure for each one is worth 4 points. The XML question seems to have had a trick. The QXmlSimpleParser will die when it reads the self-terminated element: <include src="blah"/> to it won't printby nobbie - COS3114
judging by the time of your post esckay, you eighther have an inet connection in the exam hall (lucky), or didn't have the time problem like meby nobbie - COS3114
Ye that was tough ! took an hour for Questions 1 and 2 and thought time was going to run our. The patterns afaik know were: QDir question: Visitor pattern Error display: Strategy pattern Why so many UML Diagrams ? It doesn't really test knowledge on design patterns or advanced programming. That should stay with the UML course (INF2xx or something).by nobbie - COS3114
without the writing, reading won't be possibleby nobbie - COS3114
One could argue that it's a creational patterns since it facilitates writing to disk/network and then reading it to re-create it. Wikipedia defines creational patterns as: "... patterns that deal with object creation mechanisms."by nobbie - COS3114