Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
Question:
(a) Assume you are a taxi driver. Your taxi can hold four passengers. Passengers pay a flat fee for a ride to the airport, so your goal is to pick up four passengers and take them to the airport in the smallest number of miles. Your world will be modelled as a graph of locations with distances between them. Some, but not all, of the locations have passengers that you can pick up.
(i) Explain the state space of this search problem.
(ii) What would be a good cost function for this search problem?
(iii) Now, consider a case where passengers have to pay according to how far away they are from the airport when they are picked up (note: they don't pay according to how long a ride they take in your taxi, but according to the length of the shortest path from their pickup point to the airport). Explain the state space for this search problem.
(iv) What would be a good cost function for this version of the problem? You still have desire to save petrol.
(v) Is uniform cost search guaranteed to find the optimal solution in either or both versions of the problem? Justify your answer.
(b)
Give brief definitions of the following terms: • Constraint satisfaction problem, • Back-tracking search • Forward checking • Arc consistency
Define the full form of SSL SSL has become fundamental to the spread of Internet community, and commerce and trade over Internet. Over years, the spread of its use for an incr
Q. Origin of RISC? In the 1980s a new philosophy developed having optimizing compilers which could be used to compile 'normal' programming languages down to instructions which
Q. Standards for scan codes ? There are 3 standards for scan codes: Mode1 (83-key keyboard PC, PC-XT) and Mode2 (84-key AT keyboard) and Mode3 (101-key keyboard onwards). In Mo
Artificial Intelligence 1. Explain about artificial intelligence? What are the achievements of AI? 2. Elaborate state space search briefly. 3. Prove that A* is optimal.
Consider the state transition diagram of Figure 3.9b . Suppose that it is time for the OS to dispatch a process and that there are processes in both the Ready state and the Ready/S
Convert (177.25) 10 to octal Ans. 177.25) 10 = ( ) 8 Firstly we take integer part Hence (177) 10 = (261) 8 Now as 0.25 x 8 = 2.00 and 0.00 x 8 = 0 Therefor
What is Race condition? Race condition: The circumstances where several processes access - and manipulate shared data-concurrently. The last value of the shared data depends
Q. Explain about Programmable Logic Array? Until now individual gates are considered as fundamental building blocks from that different logic functions can be derived. With the
Q. Illustrate program on hypothetical machine? The program given in figure above is a hypothetical program which performs addition of numbers stored from locations 2001 onwards
Why IO devices cannot be connected directly to the system bus? Ans: The IO devices can't be directly connected to the system bus because the following reason A) The data tra
Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd