Subject: Design & Analysis of algorithmsQuestions:Write your theoretical analysis for the brute force caseWrite your theoretical analysis for the divide-and-conquer caseNote: The algorithms of both techniques are both answered before but I need to know their theoretical analysis. - Problem StatementDuring tough times like these, investment becomes more uncertain with more dangers. To solve it, we might try to train a model to decide whento buy or sell. Therefore, to provide it with correct data, we plan to design an algorithm that answers:• what is the perfect moment to buy and when to sell to maximize your profit?Assume you must buyInput:changes : array listing changes in the prices, where indices represent days; it has at least two valuesOutput:i : index of the change before which we buyj: index of the change before which we sellmaxProfit : the profit of this intervalExample:Assume the below table contains the prices of a particular stock over dayspriceschangesDay Value50-163132707340-304551556510660-57721287979.68-1110746.Therefore, the output of maxProfit([13,7,-30,15,10, -5,12,7,-11,6]) should be (3, 7, 39) . This is because our maximum profit would be39 when we buy the stock at day 4, index of 3, and sell after day 8, index of 7. Then, the total profit is 15+ 10 – 5+ 12+7= 39

Subject: Design & Analysis of algorithms Questions: Write your theoretical analysis for the brute force case Write your theoretical analysis for the divide-and-conquer case Note: The algorithms of both techniques are both answered before but I need to know their theoretical analysis.

Subject: Design & Analysis of algorithms Questions: Write your theoretical analysis for the brute force case Write your theoretical analysis for the divide-and-conquer case Note: The algorithms of both techniques are both answered before but I need to know their theoretical analysis.

C++ for Engineers and Scientists

4th Edition

ISBN:9781133187844

Author:Bronson, Gary J.

Publisher:Bronson, Gary J.

Chapter4: Selection Structures

Section: Chapter Questions

Problem 14PP

See similar textbooks

Similar questions

Correct answer will be upvoted else Multiple Downvoted. Computer science. you can choose two indices x and y (x≠y) and set ax=⌈axay⌉ (ceiling function). Your goal is to make array a consist of n−1 ones and 1 two in no more than n+5 steps. Note that you don't have to minimize the number of steps. Input The first line contains a single integer t (1≤t≤1000) — the number of test cases. The first and only line of each test case contains the single integer n (3≤n≤2⋅105) — the length of array a. It's guaranteed that the sum of n over test cases doesn't exceed 2⋅105. Output For each test case, print the sequence of operations that will make a as n−1 ones and 1 two in the following format: firstly, print one integer m (m≤n+5) — the number of operations; next print m pairs of integers x and y (1≤x,y≤n; x≠y) (x may be greater or less than y) — the indices of the corresponding operation. It can be proven that for the given constraints it's always possible to find a correct sequence…
Using a Java program solve the following problem using arrays: Past A: Coupon collector is a classic statistic problem with many practical applications. The problem is to pick objects from a set of objects repeatedly and determine how many picks are needed for all the objects to be picked at least once. A variation of the problem is to pick cards from a shuffled deck of 52 cards repeatedly and find out how many picks are needed before you see one of each suit. Assume a picked card is placed back in the deck before picking another. Write a program to simulate the number of picks needed to get total of four cards from each different suit and display the four cards picked (it is possible that a card may be picked twice). Here is a sample run of the program: Queen of Spades 5 of Clubs Queen of Hearts 4 of Diamonds Number of picks: 12 Sample run explanation: As you see in the above run, 12 picks are made to get the four cards from different suits. The other 8 picks (12-4-8) were from the…
Need help making C or java code for these steps : Assume there are N=1,000 people in the small place. Use a simple array to record the status of each person, call it “infected”. For example, infected[1]=TRUE if user 1 is infected. Each infected individual may come into contact with ratio of all people in each round of infection. Each contact between an infected individual and a healthy individual has a chance of that the healthy individual will be infected.
Using Java, Dr. Choi has 5 students who took a midterm and final. 1.First, she wants to store their midterm and final results in two different 1-dimensional arrays and print each of them to a console. 2.She also wants to find average scores of the midterm and final using loops. 3.Second, she wants to store them in one 2-dimensional array and print it to the console. Each row has test scores of the midterm and final. 4.Modify the program above using a 2-dimensional array: Search the highest test score at midterm and lowest test score at final and print them: Pass an array to a method for finding highest score at midterm and lowest test score at final. There are two methods invoked in main () method. One is for finding the highest score and the other one is for finding the lowest score.
Airport security officials have confiscated several item of the passengers at the security check point. All the items have been dumped into a huge box (array). Each item possesses a certain amount of risk[0,1,2]. Here, the risk severity of the items represent an array of N number of integer values. The task here is to sort the items based on their levels of risk in the array. The risk values range from 0 to 2. Example: Input : 7 Value of N [1,0,2,0,1,0,2]-> Element of arr[0] to arr[N-1], while input each element is separated by new line. Output: 0001122 Element after sorting based on risk severity
Problem Statement Particulate matters are the biggest contributors to Delhi pollution. The main reason behind the increase in the concentration of PMs include vehicle emission by applying Odd Even concept for all types of vehicles. The vehicles with the odd last digit in the registration number will be allowed on roads on odd dates and those with even last digit will on even dates. Given an integer array all, contains the last digit of the registration number of N vehicles traveling on date D(a positive integer). The task is to calculate the total fine collected by the traffic police department from the vehicles violating the rules. Note: For violating the rule, vehicles would be fined as X Rs. Example 1: Input : 4-> Value of N (5,2,3,7) -> a[], Elements a[0] to a[N-1], during input each element is separated by a new line 12 -> Value of D, i.e. date 200 > Value of x i.e. fine
3D Array: Use python to solve this problem. We already know how to operate 2D arrays. Now we have to use 3D arrays in order to construct LCS with 3 parameters. Multidimensional array means multiple arrays of different dimensions or sizes can be held by a single array. We will learn about 3D arrays with an example. Suppose we want to store midterm and final marks separately of four different courses of three students in a single array. We can easily do it by using a 3D array. Python: for i in range(len(A)): print("Student: ",(i+1)) for j in range(len(A[i])): print("Course: ",(j+1)) print("Marks of Mid and Final: ") for k in range(len(A[i][j])): print(A[i][j][k],end=" ") print() print() OUTPUT: Student: 1 Course: 1 Marks of Mid and Final: 30 25 Course: 2 Marks of Mid and Final: 35 40 Course: 3 Marks of Mid and Final: 41 45 Course: 4 Marks of Mid and Final: 26 26 Student: 2 Course: 1 Marks of Mid and Final: 41 45…
Computer Engineering Lab The Government of United States of America has decided to issue new currency notes with special protection features to so as to commemorate a great mathematician. They have decided to issue notes summing up to N and all the sums from 1 to N should only made by selecting some of the notes in only one unique way. With n = 5 the sets {1,1,1,1,1}, {1,2,2}, {1,1,3} are valid. Your task is to design a C++ code that output the solution in one line. Sample Input - 100 Sample Output - 3
Tiling: The precondition to the problem is that you are given threeintegers n, i, j, where i and j are in the range 1 to 2n. You have a 2n by 2n squareboard of squares. You have a sufficient number of tiles each with the shape . Your goalis to place nonoverlapping tiles on the board to cover each of the 2n × 2n tiles except forthe single square at location i, j. Give a recursive algorithm for this problem in whichyou place one tile yourself and then have four friends help you. What is your base case?
Write in C++ Alice is trying to monitor how much time she spends studying per week. She going through her logs, and wants to figure out which week she studied the least, her total time spent studying, and her average time spent studying per week. To help Alice work towards this goal, write three functions: min(), total(), and average(). All three functions take two parameters: an array of doubles and the number of elements in the array. Then, they make the following computations: min() - returns the minimum value in the array sum() - returns the sum of all the values in the array average() - returns the average of all the values in the array You may assume that the array will be non-empty. Function specifications: Function 1: Finding the minimum hours studied Name: min() Parameters (Your function should accept these parameters IN THIS ORDER): arr double: The input array containing Alice's study hours per week arr_size int: The number of elements stored in the array Return Value:…
Assignment A scientist has developed a mathematical model for a physical process, and he wants to check how good is model is. To evaluate the correctness of his model, he wants to test the results of his model under certain parameters and compare them with experimental results. Write a program that first reads the number of tests (testCount) as an int followed by the results of each test according to the model as a double array (testModel) and finally the results of each test according to experiments as a double array (testExperiment). Then, the program should calculate the error of the model by evaluating the average of the absolute values (i.e., mutlak değer) of the differences between the model result and experimental result (see formula below) using a function. ItestModel,- textExperiment, testCount NOTE: Individual absolute value of the difference between the model value and the experiment value calculations MUST be done in the function. Every other functionality MUST be done in…
Write a program that prints an mxn matrix whose dimensions are specified by the user. Let the matrix values be random variables. You must use it within the repetition cycle. Example format: Enter dimension of matrix mxn: 2 4 The 2x4 matrix is : 1 2 3 4 5 6 7 8