The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Recent questions tagged recurrenceeqation
+3
votes
1
answer
1
time complexity to solve recurrence relation
recurrence relation for the functional value of F(n) is given below : $F(n) = a_{1}F(n1) + a_{2}F(n2) + a_{3}F(n3) + ....... + a_{k}F(nk)$ where $a_{i} =$ non zero constant. Best time complexity to compute F(n) ? assume k base values starting from F( ... ( $O(k_{2}r^{k_{1}n})$) B. Linear ( $O(n)$ ) C. Logarithmic ( $O(\log n)$ ) D. $O(n \log n)$
asked
Aug 11, 2016
in
Algorithms
by
dd

611
views
algorithms
recurrence
timecomplexity
recurrenceeqation
+2
votes
1
answer
2
Find the complexity of recurrence equation:
A scientist developed a new algorithm for computation and he observed that ot follows the recurrence equation as $T(n) = \begin{cases} 2T(n1) 1 & \quad if\: n>0 \\ 1 & \quad otherwise \end{cases}$ What is the complexity of new algorithm? $2^n$ $2^{n+1}$ $2^{n1}$ None of these
asked
Jul 12, 2016
in
Algorithms
by
sh!va

229
views
recurrenceeqation
algorithms
timecomplexity
+1
vote
3
answers
3
UGCNETDec2012III: 14
Let $T(n)$ be a function defined by $T(n) =1$ and $T(n)=2T (n/2) + \sqrt{n}$, which of the following is true? $T(n) = O(\sqrt{n})$ $T(n) = O(\log_2 n)$ $T(n) = O(n)$ $T(n) = O(n^2)$
asked
Jul 12, 2016
in
Algorithms
by
jothee

505
views
ugcnetdec2012iii
algorithms
recurrenceeqation
timecomplexity
+2
votes
1
answer
4
Order and run time of the algorithm?
Running time of an algorithm T(n), where n is input size is given by T(n) = 8 T(n/2) + qn, if n>1 T(n) = p, if, n=1 where p and q are constants. The order of algorithm is A. n2 B. nn C. n3 D. n
asked
Jan 22, 2016
in
Algorithms
by
Purple

1.7k
views
algorithms
recursion
recurrenceeqation
Page:
« prev
1
2
3
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
IISc CDS Interview Experience, 2020
IITD MS CSE (Systems) Experience
IIT Bombay M.Tech. (RA)  Interview Experience
Interview Experience for MS(R)IIT Delhi (School of Information Technology)
How am I preparing
Subjects
All categories
General Aptitude
(2k)
Engineering Mathematics
(8.2k)
Digital Logic
(2.9k)
Programming and DS
(5k)
Algorithms
(4.4k)
Theory of Computation
(6.2k)
Compiler Design
(2.2k)
Operating System
(4.6k)
Databases
(4.2k)
CO and Architecture
(3.4k)
Computer Networks
(4.2k)
Non GATE
(1.2k)
Others
(1.5k)
Admissions
(595)
Exam Queries
(562)
Tier 1 Placement Questions
(23)
Job Queries
(71)
Projects
(19)
Unknown Category
(1k)
Recent questions tagged recurrenceeqation
Recent Blog Comments
I got interview on 10th August 2020. Please...
They were eligible
Please add this one in the list too! IISc CDS...
Very helpful. can't thank you enough! :) :)
@toxicdesire I don't remember the exact...
Network Sites
GO Mechanical
GO Electrical
GO Electronics
GO Civil
CSE Doubts
52,345
questions
60,513
answers
201,931
comments
95,355
users