Register
Webpage for Algorithms

Recent questions tagged algorithms

303
views
1 answers
1 votes
GO Classes 2024 | IIITH Mock Test 5 | Question: 13
Let $\text{G = (V, E)}$ be a connected, undirected graph with edge weights $w: \text{E} \rightarrow \mathbb{Z}$. Suppose $\text{G}$ has a ... no cycles$\text{G}$ contains at most one cycleAll edge weights are differentNone of the above
User Avatar
326
views
1 answers
3 votes
GO Classes 2024 | IIITH Mock Test 5 | Question: 15
Let $n$ be a positive integer.Consider the two statements below:$\text{S1:}$ If $f(n)>g(n)$ for all $n$ then $g(n)$ ... is incorrect$\text{S1}$ is incorrect but $\mathrm{S} 2$ is correctBoth are correctBoth are incorrect
User Avatar
342
views
1 answers
2 votes
GO Classes 2024 | IIITH Mock Test 5 | Question: 23
Which of the following is/are TRUE?In the worst case, merge sort runs in $O\left(n^2\right)$ time.Depth-first search of a graph is asymptotically faster than ... a binary search tree leaves the same tree as inserting $y$ and then $x$.
User Avatar
300
views
1 answers
2 votes
GO Classes 2024 | IIITH Mock Test 5 | Question: 31
Suppose we have a set of $n$ values. There are always at least one negative value and at least one positive value in the set.What is the worst case time ... known) and arranged in descending order then it takes $\theta(n)$ in worst case.
User Avatar
253
views
1 answers
1 votes
GO Classes 2024 | IIITH Mock Test 5 | Question: 32
Let $\text{G = (V, E)}$ be a simple undirected graph, and $s$ be a particular vertex in it called the source. For $x \in \text{V},$ let $d(x)$ denote the shortest distance in ... $(u, v)$, we have $d[v]=d[u]+1$
User Avatar
194
views
1 answers
2 votes
GO Classes 2024 | IIITH Mock Test 5 | Question: 45
Consider the given two statements.$\mathrm{S} 1:$ Depth-first search is asymptotically faster than breadth-first search.$\mathrm{S} 2:$ Deleting an element from a ... $\mathrm{S} 1$ is wrong.Both are correctBoth are False
User Avatar
748
views
3 answers
0 votes
from online classes
Q )Six jobs are waiting to be run. The expected running times are 9, 7, 5, 2, 1 and x respectively. Where 5 < x < 7 and the average completion time is 13. Find the ... ? (Assume all jobs arrive at same time = 0).a)3.33b)4.33c)5.33d)6.33
User Avatar
Page: