人工智能试题集15006Word格式.docx
- 文档编号:17343233
- 上传时间:2022-12-01
- 格式:DOCX
- 页数:50
- 大小:399.91KB
人工智能试题集15006Word格式.docx
《人工智能试题集15006Word格式.docx》由会员分享,可在线阅读,更多相关《人工智能试题集15006Word格式.docx(50页珍藏版)》请在冰豆网上搜索。
9.Byvaryingtheweightsandthe(),wecanrealizeanylinearse
parationoftheinputspaceintoaregionthatyieldsoutput1,andanotherregi
onthatyieldsoutput0.
10.Byvaryingthe()andthethreshold,wecanrealizeanylinear
separationoftheinputspaceintoaregionthatyieldsoutput1,andanotherre
gionthatyieldsoutput0.
解答:
1.
2.
3.
4.
5.
6.
7.
8.
9.
10.
二.判断题
1.Acomputerwithatrillionterabytesofmemorycapableofatrillionteraflop
swouldbesmarterthanahumanbeing
2.Thehumanbraincanbedescribed,toafirstapproximation,asaverylargem
ultilayerfeedforwardneuralnetwork
3.AsystemmustthinklikeahumaninordertopasstheTuringTestreliably.
4.Exactmachinetranslationisavailablenow.
5.AI,broadlydefined,isconcernedwithintelligencebehaviorinartifacts.
6.AIisthestudyofintelligenceindependentofitsembodimentinhumans,anim
alsormachines
7.AIisthestudyofhowtodothingswhichatthemomentpeopledobetter
8.AIisthescienceofmakingmachinesdothingsthatwouldrequireintelligenc
eifdonebymen.
9.AIisthepursuitofmetaphysicsbyothermeans.
10.AIistheuseofcomputerprogramsandprogrammingtechniquestocastlighto
ntheprinciplesofintelligenceingeneralandhumanthoughtinparticular
三.应用题
Chapter2.Stimulus-ResponseAgent
1.Eachruleinproductionsystemiswrittenintheform(
)
1.Complexorganismsdonotjustperceiveandact,buttheyalsohaveaninterna
lstatethatchangesbasedonthesuccessofpreviousperception-actioncyclesa
ndthisisthemechanismoflearning
2.Productionsystemsareastandardizedwaytorepresentactionfunctions.
3.Aproductionsystemconsistsofanorderedlistofproductionrules
4.Inaproductionsystem,theactionofthefirstrulewhoseconditionevaluate
sto1isexecuted.
5.Productionsystemscannotbeimplementedaselectroniccircuits.
6.Byvaryingtheweightsandthethreshold,wecanrealizeanylinearseparatio
noftheinputspaceintoaregionthatyieldsoutput1,andanotherregionthat
yieldsoutput0.
7.Theprocedureofanagentgathersinformationaboutitsenvironmentispercep
tion.
8.wecandesignaTLUtorealizetheXORfunction
9.InordertorealizeXORwithTLUs,weneedtocombinemultipleTLUsintoane
twork.
10.TLUscanonlyrealizelinearlyseparablefunctions.
Chapter3.UninformedSearch
1.Manyproblemshavesearchspacessolargethattheycannotberepresentedby
()graphs.
2.Foreight-puzzleproblem,thenumberofnodesinthestate-spacegraphis(
3.Inprinciple,itis()(possible/impossible)totransformanimpl
icitrepresentationofagraphintoanexplicitone.
4.totransformanimplicitrepresentationofagraphintoanexplicitone,you
needgeneratesallofthenodesthatare()ofthestartnode(byap
plyingalloperatorsatthatnode),thengeneratesalloftheirsuccessors,and
soon.
5.()requirestheconstructionandmemorizationofalmo
stthecompletesearchtree.
6.()requiresthememorizationofonlythecurrentpath
andthebranchesfromthispaththatwerealreadyvisited.
7.()maysearchunnecessarilydeepforashallowgoal.
8.()isaninterestingcombinationofbreadth-firstand
depth-firststrategies
9.()anditerativedeepeningareguaranteedtofindthe
shortestpathtoasolution.
10.()andbreadth-firstsearchareguaranteedtofindthe
1.Breadth-firstsearchiscompleteevenifzerostep-costsareallowed.
2.Searchalgorithmscannotbeappliedincompletelyunobservableenvironments.
3.Breadth-firstsearchiscompleteifthestatespacehasinfinitedepthbutfi
nitebranchingfactor.
4.Breadth-firstisanoptimalsearchalgorithm.
5.Breadth-firstsearchfindsthenearestsolution,wheredistancemeasuresthe
numberofoperations.
6.Thesequenceofoperatorsalongapathfromstarttoagoaliscalledaplan.
7.Adecisiontreeisaspecialcaseofastate-spacegraph.
8.Decisiontreescanbeusedtomodelproblemsinwhichaseriesofdecisionsl
eadstoasolution.
9.Wecansolveallproblemsbyconstructingthecompletedecisiontreeandthen
findapathfromitsroottoaleafthatcorrespondstoasolutionoftheprobl
em.
10.Depth-firstsearchcanguaranteetofindtheshortestpathtoasolution
1.Search
Considertheunboundedregular2Dgridstatespaceshownbelow.Thestartsta
teistheorigin(marked)andthegoalstateisat(x,y).
(a)Whatisthebranchingfactorbinthisstatespace?
(b)Howmanydistinctstatesarethereatdepthk(fork>
0)?
(c)Breadth-firstseachwithoutrepeatedstatecheckingexpandsatmost()
nodesbeforeterminating.
(1)((4x+y+1-1)/3)-1
(2)4(x+y)-1(3)2(x+y)(x+y+1)-1
(d)BFSwithrepeated-statecheckingexpandsupto()nodesbeforetermina
ting.
(e)True/false:
h=|u-x|+|v-y|isanadmissibleheuristicforastateat
(u,v).
(f)True/false:
A*searchwithrepeated-statecheckingusinghexpandsO(x+y)
nodesbeforeterminating.
(g)True/false:
hremainsadmissibleifsomelinksareremoved.
(h)True/false:
hremainsadmissibleifsomelinksareaddedbetweennonadjac
entstates.
2.Missionariesandcannibals(15Points)
Themissionaries(传教士)andcannibals(食人者)problemisusuallystatedasf
ollows.Threemissionariesandthreecannibalsareonleftsideofariver,alon
gwithaboatthatcanholdoneortwopeople.Findawaytogeteveryonetothe
rightside,withouteverleavingagroupofmissionariesinoneplaceoutnumber
edbythecannibalsinthatplace.
Wecansearchinthestatespacesofthisproblemtosolveit.Sowehaveto
definethestateandtheoperatorsfirstly.Thestatesandoperatorsaredefined
asbelow:
State:
Astateconsistsofanorderedsequenceofthreenumbersrepresenting
thenumberofmissionaries,cannibals,andboatsontheleftsideoftheriver.
Thus,thestartstateis(3,3,1)andthegoalstateis(0,0,0).
Operators:
Wedefinepijasboatingimissionariesandjcannibalsfromleft
sideoftherivertotherightsideandqijasboatingimissionariesandjcann
ibalsfromrightsideoftherivertotheleftside.
Drawthestate-spacegraphofthisproblem.Youdonotneedtodrawanysta
tes;
justcompletethegraphthatIhavegiven.Youmaymarktheoperatorpijon
lybesideeveryedge.(Becauseoperatorqijisthesameaspij)
3.Search
Considerafinitetreeofdepthdandbranchingfactorb.(Atreeconsistingo
fonlyarootnodehasdepthzero;
atreeconsistingofarootnodeanditsbsu
ccessorshasdepth1;
etc.)Supposetheshallowestgoalnodeisatdepthg≤d.
1.Whatistheminimumandmaximumnumberofnodesthatmightbegeneratedby
adepth-firstsearchwithdepthboundequaltod?
2.Whatistheminimumandmaximumnumberofnodesthatmightbegeneratedby
abreadth-firstsearch?
3.Whatistheminimumandmaximumnumberofnodesthatmightbegeneratedby
adepth-firstiterative-deepeningsearch?
(Assumethatyoustartwithaninitial
depthlimitof1andincrementthedepthlimitby1eachtimenogoalisfound
withinthecurrentlimit.)
4.Search
Assumethat10000nodespersecondcanbegeneratedinabreadth-firstsearch
.Supposealsothat100bytesareneededtostoreeachnode.Whatarethememory
andtimerequirementsforacompletebreadth-firstsearchofatreeofdepthd
andbranchingfactorof5?
Showtheseinatable.(Youcanuseapproximatenumber
swhentimeisbetterexpressedinhour
- 配套讲稿:
如PPT文件的首页显示word图标,表示该PPT已包含配套word讲稿。双击word图标可打开word文档。
- 特殊限制:
部分文档作品中含有的国旗、国徽等图片,仅作为作品整体效果示例展示,禁止商用。设计者仅对作品中独创性部分享有著作权。
- 关 键 词:
- 人工智能 试题 15006