Recent questions in Algorithms

0 votes

1 answer

1

graph theory
consider a complete bipartite graph K(3,3) The ratio of total number of possible vertex induced subgraphs to the total number of possible edge induced subgraph in given bipartite graph is x:y . then value of x+y is______.

asked 9 hours ago in Algorithms by Lone Wolf Junior (941 points) | 36 views

0 votes

0 answers

2

Cormen Appendix A
Why does (1/3+1/c) <=1?

asked 1 day ago in Algorithms by Noddy (27 points) | 8 views

0 votes

1 answer

3

#Test series

asked 1 day ago in Algorithms by himgta Active (1.5k points) | 17 views

0 votes

0 answers

4

#self doubt
solve by using tree method!

asked 1 day ago in Algorithms by himgta Active (1.5k points) | 5 views

0 votes

1 answer

5

Asymptotic-notations
f(n)=2(log2 n)2 , g(n)=log2n+1 How to give relation between them?.

asked 1 day ago in Algorithms by Vishnathan (165 points) | 22 views

0 votes

1 answer

6

Algorithim
d the average number of comparisons made by binary search for an unsuccessful search in array A

asked 1 day ago in Algorithms by Sonali1996 (7 points) | 75 views

0 votes

0 answers

7

Randomized Quicksort
True or False : In randomized quicksort , eack key is involved in the same number of comparisons.

asked 1 day ago in Algorithms by Vaishnavi01 (89 points) | 19 views

0 votes

0 answers

8

Quick Sort Analysis
Consider the Quicksort algorithm.Suppose there is a procedure for finding a pivot element which splits the list into two sub-lists each of which contains at least one-fifth 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 1 day ago in Algorithms by Vaishnavi01 (89 points) | 34 views

0 votes

1 answer

9

time-complexcity
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 2 days ago in Algorithms by balaganesh (95 points) | 27 views

0 votes

1 answer

10

#sorting
Consider an array contains n distinct elements and we need to sort them in nondecreasing order as follows: First find the minimum, remove this element from the array and find the minimum of the remaining elements, remove this element and so on until array become empty. In the best case, how many comparisons are needed? A.O(n) B.O(n2) C.O(nlogn) D.None of the above

asked 2 days ago in Algorithms by sudharshan (95 points) | 40 views

0 votes

1 answer

11

TIME COMLEXITY
i=n; while(i>0) { j=1; while(j<=n) { j=2*j; } i=i/2; }

asked 2 days ago in Algorithms by Umar Hayat (7 points) | 17 views

0 votes

0 answers

12

#self doubt
https://gateoverflow.in/258/gate2003-66 if we are using binary search thn it should be O(logn) ,how it is O(log n)^2?

asked 2 days ago in Algorithms by himgta Active (1.5k points) | 13 views

0 votes

0 answers

13

Algorithms Complexity

asked 2 days ago in Algorithms by Vaishnavi01 (89 points) | 75 views

+1 vote

0 answers

14

Algorithms::Ace academy test series question

asked 3 days ago in Algorithms by phaneendrababu (143 points) | 78 views

0 votes

1 answer

15

Test algo

asked 3 days ago in Algorithms by Deepalitrapti Junior (573 points) | 43 views

0 votes

1 answer

16

Ace test
If t(n) and s(n) denotes the time and space complexity of an algorithm with input size n element then which one of the following is always true? S(n)=O(t(n)) correct How???

asked 3 days ago in Algorithms by akankshadewangan24 Active (4k points) | 36 views

0 votes

0 answers

17

Binary search tree
1.Time complexity to construct a binary search tree of n distinct elements? 2.Meaning of Unique BST? 3.same 1 for but unique BST? 3.if either preorder or postorder is given time complexity to construct a unique BST?

asked 3 days ago in Algorithms by Raghav Khajuria (169 points) | 17 views

0 votes

0 answers

18

Heapsort, Space complexity
Could anyone explain Why the space complexity of heapsort is O(1)??

asked 4 days ago in Algorithms by Vivekk (255 points) | 16 views

0 votes

0 answers

19

time complexity
p=0; for(i=1;i<n;i=2*i) { p=p+i; } for(j=1;j<p;j<2*j) { statement; } what will be time complexity???

asked 4 days ago in Algorithms by BASANT KUMAR Active (1.6k points) | 42 views

0 votes

1 answer

20

Self doubt
How to solve the given recurrence relation using master's theorem? T(n)=T(${n^{1/2}}$)+n

asked 4 days ago in Algorithms by Verma Ashish Active (1.3k points) | 31 views

+1 vote

0 answers

21

MADEEASY
Consider bottom- up merge sort working on 'n' elements . Assume n is a power of 2. The MAXIMUM number of comparisons in order to get sorted list is

asked 4 days ago in Algorithms by CHïntän ÞäTël (61 points) | 46 views

0 votes

0 answers

22

Algorithm
Number of spanning trees in a complete bipartite graph with m=4 and n=4 vertices? Explain with proper explanation ...

asked 5 days ago in Algorithms by Raghav Khajuria (169 points) | 40 views

0 votes

0 answers

23

Gate 2015
Let G(V,E) an undirected graph with positive edge weight . Dijkstra algorithm source shortest path algorithm can be implemented using binary heap data structures with time complexity ______? A.- O(|V|^2) B.- O(|E|+|V| log |V|) C.- O((|E|+|V|) log |V|) [closed]

asked 6 days ago in Algorithms by karandave (7 points) | 15 views

0 votes

0 answers

24

Algorithm
Deleting any random element in heap would take n+logn or n+n?

asked 6 days ago in Algorithms by Raghav Khajuria (169 points) | 55 views

0 votes

0 answers

25

#self doubt
https://gateoverflow.in/1997/gate2014-2-38 for n inputs merge procedure takes n comparisons...how n-1 is used in this question...please explain!

asked 6 days ago in Algorithms by himgta Active (1.5k points) | 33 views

0 votes

0 answers

26

Algorithms
Space complexity of building a heap?

asked 6 days ago in Algorithms by Raghav Khajuria (169 points) | 38 views

0 votes

1 answer

27

Time complexity of code given

asked 6 days ago in Algorithms by GateAspirant999 Active (2.7k points) | 40 views

0 votes

0 answers

28

made easy booklet
Find time complexity? a) T(n) = T(n/2) + pow(2,n) b) T(n) = T(pow(n,1/2)) + n c) T(n) = 16T(n/4) + n! d) T(n) = pow(2,1/2)*T(n/2) + log n can we apply master theorem on the above problem?

asked 6 days ago in Algorithms by Daniyal89 (131 points) | 39 views

0 votes

1 answer

29

dynamic prgramming
Given a two dimensional array A with n rows and k columns initialized to -1 . what is the time complexity of the function f(A,m,m)? int f(int **a,int n,int k) { if ((n<=k)||(k<=1)) return 1; if(a[n][k]==-1) a[n][k]=f(a,n-1,k)+f(a,n-1,k-1); return a[n][k]; } a)theta(m) b)theta(m^2) c)theta(2^m) d)O(1) }

asked 6 days ago in Algorithms by balaganesh (95 points) | 12 views

0 votes

1 answer

30

ALGORITHMS
Is straight merge sort in gate syllabus?? If yes, where to study from?

asked Sep 16 in Algorithms by Anuranjan Chauhan (315 points) | 10 views

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 questions in Algorithms

Recent Posts

Recent Blog Comments