Recent questions in Algorithms

0 votes

1 answer

1

Textbook question:
Let f(N) = 1 + f(logN) then find the upper bound of f(N).What is the intutive way to solve this?

asked 8 hours ago in Algorithms by prayas (71 points) | 23 views

0 votes

0 answers

2

gate 2004 algorithms
let A[1,2,...n] be an array storing a bit (1 or 0) at each location, and f(m) is a function whose time complexity is ø(m). consider the following program segment in C: counter=0; for(i=1;i<n; i++) {if (A[i] ==1) counter++; else {f(counter); counter=0; } } tge complexity of program segment is:

asked 16 hours ago in Algorithms by mitalitak (11 points) | 20 views

0 votes

2 answers

3

algorithm
fib(n) { if(n==0) return 0; if(n==1) return 1; return(fib(n-1) + fib(n-2)); } for fib(4) the number of function calls by dynamic programmming is 7 and without dynamic programming is 9? am i wrong...if so correct me

asked 1 day ago in Algorithms by A_i_$_h Active (1.9k points) | 23 views

0 votes

1 answer

4

algorithm
Number of ways we can perform matrix multiplication and number of ways a matrix can be parenthesized means the same?

asked 1 day ago in Algorithms by A_i_$_h Active (1.9k points) | 15 views

0 votes

1 answer

5

algorithm
some random numbers are given and asked to construct a balanced BST..what will be the time complexity? numbers in sorted order are given and asked to construct a balanced BST...what will be the time complexity??

asked 1 day ago in Algorithms by A_i_$_h Active (1.9k points) | 13 views

0 votes

0 answers

6

algorithm
how is 0/1 knapsack time complexity O(2^n/2) ?

asked 1 day ago in Algorithms by A_i_$_h Active (1.9k points) | 17 views

0 votes

1 answer

7

algorithm
A binary search algorithm is implemented using recurrsion then what is the space and time complexity?

asked 2 days ago in Algorithms by A_i_$_h Active (1.9k points) | 34 views

0 votes

1 answer

8

algorithm
Consider bottom- up merge sort working on 'n' elements . Assume n is a power of 2. The minimum number of comparisons in order to get sorted list is a) n log n/2 b)n log n-n+1 c)n logn d)n logn +n

asked 2 days ago in Algorithms by A_i_$_h Active (1.9k points) | 16 views

0 votes

0 answers

9

algorithm
consider a problem defined on input of size n, if it is solved usuing greedy strategy then its time complexity is never less than a) O(n^2) b)O(n log n) c)O(logn) d) O(n)

asked 2 days ago in Algorithms by A_i_$_h Active (1.9k points) | 19 views

0 votes

0 answers

10

algorithm
time complexity of multiplying two long integers of n - digits each using divide and conquer method is a)O(n^2) b)O(n) c)O(n^3) d)O(n logn)

asked 2 days ago in Algorithms by A_i_$_h Active (1.9k points) | 12 views

0 votes

1 answer

11

algorithm
travelling salesman problem is based on a) dynamic programming b)greedy method c)recursive approach d)divide and conquer

asked 2 days ago in Algorithms by A_i_$_h Active (1.9k points) | 10 views

0 votes

1 answer

12

algorithm
how do find which notations satisfy what properties for example : big O doesnt satisfy symmetric but satisfies reflexive and transitive how can this be found for various notations

asked 2 days ago in Algorithms by A_i_$_h Active (1.9k points) | 10 views

0 votes

1 answer

13

algorithm
worst case time complexity of job sequencing with deadline using greedy algorithm

asked 2 days ago in Algorithms by A_i_$_h Active (1.9k points) | 17 views

0 votes

1 answer

14

algorithm
array has n elements and we need to sort them in non decreasing order as follows. first find minimum, remove this element from the array and find minimum of remaining elements, remove this element and so on until array becomes emplty . In best case how many comparisons needed

asked 2 days ago in Algorithms by A_i_$_h Active (1.9k points) | 12 views

0 votes

0 answers

15

algorithm
Hash table always generates constant lookup time..............why? and is it the worst case too?

asked 2 days ago in Algorithms by A_i_$_h Active (1.9k points) | 5 views

0 votes

0 answers

16

algorithm
when working with powers of base n which sort is used

asked 2 days ago in Algorithms by A_i_$_h Active (1.9k points) | 5 views

0 votes

1 answer

17

algorithm
best known algorithm to check if a singly linked list is palindrome or not is O(n).......................how?

asked 2 days ago in Algorithms by A_i_$_h Active (1.9k points) | 8 views

0 votes

0 answers

18

algorithm
priority queues can be efficiently implemented using binary heaps...why?

asked 2 days ago in Algorithms by A_i_$_h Active (1.9k points) | 5 views

0 votes

0 answers

19

algorithm
Which is not O(n^2)? a) (15^10) *n +12099 b) n^1.98 c) n^3 / sqrt(n) d) (2^20)*n

asked 2 days ago in Algorithms by A_i_$_h Active (1.9k points) | 14 views

0 votes

1 answer

20

Optimal merge pattern
Is there any difference in between draw tree for huffman coding and optimal merge pattern if yes please give detailed explanation.

asked 3 days ago in Algorithms by learner_geek Junior (605 points) | 13 views

+1 vote

0 answers

21

Cormen 3rd edition (Chapter 4 Divide & Conquer)

asked 4 days ago in Algorithms by Veeplob Singh (47 points) | 22 views

0 votes

1 answer

22

algorithm
Array of 1 to n^6 , which algorithm can be used to sort in linear time? a) not possible B)radix c)counting d)quick

asked 4 days ago in Algorithms by A_i_$_h Active (1.9k points) | 24 views

0 votes

1 answer

23

algorithms
Partition algorithm O(n) splits into 1/5 and 4/5 elements. What is the time complexity?

asked 4 days ago in Algorithms by A_i_$_h Active (1.9k points) | 19 views

0 votes

1 answer

24

algorithms
if 1,2,3,4,5....................n is T1 n,n-1,n-2................................1 is T2 relationship between T1 and T2 is O(n^2) how?

asked 4 days ago in Algorithms by A_i_$_h Active (1.9k points) | 20 views

0 votes

0 answers

25

Introduction to Algorithm 3rd ed

asked 5 days ago in Algorithms by Alabhya Pandey (11 points) | 47 views

0 votes

1 answer

26

#Back-substitution
How to solve the following recurrence by back substitution. T(n)= √2 *T(n/2) + c , for n>1 = a for n=1

asked 5 days ago in Algorithms by Ashish Subscription (11 points) | 37 views

0 votes

0 answers

27

number of movements in Insertion sort

asked Jul 19 in Algorithms by vineet.ildm (351 points) | 36 views

0 votes

1 answer

28

operating systems
what is time comlexity for first fit, best fit, quick fit contiguous memory allocation algorithms ?

asked Jul 18 in Algorithms by sumit_kumar (159 points) | 22 views

0 votes

1 answer

29

Discrete

asked Jul 16 in Algorithms by Kuldeep Pal (253 points) | 12 views

0 votes

0 answers

30

Introduction to algorithms by Cormen

asked Jul 16 in Algorithms by Akshata (15 points) | 40 views

Recent questions in Algorithms

Recent Posts

Recent Blog Comments