a) Determine the big O running time of the method myMethod() by counting the approximate number of operations it performs. Show all details of your answer. Static void myMethod (String S) { int i int n - length (s) int j (2 x n) loop while (j > 0) { i-n loop while (i >= 1 ) { i-1/2 j j-1

a) Determine the big O running time of the method myMethod() by counting the approximate number of operations it performs. Show all details of your answer. Static void myMethod (String S) { int i int n - length (s) int j (2 x n) loop while (j > 0) { i-n loop while (i >= 1 ) { i-1/2 j j-1

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

public static void cheers(int n) {if (n <= 1) {System.out.println("Hurrah");}else {System.out.println("Hip");cheers(n-1);} } Consider the cheers method given above. What is the maximum number of "open" (i.e. incomplete) methods that results from calling cheers(3)? Explain your answer by tracing through the method.
1.A) The median of a set of integers is the middle-most integer in size. That is, half the integers in the set are less than or equal to the median, and half the integers are greater than or equal to the median. For example, the median of {99, 1, 10, 6, 2} is 6 since 1 and 2 are smaller than 6 and 10 and 99 are larger than 6. Implement a method median( ) with no parameters that finds and returns the median of the integers in a data array. Use this keyword in meaningfully. Assume that the data array is an instance variable of Data class. Write a parameterized constructor to allocate and assign values to data array. Assume that the array has odd length. Write main () in a separate class constructor to use the Data class.
‏1-Write the pseudocode for this method ‏2-Flowchart for this method ‏public static void bucketSort(int[] arr) { ‏ int max_value = 0; ‏ for (int i = 0; i < arr.length; i++) ‏ if (arr[i] > max_value) ‏ max_value = arr[i]; ‏ int[] bucket = new int[max_value + 1]; ‏ for (int i= 0; i
a) Determine the big theta running tíme of the method myMethod() by counting the approximate number of operations it performs. Show all details of your answer static int dolt(int n) { count -0 j+1 while < (n × n){ count - count + 1 return count static int myMethod (int n) { while (i < n) dolt(i) -ix 2 return 1;
Write a recursive method that takes as parameter as array of type double (num) and the length of the array (len). The method should display the square root of numbers that are greater than 10.0 in the array. The method prototype is: public static void display(double [] num, int len); You may use sqrt method that is defined in the Math class.
Examples of questions • You are maintaining a software and you come across the following method. Comment on its quality by pointing out problems that you see and rewrite the method by fixing them. (Note: Feel free to do the changes in multiple iterations if you find it easier.) public static void f(int[] a) { int t; } for (int p = 0; p a[i+1]){ t = a[i+1]; a[i+1] = a[i]; a[i] = t; }}}
Given class x{ static int a; int b=12; void m1(0{ } static void m2({ } class Ab extends x{ static int a; int b=10; void m10{ } static void m20{ } public static void main (String[] args){ int b=3; x obj=new Ab(); } How can you get access to the "m1" method in the child class O cast obj before getting access to it O use obj.m1() O you cannot get access to the "m1" in the child class O use the super keyword O Either A or B
Which best describes this axiom: ( aList ( ) ) . replace ( i, item ) ) . getEntry ( i ) = item When an item is replaced, it always goes in the position specified in the method call When an item is replaced, space is made by moving all of the items starting at the position specified down toward the bottom of the list by one to make room When an item is replaced, it always goes in the first available unused position None of these
The nth harmonic number is defined non-recursively as H(n) = 1+1/2+1/3+1/4+⋯+1/n Come up with a recursive definition and use it to guide you to write a method definition for a double-valued method named “harmonic” that accepts an int parameter n and recursively calculates and returns the nth harmonic number. Write a test program that displays the harmonic numbers, H(n), for n = 1,2,3,⋯,10.
Create a Java class RecursiveMethods.java and create the following methods inside: ALL THE METHODS NEED TO BE COMPLETED RECURSIVLY. NO LOOPS ALLOWED. - oddEvenMatchRec: the method takes an integer array as a parameter and returns a boolean. The method returns true if every odd index contains an odd integer AND every even index contains an even integer(0 is even). Otherwise it returns false. - sumNRec: The method takes an integer array A and returns the sum of all integers in the parameter array. - nDownToOne: Takes an integer n and prints out the numbers from n down to 1, each number on its own line. - inputAndPrintReverse: Inputs integers from the user until the user enters 0, then prints the integers in reverse order. For this method, you may NOT use an array or any type of array structure, in other words, you may not use any structure to store the user input.
Write a method that displays an n-by-n matrix usingthe following header:public static void printMatrix(int n)Each element is 0 or 1, which is generated randomly. Write a test programthat prompts the user to enter n and displays an n-by-n matrix. Here is asample run: Enter n: 3 ↵Enter0 1 00 0 01 1 1
Write a Java method that takes an array of type int and returns a boolean value. The method returns true if the number of positive elements in the parameter array is larger than the number of negative elements. The method returns false if any of the following conditions is satisfied: • The parameter array is of length of 0 or 1 • The number of positive elements of the parameter array is less than or equal to the number of negative elements • The number of positive elements or negative elements is equal to zero The method's header is as follows. public static boolean verify (int[] x) Sample run Result int[] x = (1, 2, 3}; verify(x); {5}; verify(x); int[] x = {1, 2, 3, -5, -1}; boolean b = verify(x); int[] x = new int[0]; verify(x); false boolean b = int[] x = boolean b = false true false boolean b = BIU A Paragraph +v