Posted by Zee01

Announcements | Last Post | |
---|---|---|

SoC Curricula | 09/30/2017 01:08PM | |

Demarcation or scoping of examinations and assessment | 02/13/2017 07:59AM | |

School of Computing Short Learning Programmes | 11/24/2014 08:37AM | |

Unisa contact information | 07/28/2011 01:28PM |

Is it just me or is this forum dead this year???

I am nearly done with summarising my work for this module and was wondering what all of you are going to study???

Last year the told us which sections to do, this year the give the topics...

This time around it seems like a lot less work!

Are you only studying the topics mentioned, or everything??

Good luck!!!

I am nearly done with summarising my work for this module and was wondering what all of you are going to study???

Last year the told us which sections to do, this year the give the topics...

This time around it seems like a lot less work!

Are you only studying the topics mentioned, or everything??

Good luck!!!

This is a very quiet forum.

I'm intimidated by this module having heard all negative comments about it last year, but am doing my best to think positive because this is the last module i have to do for my degree.

For now i' studying everything and will see closer to the exam if i'll want to focus on the said topics.

All the best for the exam

Would you say the module was hard last year?

I'm intimidated by this module having heard all negative comments about it last year, but am doing my best to think positive because this is the last module i have to do for my degree.

For now i' studying everything and will see closer to the exam if i'll want to focus on the said topics.

All the best for the exam

Would you say the module was hard last year?

Do you guys think that they will ask theory type questions, like: "Give the definition of a CSP, or depth-first search" OR would it rather be questions like, Show how DFS works with this example, or solve this puzzle using A* search.

(I think they would rather ask implementation type questions, I hope)

(I think they would rather ask implementation type questions, I hope)

From 2007 forum (about last year's exam):

PS: We are not doing FOL in full this year

Question 1

Was all about belief. With the vacuum cleaner problem.

-The agents belief

-belief state

-reachable belief

Question 2

-Cryptarithmetic using CSP

-also had to draw a graph for this

Question 8

-Draw AND, OR, NOT, XOR neural networks

-Draw nearal networks from tables

Other topics in exam was:

-Probabilities for decision trees / decision trees

-resolution refutation

-Max/Min Alpha/Beta

-Walksat

-FOL (Was about some guy stealing and gambling)

Supp exam (Jan 2008):

questions:

1. train a NN

2. show the states for a 3 x 3 puzzle. showing the f, g(n) and h(n) values using A*

3. Decision tree. they gave one, and you had to work out the end answers

4. when is a heuristic consistent?

5. when does a system use belief states

6. draw a neuron

7. how would you solve overfitting for a DT

8. proof by refutation...

9. draw the belief states for the vacuum cleaner

PS: We are not doing FOL in full this year

Question 1

Was all about belief. With the vacuum cleaner problem.

-The agents belief

-belief state

-reachable belief

Question 2

-Cryptarithmetic using CSP

-also had to draw a graph for this

Question 8

-Draw AND, OR, NOT, XOR neural networks

-Draw nearal networks from tables

Other topics in exam was:

-Probabilities for decision trees / decision trees

-resolution refutation

-Max/Min Alpha/Beta

-Walksat

-FOL (Was about some guy stealing and gambling)

Supp exam (Jan 2008):

questions:

1. train a NN

2. show the states for a 3 x 3 puzzle. showing the f, g(n) and h(n) values using A*

3. Decision tree. they gave one, and you had to work out the end answers

4. when is a heuristic consistent?

5. when does a system use belief states

6. draw a neuron

7. how would you solve overfitting for a DT

8. proof by refutation...

9. draw the belief states for the vacuum cleaner

Anonymous User
Re: Exam November 10, 2008 10:49AM |
Rating: 0 |

Resolution refutation means the following:

Resolution by contradiction (reductio ad absurdum) - see p211

You are given premises and a conclusion. You need to assume that the conclusion is false and then prrof a contradiction by using your inference rules that you learned from COS261 or LGC101.

Example:

Given 3 premises, you need to prove R. The first step is to convert you premises to CNF

1: P v Q

2: P -> R

3: Q -> R

In CNF form:

1: P v Q

2: Â¬P v R

3: Â¬Q v R

4: Â¬R (Assume the conclusion to be false)

---------

5: Q v R 1,2 (Inferred from 1 and 2)

6: Â¬P 2,4

7: Â¬ Q 3,4

8: R 5,7

From 4 and 8 it follows a contradiction which proves that my assumption Â¬R was incorrect.

Hope this helps. Just reminded me, wasn't COS261 or LGC101 a prereq for this module?

Resolution by contradiction (reductio ad absurdum) - see p211

You are given premises and a conclusion. You need to assume that the conclusion is false and then prrof a contradiction by using your inference rules that you learned from COS261 or LGC101.

Example:

Given 3 premises, you need to prove R. The first step is to convert you premises to CNF

1: P v Q

2: P -> R

3: Q -> R

In CNF form:

1: P v Q

2: Â¬P v R

3: Â¬Q v R

4: Â¬R (Assume the conclusion to be false)

---------

5: Q v R 1,2 (Inferred from 1 and 2)

6: Â¬P 2,4

7: Â¬ Q 3,4

8: R 5,7

From 4 and 8 it follows a contradiction which proves that my assumption Â¬R was incorrect.

Hope this helps. Just reminded me, wasn't COS261 or LGC101 a prereq for this module?

Sorry, only registered users may post in this forum.