Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
C Program for Palindrome
void main()
{
char ch[30];
char ch1[30];
int i,j,l;
clrscr();
printf("ENTER THE STRING: ");
gets(ch);
l=strlen(ch);
j=0;
for(i=l-1;i>=0;i--,j++)
ch1[j]=ch[i];
ch1[j]='\0';
if(strcmp(ch,ch1)==0)
printf("IT IS A PALINDROME");
else
printf("IT IS NOT A PALINDROME");
getch();
}
OUTPUT :
ENTER THE STRING: MALAYALAM
IT IS A PALINDROME
What is conversion operator? Explain it with example.
A: A class which is used to traverse through the objects maintained through a container class. There are _ve categories of iterators: output iterators, input iterators, forward ite
Selecting Array Elements Implement the following C++ code in assembly language, using the block-structured .IF and .WHILE directives. Assume that all variables are 32-bit signed in
can we use const data member in static. member function with example.
Armed with your function from above, we can do some interesting things. For instance, any pixel where the offsets are both zero is a pit (lower than all surrounding points) .
Ques.Implement a c/c++ program to find a shortest path between two nodes in a network?network should be taken as an adjacency matrix.
Described "pure virtual" member function?
Using your mountain project source code as a starting point, you are to write a code that randomly chooses one of the triangles on the surface of your mountain, this will be the en
program to find if a no . is prime or not
How would I make a maze in C++? I would prefer to use the recursion maze generation algorithm if possible, thanks!
Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd