lOMoARcPSD|15962747
Exam w 2020 blank - Exam
Grundlagen der Künstlichen Intelligenz (IN2062) (Technische Universität München)
Studocu wird von keiner Universität gesponsert oder unterstützt.
Heruntergeladen durch Daniel He ()
, lOMoARcPSD|15962747
Chair of Robotics, Artificial Intelligence and Real-time Systems
Department of Informatics
Technical University of Munich
Compliance to the code of conduct
Personal sticker I hereby assure that I solve and submit this exam myself under my own name by only using the allowed tools
listed below.
S5354
Signature or full name if no pen input available
Grundlagen der künstlichen Intelligenz
Exam: IN2062 / Endterm Date: Monday 1st March, 2021
Examiner: Prof. Dr.-Ing. Matthias Althoff Time: 18:15 – 19:45
P1 P2 P3 P4 P5 P6 P7 P8 P9 P 10
I
Working instructions
• This exam consists of 18 pages with a total of 10 problems.
Please make sure that you received a complete copy of the exam.
• The total amount of achievable credits in this exam is 61.5 credits.
• Detaching pages from the exam is prohibited.
• Allowed resources:
– a pen or PDF editor (do not write with red or green colors nor use pencils)
– a non-programmable pocket calculator
– the provided formula sheet
– empty scratch paper (do not submit)
• Please write answers on the exam booklet only. If you run out of space, write on the additional pages provided.
Notes on other paper will be disregarded.
• You must hand in all pages of the exam.
• Answers are only accepted if the solution approach is documented. Give a reason for each answer
unless explicitly stated otherwise in the respective subproblem.
• All subproblems are solvable independently from each other if not explicitly stated differently.
• Multiple-Choice questions are evaluated automatically. Use a cross to select your answer:
Answer A
⊠ Answer B
If you want to correct your answer, fill out the checkbox, and cross your new answer:
⊠ Answer A
Answer B
Notes next to the checkboxes cannot be evaluated.
Left room from to / Early submission at
Exam empty – Page – IN-gki-1-20210301-E5354-01
Heruntergeladen durch Daniel He ()
, lOMoARcPSD|15962747
Problem 1 Search (10.5 credits)
In the following tasks we search for a path from node A to node G , if not stated otherwise. If multiple nodes can be
explored next, alphabetic ordering should be used as the tie breaker, e.g., if B and C are added to the frontier, B is
added first.
On each of the following graphs we apply breadth-first (BFS) and depth-first (DFS) Graph-Search. Find out which
graphs are explored by each algorithm in the order A , B, C, D .
1 2 3
A B A B A B
C D C D C D
E G E G E G
a) Tick all graphs that are explored in the order A , B, C, D by BFS:
2 1 3
b) Tick all graphs that are explored in the order A , B, C, D by DFS:
3 2 1
0 c) Name another uninformed search algorithm that explores the nodes in graph 2 in the same order as BFS:
1
d) Does Depth-First Tree-Search terminate for graph 1 (0.5 points)?
Yes No
0 e) State the first four nodes visited by DFS Tree-Search searching from A to G on graph 1.
½
IN-gki-1-20210301-E5354-02 – Page – Page empty
Heruntergeladen durch Daniel He ()
Exam w 2020 blank - Exam
Grundlagen der Künstlichen Intelligenz (IN2062) (Technische Universität München)
Studocu wird von keiner Universität gesponsert oder unterstützt.
Heruntergeladen durch Daniel He ()
, lOMoARcPSD|15962747
Chair of Robotics, Artificial Intelligence and Real-time Systems
Department of Informatics
Technical University of Munich
Compliance to the code of conduct
Personal sticker I hereby assure that I solve and submit this exam myself under my own name by only using the allowed tools
listed below.
S5354
Signature or full name if no pen input available
Grundlagen der künstlichen Intelligenz
Exam: IN2062 / Endterm Date: Monday 1st March, 2021
Examiner: Prof. Dr.-Ing. Matthias Althoff Time: 18:15 – 19:45
P1 P2 P3 P4 P5 P6 P7 P8 P9 P 10
I
Working instructions
• This exam consists of 18 pages with a total of 10 problems.
Please make sure that you received a complete copy of the exam.
• The total amount of achievable credits in this exam is 61.5 credits.
• Detaching pages from the exam is prohibited.
• Allowed resources:
– a pen or PDF editor (do not write with red or green colors nor use pencils)
– a non-programmable pocket calculator
– the provided formula sheet
– empty scratch paper (do not submit)
• Please write answers on the exam booklet only. If you run out of space, write on the additional pages provided.
Notes on other paper will be disregarded.
• You must hand in all pages of the exam.
• Answers are only accepted if the solution approach is documented. Give a reason for each answer
unless explicitly stated otherwise in the respective subproblem.
• All subproblems are solvable independently from each other if not explicitly stated differently.
• Multiple-Choice questions are evaluated automatically. Use a cross to select your answer:
Answer A
⊠ Answer B
If you want to correct your answer, fill out the checkbox, and cross your new answer:
⊠ Answer A
Answer B
Notes next to the checkboxes cannot be evaluated.
Left room from to / Early submission at
Exam empty – Page – IN-gki-1-20210301-E5354-01
Heruntergeladen durch Daniel He ()
, lOMoARcPSD|15962747
Problem 1 Search (10.5 credits)
In the following tasks we search for a path from node A to node G , if not stated otherwise. If multiple nodes can be
explored next, alphabetic ordering should be used as the tie breaker, e.g., if B and C are added to the frontier, B is
added first.
On each of the following graphs we apply breadth-first (BFS) and depth-first (DFS) Graph-Search. Find out which
graphs are explored by each algorithm in the order A , B, C, D .
1 2 3
A B A B A B
C D C D C D
E G E G E G
a) Tick all graphs that are explored in the order A , B, C, D by BFS:
2 1 3
b) Tick all graphs that are explored in the order A , B, C, D by DFS:
3 2 1
0 c) Name another uninformed search algorithm that explores the nodes in graph 2 in the same order as BFS:
1
d) Does Depth-First Tree-Search terminate for graph 1 (0.5 points)?
Yes No
0 e) State the first four nodes visited by DFS Tree-Search searching from A to G on graph 1.
½
IN-gki-1-20210301-E5354-02 – Page – Page empty
Heruntergeladen durch Daniel He ()
