Hope you all did well, just for the record this was what I remember the paper consisted of. I found it to be a fair exam, pity I didn't focus enough on last semesters exam! Really got stuck drawing the 'tree' for the coyote and jackal, missed some give away marks! Hoping for a pass!!! Q1 Coyote and Jackal (ie Missionaries and Cannibal) Define state space and start stateby 35994908 - COS351D
Hi, If anyone has last semesters or last years solutions to the assignments, could you please email me at mightybrad@gmail.com Thanks!by 35994908 - COS351D
Thanks for the reply. Yeah, it is a third year subject, but a little more direction would've been good all the best! Bradby 35994908 - INF320E
Hi, This is really alot of work for such a few marks and to remember all these points and content is becoming rather daunting. The exam guide also hasn't narrowed it down too much. Does anyone have any ideas or further insights into sections that we should focus on?? Thanks Bradby 35994908 - INF320E
Hi, Yeah, I had the same thinking going on there. I was looking at the 2010 exam and it seems they do mostly give hints. If they don't give any hint then what I will do is do whatever way I think is easiest for me and then just write an explanation after saying that I could have rather used a JOIN or subquery or whatever... Bradby 35994908 - INF307H
Yeah, agreed, it's been real. See those writing in PTA in a little while! COS301 here we come baby! Good luck! See you later for the post mortem Bradby 35994908 - COS301Y
This is an attempt at Question 9b. It took me over an hour, I just hope I don't get stuck like that in the exam. Let me know your thoughts on this question... prove the function f(n) = n + n n >= 0 is computable, use unary encoding. The remarks in tutorial letter says to use a TM. Is this answer just by drawing the TM enough?by 35994908 - COS301Y
Thanks for that, I would go with yours. I think using X's to count after every occurance of ac is better. Nice!by 35994908 - COS301Y
This machine does accept baba, this should accept any even word ending in 'ba' At state 11 it loops forever because on any word with odd length where the substring 'ba' occurs more than once. Thats apparently what a neverending loop looks like. I got that from assignment 3... Hope this helps...by 35994908 - COS301Y
Thanks for the feedback! It really helps! Man, I see the error of my ways, thanks for pointing it out! You are correct. I just hope to not make silly mistakes like that in the exam. Rather now than later!by 35994908 - COS301Y
This is the turing machine, really hope this to be correct. I am starting to get the hang of them so I really hope you don't find too much wrong with this. Let me know...by 35994908 - COS301Y
CFG 1: S -> XY | b X -> aX | bY | a Y -> aX | bY | b CFG 2: S -> SY | X X -> bS | bX Y -> a | aX | ^ Write down a grammar that will generate L1L2: S -> S1S2 S1 -> X1Y1 | b X1 -> aX1 | bY1 | a Y1 -> aX1 | bY1 | b S2 -> S2Y2 | X2 X2 -> bS2 | bX2 Y2 -> a | aX2 | ^ Question: How do you prove this in both directions (i don't know whatby 35994908 - COS301Y
This is a good link for this subject. At the bottom is the download section for the pumping lemma solutions and some other resources http://wikistudent.ws/Unisa/COS3701 Bradby 35994908 - COS301Y
Thanks for all the feedback, it's good to just think as well. It really helps! If you read the last page of tutorial letter 104, it gave some pointers for the 2006 exam that they looked for. It says it must end in READ and POP delta before before going to ACCEPT I am still waiting for Assignment 1, although I haven't checked my post for about 2 weeks. I agree with starting Yearlyby 35994908 - COS301Y
In reply to your comments of Y, itself, because of the Y -> bY production. S, because of S -> Y X, because of X -> aY Here is my reasoning. Y becomes Y -> b S stays S -> Xa | Y because Y could still become either a or b. X -> aY because the Y could still become either a or b I could be wrong though...by 35994908 - COS301Y
This is an attempt at Question 2. Please add any comments, as before, I don't claim this to be correctby 35994908 - COS301Y
Yeah I agree with you, Y -> bY becomes Y -> b which we already have so it should just be Y -> a | bby 35994908 - COS301Y
Hi, This is just an attempt to answer the questions of the 2006 exam and to get some feedback and interaction for some of the questions. Please comment on the attempted answers so we can learn. I don't claim the answers to be correct. Question 1(a) The FA - See image below or Assuming the FA to be correct the CFG for the language is: S -> aX | bU X -> aY | bY Y -&by 35994908 - COS301Y
Hi, Thanks for all these posts!! I've quickly skimmed through them. I have had a busy week so I haven't had time to study. I will be going through it this weekend and then give some feedback. Thanks again!by 35994908 - COS301Y
Hi, I am really struggling to come to an understanding of Pumping Lemma. Does anyone have a good resourse or extra notes that are easy to understand? If so you could you either post the links or email me the notes at mighytybrad@gmail.com Thanks! Bradby 35994908 - COS301Y
This is cool to practice without being online, gives a more real exam perspective. Thanks for the links!by 35994908 - INF305F
Yeah, as far as I know it will be 50% multiple choice. Judging from last years forums, most of the multiple choice questions came from the assignments and the multiple choice questions from our prescribed books official website. So i think to really make sure you get as much from the multiple choice is important. That is a big focus of mine. And then obviously focussing on the assignment quesby 35994908 - INF305F
Howzit, Is anyone else struggling with the sheer volume of facts, particular the numer of different points for various sections of the book. Just like to know if there are particular things that we should be focussing on... Thanks for any advise or tips!by 35994908 - INF305F
Hi, I came across the fantastic summary for deadlock avoidance. A really excellent help and summary! http://blogs.msdn.com/b/willy-peter_schaub/archive/2010/11/02/unisa-chatter-operating-system-concepts-part-14-deadlock-avoidance-analysis-revisited.aspx Cheers Bradby 35994908 - COS3216
Howzit, Check this link out for a good summary and a few examples of scheduling algorithms: http://www.cct.lsu.edu/~kosar/csc4103/slides/05_CPU_Scheduling_I.pdf Cheers Bradby 35994908 - COS3216
Howzit, So while I have been preparing for the exam I came across difficulty in understanding the calculations to work out SJF scheduling without preemption and with non-preemption. I didn't find out Tutorial letter 102 helpul in this regard. So came across this post from a previous year and found it very helpful to me. So I am posting it here and will hopefully help some who are strugglby 35994908 - COS3216
how would we prove the correctness of this machine?by 35994908 - COS301Y
Thanks for the contribution guys, really helping me!by 35994908 - COS301Y
the content for the course has changed for 2010, so some of the work is not applicable that was in last years exams. All the best for the exams!by 35994908 - INF303D
Hi, Here is a great resource to get ideas about some subjects and what to expect. There is however very little or no information for some subjects. It will therefore be great to add whatever information you have to this site to make it more valuable. http://wikistudent.ws/Unisa/Main_Page Regardsby 35994908 - COS3216