Interested to Buy Any Domain ? << Click Here >> for more details...
palindrome for strings and numbers----Can anybody do the
prog?
- 6 Answers
- 13809 Views
- CTS, TCS, Vipro Lifescience Pvt, I also Faced
- E-Mail Answers
Answer Posted / dally
#include<stdio.h>
int main()
{
int n,sum=0,temp;
printf("Enter nuber\n");
scanf("%d",&n);
temp = n;
while(n>1)
{
n = n%10;
sum = n + sum*10;
n = n / 10;
}
if(temp == sum)
printf("Given number is polindram\n");
else
printf("Given number is not polindram\n");
}
| Is This Answer Correct ? | 4 Yes | 2 No |
Post New Answer View All Answers
What is function what are the types of function?
What is indirection? How many levels of pointers can you have?
What are data structures in c and how to use them?
What is else if ladder?
What is an endless loop?
What is the difference between a string and an array?
Explain the difference between strcpy() and memcpy() function?
What is structure packing in c?
WHAT IS THE DEFINATION OF IN TECHNOLOGY AND OFF TECHNOLOGY ?
What are the types of functions in c?
Can you please explain the difference between malloc() and calloc() function?
Write a program to check prime number in c programming?
Why should I prototype a function?
The % symbol has a special use in a printf statement. How would you place this character as part of the output on the screen?
At a shop of marbles, packs of marbles are prepared. Packets are named A, B, C, D, E …….. All packets are kept in a VERTICAL SHELF in random order. Any numbers of packets with these names could be kept in that shelf as in this example: bottom of shelf ---> [AAAJKRDFDEWAAYFYYKK]-----Top of shelf. All these packets are to be loaded on cars. The cars are lined in order, so that the packet could be loaded on them. The cars are also named [A, B, C, D, E,………….]. Each Car will load the packet with the same alphabet. So, for example, car ‘A’ will load all the packets with name ‘A’. Each particular car will come at the loading point only once. The cars will come at the loading point in alphabetical order. So, car ‘B’ will come and take all the packets with name ‘B’ from the shelf, then car ‘C’ will come. No matter how deep in the shelf any packet ‘B’ is, all of the ‘B’ packets will be displaced before the ‘C’ car arrives. For that purpose, some additional shelves are provided. The packets which are after the packet B, are kept in those shelves. Any one of these shelves contains only packets, having the same name. For example, if any particular shelf is used and if a packet with name X is in it, then only the packets having names X will be kept in it. That shelf will look like [XXXXXXX]. If any shelf is used once, then it could be used again only if it is vacant. Packets from the initial shelf could be unloaded from top only. Write a program that finds the minimum total number of shelves, including the initial one required for this loading process.
