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?
Midsquare Method :- this operates in 2 steps. In the first step the square of the key value K is taken. In the 2nd step, the hash value is obtained by deleting digits from ends of
It is a naturally occurring sorting method exemplified through a card player arranging the cards dealt to him. He picks up the cards like they are dealt & added them into the neede
1) preorder, postorder and inorder 2) The main feature of a Binary Search Tree is that all of the elements whose values is less than the root reside into the nodes of left subtr
A driver takes shortest possible route to attain destination. The problem which we will discuss here is similar to this type of finding shortest route in any specific graph. The gr
What are stored and derived attributes? Stored attributes: The attributes kept in a data base are called stored attributes. Derived attributes: The attributes that are
since the gregorian calendar was introduced in 1752,a leap year occurs every 4 years.you are to write a pseudo code to find out whether a year is a leap year.your progrm should dis
For preorder traversal, in the worst case, the stack will rise to size n/2, where n refer to number of nodes in the tree. Another method of traversing binary tree non-recursively t
Algorithm to find sum of square of a number
write an algorithm to delete an element x from binary search with time complex
Prove that uniform cost search and breadth- first search with constant steps are optimal when used with the Graph-Search algorithm (see Figure). Show a state space with varying ste
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