Register
Filter

Questions by gmrishikumar

2 votes
1 answer
1
Difference between DAG and Multi-stage graph
I have trouble understanding the difference between DAG and Multi-stage graph. I know what each of them is But I think that a multi-stage graph is also a DAG. Are multi-stage graphs a special kind of DAG?
I have trouble understanding the difference between DAG and Multi-stage graph. I know what each of them isBut I think that a multi-stage graph is also a DAG. Are multi-st...
0 votes
1 answer
4
Direct Admission GATE 2019, Marks - 77
I have scored 77.67 in GATE 2019. The rank predictor predicts my rank around 48 - 51. How accurate is the rank predictor? And if the predicted rank is accurate, then from which IITs/IISc can I expect offers for direct admission?
I have scored 77.67 in GATE 2019. The rank predictor predicts my rank around 48 - 51.How accurate is the rank predictor?And if the predicted rank is accurate, then from w...
0 votes
1 answer
6
Probablity Question
The given table shows the result of the class of 30. Find the probability that a given student who is passed in exam is a girl?
The given table shows the result of the class of 30. Find the probability that a given student who is passed in exam is a girl?
0 votes
0 answers
7
Function Pointer question
#include<stdio.h> int main ( ) { int demo ( ); // What is this and what does it do? demo ( ); (*demo) ( ); } int demo ( ) { printf("Morning"); }
#include<stdio.h>int main ( ){ int demo ( ); // What is this and what does it do? demo ( ); (*demo) ( );}int demo ( ){ printf("Morning");}
1 votes
1 answer
10
Kth Largest element in Min-Heap
What is the time complexity to find the Kth largest element in a Min-Heap? Or equivalently, What is the time complexity to find Kth smallest element in Max-Heap?
What is the time complexity to find the Kth largest element in a Min-Heap? Or equivalently, What is the time complexity to find Kth smallest element in Max-Heap?
0 votes
1 answer
11
Undirected Graph - Hamiltonian Cycle - NP Complete?
All the places where I have read the Ham-Cycle problem, the graph used is directed. Is the problem of finding Ham-Cycle on an undirected graph also NP-Complete or not?
All the places where I have read the Ham-Cycle problem, the graph used is directed. Is the problem of finding Ham-Cycle on an undirected graph also NP-Complete or not?
4 votes
2 answers
13
T(n) = sqrt(n) * T(sqrt(n)) + n
T(n) = sqrt(n) * T(sqrt(n)) + n Given solution is O(log log n). But my solution is O(n log log n). 'wolframalpha'' shows the answer same as mine. You can find the solution here. Can anyone confirm the solution and provide an explantion?
T(n) = sqrt(n) * T(sqrt(n)) + n Given solution is O(log log n). But my solution is O(n log log n).'wolframalpha'' shows the answer same as mine. You can find the solution...