Register

Search results for time

2 votes
1 answer
1
GATE Mechanical 2022 Set 1 | GA Question: 10
In a $12$-hour clock that runs correctly, how many times do the second, minute, and hour hands of the clock coincide, in a $12$-hour duration from $3$ PM in a day to $3$ AM the next day? $11$ $12$ $144$ $2$
In a $12$-hour clock that runs correctly, how many times do the second, minute, and hour hands of the clock coincide, in a $12$-hour duration from $3$ PM in a day to $3$ ...
User Avatar
1 votes
1 answer
3
GATE Electrical 2022 | GA Question: 2
In a $500\;m$ race, $P$ and $Q$ have speeds in the ratio of $3 : 4$. $Q$ starts the race when $P$ has already covered $140\; m$. What is the distance between $P$ and $Q$ (in $m$) when $P$ wins the race? $20$ $40$ $60$ $140$
In a $500\;m$ race, $P$ and $Q$ have speeds in the ratio of $3 : 4$. $Q$ starts the race when $P$ has already covered $140\; m$.What is the distance between $P$ and $Q$ (...
User Avatar
4 votes
4 answers
4
NIELIT 2016 DEC Scientist B (CS) - Section B: 16
Two main measures for the efficiency of an algorithm are: Processor and Memory Complexity and Capacity Time and Space Data and Space
Two main measures for the efficiency of an algorithm are:Processor and MemoryComplexity and CapacityTime and SpaceData and Space
User Avatar
79 votes
7 answers
5
GATE CSE 2008 | Question: 40
The minimum number of comparisons required to determine if an integer appears more than $\frac{n}{2}$ times in a sorted array of $n$ integers is $\Theta(n)$ $\Theta(\log n)$ $\Theta(\log^*n)$ $\Theta(1)$
The minimum number of comparisons required to determine if an integer appears more than $\frac{n}{2}$ times in a sorted array of $n$ integers is$\Theta(n)$$\Theta(\log n)...
User Avatar
50 votes
8 answers
10
GATE CSE 2007 | Question: 45
What is the $\text{time complexity}$ of the following recursive function? int DoSomething (int n) { if (n <= 2) return 1; else return (DoSomething (floor (sqrt(n))) + n); } $\Theta(n^2)$ $\Theta(n \log_2n)$ $\Theta(\log_2n)$ $\Theta(\log_2\log_2n)$
What is the $\text{time complexity}$ of the following recursive function?int DoSomething (int n) { if (n <= 2) return 1; else return (DoSomething (floor (sqrt(n))) + n); ...
User Avatar
41 votes
7 answers
11
GATE CSE 2008 | Question: 47
We have a binary heap on $n$ elements and wish to insert $n$ more elements (not necessarily one after another) into this heap. The total time required for this is $\Theta(\log n)$ $\Theta(n)$ $\Theta(n\log n)$ $\Theta(n^2)$
We have a binary heap on $n$ elements and wish to insert $n$ more elements (not necessarily one after another) into this heap. The total time required for this is$\Theta(...
User Avatar
57 votes
6 answers
14
GATE CSE 1999 | Question: 1.13
Suppose we want to arrange the $n$ numbers stored in any array such that all negative values occur before all positive ones. Minimum number of exchanges required in the worst case is $n-1$ $n$ $n+1$ None of the above
Suppose we want to arrange the $n$ numbers stored in any array such that all negative values occur before all positive ones. Minimum number of exchanges required in the w...
User Avatar
64 votes
8 answers
16
GATE CSE 2007 | Question: 44
In the following C function, let $n \geq m$. int gcd(n,m) { if (n%m == 0) return m; n = n%m; return gcd(m,n); } How many recursive calls are made by this function? $\Theta(\log_2n)$ $\Omega(n)$ $\Theta(\log_2\log_2n)$ $\Theta(\sqrt{n})$
In the following C function, let $n \geq m$.int gcd(n,m) { if (n%m == 0) return m; n = n%m; return gcd(m,n); }How many recursive calls are made by this function?$\Theta(\...
User Avatar
37 votes
10 answers
19
GATE CSE 1992 | Question: 01,ix
Complexity of Kruskal’s algorithm for finding the minimum spanning tree of an undirected graph containing $n$ vertices and $m$ edges if the edges are sorted is _______
Complexity of Kruskal’s algorithm for finding the minimum spanning tree of an undirected graph containing $n$ vertices and $m$ edges if the edges are sorted is _______
User Avatar
Page: