a)Write a Java code which gives the value of (1+(1/n))^n for n= 2,4,...,2^14. You can use the function Math.pow(x,y) b) BuggySum(a, a.length-1) has to calculate the sum of numbers on matrix but does not. Find the problem and show how to fix it. public static double BuggySum(double[] a, int k) { if (k == 0) return 0.0; else return a[k] + BuggySum(a, k-1); } Please write the complete code.

a)Write a Java code which gives the value of (1+(1/n))^n for n= 2,4,...,2^14. You can use the function Math.pow(x,y) b) BuggySum(a, a.length-1) has to calculate the sum of numbers on matrix but does not. Find the problem and show how to fix it. public static double BuggySum(double[] a, int k) { if (k == 0) return 0.0; else return a[k] + BuggySum(a, k-1); } Please write the complete code.

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

In PYTHON (Sum the major diagonal in a matrix) Write a function that sums all the numbers of the major diagonal in an n × n matrix of integers using the following header:def sumMajorDiagonal (m):The major diagonal is the diagonal that runs from the top left corner to the bottom right corner in the square matrix. Write a test program that reads a 4 × 4 matrix and display the sum of all its elements on the major diagonal.Program Sample Run (With Input Shown in Bold)Enter a 4-by-4 matrix row 0: 1 2 3 4Enter a 4-by-4 matrix row 1: 5 6.5 7 8Enter a 4-by-4 matrix row 2: 9 10 11 12Enter a 4-by-4 matrix row 3: 13 14 15 16Sum of the elements in the major diagonal is 34.5
Given a square matrix, calculate the absolute difference between the sums of its diagonals. For example, the square matrix is shown below: 1 2 3 4 5 6 9 8 9 The left-to-right diagonal = . The right to left diagonal = . Their absolute difference is . Function description Complete the function in the editor below. diagonalDifference takes the following parameter: int arr[n][m]: an array of integers Return int: the absolute diagonal difference Input Format The first line contains a single integer, , the number of rows and columns in the square matrix .Each of the next lines describes a row, , and consists of space-separated integers . Constraints Output Format Return the absolute difference between the sums of the matrix's two diagonals as a single integer. Sample Input 3 11 2 4 4 5 6 10 8 -12 Sample Output 15 Explanation The primary diagonal is: 11 5 -12 Sum across the primary diagonal: 11 + 5 - 12 = 4 The secondary diagonal is: 4 5…
Please send me answer with in 10 min!! I will you rate you good for sure!! Please solve all the 4 parts!! Write a class named Homework in IntelliJ that implements:(1) A function that performs dot product between two vectors a and b:public static double dotProduct(double[] a, double[] b)(2) A function that performs matrix multiplication between aMat and bMat and returns theresult in cMatpublic static void matMultiply(double[][] aMat, double[][] bMat, double[][] cMat)(3) A function that takes a line (String) as input and breaks it up into words that may beseparated by space, comma or tab:public static String[] getLineWords(String line)(4) A main function that tests all the above functions and prints out the results. Code written (has errors, but this is the structure/ method I'm going for) public class Homework { public static double dotProduct(double[] a, double[] b) { double result = 0; for (int i = 0; i < a.length; i++) { result += a[i] * b[i]; } return result; } public static…
Java code: write a java code that can perform SQUARE-MATRIX-MULTIPLY-RECURSIVE. A; B(Strassen's Algorithms)/ and ordinary multiplication. The program should ask the user for input file and output file locations, and give output for both methods. It should also check if both outputs match and include error handing for incorrect Matrix Multiplication input.
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…
Java - Given the following method header, give the code for the function using a binary search of an array. Don’t worry about the precondition (assume this is already true). public static boolean has10 (int[ ] data, int start, int end) // Precondition: The elements data[start]...data[end] are sorted from smallest to largest. This // array segment might be empty (indicated by end being less than start). // Postcondition: A true return value indicates that the number 10 appears in the array // data[start]...data[end]. A false return value indicates that 10 doesn’t appear.
mergeAndRemove(int[], int[]) This is a public static function that takes a int[] and int[] for the parameters and returns an int[]. Given two arrays of integers. Your job is to combine them into a single array and remove any duplicates, finally return the merged array.
You can prevent a function from changing the actual parameter of an array by: Select one: a. passing the array by value b. using const in the declaration of the formal parameter c. individually declaring all the elements as constants d. using static in the declaration of the formal parameter
Write a function that returns trueif the product of an array is divisible by the sum of that same array. Otherwise, return false. Example: divisible([3, 2, 4, 2]) →false WRITE IN PYTHON PLEASE
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:…
Java, I am not displaying my results correct. It should add up the digits in the string. input string |result for the sumIt Recursion functions and a findMax function that finds the largest number in a string "1d2d3d" | 6 total "55" |10 total "xx" | 0 total "12x8" |12 Max number "012x88" |88 Max Number "012x88ttttt9xe33ppp100" |100 Max Number public class Finder { //Write two recursive functions, both of which will parse any length string that consists of digits and numbers. Both functions //should be…
Write a function/ program that produces the following: int findDifference(const string a1[], int n1, const string a2[], int n2); Return the position of the first corresponding elements of a1 and a2 that are not equal. n1 is the number of interesting elements in a1, and n2 is the number of interesting elements in a2. If the arrays are equal up to the point where one or both runs out, return the smaller of n1 and n2. Notwithstanding each function's behavior described below, all functions that return an int must return −1 if they are passed any bad arguments (e.g. a negative array size, or a position that would require looking at the contents of an element past the last element we're interested in). Unless otherwise noted, passing 0 to the function as the array size is not itself an error; it merely indicates the function should examine no elements of the array. Here's an example: string cast[5] = { "samwell", "jon", "margaery", "daenerys", "tyrion" }; string roles[4] = { "samwell",…