Consider the following iterative implementation to find the length of the string:
#include<stdio.h>
int get_len(char *s)
{
int len = 0;
while(________)
len++;
return len;
}
int main()
{
char *s = "harsh";
int len = get_len(s);
printf("%d",len);
return 0;
}
Which of the following lines should be inserted to complete the above code?
#include<stdio.h>
int get_len(char *s)
{
int len = 0;
while(________)
len++;
return len;
}
int main()
{
char *s = "harsh";
int len = get_len(s);
printf("%d",len);
return 0;
}A. s[len-1] != 0
B. s[len+1] != 0
C. s[len] != ‘\0’
D. s[len] == ‘\0’
Answer: Option C
This Question Belongs to Data Structure >> Miscellaneous On Data Structures
Related Questions on Miscellaneous on Data Structures
Which data structure is used to implement a binary heap efficiently?
A. Array
B. Linked List
C. Stack
D. Queue
In which scenario would you use a Bloom Filter?
A. For implementing a stack-based algorithm
B. To maintain a balanced binary tree
C. For efficient sorting of elements
D. To test membership in a large dataset
A. Queue
B. Stack
C. Heap
D. Array
Join The Discussion