Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

Figure 1: Map location representation. Jawab soalan berikut. Answer the following questions. a) Jika kedudukan semasa anda ialah di FPT dan anda akan ke CAN,

image text in transcribed

Figure 1: Map location representation. Jawab soalan berikut. Answer the following questions. a) Jika kedudukan semasa anda ialah di FPT dan anda akan ke CAN, berdasarkan Depth First Search (DFS), lukis pohon carian untuk tempat yang dilawati sehingga ke matlamat SAHAJA oleh DFS. If your current position is at FPT and you are going to CAN, based on Depth First Search (DFS), draw the search tree, ONLY for the visited places up to goal by the DFS. (4 markah/marks) b) Jika kedudukan semasa anda ialah di FPT dan anda akan ke CAN, berdasarkan Breadth First Search (BFS) Lukiskan pohon carian untuk tempat yang dilawati sehingga matlamat SAHAJA oleh BFS. If your current position is at FPT and you are going to CAN, based on Breadth First Search (BFS) Draw the search tree ONLY for the visited places up to goal by the BFS. c) Bandingkan penyelesaian DFS dan BFS berdasarkan peta dengan menyatakan bilangan nod yang dilawati serta terangkan kaedah carlan mana yang akan menemui matlamat dengan lebih pantas. Compare DFS and BFS solution according to the map by specifying the number of visited nodes and explain which search method will find the goal faster. (4 markah/marks) Figure 1: Map location representation. Jawab soalan berikut. Answer the following questions. a) Jika kedudukan semasa anda ialah di FPT dan anda akan ke CAN, berdasarkan Depth First Search (DFS), lukis pohon carian untuk tempat yang dilawati sehingga ke matlamat SAHAJA oleh DFS. If your current position is at FPT and you are going to CAN, based on Depth First Search (DFS), draw the search tree, ONLY for the visited places up to goal by the DFS. (4 markah/marks) b) Jika kedudukan semasa anda ialah di FPT dan anda akan ke CAN, berdasarkan Breadth First Search (BFS) Lukiskan pohon carian untuk tempat yang dilawati sehingga matlamat SAHAJA oleh BFS. If your current position is at FPT and you are going to CAN, based on Breadth First Search (BFS) Draw the search tree ONLY for the visited places up to goal by the BFS. c) Bandingkan penyelesaian DFS dan BFS berdasarkan peta dengan menyatakan bilangan nod yang dilawati serta terangkan kaedah carlan mana yang akan menemui matlamat dengan lebih pantas. Compare DFS and BFS solution according to the map by specifying the number of visited nodes and explain which search method will find the goal faster. (4 markah/marks)

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Database Systems Introduction To Databases And Data Warehouses

Authors: Nenad Jukic, Susan Vrbsky, Svetlozar Nestorov

1st Edition

1943153191, 978-1943153190

More Books

Students also viewed these Databases questions

Question

1+1

Answered: 1 week ago