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!
(a) Describe the steps involved in the process of decision making under uncertainty.
(b) Explain the following principles of decision making:
(i) Laplace,(ii) Hurwicz.
(c) Mr Ryan wants a set of buttons sewn on his jacket, but is uncertain whether he wants black, white, gold, silver, green or violet buttons. A tailor will sew on a set of black buttons for Rs8, a white set for Rs10, a gold set for Rs11, a silver set for Rs9, a green set for Rs6 and a violet set for Rs7. If Mr Ryan changes his mind, then the tailor offers to replace only once whichever selected set for an additional charge of Rs4.
(i) Construct the pay-off table which shows the price Mr Ryan will pay for the buttons depending on whether he keeps the set of buttons or replaces it with another one.
(ii) Which set of buttons will Mr Ryan order if he applies Laplace and Hurwicz [take =0:6] criteria respectively?
algorithm and flow chart to find weather the given numbers are positive or negative or neutral
Define the terms i) Key attribute ii) Value set Key attribute: An entity type usually has an attribute whose values are distinct fr
What is quick sort? Answer Quick sort is one of the fastest sorting algorithm used for sorting a list. A pivot point is chosen. Remaining elements are divided or portio
Ask quapplication of data structure estion #Minimum 100 words accepted#
Problem 1. Explain about the doubly linked list with neat diagram. Diagram Explaining doubly linked list 2. Explain what are the criteria to be used in evaluatin
A circular queue can be implemented through arrays or linked lists. Program 6 gives the array implementation of any circular queue. Program 6: Array implementation of any Circu
Using the cohen sutherland. Algorithm. Find the visible portion of the line P(40,80) Q(120,30) inside the window is defined as ABCD A(20,20),B(60,20),C(60,40)and D(20,40)
Generally, Computational complexity of algorithms are referred to through space complexity (space needed for running program) and time complexity (time needed for running the progr
Aa) Come up with an ERD from the following scenario, clearly stating all entities, attributes, relationships before final sketch of the ERD: [50 m
The searching method are applicable to a number of places in current's world, may it be Internet, search engines, text pattern matching, on line enquiry, finding a record from data
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