Register
Webpage for Algorithms

Recent questions tagged algorithms

1 votes
1 answer
2132
LRU_page replacement algorithm.
How LRU page replacement algorithm works? I am unable to visualize it from book hamacher. Please anyone explain in simple language.
How LRU page replacement algorithm works? I am unable to visualize it from book hamacher. Please anyone explain in simple language.
User Avatar
1 votes
3 answers
2133
Made Easy test series
"A" sort a particular dataset of size n using merge sort in 640 msec, "B" uses the same algorithm on dataset of size 16, it takes 256 msec to sort them. what is size of data set used by "A" A. 32 B. 64 C. 128 D. None of above
"A" sort a particular dataset of size n using merge sort in 640 msec, "B" uses the same algorithm on dataset of size 16, it takes 256 msec to sort them. what is size of d...
User Avatar
0 votes
2 answers
2134
Sorting
Which sorting algorithim is best if exhactly only half of the elements are in correct position ?
Which sorting algorithim is best ifexhactly only half of the elements are in correct position ?
User Avatar
1 votes
3 answers
2135
Which sorting algorithm can be used to sort a random linked list with minimum time complexity ?
Which sorting algorithm can be used to sort a random linked list with minimum time complexity ? A)mergesort B)quicksort C)radixsort D)insertionsort E)heapsort
Which sorting algorithm can be used to sort a random linked list with minimum time complexity ?A)mergesortB)quicksortC)radixsortD)insertionsortE)heapsort
User Avatar
0 votes
1 answer
2136
Basic Question
Can any algorithms exist which take less than O(1) time????
Can any algorithms exist which take less than O(1) time????
User Avatar
1 votes
1 answer
2137
Generate atleast 3 solutions for 5 x 5 queen problem
Genearate atleast 3 solutions for 5 x 5 queen problem
Genearate atleast 3 solutions for 5 x 5 queen problem
User Avatar
0 votes
1 answer
2138
Huffman coding question
Question:What is the time complexity of Huffman algorithms when the input is already sorted
Question:What is the time complexity of Huffman algorithms when the input is already sorted
User Avatar
3 votes
4 answers
2140
solve the recurrence using any method just solve it
T(n) = 100 T (n/99) + log(n!) Answer is T(n) = θ (n log n) a)answer is justified b)answer is not justified c)cannot be determined d)none
T(n) = 100 T (n/99) + log(n!) Answer is T(n) = θ (n log n)a)answer is justifiedb)answer is not justifiedc)cannot be determinedd)none
User Avatar
2 votes
3 answers
2141
With quick sort The results after first partioning of the given array
With quick sort The results after first partioning of the given array. A = (2,8,7,1,3,5,6,4,9). Analysis the time complexity of Quick sort in the best case.
With quick sort The results after first partioning of the given array. A = (2,8,7,1,3,5,6,4,9).Analysis the time complexity of Quick sort in the best case.
User Avatar
0 votes
2 answers
2142
A list of elements are given A - <3,1,4,1,5,9,2,6,5,3,5,8,9 >
A list of elements are given A - <3,1,4,1,5,9,2,6,5,3,5,8,9 > Show Howw the "Pivot" and quick sort algorithm work. finally show the Best Case analysis for quick sort .
A list of elements are given A - <3,1,4,1,5,9,2,6,5,3,5,8,9 >Show Howw the "Pivot" and quick sort algorithm work.finally show the Best Case analysis for quick sort .
User Avatar
0 votes
1 answer
2143
Fractional Knapsack(Greedy Method)
Consider the following instance of the knapsack problem: n=3 , W=50 , (v1,v2,v3) = (60,100,120) and weight (w1,w2,w3) = (10,20,30) . solve the given knapsack problem applying greedy algorithm.
Consider the following instance of the knapsack problem: n=3 , W=50 , (v1,v2,v3) = (60,100,120) and weight (w1,w2,w3) = (10,20,30) .solve the given knapsack problem apply...
User Avatar
1 votes
1 answer
2144
Algorithms Basic Question
User Avatar
0 votes
2 answers
2145
Internetworking Routing
waht happens in internetworking routing somebody please tell please
waht happens in internetworking routing somebody please tell please
User Avatar
0 votes
2 answers
2146
What happens in Multicast Routing algorithm
What happens in Multicast Routing algorithm somebody please tell with diagram ?
What happens in Multicast Routing algorithm somebody please tell with diagram ?
User Avatar
0 votes
3 answers
2147
Asymptotic Notation
Big 'O' estimate for Factorial Functions and Logarithm of Factorial Function i.e. n! and log n! is a)O(n!) and O(n log n) b)O(nn) and O(n log n) c)O(n!) and O(log n!) d)O(nn) and O(log n!)
Big 'O' estimate for Factorial Functions and Logarithm of Factorial Function i.e. n! and log n! isa)O(n!) and O(n log n)b)O(nn) and O(n log n)c)O(n!) and O(log n!)d)O(nn)...
User Avatar
2 votes
4 answers
2148
Bellman Ford Shortest path
Is the below statement correct: Bellman Ford finds all negative weight cycles in the graph. This is true or false?
Is the below statement correct:Bellman Ford finds all negative weight cycles in the graph.This is true or false?
User Avatar
1 votes
1 answer
2151
cil-2017
User Avatar
0 votes
2 answers
2152
coal india
which is correct option? does answer depends on the definition of levels?
which is correct option? does answer depends on the definition of levels?
User Avatar
0 votes
0 answers
2156
Calculate the shortest path using TSP Greedy Appraoch
Calculate the shortest path using TSP Greedy Appraoch
Calculate the shortest path using TSP Greedy Appraoch
User Avatar
1 votes
1 answer
2157
#Confusion Is it necessary to arrange the weights in Ascending order while solving 0/1 Knapsack problem using Dynamic
Number of Cateogires are 5, Thier total weights are w1,w2,w3,w4,w5={7,2,4,8,6}b1,b2,b3,b4,b5={5,6,4,3,2}M=6=Maximum Capacity= WI am having confusion How to solve using dy...
User Avatar
3 votes
1 answer
2158
min max using divide and conquer
CAN SOMEONE SOLVE THE NUMBER OF COMPARISIONS FOR COMPUTING MIN AND MAX IN AN ARRAY USING DIVIDE N CONQUER?? RECURRENCE RELATION IS $ T(n) = 2 T(\frac{n}{2}) + 2 $ IT SHOULD COME TO $ \frac{3*n}{2} - 2 $ ??
CAN SOMEONE SOLVE THE NUMBER OF COMPARISIONS FOR COMPUTING MIN AND MAX IN AN ARRAY USING DIVIDE N CONQUER??RECURRENCE RELATION IS$ T(n) = 2 T(\frac{n}{2}) + 2 $IT SHOULD ...
User Avatar
0 votes
1 answer
2159
Dynamic programing
How to find space complexity of fibbo series ..
How to find space complexity of fibbo series ..
User Avatar
0 votes
2 answers
2160
gready
A file contain charecters a,e,i,o,u,s,t with frequencies 10,15,12,3,4,13,&1 respectively , if we use huffman codeing for data compression then avg code length will be .
A file contain charecters a,e,i,o,u,s,t with frequencies 10,15,12,3,4,13,&1 respectively , if we use huffman codeing for data compression then avg code length will be .
User Avatar
Page: