人工智能和python毕业设计题目_Python与人工智能-中国大学mooc-题库零氪

Python与人工智能 - 中国大学mooc

已完结

 451

第1周

课后作业

1、Q4 Conditional Probabilities Select all of the following statements that are true for all joint distributions over XX and YY.

2、(续上题)

3、(续上题)

4、(续上题)

5、(续上题)

6、Q1 Probabilistic Inference Your box of cereal may be a contest winner! It's rattling, which 100% of winning boxes do. Of course 1% of all boxes rattle and only one box in a million is a winner. What is the probability that your box is a winner? Note on answer formatting: Please specify your answer as a decimal probability (i.e. .05 rather than 5%). Do not include zeros before the decimal. To receive credit, your answer must match ours exactly.

7、Q2 Events You are playing a solitaire game in which you are dealt three cards without replacement from a simplified deck of 10 cards (marked 1 through 10). You win if one of your cards is a 10 or if all of your cards are odd. How many winning hands are there if different orders are different hands?

8、(续上题) 216+60=276216+60=276 What is your chance of winning? (round your answer to 3 decimal places)

9、Q3 Expectations Someone rolls a fair six-sided die and you win points equal to the number shown. What is the expected number of points after one roll?

10、(续上题) After 2 rolls?

11、(续上题) After 100 rolls?

第2周

课后作业

1、Q7 HashingQ7.1 Which critical operation is generally faster in a hash table than in a linked list?

A、inserting an element into the data structure

B、testing for the membership of an element in the data structure

C、(无)

D、(无)

2、Q7.2 On average, how fast is this operation in a hash table?

A、

B、

C、

D、

3、Q7.3 On average, how fast is this operation in a linked list?

A、

B、

C、

D、

4、Q6 Logarithms Select all of the the following statements that are true.

5、(续上题)

6、(续上题)

7、(续上题)

8、(续上题)

9、(续上题)

10、Q5 Linear Equations You know that

and

What is x?

11、(续上题) What is y?

第3周

课后作业

1、Q6 Hive Minds: Lonely BugIntroduction The next five questions share a common setup. You control one or more insects in a rectangular maze-like environment with dimensions M MM times N NN , as shown in the figure below.

At each time step, an insect can either (a) move into an adjacent square if that square is currently free, or (b) stay in its current location. Squares may be blocked by walls, but the map is known. Optimality is always in terms of time steps; all actions have cost 1 regardless of the number of insects moving or where they move. For each of the five questions, you should answer for a general instance of the problem, not simply for the example maps shown. Problems For this problem, you control a single insect as shown in the maze above, which must reach a designated target location X, also known as the hive. There are no other insects moving around.Q6.1 Which of the following is a minimal correct state space representation?

A、An integer (d) encoding the Manhattan distance to the hive.

B、A tuple ((x, y)) encoding the (x) and (y) coordinates of the insect.

C、A tuple ((x, y, d)) encoding the insect's (x) and (y) coordinates as well as the Manhattan distance to the hive.

D、This cannot be represented as a search problem.

2、Q6.2 What is the size of the state space?

A、

B、

C、

D、

3、Q7 Hive Minds: Swarm Movement You control KKK insects, each of which has a specific target ending location

XkXk. No two insects may occupy the same square. In each time step all insects move simultaneously to a currently free square (or stay in place); adjacent insects cannot swap in a single time step.

A、

B、

C、