Answer Posted / marvin

#include <studio.h>
main()
{
double income, i_t;
int tax;

printf ("
Enter income: ");
scanf ("%lf", &income);

if (income<100000)
tax = 0;

if (income<200000 && income>=100000)
tax = 10;

if (income>=200000)
tax = 20;

i_t = income*tax/100;
printf ("
Income Tax = %lf",i_t);
}

Why & is used in scanf in c?

1109

---

How to draw the flowchart for structure programs?

9348

---

Can you define which header file to include at compile time?

1028

---

What is meant by realloc()?

1165

---

What header files do I need in order to define the standard library functions I use?

1069

---

What is the difference between array_name and &array_name?

1311

---

What do you mean by keywords in c?

1156

---

Are negative numbers true in c?

1073

---

What is the difference between char array and char pointer?

1072

---

Differentiate abs() function from fabs() function.

1024

---

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.

2195

---

Write a program to print fibonacci series without using recursion?

1150

---

What are volatile variables in c?

958

---

What is variable declaration and definition in c?

911

---

What is the difference between struct and typedef struct in c?

1133

---