Given the following statements
S1 : Every context-sensitive language L is recursive
S2 : There exists a recursive language that is not context-sensitive
Which statements are true?
Which one of the following is FALSE?
In some programming languages, an identifier is permitted to be a letter followed by any number of letters or digits. If L and D denotes the set of letters and digit respectively. Which of the following expression defines an identifier?
The recurrence relation that arises in relation with the complexity of binary search is
Which one of the following in-place sorting algorithms needs the minimum number of swaps?