0 votes 0 votes The minimum number of scalar multiplication required, for parenthesization of a matrix-chain product whose sequence of dimensions for four matrices is $< 5,10,3,12,5> $ is $630$ $580$ $480$ $405$ Algorithms ugcnetcse-jan2017-paper3 algorithms matrix-chain-ordering + – go_editor asked Mar 24, 2020 recategorized May 24, 2020 go_editor 3.5k views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply Debasmita Bhoumik commented Feb 2, 2017 reply Follow Share could anyone plz explain this method more clearly? 0 votes 0 votes Himanshu Kumar Gupta commented Sep 8, 2020 reply Follow Share Option D Is correct 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes If A1=5*10 A2=10*3 A3=3*12 A4=12*5 ((A1 A2)(A3 A4))=405 which is minimum swettt871 answered Feb 1, 2021 swettt871 comment Share Follow See 1 comment See all 1 1 comment reply roomi commented Jul 22, 2021 reply Follow Share https://www.geeksforgeeks.org/matrix-chain-multiplication-dp-8/ refer this 0 votes 0 votes Please log in or register to add a comment.