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
Recent questions tagged recurrence-relation
0
votes
0
answers
1
Recurrence relation
What is the returned value by the given function below. Algo fun(n) { If(x<=2) return 1; Else { Return fun(n1/2) + n; } } Note : Assume that all the syntax and data type constraints are valid and just check algorithm.
jenilS7
asked
in
Algorithms
1 day
ago
by
jenilS7
19
views
recurrence-relation
algorithms
sequence-series
2
votes
4
answers
2
GATE CSE 2024 | Set 2 | Question: 5
Let $\text{T(n)}$ be the recurrence relation defined as follows: \[ \begin{array}{l} T(0)=1, \\ T(1)=2, \text { and } \\ T(n)=5 T(n-1)-6 T(n-2) \text { for } n \geq 2 \end{array} \] Which one of the following statements is TRUE? $T(n)=\Theta\left(2^{n}\right)$ $T(n)=\Theta\left(n 2^{n}\right)$ $T(n)=\Theta\left(3^{n}\right)$ $T(n)=\Theta\left(n 3^{n}\right)$
Arjun
asked
in
Algorithms
Feb 16
by
Arjun
2.0k
views
gatecse2024-set2
algorithms
recurrence-relation
asymptotic-notation
6
votes
2
answers
3
GO Classes Test Series 2024 | Mock GATE | Test 14 | Question: 56
The coefficient of $x^6$ in the expansion of $A(x)$ is, where $ A(x)=\frac{x(1+x)}{(1-x)^3} $
GO Classes
asked
in
Combinatory
Feb 5
by
GO Classes
484
views
goclasses2024-mockgate-14
numerical-answers
combinatory
recurrence-relation
2-marks
1
vote
0
answers
4
Memory Based GATE DA 2024 | Question: 19
Consider the function \(f(n)\), which represents the maximum number of comparisons in binary search on a sorted array of size \(n\). Which of the following recursive relationships correctly defines \(f(n)\)? \(f(n) = f\left(\lfloor \frac{n}{2} \rfloor\right) ... \rfloor\right)\) \(f(n) = f\left(\lfloor \frac{n}{2} \rfloor\right) + 1\) None of the above
GO Classes
asked
in
Algorithms
Feb 5
by
GO Classes
145
views
gate2024-da-memory-based
goclasses
algorithms
binary-search
recurrence-relation
3
votes
3
answers
5
GO Classes Test Series 2024 | Mock GATE | Test 12 | Question: 54
Of the following, which gives the best upper bound for the value of $f(N)$ where $f$ is a solution to the recurrence $ f(2 N+1)=f(2 N)=f(N)+\log N \text { for } N \geq 1, $ with $f(1)=0?$ $O(\log N)$ $O(N \log N)$ $O\left((\log N)^2\right)$ $O(N)$
GO Classes
asked
in
Algorithms
Jan 21
by
GO Classes
774
views
goclasses2024-mockgate-12
goclasses
algorithms
recurrence-relation
time-complexity
2-marks
7
votes
2
answers
6
GO Classes Test Series 2024 | Mock GATE | Test 11 | Question: 44
Acceptable input for a certain pocket calculator is a finite sequence of characters each of which is either a digit or a sign. The first character must be a digit, the last character must be a digit, and any character that is a sign must be followed by a digit. There ... by $N_k=a N _{k-1}+b N _{k-2}$, for $k \geq 3$. What is $a+ b?$
GO Classes
asked
in
Combinatory
Jan 13
by
GO Classes
514
views
goclasses2024-mockgate-11
goclasses
numerical-answers
combinatory
recurrence-relation
2-marks
0
votes
1
answer
7
solve this recurrence relation
T(n) = T(n^1/2) + n doing this in substitution method gives the ans as O(n) but using tree recursion gives the ans as O(nlogn) which of these are correct and which has to be considered for worst case
vivek1211
asked
in
Algorithms
Oct 2, 2023
by
vivek1211
252
views
recurrence-relation
0
votes
1
answer
8
GATE: Algorithms (Source: StackOverflow)
rajishu07
asked
in
Algorithms
Oct 1, 2023
by
rajishu07
232
views
algorithms
recurrence-relation
0
votes
1
answer
9
Recurrence relations
Consider the following function: function X(n,r) { if(r==0 or n == r) then return 1; else return (X(n-1,r-1,) + X(n-1,r)); } Find the worst case time complexity of function X ?
practicalmetal
asked
in
Algorithms
Sep 15, 2023
by
practicalmetal
331
views
recurrence-relation
algorithms
0
votes
0
answers
10
How to solve the following recurrence relation? I get confused when decimals are used in the expression.
rexritz
asked
in
Algorithms
Aug 13, 2023
by
rexritz
291
views
recurrence-relation
master-theorem
Page:
1
2
3
4
5
6
...
24
next »
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
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
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(683)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
243k
comments
79.7k
users
Recent questions tagged recurrence-relation
Recent Blog Comments
Hlo I'm Rupesh I got AIR 3485 in gate CS and AIR...
@Ajay Sasank here is the direct link...
Thank you for the post didi My GATE 2023 & 2024...
I Hope it helps 😊
Today's best post I seen thank you for motivation