using java to solve this algorithm problem 1. GoodArrayFor a number N, a goodArray is the smallest possible array that consists of onlypowers of two (20, 21 ... 2k) such that the sum of all the numbers in the array isequal to N.For each query that consists of three integers /, r, and m, find out the product ofelements goodArray[1] through goodArray[r] modulo m when goodArray is sortedin non-decreasing order.ExampleFor N = 26, queries = [[1, 2, 1009], [3, 3, 5]]goodArray when sorted is [2,8,16].For query / = 1, r = 2, m= 1009, ans = goodArray[1] *goodArray[2] = (2*8) modulo1009 = 16.For query / = 3, r = 3, m = 5, ans=goodArray3 = (16) modulo 5 = 1.The answer is [16, 1].Function DescriptionComplete the function getQueryResults in the editor below.JThe answer is [16, 1].Function DescriptionComplete the function getQueryResults in the editor below.getQueryResults has the following parameters:long N: the integer Nint queries[q][3]: a 2D array of queries, each with 3 elements I, r, and m.Returnint answer[q]: the answers to the queriesConstraints• 1 ≤ N≤ 10181≤q≤ 105• 1≤m≤ 105• 1≤lsrs goodArray), where I goodArray/ denotes the length of the array► Input Format For Custom TestingJava 15Autocomplete Ready Ⓒ1 > import java.io.*; ...1415161718→ Info1920212223242526272815161718192021222324326class Result {2930313233 public class Solution [...272829303132below.*The function is expected to return anINTEGER ARRAY.*The function accepts following parameters:1. LONG INTEGER n* 2. 2D INTEGER_ARRAY queries*/InfoJava isAutocomplete Ready Ⓒ1 > import java.io.*;...14* Complete the 'getQueryResults' functionpublic static List getQueryResults(long n, List> queries) {// Write your code here}}*Custom Inclass Result {below.Line: 33 Col: 24?/** Complete the 'getQueryResults' function*The function is expected to return anINTEGER ARRAY.The function accepts following parameters:* 1. LONG INTEGER n* 2. 2D INTEGER_ARRAY queries*/public static List getQueryResults(long n, List> queries) {// Write your code here}

The function is expected to return an INTEGER_ARRAY.The function accepts the following…

Answered: using java to solve this algorithm…

Engineering

Computer Science

using java to solve this algorithm problem

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

Related questions

Q: Consider the following directions for shampooing hair: • Rinse hair • Put shamp0o on hair • Lather •…

A: It is a good example of Shampoing algorithm. But you can make it better using below algorithm

Q: Algorithm 8: Computing the power of a number Input:r, is a real number a E R, n is an integer…

A: Answer : The primary operation in this program are ;

Q: Sorting refers to the task of arranging a collection of items in a specific order, typically based…

A: The solution is given below with explanation

Q: a. Write a RECURSIVE algorithm (or a method) that to detect if a given array of integers is sorted…

A: According to our guidelines, we are allowed to solve only the first question, as they are both…

Q: Problem solving using recursion There are two skeleton programs, flesh them out following the…

A: We need to write a Java code for the given scenario. *As per the guidelines only 1st question is…

Q: Write a java program read in two integers a and b. Compute and print their greatest common divisor…

A: ALGORITHM-: In Euclid's algorithm, we start with two numbers a and b. If b is zero then the greatest…

Q: Give the pseudo code and java code in full of a recursive algorithm that computes the Fibonacci…

A: It is a mathematical series. The next number of the series is adding up the before two numbers. For…

Q: Algorithm Analysis: estimate the time complexity of the following methods using Big O notation.…

A: Time complexity in BIG O. (a) question a timed complexity: Ans: in question a i=0; i<n; i++ loop…

Q: A recursive algorithm similar to calculating a number in the Fibonacci sequence, where each state…

A: The recursive technique appears to be more easier and smaller, but it comes with a catch: it…

Q: Largest product in a series Problem 8 The four adjacent digits in the 1000-digit number that have…

A: The answer is given below:-

Q: Give the pseudo code and javacode for a recursive algorithm that computes the product of two…

A: method multiply_using_addition(m,n): if n=0 then return 0 else…

Q: For this computer algorithms problem, you are given an N amount of cents, Then you are being asked…

A: Pseudocode: A pseudocode is a plain language description of the steps in an algorithm or another…

Q: Consider the following three methods of solving a particular problem (input size n): 1. You divide…

A: To solve the given problem, we need to write a recurrence for each method and determine which method…

Q: onsider the following non-recursive algorithm: Algorithm Euclid2(m, n) //Input: Integers m and n…

A: The Euclid2(m, n) algorithm: m >= n While n != 0 do r <- m mod n m <- n n <-…

Q: Assume that you were given N cents (N is an integer) and you were asked to break up the N cents into…

A: The problem you described is a classic coin change problem in the field of dynamic programming. It…

Q: A recursive algorithm has been developed as shown below: Input: List A = (a₁, ..., a) such that N ≥…

A: A recursive algorithm is one that uses "smaller (or simpler)" input values to call itself and gets…

Q: Problem 4.2: Following is a 9 by 9 matrix. 1 represents the obstacle and 0 represents the path. Find…

A: Sample Screenshot:

Q: Algorithm Euclid2(m, n) //Input: Integers m and n where m >=n //Output: Greatest Common Divisor of m…

A: a. The given algorithm computes the greatest common divisor of m and n. b Input size of this…

Q: Algorithms in pseudo code **MUST** be placed in de blocks/fences, and use `cpp` as the syntax…

Q: Suppose that you have five different algorithms (A, B, C, D and E) for solving a problem. To solve a…

A: An algorithm (pronounced AL-go-rith-um) is a procedure or formula for solving a problem, based on…

Question

100%

using java to solve this algorithm problem

1. GoodArray
For a number N, a goodArray is the smallest possible array that consists of only
powers of two (20, 21 ... 2k) such that the sum of all the numbers in the array is
equal to N.
For each query that consists of three integers /, r, and m, find out the product of
elements goodArray[1] through goodArray[r] modulo m when goodArray is sorted
in non-decreasing order.
Example
For N = 26, queries = [[1, 2, 1009], [3, 3, 5]]
goodArray when sorted is [2,8,16].
For query / = 1, r = 2, m= 1009, ans = goodArray[1] *goodArray[2] = (2*8) modulo
1009 = 16.
For query / = 3, r = 3, m = 5, ans=goodArray3 = (16) modulo 5 = 1.
The answer is [16, 1].
Function Description
Complete the function getQueryResults in the editor below.
J
The answer is [16, 1].
Function Description
Complete the function getQueryResults in the editor below.
getQueryResults has the following parameters:
long N: the integer N
int queries[q][3]: a 2D array of queries, each with 3 elements I, r, and m.
Return
int answer[q]: the answers to the queries
Constraints
• 1 ≤ N≤ 1018
1≤q≤ 105
• 1≤m≤ 105
• 1≤lsrs goodArray), where I goodArray/ denotes the length of the array
► Input Format For Custom Testing
Java 15
Autocomplete Ready Ⓒ
1 > import java.io.*; ...
14
15
16
17
18
→ Info
19
20
21
22
23
24
25
26
27
28
15
16
17
18
19
20
21
22
23
24
3
26
class Result {
29
30
31
32
33 public class Solution [...
27
28
29
30
31
32
below.
*The function is expected to return an
INTEGER ARRAY.
*The function accepts following parameters:
1. LONG INTEGER n
* 2. 2D INTEGER_ARRAY queries
*/
InfoJava is
Autocomplete Ready Ⓒ
1 > import java.io.*;...
14
* Complete the 'getQueryResults' function
public static List<Integer> getQueryResults
(long n, List<List<Integer>> queries) {
// Write your code here
}
}
*
Custom In
class Result {
below.
Line: 33 Col: 24
?
/*
* Complete the 'getQueryResults' function
*The function is expected to return an
INTEGER ARRAY.
The function accepts following parameters:
* 1. LONG INTEGER n
* 2. 2D INTEGER_ARRAY queries
*/
public static List<Integer> getQueryResults
(long n, List<List<Integer>> queries) {
// Write your code here
}

Process or set of rules that allow for the solving of specific, well-defined computational problems through a specific series of commands. This topic is fundamental in computer science, especially with regard to artificial intelligence, databases, graphics, networking, operating systems, and security.

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

This is a popular solution!

SEE SOLUTION Check out a sample Q&A here

Step 1

VIEW

Step 2

VIEW

Trending now

This is a popular solution!

Step by step

Solved in 2 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

7. Suppose that you have two different algorithms for solving a problem. To solve a problem of size n, the first algorithm uses exactly n(log2 n) operations and the second algorithm uses exactly n3/2 operations. As n grows, which algorithm uses fewer operations?
Suppose you have a computer that requires 1 minute to solve problem instance of size 210. What instance sizes can be run in 1 minute on a computer 256 times faster than the first one assuming the following complexities? (a) Θ (n2 ) (b) Θ (logn) (c) Θ ( 2n ) (d) Θ (SquareRoot(n))
Give the algorithm code for these examples:1. Divide2. Calculator3. Longest block of ones
Given a program designed to calculate rocket trajectories, the algorithm has an O(2n) complexity and takes 1 second for each iteration, and n = 15. How many hours will it take to calculate the trajectories, worst case?
using java to solve this algorithm problem
kindly solve this problem using python
Hello, hope you're having a great day. Can you please help me do exercise 1, 2 and 3 please? Thank you!