Object the value of the maximum subsequence

Assignment Help Basic Computer Science

Reference no: EM13968055

1. The maximum contiguous subsequence sum algorithms in the text do not give any indication of the actual sequence. Modify them so that they return in a single object the value of the maximum subsequence and the indices of the actual sequence.

2. a. Write a program to determine if a positive integer, N, is prime.

b. In terms of N, what is the worst-case running time of your program? (You should be able to do this inO(√N).)

c. Let B equal the number of bits in the binary representation of N. What is the value of B?

d. In terms of B, what is the worst-case running time of your program?

e. Compare the running times to determine if a 20-bit number and a 40-bit number are prime.

f. Is it more reasonable to give the running time in terms of N or B? Why?

Reference no: EM13968055

Questions Cloud

State an existence theorem for the differential equation : State an existence theorem for the differential equation - Find y0, y1, y2 after converting it to an integral equation

Number of multiplications used by the fast exponentiation : Give a precise count on the number of multiplications used by the fast exponentiation routine. (Hint: Consider the binary representation of N.)

What are the major sources of revenue : State and local governments are accountable to much more than private investors. They are accountable to the community as a whole.

Create a guide to leveraging expatriates : Create a guide to leveraging expatriates. The guide should include four to six sources that address benefits and challenges of sending expatriates to other countries.

Object the value of the maximum subsequence : 1. The maximum contiguous subsequence sum algorithms in the text do not give any indication of the actual sequence. Modify them so that they return in a single object the value of the maximum subsequence and the indices of the actual sequence.

Calculate the marginal after-tax winnings : Calculate the marginal after-tax winnings - find that jackpot size (to the nearest dollar) and explain what is significant (in terms of winnings) about that jackpot size.

Minimum positive subsequence sum : 1. Give ef?cient algorithms (along with running time analyses) to a. Find the minimum subsequence sum. b. Find the minimum positive subsequence sum.

Determining the input size : An algorithm takes 0.5 ms for input size 100. How long will it take for input size 500 if the running time is the following (assume low-order terms are negligible)?

Determine the mesh current i1 : Consider the circuit shown in the figure below. Suppose that R1 = 6Ω , R2 = 13Ω and R3 = 17Ω. Determine the mesh current i1. Express your answer to three significant figures and include the appropriate units.

User Account

All Pages