Register
Webpage for Algorithms

Recent questions tagged algorithms

4 votes
1 answer
1381
Clrs 16.2-6
Show how to solve the fractional knapsack problem in $O(n)$ time.
Show how to solve the fractional knapsack problem in $O(n)$ time.
User Avatar
0 votes
0 answers
1382
Self doubt
How to solve fractional knapsack problem using heap ?
How to solve fractional knapsack problem using heap ?
User Avatar
0 votes
2 answers
1383
GATE Algorithm question
what will be the result when the following postfix expression with single digit operand is evaluated using stack: 8 2 3 ^ / 2 3 * + 5 1 * - ? A: 6, 1 B: 5, 7 C: 3, 2 D: 1, 5
what will be the result when the following postfix expression with single digit operand is evaluated using stack:8 2 3 ^ / 2 3 * + 5 1 * - ? A: 6, 1B: 5, 7C: 3, 2D: 1, 5
User Avatar
0 votes
1 answer
1384
self doubt
Given a pointer to a node to be deleted what is the time complexity to delete a node in the circular linked list : i think answer is O(1). Am i right?
Given a pointer to a node to be deleted what is the time complexity to delete a node in the circular linked list :i think answer is O(1).Am i right?
User Avatar
0 votes
0 answers
1386
Self doubt
How is IIIT Allahabad for mtech IT ? Which NIT’s are comparable to that ?
How is IIIT Allahabad for mtech IT ? Which NIT’s are comparable to that ?
User Avatar
0 votes
0 answers
1387
self doubt
The number of different directed trees with 3 nodes are A) 3 B) 4 C) 5 D) 6 I think the answer is 5 but the answer is not.
The number of different directed trees with 3 nodes areA) 3B) 4C) 5D) 6I think the answer is 5 but the answer is not.
User Avatar
0 votes
2 answers
1388
Self doubt
The total number of comparions required to merge 4 sorted files containing 15, 3, 9 and 8 records into a single sorted file is A. 66 B. 39 C. 15 D. 33
The total number of comparions required to merge 4 sorted files containing 15, 3, 9 and 8 records into a single sorted file is A.66 B.39 C.15 D.33
User Avatar
0 votes
1 answer
1389
Masters theorem
Solve by using master's theorem
Solve by using master's theorem
User Avatar
0 votes
3 answers
1390
Masters theorem
Solve using Master's Theorem $T(n)=T(n/2)+$ 2n
Solve using Master's Theorem$T(n)=T(n/2)+$ 2n
User Avatar
1 votes
1 answer
1392
design and analysis of algorithms.
which of the following estimates are true? Explain with valid reasons. a) (2n)! is theta (n)! b) log((2n)!) is theta (log(n)!)
which of the following estimates are true? Explain with valid reasons.a) (2n)! is theta (n)!b) log((2n)!) is theta (log(n)!)
User Avatar
1 votes
0 answers
1393
Algorithms-Time Complexity
What is the time complexity of the below code? for($k=n^{10};k \geq 5;k=k^{\frac{1}{7}},k=k^2$) { $k=k^5;$ $k=k-10$ } My answer comes to be $O(log_{\frac{7}{10}}log_5(n^{10}))$ Please verify.
What is the time complexity of the below code?for($k=n^{10};k \geq 5;k=k^{\frac{1}{7}},k=k^2$){ $k=k^5;$ $k=k-10$}My answer comes to be $O(log_{\frac{7}{10}}log_5(n^{...
User Avatar
1 votes
1 answer
1394
TIme complexity
Q.14 What is the time complexity of the following recursive function? int Dosomething (int n) { if(n≤2) return 1; else return (Dosomething (floor(sqrt(n))) + n); (a) Ѳ(n 2 ) (c) Ѳ(log 2 n) (b) Ѳ(nlog 2 n) (d) Ѳ(log 2 log 2 n)
Q.14 What is the time complexity of the following recursive function?int Dosomething (int n) {if(n≤2)return 1;elsereturn (Dosomething (floor(sqrt(n))) + n);(a) Ѳ(n 2 )...
User Avatar
2 votes
2 answers
1395
Time Complexity Of the Algorithm
Q.6 The time complexity of an algorithm T(n), where n is the input size, is given by— T(n)= T(n-1) + 1/n, if n>1 = 1, otherwise. The order of the algorithm is— (a) log n (c) n^2 (b) n (d) n*n
Q.6 The time complexity of an algorithm T(n), where n is the input size, is given by— T(n)= T(n-1) + 1/n, if n>1 = 1, otherwise.The order of the algorithm is�...
User Avatar
0 votes
4 answers
1396
UGC NET CSE | July 2018 | Part 2 | Question: 21
The solution of the recurrence relation $T(m) = T(3m/4)+1$ is $\Theta (\lg \: m)$ $\Theta (m)$ $\Theta (m\lg m)$ $\Theta (\lg\lg m)$
The solution of the recurrence relation $T(m) = T(3m/4)+1$ is$\Theta (\lg \: m)$$\Theta (m)$$\Theta (m\lg m)$$\Theta (\lg\lg m)$
User Avatar
0 votes
1 answer
1397
UGC NET CSE | July 2018 | Part 2 | Question: 27
Match the following with respect to algorithm paradigms : ... $\text{(a)-(iv), (b)-(iii), (c)-(ii), (d)-(i)}$
Match the following with respect to algorithm paradigms :$\begin{array}{clcl} & \textbf{List-I} & {} & \textbf{List-II} \\ \text{(a)} & \text{The 8-Queen's problem} & \t...
User Avatar
0 votes
2 answers
1398
UGC NET CSE | July 2018 | Part 2 | Question: 30
Consider a Boolean function of 'n' variables. The order of an algorithm that determines whether the Boolean function produces a output 1 is Logarithmic Linear Quadratic Exponential
Consider a Boolean function of 'n' variables. The order of an algorithm that determines whether the Boolean function produces a output 1 isLogarithmicLinearQuadraticExpon...
User Avatar
1 votes
1 answer
1405
Asymptotic analysis
Arrange them in increasing order
Arrange them in increasing order
User Avatar
4 votes
0 answers
1407
time complexity
for(int i=0; i < n; i++) { for(int j=0; j < (2*i); j+=(i/2)) { cout<<"Hello Geeks"; } } is it o(nlogn)??
for(int i=0; i < n; i++) { for(int j=0; j < (2*i); j+=(i/2)) { cout<<"Hello Geeks"; } }is it o(nlogn)??
User Avatar
1 votes
1 answer
1408
Self doubt
When sorting technique is called stable?
When sorting technique is called stable?
User Avatar
4 votes
7 answers
1409
Searching
Q) Consider a sorted array of n numbers. What would be the time complexity of the best known algorithm to find a pair a and b such that |a-b| = k , k being a positive integer. a) O(logn) b) O(n) c)O(nlogn) d)O(n^2) Which of the option is Correct And Why?
Q) Consider a sorted array of n numbers. What would be the time complexity of the best known algorithm to find a pair a and b such that |a-b| = k , k being a positive int...
User Avatar
0 votes
3 answers
1410
Merge Sort
A list of n string, each of length n, is sorted into lexicographic order using the merge-sort algorithm. The worst case running time of this computation is (A) (B) (C) (D)
A list of n string, each of length n, is sorted into lexicographic order using the merge-sort algorithm. The worst case running time of this computation is(A) (B) (C) (D)...
User Avatar
Page: