Strings

1
Write an efficient C code for tr. tr abc xyz replace a with x, b with y and c with z in the input file.



2
Write strlen function that returns length in less complexity provided we have char str[100],str can contain any string of length 100 maximum.



3
Write all the test cases for anagram checking program



4
Check whether a given string consists the substring of type "ab*c"



5
Given a string s1 and a string s2. Write a snippet to say whether s2 is a rotation of s1 using one call to strstr routine. e.g : s1=abcd s2=cdab return true. s1=abcd s2=acbd return false.