7: Past paper stuff

Question 1

Why is the A* search algorithm the following:

a) optimal?
b) complete?
c) optimally efficient?
d) focused?

Answer 1

???

Question 2

What is the minimax search algorithm? Which parts of it are informed and uninformed?

Answer 2

???

Question 3

What is backprop? What does it do?

Answer 3

???

Question 4

What are hyperplanes?

Answer 4

???

Question 5

How do you calculate weight changes?

Answer 5

???

Question 6

How do you calculate weight changes for hidden units in neural networks?

Answer 6

???

Question 7

What are convolutional neural networks?

Answer 7

???

Question 8

What is Bayes’ rule?

Answer 8

???

Question 9

What is a causal probability?

Answer 9

???

Question 10

What is a diagnostic probability?

Answer 10

???

Question 11

How do you convert from a causal to a diagnostic probability uisng Bayes’ rule?

Answer 11

???

Question 12

What are FOPL semantics?

Answer 12

???

Question 13

What is entailment?

Answer 13

???

Question 14

What is a perfect information game?

Answer 14

???

Question 15

What is a 2-player perfect information game?

Answer 15

???

Question 16

What is an endgame database?

Answer 16

???

Question 17

How do you construct an endgame database?

Answer 17

???

Question 18

How can you use statements to prove that certain entailments are true?

Answer 18

???

Question 19

What are complete and incomplete search methods?

Answer 19

???

Question 20

What is the WalkSAT search algorithm?

Answer 20

???

Question 21

How does the WalkSAT search algorithm work?

Answer 21

???

Question 22

What is a probability space?

Answer 22

???

Question 23

What are joint probability distributions?

Answer 23

???

Question 24

How do you deduce probabilities from joint probability distributions? What method does it use?

Answer 24

???

Question 25

How do you find the number of node iterations needed for each search algorithm to solve a certain problem?

Answer 25

???

Question 26

What is Manhattan distance?

Answer 26

???

Question 27

What is NYC cab distance?

Answer 27

???

Question 28

How do you manually write out A* search algorithm trees for a certain problem?

Answer 28

???

Question 29

How do you manually write out greedy search algorithm trees for a certain problem?

Answer 29

???

Question 30

How do you manually write out Uniform-cost search algorithm trees for a certain problem?

Answer 30

???

Question 31

How do you manually write out depth-first algorithm trees for a certain problem?

Answer 31

???

Question 32

What does it mean for a heuristic to be admissible? How does this apply to the A* search algorithm?

Answer 32

???

Question 33

What are binary game search trees?

Answer 33

???

Question 34

What is the alpha-beta search algorithm?

Answer 34

???