pgm to find number of words starting with capital letters
in a file(additional memory usage not allowed)(if a word
starting with capital also next letter in word is capital
cann't be counted twice)
- 2 Answers
- 15260 Views
- Subex, Wipro, I also Faced
- E-Mail Answers
Answer Posted / shiva
int flag=0,count=0;
FILE *in=fopen("in.txt","r");
while(!feof(in))
{
if( isupper( fgetc(in) ) && flag==0)
{
flag=1;
count++;
}
else if( fgetc(in) ==' ')
flag=0;
}
printf("Count=%d",count);
// PROGRAM VERIFIED WITH SAMPLE INPUT
| Is This Answer Correct ? | 28 Yes | 8 No |
Post New Answer View All Answers
What is wrong in this statement? scanf(“%d”,whatnumber);
where are auto variables stored? What are the characteristics of an auto variable?
Write a program, where i have a grid with many cells, how many paths are possible from one point to other desired points.
How is a macro different from a function?
write a c program to find the largest and 2nd largest numbers from the given n numbers without using arrays
What is #include cctype?
What is cohesion in c?
What is extern keyword in c?
How do you construct an increment statement or decrement statement in C?
What is 2c dna?
the 'sizeof' operator reported a larger size than the calculated size for a structure type. What could be the reason?
What is the difference between procedural and functional programming?
What is a wrapper function in c?
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.
How do we declare variables in c?
