Brainscape's Knowledge GenomeTM

Browse over 1 million classes created by top students, professors, publishers, and experts.


See full index

CS3105 AI > 7: Past paper stuff > Flashcards

7: Past paper stuff Flashcards

1
Q

Why is the A* search algorithm the following:

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

A

???

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

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

A

???

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

What is backprop? What does it do?

A

???

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

What are hyperplanes?

A

???

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

How do you calculate weight changes?

A

???

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

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

A

???

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

What are convolutional neural networks?

A

???

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

What is Bayes’ rule?

A

???

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

What is a causal probability?

A

???

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

What is a diagnostic probability?

A

???

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

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

A

???

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

What are FOPL semantics?

A

???

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

What is entailment?

A

???

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

What is a perfect information game?

A

???

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

What is a 2-player perfect information game?

A

???

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

What is an endgame database?

A

???

17
Q

How do you construct an endgame database?

A

???

18
Q

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

A

???

19
Q

What are complete and incomplete search methods?

A

???

20
Q

What is the WalkSAT search algorithm?

A

???

21
Q

How does the WalkSAT search algorithm work?

A

???

22
Q

What is a probability space?

A

???

23
Q

What are joint probability distributions?

A

???

24
Q

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

A

???

25
Q

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

A

???

26
Q

What is Manhattan distance?

A

???

27
Q

What is NYC cab distance?

A

???

28
Q

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

A

???

29
Q

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

A

???

30
Q

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

A

???

31
Q

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

A

???

32
Q

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

A

???

33
Q

What are binary game search trees?

A

???

34
Q

What is the alpha-beta search algorithm?

A

???

CS3105 AI (8 decks)

Brainscape helps you reach your goals faster, through stronger study habits.
© 2024 Bold Learning Solutions. Terms and Conditions