Vidyalelo
Data Structure · Q643

Miscellaneous on Data Structures

Programming · Data Structure · question 643

Q643

Which of the following can be the base case for the recursive implementation used to find the length of a string? #include int get_len(char *s) int len = 0; while(s[len] != '\0') len++; return len; int main() char *s = ""; int len = get_len(s); printf("%d",len); return 0;

A.
if(string[len] == 1) return 1
B.
if(string[len+1] == 1) return 1
C.
if(string[len] == ‘\0’) return 0
Answer
D.
if(string[len] == ‘\0’) return 1

Answer: Option C

Solution

Answer: Option C
No explanation is given for this question Let's Discuss on Board