Register

#Doubt

131 views
0 votes
0 votes

How many statements are true?

 

Statement 1: Dynamic programming algorithms fills their memory table either in RMO or in CMO.

Statement 2: Bottom up dynamic algorithms are always iterative.

Statement 3: We can apply Dijkstra’s shortest path algorithm on unweighted graph it works like BFS then.

Statement 4: Graph can be represented with B trees.

A). 1

B). 2

C). 3

D). 4

User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
1 answer
1
Subbu. asked Jul 18, 2022
479 views
#doubt
BigO notation of T(n)=T(n-1)+ √n ; n>=1 =0. ; Otherwise
BigO notation ofT(n)=T(n-1)+ √n ; n>=1 =0. ; Otherwise
User Avatar
0 votes
0 votes
1 answer
2
amit166 asked Nov 22, 2018
370 views
#doubt
difference between Bellmann ford and dijkstra's algorithm for -ve weight cycle graph
difference between Bellmann ford and dijkstra's algorithm for -ve weight cycle graph
User Avatar
1 votes
1 votes
2 answers
3
kavya kamish upadhya asked Aug 21, 2018
1,064 views
#Doubt
Quick sort is run on following inputs I1: stricltly increasing order of n input sequece I2: stricltly decreasing order of n input sequece Let S1 and S2 be the number of swaps made by the input I1 and I2 respectively Then A). S1<S2 B). S1>S2 C). S1=S2 D). Cannot predict anything for arbitrary n
Quick sort is run on following inputsI1: stricltly increasing order of n input sequeceI2: stricltly decreasing order of n input sequeceLet S1 and S2 be the number of swap...
User Avatar
0 votes
0 votes
0 answers
4
air1ankit asked Oct 28, 2017
193 views
#doubt algo
What is the disadvantage of avl tree over b tree ??
What is the disadvantage of avl tree over b tree ??
User Avatar
Link Copied!