Based on this alternative version, the Levenshtein distance between the strings, word and work is ______ (Answer in integer).
To calculate the alternative Levenshtein distance between the strings "word" and "work" with each insertion and deletion costing 1 and no substitutions allowed, we proceed as follows:
In conclusion, the alternative Levenshtein distance is 2, which fits within the specified range of (2,2).
In an engineering college of 10,000 students, 1,500 like neither their core branches nor other branches. The number of students who like their core branches is 1/4th of the number of students who like other branches. The number of students who like both their core and other branches is 500.
The number of students who like their core branches is
$A$ is an ($n \times n$) matrix. Consider the following two statements
Statement 1: Columns of matrix $A$ are linearly independent
Statement 2: Inverse of matrix $A$ exists
Which one of the following statements is TRUE?