In a tridiagonal matrix of size nn$,$ using the Thomas algorithm, the number of multiplication and division operations is calculated as follows: In the forward elimination step, we perform n $1$ multiplications and n $1$ divisions. In the back substitution step, we perform n $-1$ multiplications. Therefore, the total number of multiplication and division operations is $2$n $-2$ multiplications and n $1$ divisions.