1,566 views
3 votes
3 votes
#include<stdio.h>
#include<string.h>
int main(void) {
char *a="MADEEASY";
char *b="GATECSIT2019";
char *r=a;
char *s=b;
printf("%d",(int)strlen(b+3[r]-1[s]));
return 0;
}
 

Ans is given $8.$ I know basic thing, but couldnot getting what strlen(b+3[r]-1[s]) returning?? Plz explain.

3 Answers

Best answer
7 votes
7 votes

strlen(b+3[r]-1[s]) :

first: 3[r] is same as r[3] i.e., 'E'

and 1[s] is same as s[1] i.e., 'A'

3[r] - 1[s] = 'E' - 'A' = 4

now, b + 4 refers to  4 th index in b i.e, 'C' (starting position)

strlen(b+4) = strlen("CSIT2019") = 8

Thus, it will return 8.

correct me if i am wrong.

selected by
0 votes
0 votes
b+3[r]-1[s]=b+*(r+3)-*(s+1)

                   =b+E-A      {ASCII OF A=65 &E=69}

                    =b+ 69 -65

                     =b+4

                       =  strlen(b+4)

                         =strlen(CSIT2019)

                          =8               (So answer is 8)
0 votes
0 votes
b+3[r]-1[s]=b+*(r+3)-*(s+1)    (r[3]=*(r+3)=*(3+r)=3[r])

                   =b+E-A      {ASCII OF A=65 &E=69}

                    =b+ 69 -65

                     =b+4 (here b points to C right now)

                       =  strlen(b+4)

                         =strlen(CSIT2019) (strlen never count \0')

                          =8               (So answer is 8)

Related questions

4 votes
4 votes
3 answers
1
2 votes
2 votes
2 answers
3
srestha asked May 12, 2019
1,074 views
Consider the following function $foo()$void foo(int n){ if(n<=0) printf("Bye"); else{ printf("Hi"); foo(n-3); printf("Hi"); foo(n-1); } }Let $P(n)$ represent recurrence r...