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
0
answers
1
doubt. not getting the concept
asked
16 hours
ago
in
Algorithms
by
Deepanshu
(
363
points)

15
views
algorithms
0
votes
0
answers
2
Algorithm(Goodrich)1.7
Show that $log^{3}n$ is $o\left ( n^{1/3} \right )$
asked
19 hours
ago
in
Algorithms
by
srestha
Veteran
(
91.6k
points)

45
views
algorithms
timecomplexity
0
votes
1
answer
3
Made Easy algorithms
How many edge disjoint spanning trees are possible for a undirected complete connected graph of n vertices?
asked
1 day
ago
in
Algorithms
by
Sambhrant Maurya
Junior
(
605
points)

23
views
algorithms
spanningtree
graphtheory
0
votes
0
answers
4
made easy, recurrence relations
which of the following cannot be solved using masters theorem? a) T(n) = 2T(n/2) + n/logn b) T(n) = 2T(n/2) + logn c)T(n)=T(n/2)+logn d) non of these
asked
4 days
ago
in
Algorithms
by
manvi_agarwal
(
37
points)

78
views
recurrence
algorithms
master
theorem
timecomplexity
0
votes
0
answers
5
selfdoubt
While solving the problem of longest match subsequence we use the concept of dynamic programming which further uses tabulation. For given 2 strings we can create a table using 2D matrix but how we'll draw the same table for 3 or more number of strings?
asked
4 days
ago
in
Algorithms
by
AIkiran01
(
163
points)

15
views
algorithms
dynamicprogramming
0
votes
2
answers
6
masters theorem
Solution using back substitution method T(n) = 2T(n/2) + nlogn ? detailed solution please. ans is nlognlogn or n(logn)^2
asked
4 days
ago
in
Algorithms
by
manvi_agarwal
(
37
points)

27
views
timecomplexity
algorithms
mastertheorem
asymptoticnotations
recurrence
0
votes
3
answers
7
Time Complexity
What is the time complexity of the following? for(i=0; i < n *n ; i = i *i) print("*");
asked
5 days
ago
in
Algorithms
by
smsubham
Loyal
(
6.6k
points)

46
views
timecomplexity
algorithms
asymptoticnotations
0
votes
0
answers
8
self doubt
consider the following c program A A(n) { if(n<=1) return (n2+n+1); else return ( 5A(n/2)+ 3A(n/2)+n2 } find time complexity T(n)=?
asked
6 days
ago
in
Algorithms
by
hitendra singh
(
213
points)

45
views
algorithms
mastertheorem
0
votes
0
answers
9
RECURRENCE RELATION DOUBT
Which of the following methods enlisted can be termed as best and appropriate for solving recurrence relation? 1)Substitution Method 2)Recurrence Tree 3)Master's Theorem
asked
Aug 7
in
Algorithms
by
Devshree Dubey
Boss
(
13.2k
points)

20
views
algorithms
recurrence
0
votes
0
answers
10
Self doubt
What is edge disjoint spanning trees?
asked
Aug 7
in
Algorithms
by
Prince Sindhiya
Active
(
1.7k
points)

5
views
algorithms
0
votes
0
answers
11
Ace Algorithms
Leading element in an array of n elements is the element which occurs more than n/2 times in the array. a) What is the time complexity to find whether a leading element exists or not in a sorted array of n elements? b)What is the time complexity to find ... between 0 to n? c)What is the time complexity to find whether leading element exists or not in an unsorted array of n elements?
asked
Aug 7
in
Algorithms
by
Sambhrant Maurya
Junior
(
605
points)

57
views
algorithms
divideandconquer
binarysearch
0
votes
0
answers
12
Made Easy Algorithms
How to calculate the time complexity for finding repeated elements in an array of n elements using linear search and binary search?
asked
Aug 6
in
Algorithms
by
Sambhrant Maurya
Junior
(
605
points)

16
views
algorithms
timecomplexity
binarysearch
0
votes
0
answers
13
Made Easy algorithms
Given an array of n elements, two elements in the array a[i] and a[j] are said to be inverse only if a[i]>a[j] && i<j. What is the time complexity required to find the number of inverses in the given array using merge sort? a) O(n) b) O(n2) c) O(nlogn) d) O(logn)
asked
Aug 6
in
Algorithms
by
Sambhrant Maurya
Junior
(
605
points)

16
views
algorithms
mergesort
timecomplexity
+1
vote
1
answer
14
Made Easy algorithms
After applying few passes of quick sort on a given array, the following output was obtained: 1,10,5,8,25,44,55,30,70 Then how many pivot elements are there in the above output?
asked
Aug 6
in
Algorithms
by
Sambhrant Maurya
Junior
(
605
points)

21
views
algorithms
quicksort
0
votes
0
answers
15
Masters Theorem
How can we apply Masters theorem to these equations : T(n) = 16*T(n/4) + n! and T(n) = 4*T(n/2) + cn Please explain the process.
asked
Aug 6
in
Algorithms
by
Rahul Ranjan 1
(
141
points)

27
views
mastertheorem
timecomplexity
algorithms
asymptoticnotations
recurrence
0
votes
0
answers
16
#G.S.BALUJA # DATA STRUCTURE
How many real links are required to store an sparse matrix of 10 row 10 coloumns and 15 non zero entries...??
asked
Aug 5
in
Programming
by
Shubham10baranwal
(
7
points)

17
views
datastructure
algorithms
0
votes
1
answer
17
self doubt
worst no. of comparision required for sort n numbers by insertion sort and selection sort if: 1. Array is already sorted. 2. Array is sorted but in descending order. 3. Array is not sorted.
asked
Aug 5
in
Algorithms
by
iamdeepakji
(
21
points)

16
views
algorithms
+1
vote
1
answer
18
How Bellman ford is dynamic programming?
asked
Aug 3
in
Algorithms
by
Sandy Sharma
Junior
(
675
points)

35
views
shortestpath
algorithms
graphalgorithms
bellmanford
0
votes
2
answers
19
Slowness and Fastness of any algorithm
How the slowness and the fastness of any algorithm depends ? Is (n/logn) is slower than log(logn) ?
asked
Aug 2
in
Algorithms
by
ashwina
Active
(
2k
points)

28
views
algorithms
0
votes
0
answers
20
DFS BFS
Please give an example i didn't get it The depth of any DFS tree rooted at a vertex is at least as much as the depth of any BFS tree rooted at the same vertex.
asked
Aug 2
in
Algorithms
by
Rishav Kumar Singh
Active
(
1.5k
points)

17
views
dfs
bfs
algorithms
+1
vote
1
answer
21
Sorting
Could a binary search tree be built using o(n lg n) comparisons in the comparison model? Explain why or why not.
asked
Aug 2
in
Algorithms
by
Ravi Dubey
(
75
points)

24
views
sorting
algorithms
timecomplexity
testseries
0
votes
0
answers
22
Master theorem rules
On which of the following recurrence relation Master Theorem cannot be applied? a) T(n)=2T(n/2)+nlogn b) T(n)=T(n/2)+1 c) T(n)=8T(n/2)+logn d) T(n)=7T(n/4)+n^2
asked
Aug 1
in
Algorithms
by
Sandy Sharma
Junior
(
675
points)

36
views
algorithms
mastertheorem
+1
vote
3
answers
23
CORMEN
What is the asymptotic performance of TREEINSERT when used to insert n items with identical keys into an initially empty binary search tree?
asked
Aug 1
in
Algorithms
by
Rishav Kumar Singh
Active
(
1.5k
points)

27
views
algorithms
bst
0
votes
2
answers
24
time complexity
main() { int i,count; for (i=1; i<=n; i++) { for(i=1; i<=(n*n); i++) { for(i=1; i<=(n*n*n); i++) { count++; } } } } What will be the time complexity of the given program?
asked
Jul 31
in
Algorithms
by
Bhunesh_Singh
(
19
points)

34
views
timecomplexity
algorithms
+2
votes
1
answer
25
Self doubt algorithms
In coremen it is given that $log^kn$=$(logn)^k$ $loglogn$ is not equal to $log^2n$ i understood it with example please correct me if I am wrong .
asked
Jul 31
in
Algorithms
by
Prince Sindhiya
Active
(
1.7k
points)

51
views
algorithms
+3
votes
1
answer
26
DFS Algo
Is following statement true/false? A DFS of a directed graph always produces the same number of tree edges, i.e., independent of the order in which vertices are considered for DFS. Answer is FALSE please explain
asked
Jul 30
in
Algorithms
by
Rishav Kumar Singh
Active
(
1.5k
points)

30
views
dfs
algorithms
+1
vote
1
answer
27
MIT_algorithms
I don't understand How?
asked
Jul 30
in
Algorithms
by
Rishav Kumar Singh
Active
(
1.5k
points)

56
views
timecomplexity
algorithms
+2
votes
3
answers
28
sorting
When the recurrence relation for both are same , why they both getting different result? Q1. In a modified merge sort, the input array is splitted at a position onethird of the length(N) of the array. What is the worst case time complexity of this merge sort? ANSWER: recurrence ... is If for first case it is N(log3/2N) then for second case also it should be N(log4/3N) BUT its not. WHY?
asked
Jul 30
in
Algorithms
by
Rishav Kumar Singh
Active
(
1.5k
points)

48
views
algorithms
sorting
timecomplexity
+3
votes
0
answers
29
GeeksForGeeks
Maximum Subarray Sum problem is to find the subarray with maximum sum. For example, given an array {12, 13, 5, 25, 20, 30, 10}, the maximum subarray sum is 45. The naive solution for this problem is to calculate sum of all subarrays starting with every element and return ... complexity using Divide and Conquer. A O(n) B O(nLogn) C O(Logn) D O(n2) Correct answer is B. O(nLogn) How?
asked
Jul 27
in
Algorithms
by
Rishav Kumar Singh
Active
(
1.5k
points)

50
views
divideandconquer
algorithms
+1
vote
0
answers
30
Algorithms
Solve the recurrence relation $T(n) = T(\sqrt{n}) + n$
asked
Jul 27
in
Algorithms
by
gauravkc
Loyal
(
6.1k
points)

154
views
algorithms
asymptoticnotations
timecomplexity
Page:
1
2
3
4
5
6
...
64
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
Schedule for GATE 2019
GATE 2019 official website
Correct way of preparation
Right process to start solving MCQs in Comp.Sc.
UGC NET JULY 2018 Results
Follow @csegate
Gatecse
Recent questions tagged algorithms
Recent Blog Comments
All of you got tracking details rt? Yesterday ...
I still haven't got consignment tracking number, ...
Good
I had paid in 12th August, 2018. But did not get ...
Sunday is IndiaPost holiday (Amazon works) so you ...
37,976
questions
45,471
answers
131,383
comments
48,425
users