Awesome q2a theme
Ask us anything
Toggle navigation
Email or Username
Password
Remember
Login
Register
|
I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Exams
Recent questions and answers in Algorithms
0
votes
0
answers
Made_Easy_Test_Series Algorithms- Quick sort
Doubt: Is it really possible to write recurrence relation of for quick sort like it is given in the solution? if yes, then Please explain that how can one find the value of k in quick sort’s recurrence relation T(n)= T(n-k)+T(k-1)+cn in order to get the given recurrence relation in solution.
[closed]
asked
1 day
ago
in
Algorithms
by
Rudr Pawan
(
688
points)
|
6
views
+1
vote
0
answers
MadeEasy Test Series - Worst case height in Binary tree
asked
2 days
ago
in
Algorithms
by
luc_Bloodstone
(
26
points)
|
13
views
made-easy-test-series
algorithms
binary-tree
data_structure
0
votes
1
answer
self doubt on time complexity
What is the recurrence equation and how to solve it?
answered
2 days
ago
in
Algorithms
by
arya_stark
(
24
points)
|
11
views
algorithms
time-complexity
0
votes
0
answers
self doubt in algorithms time complexity
What is the answer for this?
asked
2 days
ago
in
Algorithms
by
Abhipsa Mishra
(
13
points)
|
3
views
algorithms
time-complexity
#algorithms
0
votes
0
answers
#Algorithms#METestSeries
As the question is asking about minimum no of comparision in best algo then if we take one pair of smallest largest size length like comparison bet 70 and 102 (merged size= 70+102= 172) = min(70,102) = 70 ----(i) comparison bet 74 and 85 (merged size= 74+ 85=159) = 74 ... 80=252) = 80 ---(iii) comparison bet 252 and 159 = 159 ---(iv) Total = 70+74+80+159 = 383 ??am i wrong?
asked
4 days
ago
in
Algorithms
by
nandani17
(
12
points)
|
8
views
0
votes
1
answer
Solve the recurrence relation: T(n) = T(n^(1/2)) + n
answered
4 days
ago
in
Algorithms
by
!KARAN
(
156
points)
|
8
views
recurrence-relations
time-complexity
0
votes
0
answers
MOCK TEST SERIES ACE
Suppose there are two singly linked lists both of which intersect at some point and become a single linked list. The head or start pointers of both the lists are known, but the intersecting node and lengths of lists are not known. What is worst case time complexity of optimal ... ), where m, n are lengths of given lists (D) Θ(min(n, m)), where m, n are lengths of given lists
asked
6 days
ago
in
Algorithms
by
Dipanshu Rana
(
24
points)
|
11
views
0
votes
0
answers
ACE TEST SERIES Algorithm
asked
Dec 1
in
Algorithms
by
Rajesh Panwar
(
40
points)
|
14
views
0
votes
2
answers
DAA ACE TEST SERIES
answered
Dec 1
in
Algorithms
by
Pratyush Priyam Kuan
(
381
points)
|
23
views
0
votes
0
answers
Testbook test series algorithms
An unordered list contains n distinct elements. What is the number of comparisons to find an element in this list that is neither maximum nor minimum is: O(nlogn) O(n) O(logn) O(1)
asked
Nov 30
in
Algorithms
by
Abhipsa Mishra
(
13
points)
|
14
views
algorithms
0
votes
1
answer
Madeeasy Test series - time complexity
What is the time complexity of foo() and bar() ? I solved it and get ans correct for foo(), but for bar() I am getting wrong ans, for bar(): T(n) = 2T(n-1) + c; c is constant I solved it and get this: T(n) = 2^(n-1) * 3^n ... bar() is T(n) = O(2^n), I don't understand how they get this. Is my recurrence equation is wrong or something else, please solve this.
answered
Nov 29
in
Algorithms
by
avistein
(
325
points)
|
22
views
time-complexity
made-easy-test-series
algorithms
data_structure
0
votes
0
answers
Self doubt on time complexity calculation
Please show how to calculate time complexity of $T(n) = 3T(n/4) + n^2$ using recursion tree method. Thanks!
asked
Nov 29
in
Algorithms
by
Abhipsa Mishra
(
13
points)
|
14
views
algorithms
time-complexity
0
votes
0
answers
Self doubt on time complexity calculation
What is the time complexity of the following recurrence equation : T(n) = T(n/2) + T(n/4) + T(n/8) + n I solved it using recursion tree method and I'm getting O(n) as the answer. Please let me know the answer and the procedure you used. Thank you.
asked
Nov 29
in
Algorithms
by
Abhipsa Mishra
(
13
points)
|
15
views
algorithms
time-complexity
0
votes
0
answers
ACE Test Series CSIT_P_39 Q18: DFS
asked
Nov 26
in
Algorithms
by
DukeThunders
(
288
points)
|
18
views
0
votes
1
answer
Self doubt on Graph theory Question
Let Graph $G$ has 1 vertex of degree $3$, 3 vertices of degree $2$ and 1 vertex of degree $1$. Is $G'$connected or Disconnected ?
answered
Nov 26
in
Algorithms
by
GAITONDE
(
1.6k
points)
|
57
views
graph-theory
algorithms
0
votes
0
answers
ACE Test Series Test 50 Algo: Dijkstra Algo
asked
Nov 25
in
Algorithms
by
DukeThunders
(
288
points)
|
31
views
0
votes
1
answer
MadeEasy Test Series - Calculate time complexity
What is the time complexity of below function? Can we able to solve it by Masters Theorem?
answered
Nov 25
in
Algorithms
by
GAITONDE
(
1.6k
points)
|
27
views
time-complexity
made-easy-test-series
algorithms
data_structure
0
votes
0
answers
MadeEasy Test Series - Question on array of pointers
asked
Nov 25
in
Algorithms
by
luc_Bloodstone
(
26
points)
|
32
views
made-easy-test-series
#pointers
algorithms
data_structure
0
votes
1
answer
testbook MST doubt
In the above question what does the line "edges are uniformly distributed over the half open interval [0,1)" means and whats the significance of this in constructing MST?
answered
Nov 20
in
Algorithms
by
Kushagra गुप्ता
(
154
points)
|
18
views
#algorithms
mst
0
votes
0
answers
Cormen 3e Chapter 6 Exercise 6.5-9
Give an O(nlogk)-time algorithm to merge k sorted lists into one sorted list, where n is the total number of elements in all input lists. (Use a min-heap for k-way merge)
asked
Nov 19
in
Algorithms
by
aditi19
(
54
points)
|
16
views
cormen
#heap
merging
data_structure
0
votes
0
answers
Self doubt (Algorithms)
Time complexity of the best possible algorithm to transform a min-heap to max-heap is?
asked
Nov 18
in
Algorithms
by
Priyansh Singh
(
118
points)
|
16
views
#heap
0
votes
1
answer
#Algorithms#GATE
answered
Nov 17
in
Algorithms
by
arya_stark
(
24
points)
|
22
views
0
votes
0
answers
Ace Test Offline
i=n; while(i>0) { k=1; for(j=0;j<=n;j+=k) k++; i/=2; } The time complexity of following piece of code is: $O(nlog(n))$ $O(log^2n)$ $O(n^2)$ $O(log(n*sqrt(n)) $
asked
Nov 17
in
Algorithms
by
Akash Papnai
(
8
points)
|
23
views
time-complexity
algorithms
0
votes
0
answers
ACE Question Algorithms
I I have solved this question using heap So the time would be O(n) + O(logn) +O(logn) + O(logn) =O(n) But B and C are almost same which one would be correct? Any one please clarify.
asked
Nov 17
in
Algorithms
by
Shivateja MST
(
65
points)
|
10
views
algorithms
0
votes
0
answers
Cormen Edition 3 Exercise 22.4 Question 3 (Page No. 615)
asked
Nov 13
in
Algorithms
by
Kushagra गुप्ता
(
154
points)
|
14
views
cormen
graph-algorithms
descriptive
dfs
0
votes
0
answers
MADE EASY: ALGO 2020
Isnt the 2nd statement right? We can find the number of ways to parenthesize $n+1$ matrices in $2n_C$_n/(n+1)$ ways right?
asked
Nov 7
in
Algorithms
by
Debapaul
(
308
points)
|
6
views
0
votes
0
answers
algorithm time complexcity
2T(n/2)+n/logn find its time complexity by masters theorem ??
asked
Nov 7
in
Algorithms
by
69akki
(
8
points)
|
13
views
0
votes
0
answers
Algorithms-DP (Ref: Gatebook Test series & https://www.cs.umd.edu/class/fall2014/cmsc351/HW/hw4-solutions.pdf)
asked
Nov 6
in
Algorithms
by
Kushagra गुप्ता
(
154
points)
|
10
views
algorithms
dynamic-programming
0
votes
0
answers
madeeasy test series algorithms
asked
Nov 5
in
Algorithms
by
kalra05
(
19
points)
|
32
views
#algorithms#timecomplexity
0
votes
1
answer
Introduction to algorithms(Cormen)-2e-Chapter:15-DP
answered
Nov 4
in
Algorithms
by
Arjun
(
63
points)
|
35
views
algorithms
cormen
dynamic-programming
0
votes
2
answers
#Madeeasy_Algorithms#GATE 2020
answered
Nov 3
in
Algorithms
by
Rudr Pawan
(
688
points)
|
17
views
0
votes
0
answers
Applied Gate Test series
Find the time complexity of codes below – for(i=1;i<n*n*n*;i*=n) { for(j=0;j<n;j+=2) { for(k=1;k<n;k*=3) { //constant; } } } for(i=0;i<n;i++) { if(i mod 2 ==0) { for(j=i;j<n;j++) { if(i%2==0 && j%2==0) printf("Gate 2020"); } } }
asked
Nov 3
in
Algorithms
by
MRINMOY_HALDER
(
37
points)
|
35
views
algorithms
time-complexity
0
votes
0
answers
Made easy Algorithm book
Suppose that you are running Dijkstra’s Algorithm on the edge-weighted digraph below starting from vertex A. Vertex Distance Parent A 0 NULL B 2 A C 13 F D 23 A E 11 F F 7 B G 36 F H 19 E What is the possible value of expression x+y?
[closed]
asked
Nov 1
in
Algorithms
by
Akash Papnai
(
8
points)
|
9
views
algorithms
0
votes
1
answer
Find number of Minimum cost spanning tree possible? (MadeEasy Test Series)
answered
Oct 20
in
Algorithms
by
pranay562
(
666
points)
|
44
views
algorithms
data_structure
graph-theory
mst
made-easy-test-series
0
votes
0
answers
TIme complexity Made easy
What is time complexity for this function?
asked
Oct 17
in
Algorithms
by
vupadhayayx86
(
6
points)
|
22
views
time-complexity
programming
made-easy-test-series
gate
0
votes
0
answers
floor or ceil which to use in the given problem's time complexity #self-doubt (example of Narasimha Karumanchi)
asked
Oct 17
in
Algorithms
by
debasree88
(
8
points)
|
9
views
0
votes
1
answer
#Self Doubt Huffman Coding!
Hello all, I've this trivial doubt in Huffman coding algorithms questions - Mostly there's a question of type - What is the min expected length of the message? Now my doubt is in some questions - after finding expected length of message = no of bits ... t figure out in which case one has to divide and in which case not to divide with total number of characters? Thank you
answered
Oct 14
in
Algorithms
by
Rudr Pawan
(
688
points)
|
26
views
algorithms
huffman-code
0
votes
1
answer
Deletion of an element from Heap
The best time required to delete an element x,if present, in a min-heapof n elements is O(logn) O(n) O(n logn) None of these
answered
Oct 13
in
Algorithms
by
!KARAN
(
156
points)
|
22
views
algorithms
0
votes
1
answer
Algorithm ACE Test Series Test 29 on Recurrence relation
answered
Oct 12
in
Algorithms
by
Rudr Pawan
(
688
points)
|
15
views
0
votes
1
answer
Difference between logarithmic notations
Can any one please tell what is difference between (log^2)n ,(logn)^2 and loglogn? Are these equal?
answered
Oct 12
in
Algorithms
by
Rudr Pawan
(
688
points)
|
32
views
algorithms
To see more, click for all the
questions in this category
.
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
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.
Top Users
Dec 2019
Pratyush Priyam Kuan
147 Points
Vimal Patel
72 Points
avistein
65 Points
Mk Utkarsh
47 Points
Debapaul
21 Points
vishal burnwal
19 Points
Shaik Masthan
18 Points
srestha
18 Points
Priyansh Singh
16 Points
DukeThunders
14 Points
Monthly Top User and those within 60% of his/her points will get a share of monthly revenue of GO subject to a minimum payout of Rs. 500. Current monthly budget for Top Users is Rs. 75.
All categories
General Aptitude
41
Engineering Mathematics
270
Digital Logic
150
Programming & DS
262
Algorithms
212
Theory of Computation
332
Compiler Design
136
Operating System
198
Databases
225
CO & Architecture
161
Computer Networks
184
Non GATE
2
Others
56
Admissions
11
Exam Queries
20
Tier 1 Placement Questions
2
Job Queries
4
Projects
1
Recent questions and answers in Algorithms
2,267
questions
1,281
answers
6,475
comments
89,713
users