Answer Posted / jagannath

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

int main()
{
int f=0,s=1,t=1,n,fl;
printf("enter the limit\t:");
scanf("%d",&n);
printf("\nfirst %d prime fibonacci numbers
are\n",n);
while(n)
{
fl=0;
fl=prime(f);
if(f>1 && fl==1)
{
printf("%d\t",f);
n=n-1;
}
s=t;
t=f;
f=s+t;
}
}

int prime(int x)
{
int i,f=0;
for(i=2;i<=x/2;i++)
{
if(x%i==0)
{
f=1;
break;
}
}
if(f==0)
{
return 1;
}
else
return 0;

}

Given an array of 1s and 0s arrange the 1s together and 0s together in a single scan of the array. Optimize the boundary conditions?

1553

---

What is 1f in c?

2730

---

Please send me WIPRO technical question to my mail ID.. its nisha_g28@yahoo.com please its urgent

2173

---

Difference between linking and loading?

1155

---

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

1135

---

PROGRAM TO WRITE CONTENTS OF 1 FILE IN REVERSE TO ANOTHER FILE,PROGRAM TO COPY 1 FILE TO ANOTHER BY SPECIFYING FILE NAMES AS COMMAND LINE

2085

---

Device an algorithm for weiler-atherton polygon clipping, where the clipping window can be any specified polygon

6024

---

Are there namespaces in c?

1189

---

What is main () in c language?

1187

---

Do pointers take up memory?

1209

---

What is #line?

1111

---

write a c program for swapping two strings using pointer

2690

---

What is the method to save data in stack data structure type?

1147

---

Is there sort function in c?

1068

---

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

1276

---