1. Give a big-Oh characterization, in terms of n, of the running time of following methods. 1 /** Returns the maximum value of a nonempty array of numbers. */ 2 public static double arrayMax(double[] data) { 3 int n = data.length; 4 5 6 7 8 9} 2. Give a big-Oh characterization, in terms of n, of the running time of following methods. 1 2 3 4 5 6 7 8 12 13 14 15 } } 1822723 /** Returns the sum of the integers in given array. */ public static int example1(int[] arr) { int n = arr.length, total = 0; double currentMax = data[0]; for (int j=1; j currentMax) current Max = data[j]; return current Max; 9 /** Returns the sum of the integers with even index in given array. */ public static int example2(int[ ] arr) { 10 11 int n = arr.length, total = 0; for (int j=0; j < n;j += 2) total += arr[j]; return total; 19 for (int j=0; j < n; j++) total + = arr[j]; return total; 20 // assume first entry is biggest (for now // consider all other entries // if data[j] is biggest thus far... // record it as the current max 3. Give a big-Oh characterization, in terms of n, of the running time of following methods. 18 public static int example3(int[ ] arr) { int n = arr.length, total = 0; for (int j=0; j

1. Give a big-Oh characterization, in terms of n, of the running time of following methods. 1 /** Returns the maximum value of a nonempty array of numbers. */ 2 public static double arrayMax(double[] data) { 3 int n = data.length; 4 5 6 7 8 9} 2. Give a big-Oh characterization, in terms of n, of the running time of following methods. 1 2 3 4 5 6 7 8 12 13 14 15 } } 1822723 /** Returns the sum of the integers in given array. */ public static int example1(int[] arr) { int n = arr.length, total = 0; double currentMax = data[0]; for (int j=1; j currentMax) current Max = data[j]; return current Max; 9 /** Returns the sum of the integers with even index in given array. */ public static int example2(int[ ] arr) { 10 11 int n = arr.length, total = 0; for (int j=0; j < n;j += 2) total += arr[j]; return total; 19 for (int j=0; j < n; j++) total + = arr[j]; return total; 20 // assume first entry is biggest (for now // consider all other entries // if data[j] is biggest thus far... // record it as the current max 3. Give a big-Oh characterization, in terms of n, of the running time of following methods. 18 public static int example3(int[ ] arr) { int n = arr.length, total = 0; for (int j=0; j

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: Recall the Find problem from Assignment # 1. You were asked to implement the following static…

A: Here is the solution of the above problem:

Q: Finding the maximum of an array give a big -Oh characterization , in terms of n ,of the running…

A: The array Max method, which is provided, iterates through an array of numbers to get the largest…

Q: iv. ΑΘ bound

A: Dear student, I can answer the A (θ) bound time complexity correctly.

Q: Consider the following method:public static void mystery5(int[] nums) {for (int i = 0; i <…

A: A) {8} Here the number of element in array is 1. So the if condition would be false. Thus final…

Q: The following program should be able to print the values within a range of elements of an array. Ln…

A: SOLUTION- Below are the values for the missing parts - AAA - prnElem We have to call the method so…

Q: Given the integer array average Temps with the size of NUM_INPUTS, write a for loop to initialize…

A: You are given an integer array averageTemps with a specified size (NUM_INPUTS). You need to…

Q: Given an array with n objects colored red, white or blue, sort them so that objects of the same…

A: class Sort { //required function public void sortColors(int[] nums) { int…

Q: Public Class Utilities { replaceCharacter Method public static void replaceCharacter(char[] array,…

A: The below given Java program will obey the following rubrics: Declaring main class. Defining some…

Q: For each problem, please provide i. Describe the worst-case input (the input that would cause the…

A: Note: The answers of the first two subparts are given. Please repost the remaining subpart in sets…

Q: a big-Oh characterization, in terms of n

A: Given :-In the above question, a method using java is mentioned

Q: 6) Create a method which takes an integer array input from the user and reverses the elements in the…

A: // Code in java import java.util.Scanner; public class Main { public static void main(String[]…

Q: int nums[] = {7,2,5,8,7,2,3,4,8}; int total = 0; for (int n : nums) { } System.out.println(total);…

A: Answer the above question are as follows

Q: 1. write algorothim pseudocode. analyze the bestcase .k . analyze the worse case of k.

A: Algorithm: Take the input array and k Create a Priority Queue (max heap) by pushing the values of…

Q: Write a program that counts the number of basic steps needed for sorting an array of integer…

A: Given :- Write a program that counts the number of basic steps needed for sorting an array of…

Q: 1. Give a big-Oh characterization, in terms of n, of the running time of following methods. 1 /**…

A: The objective of the question is to determine the Big O notation for the running time of the given…

Q: write a method that creates an array representing the count of how many values in a given data set…

A: NOTE: Here I also used driver code for running the function ,please ignore it 2) please follow…

Q: Consider the following problem. Input: An array of sizen>3that consists ofanon-empty decreasing…

A: As the programming language is not mentioned here, we are using JAVA here Recursive Algorithm used…

Q: Use a two-dimensional, multi-dimensional array and pass it to a method and receive it back. You will…

A: Below is the complete solution with explanation in detail for the given question in Java Programming…

Q: Exercise 3 (Verifying Sorted Order) Create a class called Sortedorder. In this class, implement a…

Q: Write a method to return the first duplicated string in an array. Comparison must check case (e.g.,…

A: Answer: ublic class arrays { public static void main(String[] args) { String[] myNumbers =…

Q: Fill in the blank to complete the following method that takes an array of integers and returns the…

A: Given Program: public static double getAverage(int[] array){ double avg=0;…

Concept explainers

Merge sort

Merge Sort recursively sorts a given collection of numbers or elements by using the divide and conquer strategy in less time. It is one of the most used algorithms, with the worst-case time complexity of O (n log n). It was invented by John Von Neumann. The algorithm continuously divides an array into sub-arrays until each sub-array consists of a single element. It then merges those sub-arrays to produce a sorted array.

Question

1. Give a big-Oh characterization, in terms of n, of the running time of following methods.
1 /** Returns the maximum value of a nonempty array of numbers. */
2 public static double arrayMax(double[]
data) {
3
int n = data.length;
4
5
6
1
2
3
4
5
6
7
8
9}
2. Give a big-Oh characterization, in terms of n, of the running time of following methods.
7
8
10
11
}
12
13
14
15 }
double current Max = data[0];
for (int j=1; j<n; j++)
if (data[j] > current Max)
currentMax = data[j];
return current Max;
/** Returns the sum of the integers in given array. */
public static int example1(int[] arr) {
int n = arr.length, total = 0;
for (int j=0; j<n; j++)
total += arr[j];
DBD2E2D
9 /** Returns the sum of the integers with even index in given array. */
public static int example2(int[ ] arr) {
int n = arr.length, total = 0;
21
return total;
for (int j=0; j <n; j += 2)
total + = arr[j];
// assume first entry is biggest (for now
// consider all other entries
// if data[j] is biggest thus far...
// record it as the current max
return total;
24 }
3. Give a big-Oh characterization, in terms of n, of the running time of following methods.
17/** Returns the sum of the prefix sums of given array. */
18 public static int example3(int[] arr) {
19
int n= arr.length, total = 0;
20 for (int j=0; j<n; j++)
// loop from 0 to n-1
for (int k=0; k <= j; k++)
total + = arr[j];
23 return total;
// note the increment of 2
// loop from 0 to n-1
// loop from 0 to j

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: Define big Oh

VIEW

Step 2: Time complexity in terms of big Oh for Q1, Q2 and Q3

VIEW

Solution

VIEW

Trending now

This is a popular solution!

Step by step

Solved in 3 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

in java ecplise . Implement a program that randomly generates 10 integers from -100 to 100,stores them in a 1D array, and finds their maximum value. Calculate theexecution time of finding a maximum. Repeat the test for 10,000 and10,000,000 numbers. Provide your results in the form of a table below andprovide a small summary. Implement a Java program that will populate a 5x5 matrix with randomlygenerated integers from 0 to 100.(1) print your matrix in a table form.(2) modify your code to multiply all even numbers by 10 and print the matrix.Your output of questions (1) and (2) should match the format of the followingsample outputs:
Use Java to write a program that prompts the user for a positive odd integer , generates a normal magic square of order size of that integer, and prints it with numbers right-justified and aligned in evenly-spaced columns. (Magic square definition: https://en.wikipedia.org/wiki/Magic_square. Can assume that the numbers in the square are 3 digits or less (i.e. size ≤ 31). Have the construction of the 2D integer array magic square take place in a public static method getMagicSquare that takes in an integer n as a parameter and returns the 2D integer array magic square as specified. Your main method should perform input and output (I/O) and call this method to perform the computation. Methods for generating a magic square : Assign 1 to our initial current position: the bottom row, middle column. Place each successive value (up to size * size) in the first of the following positions that is unoccupied: (1) one space down and to the right, or (2) one space up. Positions wrap around…
Answer the given question with a proper explanation and step-by-step solution. Given an array of integer 'nums' produce an array of integers composed of the absolute values of all the nunbers in 'nums' public int[] getArrayAbs(int[] nums) { return; }
Give a big-Oh characterization, in terms of n, of the running time of the followingmethod.
A method to make an almost sorted array into fully sorted.@param arr: an array of integers, with all the numbers are sortedexcepted the last one@param size: the number of elements in an array*/public static void insertLast(int[] arr, int size){// your work}To make it concrete, let's use the example shown in Figure 1. In this example, the arraycontains [1, 3, 4, 5, 6, 7, 2], and the size of the array is 7. As we can see, The inputarray are sorted excepted the last one. The goal here is to place last element into a correctposition so all numbers will be sorted. This is exactly what the method insertLast is toperform.1Figure 1: Sampel output for insertion sort part 1.As we recall from the lecture, the idea is keep shifting all larger number (compared with thelast number) to the right until we nd the number is smaller than the last number. In ourexample,1. Compare 7 with 2. Since 7 > 2, we copy 7 to its right.2. Compare 6 with 2. Since 6 > 2, we copy 6 to its right.3. Compare 5 with…
b. The following is the code for the 3-SUM problem what is the tilde notation for the array access? public static int count(int[] a) { int n = a.length; 0; 0; i < n; i++) { %3D int count = for (int i = %3D for (int j = i+1; j < n; j++) { %3D for (int k if (a[i] + a[j] + a[k] j+1; k < n; k++) { e) { %3D == count++; } } } } return count; }
public static void reverse(ArrayList<Integer> alist){}public static ArrayList<Integer> reverseList(ArrayList<Integer> alist){} How to use these two headers method and a main method to create the output of [1,2,3] [3,2,1]
I want solution with steps