Answer Posted / bhawna

#include<stdio.h>
#include<conio.h>
main()
{
int per_men, tot_men, tot_lit_pop, tot_lit_per, men_lit_per, tot_lit_men, tot_lit_wom, tot_wom, ilt_wom, ilt_men, tot_pop=80000;

per_men=52;
tot_men=tot_pop*per_men/100;
tot_lit_per=48;
tot_lit_pop=tot_pop*tot_lit_per/100;
men_lit_per=35;
tot_lit_men=tot_pop*men_lit_per/100;
tot_lit_wom=tot_lit_pop-tot_lit_men;
tot_wom=tot_pop-tot_men;
ilt_men=tot_men-tot_lit_men;
ilt_wom=tot_wom-tot_lit_wom;


printf("\nTotal Population = %d",tot_pop);
printf("\nTotal number of Men = %d",tot_men);
printf("\nTotal number of Literate Population = %d",tot_lit_pop);
printf("\nTotal number of Literate Men = %d",tot_lit_men);
printf("\nTotal number of Literate Women = %d",tot_lit_wom);
printf("\nTotal number of Women = %d",tot_wom);

printf("\nTotal number of Illiterate Men = %d",ilt_men);
printf("\nTotal number of Illiterate Women = %d",ilt_wom);

getch();
}

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.

2160

---

What are the back slash character constants or escape sequence charactersavailable in c?

1154

---

What is the use of typedef in c?

1009

---

write a program to create a sparse matrix using dynamic memory allocation.

4865

---

What is the general form of a C program?

1000

---

Process by which one bit pattern in to another by bit wise operation is?

1127

---

What are c header files?

970

---

Do you have any idea about the use of "auto" keyword?

1068

---

Write a program to print all permutations of a given string.

1165

---

What is pass by reference in functions?

816

---

Why we use stdio h in c?

1002

---

What is static memory allocation?

1135

---

In c programming write a program that will print 10 multiples of 3 except 15,18,21 using looping

1459

---

What is data type long in c?

1043

---

When we use void main and int main?

1047

---