ISRO Scientist or Engineer Computer Science May 2017
For the following questions answer them individually
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?
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?
Which one of the following in-place sorting algorithms needs the minimum number of swaps?
Given two statements
(i) Insertion of an element should be done at the last node in a circular list
(ii) Deletion of an element should be done at the last node of the circular list
Which of the following data structure is useful in traversing a given graph by breadth first search?
