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 company is planning a party for its employees. The organizers of the party want it to be a fun party, so they have assigned a fun rating to every employee (for any employee x, x's fun rating is denoted by fun(x)) and are planning to invite employees that will maximize fun. The employees at the company are organized into a strict hierarchy, which is encoded as a tree T rooted at the president root(T) of the company. Each node is an immediate supervisor of its children. However, there is a restriction: An employee and his immediate supervisor (his parent in the tree) cannot both attend, because otherwise there would be no fun at all.
a) Give an algorithm that makes a guest list for the party that maximizes the sum of fun ratings of the guests. Denoting the total number of company employees by n, your function should have O(n) time complexity. Show the pseudocode, argue that your algorithms is correct, and argue that its complexity is indeed O(n). Again, make sure that for any guest, the guest's immediate supervisor does not attend (and at the same time, that the overall fun rating of guests is maximized).
b) How would you modify your algorithm to always select the president of the company (regardless of his fun rating or the consequences on the overall amount of fun we can achieve)? How would the time complexity change? Show the modification of the pseu- docode, argue that your modification solves this part correctly, and explain what the new time complexity is.
The recent discovery of the following fragment of uncommented procedural C code in the Sunlab has caused a big scandal. What is the worst-case time complexity of foo(a,1,N,k), and for which inputsdoes it occur?
Using only asymmetric encryption algorithms write down any steps taken by Bob which permit him to read the message.
Design an algorithm to solve the Spectral Assembly problem under the above conditions. Does the problem have a unique solution?
What factors and principles should the federal government take into account when considering indecency regulation issues?
Running time of quicksort can be enhanced in practice by taking advantage of fast running time of insertion sort when its input is "nearly" sorted.
Expalin the search algorithm that results from each of the following special cases. How does it relate to other algorithms we have discussed.
Determine an algorithm which works directly with this graph representation, and calculates minimum number of semesters necessary to complete the curriculum.
Communication A significant distinction between online and face-to-face classes lies in the area of communication.
Calculate the worst-case run-time complexity of your algorithm and prove optimality of the solution it gives. Suppose that the road is a straight line with a western end and an eastern end.
Construct a simple threat model that describes the risk this represents: attacker(s), attack vector, vulnerability, assets, and likelihood of occurrence, likely impact, and plausible mitigations.
Determine the mean salary as well as the number of salaries.
In which view can you see header and footer areas of worksheet?
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: +1-415-670-9521
Phone: +1-415-670-9521
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd