Doubt in understanding of the concepts

#1

I didnot understand the the dp approach of the matrix chain muliplication,please help me with the code and concept

#2

hello @Somasree

first understand the recurrence relation.

solve(i,j) -> tells minimum cost of multiplying matrix in range [i-1…j]

how we can break this problem into smaller subproblems, well the idea is to break at every index(i.e try all possibilities) and pick minimum of among all.

solve(i,j) = minimum of solve(i,k) + solve(k+1,j) + cost of combining where K goes from [ i…j-1]

this is the recurrence , in dp solution we are doing the same thing.
rewatch this ->

#3

Thank u .I have understood. :blush:

#4

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.

#5

Can you please tell me how to be a TA at coding blocks .What is the min criteria??

#6

ds- algo and debugging .

a) first they will take ur online ds-algo test
b) then they take one telephonic round (ds-algo based)
c) and debuggin round where u have to debug the incorrect code(compiler not allowed)

#7

Ok.Thank u . :blush:

#8

image
image1920×1080 352 KB

please help me to solve this mcq

#9

first read this property of fibonnaci series -> link

and after that it is just a basic math.

if first sequence repeats after T1 time and second sequence repeats after T2 time
then after LCM(T1,T2) time both the sequence will repeat

#10

ok thank u understood