Show all posts by user
Advanced Programming
Page 1 of 5
Pages: 12345
Results 1 — 30 of 142
Also done.. Now the BIG question..honours, another degree, Certificates/Diplomas or HOLIDAY?
by
Rey
-
COS351D
Hell I hope so. This is my last subject for my degree. Life just keeps throwing things at me. It's kind of nice that this is only a semester course now, but I agree that it is far to fast to get any depth. When they say intro, the mean intro. All my previous COS and INF subjects have been year modules. I would love to do the Honours module of this one.
Does anyone remember if it was out o
by
Rey
-
COS351D
CNF - Conjunctive Normal Form
I have no idea when they going to be out...hope soon. So I know if I need to register again
by
Rey
-
COS351D
I live 5 min's away from the exam venue and no robot between me and home
Comes in handy if something goes wrong with the car. At least I can run there.
by
Rey
-
COS351D
Post mortem
I have no idea how I did. To many questions on what does X mean!
Question 1
Question 2
CSP
Question 3
Resolution Refutation
I had to start this again. It went through twice to get the refutation. Clause 1 was key
Question 4
A*
Don't know if I did the nodes correctly. Actually have no idea if the entire question came out correctly.
Question 5
Alpha-Beta?
Que
by
Rey
-
COS351D
These questions take FOREVER...I'm running out of paper....
by
Rey
-
COS351D
Correct me if I'm wrong please:
Procedure:
1. Find entropy of entire test set
2. Find Entropy of each variable in set
3. Calculate information Gain for each entire variable set
4. Place root node of highest IG
5. Calculate IG for each variable relating to previous node
6. Add node of highest information gain to previous node or add leaf node
7. loop 5
Only add variable nodes tha
by
Rey
-
COS351D
FOL Handout
very brief English -> FOL
by
Rey
-
COS351D
Here is a link to the application they using:
Eclipse
navigate to:
Eclipse
http://sunsite.informatik.rwth-aachen.de/ftp/pub/mirror/ECLiPSe-CLP/6.0_183/i386_nt/
OPL studio
http://www-01.ibm.com/software/integration/optimization/cplex-optimization-studio/
by
Rey
-
COS351D
CSP Examples
They use some software examples as well, but the Var, Dom, and Constraints are useful.
by
Rey
-
COS351D
Hi
By no means am I ready for this exam... so don't take what I say as valid maybe not even satisfiable
Formulating a problem space: States description, Start State, Goal State, Cost function, Successor
I think your confusion is in the use of T and F. I think it would better be explained as (A,B ) where A has a single value between 0 and 3 litres and B has a single value between 0
by
Rey
-
COS351D
Chapter 1 You may not have the time to download or watch, but I'll leave it here anyway.
Lecture Series on Artificial Intelligence by Prof. P. Dasgupta, Department of Computer Science & Engineering, I.I.T,kharagpur. For More details on NPTEL visit http://nptel.iitm.ac.in
I watch on VLC at 1.3x playback. The lectures are about 59min long. Just watch the lectures pertaining to concep
by
Rey
-
COS351D
Tutorial on Alpha Beta pruning (Java app)
by
Rey
-
COS351D
2nd ed.
Chapter 1
Chapter 2
Chapter 3
Chapter 4a
Chapter 4b
Chapter 5
Chapter 6
Chapter 7
Chapter 9a
Chapter 9b
Got some more.. Will look through my stuff later.
Lect 1 <- Change the URL from lect1.pdf - 27 (Sorry it's in my dropbox and am using it to study on the road. so not zipped into one file)
A lot of you may already have these. Hope they help.
(If anyone has
by
Rey
-
COS351D
Now that everyone is talking , it's making me even MORE nervous. My Machines weren't that big, just challenging.
by
Rey
-
COS301Y
Was good. Got stumped on question 1a , calmed down and the rest went well!
Drawing the 2PDA and TM was LONG, I think I got them, but goofed on the unary encoded TM, but hopefully some method marks.
The Lemma were pumped the the Kleene proof was a star. I think I passed. Not gonna jinx it!
I have doubts now that I'm finished, like, it was DRAW the machines and not describe right
by
Rey
-
COS301Y
Hi Everyone
I just want to wish everyone luck. I hope to see none of you again well at least not in this subject!
Thanks to everyone who helped with the "model" answers, and for the people with questions. Don't think of it as not knowing the answer, think of it as testing if someone else does! It helps everyone learn.
Regards
Rey
by
Rey
-
COS301Y
All helps appreciated. If not by me then students to follow
by
Rey
-
COS301Y
I get the impression that we are the ones being pumped, but after you get it, it's kind of simple, but still REALLY tedious! I hope we don't get PROVE by pumping lemma with length that this language is context free!
by
Rey
-
COS301Y
Stated something like this:
Given Language L, will it be accepted by a given PDA and vise versa?
Isn't this a Decidability problem? What theorem was this?
by
Rey
-
COS301Y
Ok. I feel "uncomfortable" sending my machine into infinity , do you think they will accept the constant loop over the actual input?
It makes it a bit harder to design the machine (well just a marker, finding it and re-entry into the correct spot at the beginning of the machine).
by
Rey
-
COS301Y
Thanks.
Your last loop for words not accepted, does it not have to return to the beginning of the word and start looping again .i.e loop forever on words .....? How do you not stop it from crashing off the beginning?
by
Rey
-
COS301Y
2007 Q9 - 13 years ago
Question 9 (2007)
a) A function is computable if there exist a Turing Machine that can accept it.
b) As it is accepted by the TM bellow it is computable
Correction please read post bellow by louisrdev. I agree.
by
Rey
-
COS301Y
2007 Q8 - 13 years ago
Question 8 (2007)
PALINDROME ALAN {anban} {anbnban} {a222}
FA NO NO NO NO YES
PDA YES NO YES NO YES
TM YES NO YES YES YES
Again Yes/No ?
by
Rey
-
COS301Y
2007 Q7 - 13 years ago
Question 7 (2007)
i)
Accept(T) = ab(bb)*a
Loop(T) = aa(a+b)*+ ab* + abba(a+b)*
ii) a(ba)*
YES/NO?
by
Rey
-
COS301Y
2007 Q6 - 13 years ago
Question 6 (2007)
i) (be careful of my answer, haven't tested it)
1)Read a,
2)Push X onto stack1
3)Repeat 1 - 2 till b is read
5)Read b
6)Read b
7)Pop X from stack1 push X onto stack2
8)Repeat 6 - 7 till Pop /\ from stack1
9) Pop X, then Pop X from stack2
10)Read a
11)Pop X from stack2
12)Repeat 10 - 11 till Pop /\ from stack2
13)Read /\
14)Accept
ii) Yes. As 2PDA is equi
by
Rey
-
COS301Y
2007 Q5 - 13 years ago
Question 5 (2007)
WHAT THE HELL DID I MISS HERE! Someone give me a simpler version PLEASE!
Comments:
1. I see that I'm not going to Loop on words starting with 'ab' or 'ba' of even length! Could make an even loop if the first characters did this and make it bounce back and forth. That would add two extra loops above this TM to track these occurrences (above left and
by
Rey
-
COS301Y
I was thinking, which is probably a bad thing.
That if you run 'a' you could probably exit the loop by doing a 'b', but aa* would loop for as long as there is input. I suppose then I should have had aa+
Second possible loop would be running an 'a', then a 'ba'. Since the input is the tape, it would not read anything further, as the head would just bounc
by
Rey
-
COS301Y
Page 1 of 5
Pages: 12345