Write a program to generate the Fibonacci series in c?

Correct Answer: #include int main(){ int a=5,b=10; a=b+a; b=a-b; a=a-b; printf("a= %d b= %d",a,b); }

Correct Answer: It is also called as post tested loop It is used when it is necessary to execute the loop at least one time Syntax: do { Loop body } while (Expression); Example: int main(){ int num,i=0; do{ printf("To enter press 1\n"); printf("To exit press 2"); scanf("%d",&num); ++i; switch(num){ case 1:printf("You are welcome\n");break; default : exit(0); } } while(i<=10); return 0; } Output: 3 3 4 4

Correct Answer: #include int main( int count,char * argv[] ) { int i; FILE *ptr; char *str; char ch; if( count == 1) { printf( "The syntax of the command is incorrect\n" ); } for( i=1;i2) printf("\nError occurred while procesing : %s\n",argv[i]); } else { if(count>2) { printf("%s\n\n",argv[i]); } while((ch=getc(ptr))!=-1) printf("%c",ch); } fclose(ptr); } return 0; } Save the above file as openc, compile and execute the go to command mode (current working directory) and write: open xyc (xyc any file present in that directory) To run the open command in all directories and drive you will have to give the path of current working directory in command mode Write: C:tc\bin>PATH c:\tc\bin Now press enter key Now your open command will work in all directory and drive

Correct Answer: Johnny Depp

Explanation:

Default value of enum constant
GaryOldman = -2 +1 = -1
And default value of enum constant
EdNorton = -1 + 1 = 0
Note: Case expression can be enum constant.

Correct Answer: Output: 12 Explanation: Binary value of a=1 is 00001 (in 5 bit) Binary value of b=3 is 00011 (in 5 bit) Binary value of c=3 is 000011 (in 6 bit) In memory it is represented as: Let address of bit1 is 500 which initialize to char pointer p Since can is one byte data type so p++ will be 501 *p means content of memory location 501 which is (00001100) and its binary equivalent is 12 Hence output is 12

Correct Answer: #include int main(){ int i=1,f=1,num; printf("Enter a number: "); scanf("%d",&num); while(i<=num){ f=f*i; i++; } printf("Factorial of %d is: %d",num,f); return 0; } Sample output: Enter a number: 5 Factorial of 5 is: 120

Correct Answer: #include int main(){ int num,i,f,r,sum=0,temp; printf("Enter a number: "); scanf("%d",&num); temp=num; while(num){ i=1,f=1; r=num%10; while(i<=r){ f=f*i; i++; } sum=sum+f; num=num/10; } if(sum==temp) printf("%d is a strong number",temp); else printf("%d is not a strong number",temp); return 0; } Sample output: Enter a number: 145 145 is a strong number

Correct Answer: #include int main(){ int r,i,j,k; printf("Enter the number range: "); scanf("%d",&r); for(i=1;i<=r;i++){ for(j=1;j<=10;j++) printf("%d*%d=%d ",i,j,i*j); printf("\n"); } return 0; } Sample Output: Enter the number range: 5 1*1=1 1*2=2 1*3=3 1*4=4 1*5=5 1*6=6 1*7=7 1*8=8 1*9=9 1*10=10 2*1=2 2*2=4 2*3=6 2*4=8 2*5=10 2*6=12 2*7=14 2*8=16 2*9=18 2*10=20 3*1=3 3*2=6 3*3=9 3*4=12 3*5=15 3*6=18 3*7=21 3*8=24 3*9=27 3*10=30 4*1=4 4*2=8 4*3=12 4*4=16 4*5=20 4*6=24 4*7=28 4*8=32 4*9=36 4*10=40 5*1=5 5*2=10 5*3=15 5*4=20 5*5=25 5*6=30 5*7=35 5*8=40 5*9=45 5*10=50

Correct Answer: include int main(){ int s,i,j,temp,a[20]; printf("Enter total elements: "); scanf("%d",&s); printf("Enter %d elements: ",s); for(i=0;ia[j]){ temp=a[i]; a[i]=a[j]; a[j]=temp; } } } printf("After sorting is: "); for(i=0;i

Correct Answer: #include void quicksort(int [10],int,int); int main(){ int x[20],size,i; printf("Enter size of the array: "); scanf("%d",&size); printf("Enter %d elements: ",size); for(i=0;ix[pivot]) j--; if(i