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?
The complexity of multiplying two matrices of order m*n and n*p is mnp
An interesting application or implementation of trees is the playing of games such as tie-tac-toe, chess, nim, kalam, chess, go etc. We can depict the sequence of possible moves
Merging 4 sorted files having 50, 10, 25 and 15 records will take time O (100)
Which of the sorting algorithm is stable Heap sorting is stable.
Evaluate the frequency counts for all statements in the following given program segment. for (i=1; i ≤ n; i ++) for (j = 1; j ≤ i; j++) for (k =1; k ≤ j; k++) y ++;
Post order traversal: The children of node are visited before the node itself; the root is visited last. Each node is visited after its descendents are visited. Algorithm fo
give some examples of least cost branch and bound method..
Two linked lists are having information of the same type in ascending order. Write down a module to merge them to a single linked list that is sorted merge(struct node *p, stru
A database is a collection of data organized in a manner that facilitates updation, retrieval and management of the data. Searching an unindexed database having n keys will have a
The advantage of list over Arrays is flexibility. Over flood is not a problem until the computer memory is bushed. When the individual record are quite large, it may be difficult t
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