closed by
437 views
1 votes
1 votes
closed as a duplicate of: GATE IT 2005 | Question: 53
The following C function takes two ASCII strings and determines whether one is an anagram 
of the other. An anagram of a string s is a string obtained by permuting the letters in s.

int anagram (char *a, char *b){

int count [128], j;

for (j = 0; j < 128; j++)

count[j]=0;

j = 0;

while (a[j] && b[j]){

         A;

         B;

}

for (j = 0; j < 128; j++)

if (count[j])

return 0;

return 1;

}

Choose the correct alternative for statements A and B.
  • 1 A: count [a[j]]++ and B: count[b[j]]--
  • 2 A: count [a[j]]++ and B: count[b[j]]++
  • 3 A: count [a[j++]]++ and B: count[b[j]]--
  • 4 A: count[a[j]]++ and B: count [b[j++]]--
closed by

Related questions

0 votes
0 votes
0 answers
1
0 votes
0 votes
0 answers
2
rsansiya111 asked Dec 26, 2021
314 views
0 votes
0 votes
1 answer
3
rsansiya111 asked Dec 26, 2021
213 views
0 votes
0 votes
1 answer
4
rsansiya111 asked Dec 26, 2021
211 views