Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Algorithm Doubt
Devshree Dubey
asked
in
Algorithms
Apr 27, 2018
544
views
0
votes
0
votes
How to compute the nth term of fibonacci series 1,1,2,3,5........ ?
algorithms
recurrence-relation
Devshree Dubey
asked
in
Algorithms
Apr 27, 2018
by
Devshree Dubey
544
views
answer
comment
Follow
share this
share
0 Comments
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
2
Answers
2
votes
2
votes
Best answer
..................
abhishekmehta4u
answered
Apr 27, 2018
selected
Feb 6, 2020
by
Shaik Masthan
by
abhishekmehta4u
comment
Follow
share this
4 Comments
Show 3 previous comments
by
Sammohan Ganguly
commented
Apr 27, 2018
reply
Follow
share this
X^2 -x -1 =0
0
0
by
abhishekmehta4u
commented
Apr 27, 2018
reply
Follow
share this
It is a chararstic equation of recurrence relation.
We can google out it is a procedure to find recurrence relation.
0
0
by
Sammohan Ganguly
commented
Apr 27, 2018
reply
Follow
share this
Thanks
0
0
Please
log in
or
register
to add a comment.
1
vote
1
vote
ANSWER FOR THE Nth TERM OF FIBONACCI SERIES.
Kushagra Chatterjee
answered
Apr 27, 2018
by
Kushagra Chatterjee
comment
Follow
share this
4 Comments
Show 3 previous comments
by
Devshree Dubey
commented
Apr 27, 2018
reply
Follow
share this
@Kushagra Chatterjee,@abhishekmehta4u,Both of u a big big thanks. Both of u have mentioned the method for solving recurrence relation with such finesse.
0
0
by
Kushagra Chatterjee
commented
Apr 27, 2018
reply
Follow
share this
I was trying to write the nth term of fibonacci as a combination of the roots of the characteristic equation that can be done for any linear recurrence equation.
0
0
by
Akhilesh Singla
commented
Apr 27, 2018
reply
Follow
share this
Ok, thanks for explaining.
0
0
Please
log in
or
register
to add a comment.
← Previous
Next →
← Previous in category
Next in category →
Related questions
0
votes
0
votes
1
answer
1
Shreya2002
asked
in
Algorithms
Oct 28, 2022
358
views
Madeeasy Algorithm
How to solve this recurrence relation T(n)= T(0.09n) + T(0.91n) + cn where c is constant and T(1)=1 options are-
Shreya2002
asked
in
Algorithms
Oct 28, 2022
by
Shreya2002
358
views
made-easy-test-series
algorithms
time-complexity
recurrence-relation
1
vote
1
vote
2
answers
2
srestha
asked
in
Algorithms
May 10, 2019
654
views
Made Easy Test Series:Algorithm-Recurrence Relation
What is the solution of recurrence relation $T\left ( n \right )=T\left ( n-1 \right )+n$
srestha
asked
in
Algorithms
May 10, 2019
by
srestha
654
views
algorithms
time-complexity
recurrence-relation
2
votes
2
votes
2
answers
3
pradeepchaudhary
asked
in
Algorithms
Jul 14, 2018
8,031
views
Time Complexity Of the Algorithm
Q.6 The time complexity of an algorithm T(n), where n is the input size, is given by— T(n)= T(n-1) + 1/n, if n>1 = 1, otherwise. The order of the algorithm is— (a) log n (c) n^2 (b) n (d) n*n
pradeepchaudhary
asked
in
Algorithms
Jul 14, 2018
by
pradeepchaudhary
8.0k
views
algorithms
time-complexity
recurrence-relation
2
votes
2
votes
2
answers
4
iarnav
asked
in
Algorithms
Apr 3, 2018
973
views
#Algorithm Help Solving Recurrence of Select Algorithm with guaranteed Linear time O(n)
Solution to the Recurrence equation $T(n) = T(n/5)+T(7n/10)+O(n)$ is
iarnav
asked
in
Algorithms
Apr 3, 2018
by
iarnav
973
views
algorithms
recurrence-relation
Subscribe to GATE CSE 2023 Test Series
Subscribe to GO Classes for GATE CSE 2023
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
-tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
From Rank 4200 to 64: My Journey to Success in GATE CSE Exam
What are the key things to focus on during the final 10-15 days before the GATE exam to improve performance?
All India GO Classes Mock test
NTA UGC NET JRF December 2022 Apply Online Form 2023
Life happens, just chill and do hardwork
Subjects
All categories
General Aptitude
(2.5k)
Engineering Mathematics
(9.3k)
Digital Logic
(3.3k)
Programming and DS
(5.8k)
Algorithms
(4.6k)
Theory of Computation
(6.7k)
Compiler Design
(2.3k)
Operating System
(5.0k)
Databases
(4.6k)
CO and Architecture
(3.8k)
Computer Networks
(4.6k)
Non GATE
(1.3k)
Others
(2.4k)
Admissions
(649)
Exam Queries
(842)
Tier 1 Placement Questions
(17)
Job Queries
(74)
Projects
(9)
Unknown Category
(853)
Recent Blog Comments
Eligibility Criteria: Discipline of...
4-year B.Tech./B.E. degree or a MSc./MCA degree...
I am not sure about others but I would pay 2X...
@DebRC Yes. This, time stamp and comparing...
Small feedback for next year. It would be great...
Twitter
WhatsApp
Facebook
Reddit
LinkedIn
Email
Link Copied!
Copy