Answer Posted / naman patidar

we can reduce no of iterations by changing the condition
(i<=n/2) with (i<=sqrt(n))..
This is a rule that if a number is not dividable by any no
(except 1)less than equal to the sqr root of it then the no
is prime.

int n ; // any no, user input.
int i ;
for(i=2; i<=sqrt(n); i++ )
{
if(n%i==0)
{
printf("not prime");
break;
}
}
if(i > sqrt(n)) // you can use a flag as well here
{
printf("prime no");
}

why to assign a pointer to null sometimes??how can a pointer we declare get assigned with a garbage value by default???

1981

---

Is return a keyword in c?

1096

---

Using which language Test cases are added in .ptu file of RTRT unit testing???

4292

---

Why c is faster than c++?

1048

---

What is a good data structure to use for storing lines of text?

1089

---

What is the purpose of ftell?

1091

---

How do we declare variables in c?

1078

---

What is getch () for?

1248

---

hw can we delete an internal node of binary search tree the internal node has child node..plz write progarm

2028

---

What is the difference between %d and %i?

1106

---

Explain high-order and low-order bytes.

1113

---

write a program in C that prompts the user for today's date,tomorrow's date and display the results.Use structures for today's date,tomorrow's date and an array to hold the days for each month of the year.

5463

---

Which is not valid in C a) class aClass{public:int x;}; b) /* A comment */ c) char x=12;

1080

---

Explain what is the benefit of using #define to declare a constant?

1199

---

What is extern keyword in c?

1138

---