啟發式演算法與簡易應用
Computers
University
Used 2+ times
AI Actions
Add similar questions
Adjust reading levels
Convert to real-world scenario
Translate activity
More...
Content View
Student View
7 questions
Show all answers
1.
FILL IN THE BLANK QUESTION
2 mins • 1 pt
假設要最大化 f(x) = x，編碼是十進位數值，鄰域函式是交換兩個相鄰的數字，
使用 Best-improving Iterative Improvement (II) 演算法搜尋，目前的解是 4132，
請問搜尋一步後會移動到哪一個解 ?
(a)
2.
FILL IN THE BLANK QUESTION
3 mins • 1 pt
若以上下左右相鄰的位置為鄰域，以 Best-improving II 搜尋，
請問這個搜尋空間中最大塊的盆地有幾格？
(a)
3.
FILL IN THE BLANK QUESTION
1 min • 1 pt
(a)
4.
FILL IN THE BLANK QUESTION
1 min • 1 pt
(a)
5.
MULTIPLE CHOICE QUESTION
1 min • 1 pt
00101
10100
10111
00111
6.
FILL IN THE BLANK QUESTION
1 min • 1 pt
請寫出另一個子代解（連續六個數字，沒有空白）
(a)
7.
FILL IN THE BLANK QUESTION
5 mins • 1 pt
請計算出使用 SPT 法則排完所有 Jobs 的 makespan。
(a)
Access all questions and much more by creating a free account
Create resources
Host any resource
Get auto-graded reports
Continue with Google
Continue with Email
Continue with Classlink
Continue with Clever
or continue with
Microsoft
%20(1).png)
Apple
Others
Already have an account?
