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?
A binary tree in which if all its levels except possibly the last, have the maximum number of nodes and all the nodes at the last level appear as far left as possible, is called as
#question. merging 4 sorted files containing 50,10,25,15 records will take time?
whats the definition of ADT and data type?
Comp are two functions n 2 and 2 n / 4 for distinct values of n. Determine When s ec on d function b ec om es l a r g er th an f i r st functi
How do you find the complexity of an algorithm? Complexity of an algorithm is the measure of analysis of algorithm. Analyzing an algorithm means predicting the resources that
using a program flowchart design a program to illustrate pop and push operation
Q. What do you understand by the tree traversal? Write down the procedure for traversing a binary tree in preorder and execute it on the following tree. Ans: Th
Graph terminologies : Adjacent vertices: Two vertices a & b are said to be adjacent if there is an edge connecting a & b. For instance, in given Figure, vertices 5 & 4 are adj
sir how can i explain deletion process in a data structure
write an algorithm to find the average number of occurances of MECHANIL in an english passage
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