b) You are given the task of analyzing how joyful a person is. If you are given a list of numbers that represent the emotional value of an individual on each day, design a divide and conquer algorithm to find the most joyous interval of the person. The measure of joy is given as sum of the values in interval multiplied by the smallest integer in the interval.

b) You are given the task of analyzing how joyful a person is. If you are given a list of numbers that represent the emotional value of an individual on each day, design a divide and conquer algorithm to find the most joyous interval of the person. The measure of joy is given as sum of the values in interval multiplied by the smallest integer in the interval.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

1. Design an algorithm to find the weighted sum of four test scores (https://en.wikipedia.org/wiki/Weight_function). Assume that the weights have been accurately calculated in advance such that their sum equals one. Your algorithm must-read in the four test scores and four corresponding weights in the following order: score1 weight1 score2 weight2 score3 weight3 score4 weight4 Write your algorithm such that it can be run with any set of data values. However, you can test your algorithm on the following sample data to verify that the result is 70: 90 0.10 80 0.20 70 0.30 60 0.40 2. Write an algorithm that prompts the user for the radius, in inches, and price of a pizza, and then reads in those values. Finally, have the algorithm compute and output the pizza’s cost per square inch. 3. Sports exercise advisor algorithm. In this algorithm you will start out with a temperature value in Celsius, so you do not need to ask the user for it. First, convert the temperature to Fahrenheit.…
Please give me solution ASAP
Write a program function (in any programming language) that will find and add 3 digitsodd numbers which are in the range from 1 to the first five digits of your student ID and thendivide the summation by the rest of the digits in your student ID. Find the CyclomaticThe complexity of the code segment and show the different basic paths for test cases.
Please code this in Python according to the function given below.
e input is: 3 the output is: heads heads tails For reproducibility needed for auto-grading, seed the program with a value of 1. In a real program, you would seed with the current time. In that case, every program's output would be different, which is what is desired but can't be auto-graded. Note: A common student mistake is to seed before each call to random.randint(). But seeding should only be done once, at the start of the program, after which random.randint() can be called any number of times. Your program must define and call the heads_or_tails() function that randomly picks 0 or 1 and returns "heads" or "tails". Assume the value 0 represents "heads" and 1 represents "tails". i have this: import random def heads_or_tails(n): i=0 while i<n: random.randint(0,1) if num==0: print('heads') else: print('tails') i = i + 1 if __name__ == '__main__': random.seed(1) number_of_flips = int(input()) heads_or_tails(number_of_flips) it…
Instructions for Questions 1 through 6. For each piece of pseudocode, give the runtime in terms of N. Your answer should give an exact value for the number of times the inner loop runs (i.e. the final value of count), and it should also give the order of growth of the runtimes using big-Oh notation. You can assume that N "comes out nicely" with respect to loops. For example, if the loop counts by 2, you can assume it is an even number, and if it multiplies or divides by 2 each time, you can assume it is a power of 2. Note: log(N!) is 0(NlogN).
Please assist with problem.
Aiden Turner is paid every Friday. He is scheduled to receive a raise next week; however, he isn’t sure of the exact raise percentage. He wants a program that calculates and displays his new weekly pay. Create two algorithms for this problem: one that does not use a processing item and one that does. Desk-check each algorithm twice. First, use $500 and 4% as the current weekly pay and raise percentage, respectively; then use $600 and 2%.
In Python input 1 and input 2’s degree is 4 If input 1 and input 2 have same parents, result return 0 Else if input 1 and input 2 have same grandparents , result return 1 Else if input 1 and input 2 have same great_grandparents , result return 2 Else if input 1 and input 2 have same great_great_grandparents , result return 3 Continue until found they have the same great_great_great…._grandparents, For adding one great, result +1 Else: if no relationship between two input, return -1 tree = [[‘Max’, None , None], [‘Luc’, ‘Max’, None], [‘Lue’, ’Max’, None], [‘Joy’, ‘Luc’, ‘Yoyo’], [‘Eva’, ‘Joy’, ‘Zoe’,], [‘Julie’, ‘Geo’, ‘Eva’], [‘input1’, ‘Brand’, ‘Julie’], [‘Jim’, ‘Lue’, ‘Rae’], [‘Gil’, ‘Jim’, ‘Ree’], [‘Rose’, ‘Gil’, ‘Mandy’] [‘input2’, ‘James’, ‘Rose’] this follow by [people, father, mother] Make the function def degree(input1, input 2, tree)
Max Jones belongs to a CD (compact disc) club that allows him to buy CDs at a much lower price than his local music store charges. He wants to know how much he saves by buying all of his CDs through the club rather than through the music store. The output is the savings. The input is the number of CDs purchased, the club CD price, and thestore CD price. The algorithm should use two processing items: one for the cost of buying the CDs through the club, and the other for the cost of buying the CDs through the store. Write the algorithm using pseudocode.
Please assist me with these questions.(for the 1st part just complete the bolded area. All other areas have been completed. Then complete the 2nd part 1. Devise an algorithm to receive a positive number, n, and output all prime numbers that are smaller than n and have the digit 5. For example, if n is 100, the program should output 5, 53 and 59. Your solution should have a main algorithm and two sub-algorithms, let's call them prime(num) and has5(num). Trace your algorithm and sub-sub-algorithm for the input 15. You should provide pre- and post-conditions for all your 3 (sub)algorithms. Now, let's trace this algorithm for the input n = 15: For i = 2 to 14, we check if i is prime and if i contains the digit 5. The prime numbers less than 15 are 2, 3, 5, 7, 11, 13. Among these, only 5 contains the digit 5. So, the output for n = 15 is [5]. 2. I also need help with creating JavaScript code for the flowchart provided below. Note: You will have to implement several functions that…
Please give me correct solution.