The complexity of Fibonacci series is _________(a) O(2^n)(b) O(log n)(c) O(n^2)(d) O(n log n)I have been asked this question in an interview for job.I need to ask this question from Algorithms topic in division Algorithms of Discrete Mathematics

The complexity of Fibonacci series is _________(a) O(2^n)(b) O(log n)(

1.	The complexity of Fibonacci series is _________(a) O(2^n)(b) O(log n)(c) O(n^2)(d) O(n log n)I have been asked this question in an interview for job.I need to ask this question from Algorithms topic in division Algorithms of Discrete Mathematics
Answer» Right choice is (a) O(2^N) For EXPLANATION: Fibonacci is f(n) = f(n-1) + f(n-2), f(0) = 0, f(1) = 1. LET g(n) = 2^n. Now prove inductively that f(n) > = g(n).

Discussion

No Comment Found

Related InterviewSolutions

The value of 12 mod 3 is?(a) 0(b) 1(c) 2(d) 3This question was addressed to me in an international level competition.This question is from Algorithms topic in chapter Algorithms of Discrete Mathematics
The quotient and remainder when -1 is divided by 3 is?(a) -1 and -1(b) -1 and 2(c) 1 and2(d) -1 and -2I got this question at a job interview.The doubt is from Algorithms in chapter Algorithms of Discrete Mathematics
The greatest common divisor of 414 and 662 is?(a) 4(b) 5(c) 2(d) 6I have been asked this question in a national level competition.My question comes from Integers and Algorithms topic in portion Algorithms of Discrete Mathematics
The hexadecimal expansion of (177130)10 is ___________(a) (2B3EB)16(b) (2B3EA)16(c) (2C3AA)16(d) (2B2AA)16This question was addressed to me during an interview for a job.I need to ask this question from Integers and Algorithms topic in division Algorithms of Discrete Mathematics
The value of 15 mod 11 is?(a) 1(b) 2(c) 3(d) 4I had been asked this question in exam.My question comes from Algorithms topic in section Algorithms of Discrete Mathematics
The quotient and remainder when 18 is divided by 5 is?(a) 2 and 3(b) 1 and 2(c) 3 and 2(d) 3 and 3I got this question in homework.Query is from Algorithms in division Algorithms of Discrete Mathematics
If a|b and a|c, then?(a) a|bc(b) c|a(c) a|(b+c)(d) b|aI got this question in homework.This interesting question is from Algorithms topic in division Algorithms of Discrete Mathematics
Is 102 congruent to 6 modulo 16.(a) True(b) FalseI have been asked this question by my college director while I was bunking the class.The doubt is from Algorithms topic in chapter Algorithms of Discrete Mathematics
Is 17 congruent to 4 modulo 6.(a) True(b) FalseThe question was posed to me during an online interview.I want to ask this question from Algorithms in portion Algorithms of Discrete Mathematics
The value of 155 mod 9 is?(a) 0(b) 1(c) 2(d) 3This question was posed to me in quiz.This interesting question is from Algorithms topic in portion Algorithms of Discrete Mathematics

The complexity of Fibonacci series is _________(a) O(2^n)(b) O(log n)(c) O(n^2)(d) O(n log n)I have been asked this question in an interview for job.I need to ask this question from Algorithms topic in division Algorithms of Discrete Mathematics

Discussion

No Comment Found

Related InterviewSolutions

Reply to Comment