import java.lang.System;3.public class FibonacciComparison {4.// Fibonacci Sequence: 0, 1, 1, 2, 3, 5, 8 ..../*7input cases8.1) 092) 3103) -1114) 912output cases131) 0142) 2153) 0164) 3417*/// Note that you need to return 0 if the input is negative.// Please pay close attention to the fact that the first index in our fib sequence is 0.181920// Recursive Fibonaccipublic static int fib(int n) {// Code this func.21222324return -1;2526// Iterative Fibonacci2728public static int fiblinear(int n) {// Code this func.2930return -1;313233public static void main(String[] args) {34// list of fibonacci sequence numbersint[] nlistw{ 5,10, 15, 20, 25, 30, 35, 40, 45};353637// Two arrays (one for fibLinear, other for fibRecursive) to store time for each run.// There are a total of nlist.length inputs that we will testdouble[] timingsEF = new double[nlist.Length];double[] timingsLF = new double[nlist.length];3839404142// Every number in n_list will be given as input 5 times to both fibonacci functions43// and an average will be taken to make the results more accurate. 44int numTrials = 5;4546//Iterating over number listfor ( int i = 0; i < nlist.length; i++ ) {4748int n =nlist[i];4950//FibRecursive51// Start recording time5253// Run fibRecursive function 5 timesfor ( int k = 0; k < numTrials; k++ )5455fib(n);// Stop recording time5657wwww58// Taking average of the run time and store it in the array59timingsEF[i] = le-9*(stop-start) / numTrials;6061//Fiblinear62// Start recording time63ww// Run Fiblinear 5 times6465for ( int k = 0; k < numTrials; k++ )fiblinear (n);666768// Stop recording time6970//Taking average and store it in the array71timingsLF[i] = le-9*(stop-start) / numTrials;72}7374// Print out the runtimes for different fib functions.75System.out.println("Timings for Exponential Fibonacci");for ( double time : timingsEF )7677System.out.print(" "+time);78System.out.println();79System.out.println();80System.out.println();81System.out.println("Timings for Linear Fibonacci");for ( double time : timingsLF )8283System.out.print(" "+time);84System.out.println();8586

Answered: public class FibonacciComparison { //…

public class FibonacciComparison { // Fibonacci Sequence: 0, 1, 1, 2, 3, 5, 8 . /* input cases 1) 0 2) 3 3) -1 4) 9 output cases

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Related questions

Q: Find error and correct it : public class ProgramLayout { public static void main (String[]…

A: We are going to predict the error in the following code.

Q: ANSWER IN PYTHON PLEASE.

A: Coded usign Python 3.

Q: a = CalSomething (a, CalSomething (a), y); %3D

A: Assuming that we need to fill in the blanks before a in the second image, that means we need to…

Q: void setup() { k=analogReack1); oin loop() { ddu i- 2; rt j = B; k = myFunction(i, j);} int…

A: The read analogue will read input present at pin 1. Data at pin 1 is 102..

Q: 1. Add a field to the Hexagon.java class called side. It should be a double. 2. Write a no arguments…

A: Constructor is called when a instance of the class is created. It is used to initialize the object.…

Q: Q11 Draw a DFA/NFA for the following: 1. L = (awbb: w (a,b)*) 2. L=(wibaw2: w1,w2 = (a,b)*)

A: NFA and DFA is given in the below diagram. See below steps.

Q: for (i = 0; i < 2; ++i) { a = i* 20; ecrire (a); } lire (b);

A: we have the given functions of which the definitions are not provided in the given code above:…

Q: main(){ int i,n; for(int i=0;i<n;i++){ fork(); printf("*"); } } How many times ‘*’ will be…

A: the answer to given question is provided below:

Q: Dijkstra's algorithm Weight Class Implementation language : C++ Note : Skelton Files Provided…

A: Given To know about the Dijkstra's algorithm Weight Class Implementation.

Q: 6. Show Flight Info Enter Airline Code: QA Enter Flight Number: 404 Flight: Q4404 Type: I Status: S…

A: import java.util.*;class Flight { String airlineCode; int flightNumber; char type; // D for…

Q: Java Input. class main { publicstaticvoid main(String args[]) { int a =1; int b =2; int c =3; a…

A: | is bitwise or operator which operates on binary individual bits and do OR operator work. >>…

Q: What will the given code prints on the output screen.

A: Given, Programming language = JAVA Code: class isNaN_output { public static void main(String…

Q: Problem Description The hailstone sequence is defined as the integer sequence that results from…

A: Python programming language : Python is a programming language that Guido van Rossum created in the…

Q: class Output { public static void main(String args[]) { Integer i = new Integer(557); float x =…

A: Given, The programming language used = JAVA Code: class Output { public static void…

Q: 1、Counting Primitive Operations void STRAITMAXMIN(A,n,max,min) //Set the maximum value in A to max…

A: Given : { int i,n max=min=A[1] for i=2 to n { if A[i]> max…

Q: public string getJobiitle() { return jobiitles 12 13 44 public void setJoblitle(String joblitle) {…

A: Since you are asking multiple questions, we are answering first part question only. If you want…

Question

import java.lang.System;
3.
public class FibonacciComparison {
4.
// Fibonacci Sequence: 0, 1, 1, 2, 3, 5, 8 ....
/*
7
input cases
8.
1) 0
9
2) 3
10
3) -1
11
4) 9
12
output cases
13
1) 0
14
2) 2
15
3) 0
16
4) 34
17
*/
// Note that you need to return 0 if the input is negative.
// Please pay close attention to the fact that the first index in our fib sequence is 0.
18
19
20
// Recursive Fibonacci
public static int fib(int n) {
// Code this func.
21
22
23
24
return -1;
25
26
// Iterative Fibonacci
27
28
public static int fiblinear(int n) {
// Code this func.
29
30
return -1;
31
32
33
public static void main(String[] args) {
34
// list of fibonacci sequence numbers
int[] nlist
w
{ 5,10, 15, 20, 25, 30, 35, 40, 45};
35
36
37
// Two arrays (one for fibLinear, other for fibRecursive) to store time for each run.
// There are a total of nlist.length inputs that we will test
double[] timingsEF = new double[nlist.Length];
double[] timingsLF = new double[nlist.length];
38
39
40
41
42
// Every number in n_list will be given as input 5 times to both fibonacci functions
43
// and an average will be taken to make the results more accurate.

44
int numTrials = 5;
45
46
//Iterating over number list
for ( int i = 0; i < nlist.length; i++ ) {
47
48
int n =
nlist[i];
49
50
//
FibRecursive
51
// Start recording time
52
<Code here>
53
// Run fibRecursive function 5 times
for ( int k = 0; k < numTrials; k++ )
54
55
fib(n);
// Stop recording time
56
57
<Code here>
wwww
58
// Taking average of the run time and store it in the array
59
timingsEF[i] = le-9*(stop-start) / numTrials;
60
61
//
Fiblinear
62
// Start recording time
63
<Code here>
ww
// Run Fiblinear 5 times
64
65
for ( int k = 0; k < numTrials; k++ )
fiblinear (n);
66
67
68
// Stop recording time
69
<Code here>
70
//Taking average and store it in the array
71
timingsLF[i] = le-9*(stop-start) / numTrials;
72
}
73
74
// Print out the runtimes for different fib functions.
75
System.out.println("Timings for Exponential Fibonacci");
for ( double time : timingsEF )
76
77
System.out.print(" "+time);
78
System.out.println();
79
System.out.println();
80
System.out.println();
81
System.out.println("Timings for Linear Fibonacci");
for ( double time : timingsLF )
82
83
System.out.print(" "+time);
84
System.out.println();
85
86

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

Step 2

Step 3

Step 4

Step 5

Trending now

This is a popular solution!

Step by step

Solved in 5 steps with 3 images

SEE SOLUTION Check out a sample Q&A here

Similar questions

Exponent y Catherine Arellano mplement a recursive function that returns he exponent given the base and the result. for example, if the base is 2 and the result is 3, then the output should be 3 because the exponent needed for 2 to become 8 is 3 (i.e. 23 = 8) nstructions: 1. In the code editor, you are provided with a main() function that asks the user for two integer inputs: 1. The first integer is the base 2. The second integer is the result 2. Furthermore, you are provided with the getExponent() function. The details of this function are the following: 1. Return type - int 2. Name - getExponent 3. Parameters 1. int - base 2. int - result 4. Description - this recursive function returns the exponent 5. Your task is to add the base case and the general case so it will work Score: 0/5 Overview 1080 main.c exponent.h 1 #include 2 #include "exponent.h" 3 int main(void) { 4 int base, result; 5 6 printf("Enter the base: "); scanf("%d", &base); 7 8 9 printf("Enter the result: ");…
Lab 9 C balance the same, y, n, why? class CheckingAct { . . . . private int balance; public void processCheck( int amount ) { int charge; if ( balance < 100000 ) charge = 15; else charge = 0; balance = balance - amount - charge ; // change the local copy of the value in "amount" amount = 0 ; } } public class CheckingTester { public static void main ( String[] args ) { CheckingAct act; int check = 5000; act = new CheckingAct( "123-345-99", "Your Name", 100000 ); System.out.println( "check:" + check ); // prints "5000" // call processCheck with a copy of the value 5000 act.processCheck( check ); System.out.println( "check:" + check ); // prints "5000" --- "check" was not changed } }
Virus DNA files As a future doctor, Jojo works in a laboratory that analyzes viral DNA. Due to the pandemic During the virus outbreak, Jojo received many requests to analyze whether there was any viral DNA in the patient. This number of requests made Jojo's job even more difficult. Therefore, Jojo ask Lili who is a programmer for help to make a program that can read the file containing the patient's DNA data and viral DNA and then match them. If on the patient's DNA found the exact same string pattern, then write to the index screen the found DNA. Data contained in the file testdata.in Input Format The first line of input is the number of test cases TThe second row and so on as many as T rows are the S1 string of patient DNA and the S2 string of viral DNA separated by spaces Output Format The array index found the same string pattern. Constraints 1 ≤ T ≤ 1003 ≤ |S2| ≤ |S1| ≤ 100|S| is the length of the string.S will only consist of lowercase letters [a-z] Sample Input (testdata.in)…
Java
JAVA The loop continuation condition is the inverse of the loop termination condition. True False
Complete the isExact Reverse() method in Reverse.java as follows: The method takes two Strings x and y as parameters and returns a boolean. The method determines if the String x is the exact reverse of the String y. If x is the exact reverse of y, the method returns true, otherwise, the method returns false. Other than uncommenting the code, do not modify the main method in Reverse.java. Sample runs provided below. Argument String x "ba" "desserts" "apple" "regal" "war" "pal" Argument String y "stressed" "apple" "lager" "raw" "slap" Return Value false true false true true false
Java - Data Visualization (this is not graded)
Charge Account Validation Using Java programming Create a class with a method that accepts a charge account number as its argument. The method should determine whether the number is valid by comparing it to the following list of valid charge account numbers:5658845 4520125 7895122 8777541 8451277 13028508080152 4562555 5552012 5050552 7825877 12502551005231 6545231 3852085 7576651 7881200 4581002These numbers should be stored in an array. Use a sequential search to locate the number passed as an argument. If the number is in the array, the method should return true, indicating the number is valid. If the number is not in the array, the method should return false, indicating the number is invalid.Write a program that tests the class by asking the user to enter a charge account number. The program should display a message indicating whether the number is valid or invalid.
def colours (guess tuple, hidden tuple) -> int: Preconditions: - guess is a sequence of four unique colours chosen from R, O, Y, G, B, V, - hidden is a sequence of four unique colours chosen from R, O, Y, G, B, V, Postconditions: output is number of correct colours in guess correct = 0 for colour in ('R','O','Y, 'G','B','V): if colour in guess and colour in hidden: correct = correct + 1 return correct colours (['R','B','O','G'],['R','B',V,'O']) Q1(a) What is the worst-case complexity of colours? What is the worst-case complexity of positions? Explain your answers.
def SomeMethod(a,b): a= a+b b=b+a print(a,b,end=" ") return (a+b) def main(): x=10 y=20 print(SomeMethod(x,y)) main() x and y are called: ? a and b are called: ?
Java - Smallest Number
Digital communication class