Which Of The Following Can Be The Base Case For The Recursive #1736
Which of the following can be the base case for the recursive implementation used to find the length of a string? </p> <pre><code class="language-c"> #include<stdio.h> 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; }</code></pre>
This multiple choice question (MCQ) is related to the book/course
gs gs122 Data Communication and Computer Network.
It can also be found in
gs gs122 Recursion - Length of a String using Recursion - Quiz No.1.
Which of the following can be the base case for the recursive implementation used to find the length of a string?
#include<stdio.h> 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; }
if(string[len] == 1) return 1
if(string[len+1] == 1) return 1
if(string[len] == ‘\0’) return 0
if(string[len] == ‘\0’) return 1
Similar question(s) are as followings:
Online Quizzes of gs122 Data Communication and Computer Network
Sorting - Insertion Sort - Quiz No.1
gs gs122 Data Communication and Computer Network
Online Quizzes
Sorting - Insertion Sort - Quiz No.2
gs gs122 Data Communication and Computer Network
Online Quizzes
Sorting - Insertion Sort - Quiz No.3
gs gs122 Data Communication and Computer Network
Online Quizzes
Sorting - LSD Radix Sort - Quiz No.1
gs gs122 Data Communication and Computer Network
Online Quizzes
Sorting - MSD Radix Sort - Quiz No.1
gs gs122 Data Communication and Computer Network
Online Quizzes
Sorting - MSD Radix Sort - Quiz No.2
gs gs122 Data Communication and Computer Network
Online Quizzes
