Answer Posted / vadivelt

Hi.
Have a look on the code i hav written below.
Just give max no(in this question 500) as a input, u ll get
the prime nos in this range.


#include<stdio.h>
#include<conio.h>

main()
{
int n, j, k, flag = 0;
printf("ENTER THE NO\n");
scanf("%d", &n);
printf("\nPRIME NOS IN THIS RANGE\n");
for(j = 1; j<= n; j++)
{
for(k = j; k>=1; k--)
{
if(j%k == 0)
flag++;
}
if(flag == 2)
{
printf("%d ", j);
}
flag = 0;
}
getch();
}

Explain how do you view the path?

1092

---

Explain what is the most efficient way to store flag values?

1176

---

What are the different types of constants?

1021

---

For what purpose null pointer used?

1016

---

Why is this loop always executing once?

1002

---

Why c is called procedure oriented language?

1001

---

a value that does not change during program execution a) variabe b) argument c) parameter d) none

1186

---

How many data structures are there in c?

1069

---

How to write a code for reverse of string without using string functions?

2077

---

What is c basic?

1128

---

What is logical error?

1068

---

What is dynamic dispatch in c++?

1000

---

which type of aspect you want from the student.

2118

---

What is time null in c?

1010

---

How do you determine whether to use a stream function or a low-level function?

1082

---