Recent questions in Algorithms

0 votes

1 answer

1

[Algo] complexity
f(n) + o(f(n)) = thetha(f(n)) Does this hold? o is small -oh notation.

asked 32 minutes ago in Algorithms by rahul sharma 5 Veteran (11.4k points) | 6 views

0 votes

1 answer

2

Find the value of P
Consider the following code What is the output printed by the above code in terms of n? How it is coming b??

asked 19 hours ago in Algorithms by Shubhanshu Boss (6k points) | 17 views

0 votes

0 answers

3

Algorithm: Selection Sort
Consider the following code which sort all elements of an array A' in descending order. Which of the following will represents correct value of X, Y, Z in above code for selection sort? a. i > 0, K > 0, a[K] ... the descending order but by using option a it is aranging in ascending order. And option D is doing what question is saying.

asked 21 hours ago in Algorithms by Shubhanshu Boss (6k points) | 11 views

0 votes

1 answer

4

Algorithm doubt
Which of the following statements is/are valid? 1. Time Complexity of QuickSort is Θ(n^2) 2. Time Complexity of QuickSort is O(n^2) 3. For any two functions f(n) and g(n), we have f(n) = Θ(g(n)) if and only if f(n) = O(g(n)) and f(n) = Ω(g(n)). 4. Time complexity of all computer algorithms can be written as Ω(1)

asked 23 hours ago in Algorithms by Surya Dhanraj Active (1.8k points) | 19 views

0 votes

0 answers

5

greedy algorithm
job scheduling(with deadline) implementation with best algorithm will take time complexity of 1) O(n) 2)O(nlog(n)) 3)O(n^2) 4)O(n^3) answer is O(n) using disjoint set can someone provide me algorithmic steps using disjoint set for job scheduling .

asked 23 hours ago in Algorithms by Niraj Singh 2 Active (1.9k points) | 9 views

0 votes

0 answers

6

Optimal merge
Suppose there are 4 sorted list of 8 elements each if we merge these lists into a single sorted list of 32 elements. The key comparisons that are needed in worst case using an efficient algorithm are

asked 1 day ago in Algorithms by saumya mishra (447 points) | 12 views

0 votes

1 answer

7

Time complexity
An unsorted list contain log(n) (base 2) distinct elements. The time complexity to find an element in this list that is neither maximum nor minimum is?

asked 1 day ago in Algorithms by mystylecse Active (1.7k points) | 24 views

+1 vote

1 answer

8

Analysis Of Prims Algorithm Time Complexity

asked 2 days ago in Algorithms by pC Veteran (21.5k points) | 44 views

+1 vote

1 answer

9

Bucket sort
1. Is bucket sort always stable or does it depend on the sorting subroutine used by bucket sort toe sort the buckets? 2. Bucket sort is always NOT inplace.Is this correct?

asked 3 days ago in Algorithms by rahul sharma 5 Veteran (11.4k points) | 14 views

+2 votes

1 answer

10

Find the value of p
Consider following program and determine the value of p after execution of program:- main() { p = 1; for(i=1;i<=n;i++) { for(j=1;j<=n;j=5*j) { p = p + n; } } } I think p's final value should be p = 1+n2log5n.

asked 3 days ago in Algorithms by Shubhanshu Boss (6k points) | 31 views

0 votes

0 answers

11

Time complexity
class Solution { public: int getSum(int a, int b) { int total = a; while (b != 0) { total = a ^ b; //calculates sum of 'a' and 'b' without taking carry b = (a & b) << 1; //calculates the carry a = total; //add sum(without carry) and carry } return total; } }; What is the time complexity of the above code ?Plz describe.

asked 3 days ago in Algorithms by ashwina Junior (601 points) | 26 views

+1 vote

0 answers

12

Corman Algo
if f(n)=n/log n and c=2 Than f*(n)=?

asked 4 days ago in Algorithms by Nitesh Choudhary Active (2k points) | 28 views

0 votes

1 answer

13

Recurrence
How can we get this solution by solving this recurrence?

asked 5 days ago in Algorithms by saumya mishra (447 points) | 31 views

0 votes

1 answer

14

Asymptotic notation

asked 6 days ago in Algorithms by Nisha moyal (25 points) | 36 views

+1 vote

1 answer

15

Hamiltonian
A graph is said to be hamiltonian if it contains a cycle containing all vertices. Any DFS tree on the graph must have depth v-1 true or false

asked 6 days ago in Algorithms by A_i_$_h Boss (5.2k points) | 42 views

0 votes

1 answer

16

hashing
What is the average number of probe required when inserting an element with load factor alpha (assume uniform hashing) a) 1 / 1-alpha b) 1/1+alpha c)1/alpha d)2/2-alpha

asked 6 days ago in Algorithms by A_i_$_h Boss (5.2k points) | 42 views

+1 vote

1 answer

17

Time complexity
Q2. Consider the following C function: int fun1 (int n) { int i, j, k, p, q = 0; for (i = 1; i<n; ++i) { p = 0; for (j=n; j>1; j=j/2) ++p; for (k=1; k<p; k=k*2) ++q; } return q; } Which one of the following most closely approximates the return value of the function fun1? (a) n3 (c) nlogn (b) n (logn)^2 (d) nlog(logn)

asked 6 days ago in Algorithms by garg div (57 points) | 45 views

+1 vote

1 answer

18

doubt
what should be the minimum number of comparisons required to find the minimum and maximum of 100 numbers ?

asked 6 days ago in Algorithms by Diksha Aswal Junior (675 points) | 46 views

0 votes

1 answer

19

comparison
Consider a set of n distinct elements, by comparison Amit wants to find the largest 3 elements in the set. Which of the following is true a) Three largest elements can be determined using O(log ^2 n ) comparison b)O(log ^2 n ) comparison is not ... n comparisons c)n + O(1) comparison are needed d)n + O(1) not sufficient , n + O(log n) comparisons required

asked Sep 18 in Algorithms by A_i_$_h Boss (5.2k points) | 22 views

0 votes

1 answer

20

asymptotic notation
a) T(n) = √n T(√n) + n b) T(n) = 4T(n/2) + n2 √(2)

asked Sep 18 in Algorithms by A_i_$_h Boss (5.2k points) | 43 views

0 votes

0 answers

21

asymptotic notation
T(n) = 2T( n / root(2)) + n T(1) = O(1) when i solve this i get theta ( n ^ log 2 base root(2)) using masters theorem after this how do i slove

asked Sep 18 in Algorithms by A_i_$_h Boss (5.2k points) | 34 views

0 votes

1 answer

22

asymptotic notation
f(n) = theta(n) , g(n) = Omega(n) , h(n) = O(n) then f(n) + [g(n) -h(n)] ?

asked Sep 18 in Algorithms by A_i_$_h Boss (5.2k points) | 21 views

0 votes

0 answers

23

DYNAMIC PROGRAMMING

asked Sep 17 in Algorithms by Parshu gate (457 points) | 26 views

0 votes

0 answers

24

DYNAMIC

asked Sep 17 in Algorithms by Parshu gate (457 points) | 7 views

0 votes

0 answers

25

dynamic programming

asked Sep 17 in Algorithms by Parshu gate (457 points) | 15 views

0 votes

1 answer

26

time complexity

asked Sep 17 in Algorithms by Parshu gate (457 points) | 32 views

0 votes

1 answer

27

Basic Doubt in spanning tree complexity

asked Sep 16 in Algorithms by rahul sharma 5 Veteran (11.4k points) | 43 views

0 votes

3 answers

28

UGCNET-dec2009-ii-11
Recursive functions are executed in a (A) First in first out-order (B) Last in first out-order (C) Parallel fashion (D) Load balancing

asked Sep 16 in Algorithms by rishu_darkshadow Loyal (2.9k points) | 34 views

+1 vote

1 answer

29

AVL tree
State If True or False. Give reason too Inserting in an AVL tree with n nodes requires $\Theta \left ( log n \right )$ rotations

asked Sep 15 in Algorithms by srestha Veteran (58.6k points) | 40 views

+1 vote

1 answer

30

Show the approach
Recurrence: $T\left ( n \right )\leq T\left ( \frac{n}{5} \right )+T\left ( \frac{7n}{10} \right )+\Theta \left ( n \right )$

asked Sep 15 in Algorithms by srestha Veteran (58.6k points) | 44 views

Recent questions in Algorithms

Recent Posts

Recent Blog Comments