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

I forgot my password
All Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous
Blogs
New Blog
Exams
First time here? Checkout the
FAQ
!
x
×
Close
Use the google search bar on side panel. It searches through all previous GATE/other questions. For hardcopy of previous year questions please see
here
Recent questions tagged algorithms
Webpage for Algorithms
0
votes
3
answers
1
Find total number of comparisons needed
What is the total number of comparisons needed in the best case to find minimum and maximum of $300 $ elements?
asked
6 days
ago
in
Algorithms
by
pankaj_vir
Loyal
(
9.5k
points)

67
views
algorithms
normal
sorting
+1
vote
0
answers
2
radix sort counting sort
Given an array where numbers are in range from 1 to n6, which sorting algorithm can be used to sort these number in linear time? 1)Counting Sort 2)Radix Sort 3)Bubble Sort 4)Merge Sort.
asked
Oct 9
in
Algorithms
by
Kaushal Sanadhya
(
61
points)

30
views
algorithms
sorting
timecomplexity
radix
+1
vote
0
answers
3
Merge sort
How many swaps are performed in Merge sort algorithm in worst case?
asked
Oct 9
in
Algorithms
by
Kaushal Sanadhya
(
61
points)

48
views
mergesort
algorithms
sorting
merging
0
votes
0
answers
4
Merge Sort Doubt
what is the recurrence relation for merge sort?
asked
Oct 6
in
Algorithms
by
aditi19
Junior
(
843
points)

24
views
mergesort
algorithms
timecomplexity
#recurrencerelations
sorting
divideandconquer
0
votes
0
answers
5
Selfdoubt  Case of Deletion when Open Addressing is used for collision resolution
asked
Oct 5
in
Algorithms
by
Soumya29
Boss
(
13.3k
points)

72
views
hashing
algorithms
0
votes
0
answers
6
Self Doubt
What would be the worst case time complexity of an unreachable code? Let's say there are two parts to the code, where first part is if (0) with complexity O(n) and the else part with O(1). Something like this: if (0) { Time complexity ... or we deduce it logically? Is there any resource to support this? How is time complexity calculated for unreachable code? Thanks Registered user 48
asked
Oct 4
in
Algorithms
by
Registered user 48
(
165
points)

22
views
algorithms
selfdoubt
programming
+1
vote
3
answers
7
recurrence relation MIT
$T(n)=\sqrt{n} T(\sqrt{n})+100n$ Please solve this.
asked
Oct 4
in
Algorithms
by
sushmita
Boss
(
14.6k
points)

63
views
recurrence
algorithms
timecomplexity
recurrenceeqation
discretemathematics
+1
vote
0
answers
8
#self doubt #greedy method #testseries
Consider the multistage graph with 6 stages then what is the minimum cost from Source node (A) to Destination node (N) using Greedy Method ______
asked
Oct 4
in
Algorithms
by
meghna
Active
(
1.6k
points)

31
views
algorithms
mstgreedy
0
votes
0
answers
9
#self doubt #minimum spanning tree
T/F In a graph G=(V,E) suppose that each edge e ∊ E has an integer weight w(e) such that 1<= W(e) <=n Then there is a an o(mlogn) time algorithm to ﬁnd a minimum spanning tree in G. Also,Does this "weight w(e) such that 1<= W(e) <=n" has significance on time complexity or we consider it as some edges weights and proceed?
asked
Oct 4
in
Algorithms
by
meghna
Active
(
1.6k
points)

9
views
minimumspanningtrees
algorithms
0
votes
0
answers
10
Prove that for any constant c > 0, (log n)^c = o(n).
asked
Oct 3
in
Algorithms
by
Ojamajo Conan
(
35
points)

9
views
algorithms
timecomplexity
+1
vote
1
answer
11
write efficient algorithm
Let S be a set of n positive integers, where n is even. Give an efficient algorithm to partition S into two subsets S1 and S2 of n/2 elements each with the property that the difference between the sum of the elements in S1 and the sum of the elements in S2 is maximum. What is the time complexity of your algorithm?
asked
Oct 3
in
Algorithms
by
Ojamajo Conan
(
35
points)

18
views
algorithms
datastructure
0
votes
1
answer
12
Self Doubt
What is adaptive algorithm and is merge sort and quick sort is adaptive?
asked
Oct 2
in
Algorithms
by
iamdeepakji
(
79
points)

23
views
algorithms
0
votes
0
answers
13
Optimal BST
what are the applications of optimal binary search tree?
asked
Oct 1
in
Algorithms
by
aditi19
Junior
(
843
points)

10
views
algorithms
bst
obst
0
votes
0
answers
14
Self doubt
"FIFO sometimes can support stack property" And sometimes not and so,it will fall in bealady's anomaly Why is it so ?
asked
Sep 30
in
Operating System
by
Prince Sindhiya
Active
(
3.6k
points)

13
views
pagereplacement
algorithms
0
votes
1
answer
15
time complexity
If both of the algorithms A and B need O(nlogn) time then they both are equally efficient and finish in same amount of time. TRUE OR FALSE
asked
Sep 28
in
Algorithms
by
sushmita
Boss
(
14.6k
points)

60
views
timecomplexity
algorithms
asymptoticnotations
0
votes
1
answer
16
MIT assignment
Find the complexity of the following code fragment: int i = 1; for(; i <= n logn; i + +) { for(i + +; i <= n; i + +) { print(1) } }
asked
Sep 28
in
Algorithms
by
sushmita
Boss
(
14.6k
points)

76
views
timecomplexity
asymptoticnotations
algorithms
0
votes
2
answers
17
Can we solve the recurrence T(n) = T(n/2) + 2^n by masters theorem, if possible?
asked
Sep 28
in
Algorithms
by
mohitrai0_0
(
157
points)

49
views
recurrence
algorithms
mastertheorem
timecomplexity
asymptoticnotations
+1
vote
1
answer
18
MIT ASSIGNMENT
Find the complexity of the following function when called with some integer n: void foo(n) { int i,j,k,x=0; for (i=1 ; i ≤ n ; i++) for (j=1 ; j ≤ i * i ; j++) { for ( k = 1 ; k ≤ j ; k++) { x=x+10; } }
asked
Sep 28
in
Algorithms
by
sushmita
Boss
(
14.6k
points)

75
views
algorithms
timecomplexity
asymptoticnotations
0
votes
1
answer
19
MIT ASSIGNMENT
FIND THE TIME COMPLEXITY int i=1,j; for(;i <= n;i + +) { for(j = i; j <= nlogn; j∗ = 2) { sum + +; } }
asked
Sep 28
in
Algorithms
by
sushmita
Boss
(
14.6k
points)

48
views
algorithms
timecomplexity
asymptoticnotations
0
votes
1
answer
20
MIT assigment
Arrange the following functions in their increasing order of complexities. $f(n) = n ^{0.999999} * logn$ ($log n$ is not in power) $g(n) = 10000 n$ $h(n) = n^{2}$ $k(n) = (1.000001)^{n}$ $p(n) = \frac{2 ^{√n}}{ n^{2}}$ $q(n) = \frac{n^{1.000001}}{logn}$
asked
Sep 28
in
Algorithms
by
sushmita
Boss
(
14.6k
points)

118
views
timecomplexity
algorithms
asymptoticnotations
0
votes
0
answers
21
mit assignment
State true/false f(n) != O(g(n)) and g(n) != O(f(n))
asked
Sep 28
in
Algorithms
by
sushmita
Boss
(
14.6k
points)

31
views
algorithms
timecomplexity
asymptoticnotations
0
votes
0
answers
22
Cormen
Let $T$ be a minimum weight spanning tree of graph $G = (V, E)$, and let $V’$ be a subset of $V$ . Let $T'$ be a subgraph of $T$ induced by $V'$ and let $G’$ be a subgraph of $G$ induced by $V'$. Prove that If $T'$ is connected , then $T'$ is a minimum weight spanning tree of graph $G′$
asked
Sep 27
in
Algorithms
by
sushmita
Boss
(
14.6k
points)

34
views
algorithms
timecomplexity
minimumspanningtrees
+1
vote
1
answer
23
Vani test series question
https://gateoverflow.in/?qa=blob&qa_blobid=16020532755515515346 Shouldnt the answer be option d? How option c?
asked
Sep 26
in
Algorithms
by
Human
(
99
points)

54
views
algorithms
0
votes
2
answers
24
Self doubt
Find the Complexity of: T(N) = T(${\sqrt{N}}$) + NlogN
asked
Sep 24
in
Algorithms
by
Sirjanpreet Singh Ba
(
7
points)

43
views
timecomplexity
algorithms
+1
vote
0
answers
25
Algorithm Searching
Which is faster and by how much, a linear search of only 1000 elements on a 5GHz computer or a binary search of 1 million elements on a 1GHz computer. Assume that the execution of each instruction on the 5GHz computer is five times ... 1GHz computer and that each iteration of the linear search algorithm is twice as fast as each iteration of the binary search algorithm.
asked
Sep 23
in
Algorithms
by
Vaishnavi01
(
153
points)

19
views
algorithms
searching
gate
+1
vote
0
answers
26
Algorithms arrays
asked
Sep 23
in
Algorithms
by
Vaishnavi01
(
153
points)

21
views
arrays
algorithms
programming
0
votes
0
answers
27
Cormen Appendix A
Why does (1/3+1/c) <=1?
asked
Sep 22
in
Algorithms
by
Noddy
(
27
points)

12
views
algorithms
asymptoticnotations
timecomplexity
0
votes
0
answers
28
Randomized Quicksort
True or False : In randomized quicksort , eack key is involved in the same number of comparisons.
asked
Sep 21
in
Algorithms
by
Vaishnavi01
(
153
points)

25
views
algorithms
sortingalgorithmsquicksort
gate
0
votes
0
answers
29
Quick Sort Analysis
Consider the Quicksort algorithm.Suppose there is a procedure for finding a pivot element which splits the list into two sublists each of which contains at least onefifth of the elements.Let T(n) be the number of comparisons required to sort n elements.Then: A. T(n)<=2T(n/5)+n B. T(n)<=T(n/5)+T(4n/5)+n C. T(n)<=2T(4n/5)+n D. T(n)<=2T(n/2)+n
asked
Sep 21
in
Algorithms
by
Vaishnavi01
(
153
points)

54
views
quicksort
algorithms
sorting
timecomplexity
gate
0
votes
1
answer
30
timecomplexcity
for(i=0;i<n;i++) for(j=0;j<i;j++) for(k=0;k<j;k++) what is the time complexity of above psudo code? explain.
asked
Sep 21
in
Algorithms
by
balaganesh
(
125
points)

39
views
timecomplexity
algorithms
asymptoticnotations
Page:
1
2
3
4
5
6
...
67
next »
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
List of Available Exams
New Assignment on Network programming : P2P simulation
Theory of Computation  GO Classroom
Probability  GO Classroom
Daily Quiz
Follow @csegate
Gatecse
Recent questions tagged algorithms
Recent Blog Comments
@IITDELHIVISHAL Yes, it will work. Make your...
sir if watch& making notes from quality videos...
yes! those will be available on GO,no need to pay
did you mean, those tests also available in GO?
It's a test series conducted by Kiran sir i.e...
40,770
questions
47,479
answers
145,655
comments
62,241
users