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
Q. Describe short note on Information system for strategic advantage? Ans. Strategic role of information systems engage using information technology to develop products or serv
Convert the following into SOP form 1. (A+B) (B'+C) (A'+ C) 2. (A'+C) (A'+B'+C') (A+B') 3. (A+C) (AB'+AC) (A'C'+B)
Why pointer variable sometimes desirable to pass a pointer to a function as an argument? Frequently, a called function needs to make changes to objects declared in the calling
Binary Resolution: We looked at unit resolution (a propositional inference law) in the last lecture: A ∨ B, ¬B /A We may have this a bit further to propositional bin
Question: a) Consider a car having a collision detection mechanism. Write an algorithm (in simple English) to illustrate the collision detection mechanism. b) The same car
what is semi conductor
Dynamic partitioning: To rise above from difficulties with fixed partitioning, partitioning can be done dynamically, which called dynamic partitioning. Having it, the primary
Define data path. The registers, the ALU, and the interconnecting bus are collectively referred to as the data path.
As CMOS is a special chip with its own battery, the best way to clear out a CMOS chip is to cut off it from its power supply. To clear the CMOS password you just take away the
How the transaction that are programmed by the user can be protected? By executing an authority check.
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