WAP to check whether the given string is palindrome or not(without using string reverse function).

Consider the hex strings A=0x09a3b4fd83b08d2c and B=0xd09d4a09cba24e45. a) What is A B in hexadecimal? Please give your answer a leading Ox and use lowercase letters only. Make sure you use exactly 16 hex digits (which may involve typing in leading zeros). hexadecimal: b) Suppose that A was generated uniformly at random from all 8 byte strings. What is the probability that the second binary digit of A is 1? c) Suppose that A was generated uniformly at random from all 8 byte strings. What is the probability that the second binary digit of A B is 1?

Complete the given CPP function definition and run it for a test case. void swapString(string &str, int i, int j) { //check whether i and j are in the range //0 to str.length ()-1 and i is less than j. //if the conditions are true then swap the //characters at index i and j in the string. }

Regular Expression The set of strings that has exactly 3 b (and any number of a).

I have a string with a phrase in it, and I want to turn it into all caps using the function toupper. Write a code fragment that does that and then prints the resulting string.

Write a function reverse(instring) to take a string and reverse it.

Write out a function that prints out all the permutations of a string. For example, abc would give you abc, acb, bac, bca, cab, cba.