1. ## Please Solve the two C programs..

Write a program which accepts the name and displays the alphabets which are not in the given name?

another program:
W.A.P. which accepts a sentence and print the word of the sentence whose number of occurrences in the sentence is maximum (always one word of the given sentence will have maximum recurrent).

Thanks..

2. Originally Posted by Elysia
Okay.. okay Got it.. I am very new in this forum..

My question was
"a program which accepts the name and displays the alphabets which are not in the given name?"
I can solve the problem..I can define the all alphabets in an array. I also can match the character in the name. But how can I print the previous array which are not matching..

3. Let me ask you this then:
If I gave you a name, and asked you to tell me which characters in the alphabet that is not in the name, how would you do it?

4. Originally Posted by Elysia
Let me ask you this then:
If I gave you a name, and asked you to tell me which characters in the alphabet that is not in the name, how would you do it?
I will check if 'A' is in the name or not if no then print A .. then check 'B' if yes then don't print and so on..
BUT it will be big program.. 26 times looping ..
Please don't angry with me. Is there any easy way to solve?

5. You have the right idea.
In C, you can use a character and increment it to find the next letter.
For example,
char x = 'A';
x is now 'A'.
x++;
x is now 'B'.
Similarly,
x = 'a';
x++;
x is now 'b'.

That should take care of your looping problem.
Do not worry about me being angry. I am not. I am simply guiding you into thinking logically how to solve a problem. Handy stuff.

6. Originally Posted by Elysia
You have the right idea.
In C, you can use a character and increment it to find the next letter.
For example,
char x = 'A';
x is now 'A'.
x++;
x is now 'B'.
Similarly,
x = 'a';
x++;
x is now 'b'.

That should take care of your looping problem.
Do not worry about me being angry. I am not. I am simply guiding you into thinking logically how to solve a problem. Handy stuff.
Ohhhh! Got it.. Thanks.. Thanks.. I can do that. Many thanks..

7. Yeah, good luck. Check back if you have problems.