A matrix in which non-zero entries can only occur on the diagonal or on elements immediately above or below the diagonal, is called ______ matrix.

Related MCQs

• let x be the adjacency matrix of a graph .G with no self loop.The entries along the principle diagonal of x are
• In a binary tree, certain null entries are re- placed by special pointers which point to nodes higher in tree for efficiency. These special pointers are called
• Matrices with relatively high proportion of zero entries are called ______ matrices.
• A data structure where elements can be added or removed at either end but not in the middle is referred as
• The following data structure can’t store the non-homogeneous data elements
• Groups of consecutive elements in a string, such as words, phrases and sentences are called ________.
• The number of elements n is called the length or _____ of the array.
• In selection sort of n elements,how many times is the swp function called in the complete execution of the algorithm?
• A linear collection of data elements where the linear node is given by means of pointer is called?
• In selection sort of n elements,how many times is the swap function called in the complete execution of the algorithm?