Show all posts by user
Formal Logic 3
Page 2 of 5
Pages:
12345
Results 31 — 60 of 132
Well, i completely understand what you mean with bored. I was like that once this week, but I guess one just has to push through.
I did go through the 4 exams from myUnisa, basicaly through all the theory, still need to sharpen up on some points. Did anybody notice that there was no practical question in the 2010 exam? Mostly theory.
As for the 3 hour exams, just remove the Question 2 part
by
BlaXpydo
-
COS340A
As for the lecture support, yes, worth it. Mr.Aron really did help with the work.
Also, please note that there is NO study guide for this module. 8 chapters later, you really have a head full of info.
by
BlaXpydo
-
COS340A
Hey there phyzmatix, how you doing?
Well, I'm sure you saw the amount of comments floating around this forum, and it can be taken in relevance with the comments of Advance programming. I'd say that COS3712 (Computer Graphics) & COS3711(Advance Programming) are the two modules that needs the most work. You really need to know the theory to be able to implement the work. If you had
by
BlaXpydo
-
COS340A
I might be wrong (so I stand to be corrected ) but it seems to me, from the practical parts in the past exams, that most of the practical questions will be of 3 different kinds, namely:
1.Texture mapping
2.Lighting
3.Adding menu and key funtionality
If anybody sees any other questions being asked, please comment.
by
BlaXpydo
-
COS340A
Wow, nice. Glad to see someone making use of it. Thanks for that man.
by
BlaXpydo
-
COS340A
Just want to know how everybody is doing in preparing for the exam. Would like to know how you guys studying this module. I'm sure it will be interesting to hear everyone's different approach.
by
BlaXpydo
-
COS340A
Here is a link to the 2007 forum (Computer Graphics) with a list that Reanie made for the theory that she saw in the previous exams (pre2007).
Hope some of you will have time to go through this as well.
Exam Theory Questions
by
BlaXpydo
-
COS340A
Thanks man. Yip, did check the book, guess it was just a small slip up with the 'syntax' there.
Hope you all are getting the work load done for this exam.
by
BlaXpydo
-
COS340A
Is the diagram correct for this agorithm? It states that the parametric equation has values for both (x1,x2) and (y1,y2), but no such values (y1, y2) in the diagram. Could it be that point Q contains the x2 and the y2?
by
BlaXpydo
-
COS340A
Thanks. Just checking.
by
BlaXpydo
-
COS340A
Am I correct to asume that we won't be getting any questions on lines and planes to solve mathematicaly, but
only questions on the matrix manipulation?
by
BlaXpydo
-
COS340A
Where I wrote, there were two seats reserved for COS3701. One for me and one for somebody else. The other person never showed up. Wonder what happened.
I first drew the wrong FA on question 1. Then redid it, then came to the CFG.
Thanks for all the help eddy. You've really been going at it.
by
BlaXpydo
-
COS301Y
The question on with the turing machine witht he recursive language for 3 marks. Think it was question 7.
Well, I'm sure we all did well. It was do-able
by
BlaXpydo
-
COS301Y
Well, that was not to hard. All the kind of questions one would expect hey, except for that one.
But all went well.
by
BlaXpydo
-
COS301Y
Exam - 8 years ago
Good luck to all writing! Been a great time working with you all, and I hope you all pass.
Just relax, its going to be fine.
by
BlaXpydo
-
COS301Y
I think it will be safe to inform the marker (at the start of the answer) that you are assuming the correct input string is being used.
by
BlaXpydo
-
COS301Y
If they give us a function to prove, and they say n >= 3 (or any number, just as long as its larger than 0), can we asume the input string will always comply with this? Or should we design accordingly?
by
BlaXpydo
-
COS301Y
That was what I was thinking...but not quite sure.
by
BlaXpydo
-
COS301Y
1.Can a FA and a PDA accept PALINDROM? In my opinion not neither of them can since they can't keep track of all the letters of the first half. But I might be mistaken.
2.Can a FA and a PDA accept the following? a^n b a^n, a^n b^n b a^n
by
BlaXpydo
-
COS301Y
@hexium: Did you do the openGL subject (COS3712)? I'm doing it this semester.
by
BlaXpydo
-
INF303D
Don't know about you guys, but I created a composite entity in the second diagram.
I'm glad its done, now on to the second exam (Thursday - COS3701). anybody else writing?
by
BlaXpydo
-
INF303D
So how was it? Did not expect those ERDs. And the first DD was worth more than 10 marks.
by
BlaXpydo
-
INF303D
Hey eddy, thanks for the help. I don't think I will be figuring it out, so I'm going to go to bed now. I need some sleep.
Thanks for all the help.
by
BlaXpydo
-
INF303D
You see eddy, that particular question was asked before, so it would actually be nice to have some idea of what might be happening there hey.
Well, I'm sure that the questions of tomorrow will be quite do-able.
by
BlaXpydo
-
INF303D
Does anybody have the solution to the BoingX problem? (page 238 - Problem 8)?
If you do have some or any solution could you please PM me?
by
BlaXpydo
-
INF303D
But how would you answer the question, given that it is 12 marks?
by
BlaXpydo
-
COS301Y
I did not check your i) answer, but I agree with your other answers.
A hint on iii): Check page 491 of Cohen, there is shows that nPDA = TM (n>=2). So you can actually say any nPDA = TM where n >= 2
by
BlaXpydo
-
COS301Y
But does not the terminal 'b' between the 2 a's make it impossible to have 5 cases?
How did you do that?
by
BlaXpydo
-
COS301Y
On the word we choose for this pumping lemma (n = 2^p), and we use the case solution, do we still get 5 parts? or 4?
by
BlaXpydo
-
COS301Y
Check the extra resources on myunisa
by
BlaXpydo
-
COS340A
Page 2 of 5
Pages:
12345