Microsoft Project 2016: The “Microsoft Project 2016” refers to project management software which helps the project managers for schedule development and resource assignment for tasks. It also helps the project managers to track progress, manage budget, and analyze assignments. It is a midrange tool offered by Microsoft at the year 2016. Other project management software tools: The list of other project management software tools is as follows: SCORO: It is one of the project management software, which helps to rationalize the complete work progress, so that the users need not use different tools for different tasks. PROOFHUB: It is one of the project management software, which has a simple and very good user interface to collaborate team more proficiently. ASANA (Smart phone application): It is one of the project management software for smart phones, which will support small, medium, and large team size and also it integrates Microsoft Office, CSV files, Gmail, and so on.

Question

Design a dynamic programming algorithm for the Longest Alternating Subsequence problem described below: Input: A sequence of n integers Output: The length of the longest subsequence where the numbers alternate between being larger and smaller than their predecessor The algorithm must take O(n²) time. You must also write and explain the recurrence. Example 1: Input: [3, 5, 4, 1, 3, 6, 5, 7, 3, 4] Output: 8 ([3, 5, 4, 6, 5, 7, 3, 4]) Example 2: Input: [4,7,2,5,8, 3, 8, 0, 4, 7, 8] Output: 8 ([4, 7, 2, 5, 3, 8, 0,4]) (Take your time with this for the subproblem for this one)

Answer 1

Question

100%

Chapter 1, Problem 7E

Program Plan Intro

Microsoft Project 2016:

The “Microsoft Project 2016” refers to project management software which helps the project managers for schedule development and resource assignment for tasks.

It also helps the project managers to track progress, manage budget, and analyze assignments.

It is a midrange tool offered by Microsoft at the year 2016.

Other project management software tools:

The list of other project management software tools is as follows:

SCORO:

It is one of the project management software, which helps to rationalize the complete work progress, so that the users need not use different tools for different tasks.

PROOFHUB:

It is one of the project management software, which has a simple and very good user interface to collaborate team more proficiently.

ASANA (Smart phone application):

It is one of the project management software for smart phones, which will support small, medium, and large team size and also it integrates Microsoft Office, CSV files, Gmail, and so on.

Explanation of Solution

b.

Comparing other tools with Project 2016:

Explanation of Solution

c.

Justification for investing in enterprise or portfolio project management (PPM) software:

Organizations can justify their investment in enterprise or PPM software because it offers following things:

It distributes flexible work management solutions among businesses, departments, and group...

Expert Solution & Answer

Trending nowThis is a popular solution!

See solution

Check out sample textbook solution

Students have asked these similar questions

Design a dynamic programming algorithm for the Longest Alternating Subsequence problem described below: Input: A sequence of n integers Output: The length of the longest subsequence where the numbers alternate between being larger and smaller than their predecessor The algorithm must take O(n²) time. You must also write and explain the recurrence. Example 1: Input: [3, 5, 4, 1, 3, 6, 5, 7, 3, 4] Output: 8 ([3, 5, 4, 6, 5, 7, 3, 4]) Example 2: Input: [4,7,2,5,8, 3, 8, 0, 4, 7, 8] Output: 8 ([4, 7, 2, 5, 3, 8, 0,4]) (Take your time with this for the subproblem for this one)

Design a dynamic programming algorithm for the Coin-change problem described below: Input: An amount of money C and a set of n possible coin values with an unlimited supply of each kind of coin. Output: The smallest number of coins that add up to C exactly, or output that no such set exists. The algorithm must take O(n C) time. You must also write and explain the recurrence. Example 1: Input: C24, Coin values = = [1, 5, 10, 25, 50] Output: 6 (since 24 = 10+ 10+1+1 +1 + 1) Example 2: Input: C = 86, Coin values = [1, 5, 6, 23, 35, 46, 50] Output: 2 (since 86 = 46+35+5)

Design a dynamic programming algorithm for the Longest Common Subsequence problem de- scribed below Input: Two strings x = x1x2 xm and y = Y1Y2... Yn Output: The length of the longest subsequence that is common to both x and y. . The algorithm must take O(m n) time. You must also write and explain the recurrence. (I want the largest k such that there are 1 ≤ i₁ < ... < ik ≤ m and 1 ≤ j₁ < ... < jk ≤ n such that Xi₁ Xi2 Xik = Yj1Yj2 ··· Yjk) Example 1: Input: x = 'abcdefghijklmnopqrst' and y = 'ygrhnodsh ftw' Output: 6 ('ghnost' is the longest common subsequence to both strings) Example 2: Input: x = 'ahshku' and y = ‘asu' Output: 3 ('asu' is the longest common subsequence to both strings)