A k-diagonal matrix is a n *n square matrix in which the elements on the principal diagonal and k diagonals above the principal diagonal and k diagonals below the principal diagonal only have none\ zero elements. Other elements are zero’s. In order to save the space, the non zero elements are stored in a one dimensional array. The no of locations in this array are: (a) n*(n-k-1)/2 (b) n*(n-1) – (n-k)(n-k-2) (c) n*(n-1) – (n-k)(n-k-2) (d) n*n – (n-k-1)
-- Regards, Kamakshi kamakshi...@gmail.com -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
