Download Automata fix questions and answers and more Exams Computer Science in PDF only on Docsity!
1. Decimal to binary conversion
#include<stdio.h>
int main()
int n ,c ,k;
scanf("%d",&n);
int flag=0;
for(c=31;c>=0;c-=1)
k=n>>c;
if(k &1)
printf("1");
flag=1;
else if(flag==1)
printf("0");
printf("\n");
return 0;
- Birthday date (13th^ july) #include <stdio.h> #include <string.h> int checkBirthday(char* month,int day) { strcmp(month,"july"); if(strcmp(month,"jun")==0 && day == 5) return 1; else return 0; } int main() { char inp[]="jun"; int day=5; if(checkBirthday(inp,day)==1) printf("\tYes\n"); else printf("\tNo\n"); }
- Print the pattern 1 11 111 1111 #include<stdio.h> void patternPrint (int num); int main() { int n; scanf("%d",&n); patternPrint (n); return 0; } void patternPrint(int n) { int print=1,i,j; for(i=1;i<=n;i++)//error { for(j=1;j<=i;j++)//error { printf("%d",print); } printf("\n"); } }
- Print the pattern 11111 1 1 1 1 1 1 11111
Printing a fibonacci number
#include<stdio.h> int fibonacci(int num); int main() { int num; printf("enter the number"); scanf("%d",&num); fibonacci(num); return 0; } int fibonacci(int num) { int i; long sum=0; long num1=0; long num2=1; for(i=1;i<=num;++i) { printf("%ld",num1); sum=num1+num2; num1=num2; num2=sum; //num1=num2; } }
5. Prime _consecutive SUM
#include<stdio.h> #include<string.h> int isprime(int num) { int i; int isprime=1; for (i=2;i<num;i++) { if(num%i==0) { isprime=0; break; } } return isprime;
int is_prime_has_cons_sum_fact(int num) { int prime_num[100], i, j, sum=0; int prime_idx=0; for(i=2;i<num; i++) { if(isprime(i)==1) { prime_num[prime_idx]=i; prime_idx++; } } for(i=0;i <prime_idx ; i++) { sum=0; for(j=i; j<prime_idx;j++) { sum=sum+prime_num[j]; if(sum==num) { return i; } } } return 0; } void main() { int n,m; scanf("%d",&n); for(m=2;m<=n;m++) { if(isprime(m) && is_prime_has_cons_sum_fact(m)) { printf(" %d", m); } } }
- Palindrome or not #include<stdio.h>
int num; scanf("%d", &num); printcharacterpattern(num); return 0; }
