

















Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
C & C++ PROGRAMMING - LOGIC-BASED REVISION SHEET PATTERN 1: INPUT → PROCESS → OUTPUT Program 1: Basic I/O Input: One number Logic: Read input, print output
Typology: Study notes
1 / 25
This page cannot be seen from the preview
Don't miss anything!


















c
#include int main() { int n; scanf("%d", &n); printf("%d", n); return 0 ; }
c
#include int main() { int a, b; scanf("%d %d", &a, &b); printf("%d", a + b); return 0 ; }
c
#include int main() { int n; scanf("%d", &n); if(n % 2 == 0 ) printf("Even"); else printf("Odd"); return 0 ; }
c
#include int main() { int n; scanf("%d", &n); if(n > 0 ) printf("Positive"); else if(n < 0 ) printf("Negative"); else printf("Zero"); return 0 ; }
c
#include int main() { int m; scanf("%d", &m); if(m >= 40 ) printf("Pass"); else printf("Fail");
PATTERN 4: NESTED IF-ELSE
PATTERN 5: SWITCH CASE
c
#include int main() { int y; scanf("%d", &y); if(y % 4 == 0 ) { if(y % 100 == 0 ) { if(y % 400 == 0 ) printf("Leap"); else printf("Not Leap"); } else printf("Leap"); } else printf("Not Leap"); return 0 ; }
c
#include int main() { char op; float a, b; scanf(" %c %f %f", &op, &a, &b); switch(op) { case '+': printf("%.2f", a+b); break; case '-': printf("%.2f", a-b); break; case '': printf("%.2f", ab); break; case '/': printf("%.2f", a/b); break; default: printf("Invalid");
PATTERN 6: FOR LOOP (FIXED COUNT)
return 0 ; }
c
#include int main() { int m; scanf("%d", &m); switch(m/ 10 ) { case 10 : case 9 : printf("A"); break; case 8 : printf("B"); break; case 7 : printf("C"); break; case 6 : printf("D"); break; default: printf("F"); } return 0 ; }
c
#include int main() { int n, i; scanf("%d", &n); for(i = 1 ; i <= n; i++) printf("%d ", i); return 0 ; }
PATTERN 8: WHILE LOOP (UNKNOWN COUNT)
scanf("%d", &n); for(i = 1 ; i <= n; i++) sum = sum + i; printf("%d", sum); return 0 ; }
c
#include int main() { int n, i, count = 0 ; scanf("%d", &n); for(i = 1 ; i <= n; i++) if(i % 2 == 0 ) count++; printf("%d", count); return 0 ; }
c
#include int main() { int n, i, sum = 0 ; scanf("%d", &n); for(i = 1 ; i <= n; i++) if(i % 2 == 0 ) sum = sum + i; printf("%d", sum); return 0 ; }
c
#include int main() { int n, sum = 0 ; scanf("%d", &n); while(n > 0 ) { sum = sum + n % 10 ; n = n / 10 ; } printf("%d", sum); return 0 ; }
c
#include int main() { int n, count = 0 ; scanf("%d", &n); while(n > 0 ) { count++; n = n / 10 ; } printf("%d", count); return 0 ; }
c
#include int main() { int n, i, fact = 1 ; scanf("%d", &n); for(i = 1 ; i <= n; i++) fact = fact * i; printf("%d", fact); return 0 ; }
c
#include int main() { int n, i, flag = 1 ; scanf("%d", &n); if(n <= 1 ) flag = 0 ; for(i = 2 ; i < n; i++) if(n % i == 0 ) flag = 0 ; if(flag) printf("Prime"); else printf("Not Prime"); return 0 ; }
c
#include int main() { int n, i, a = 0 , b = 1 , c; scanf("%d", &n); printf("%d %d ", a, b); for(i = 2 ; i < n; i++) {
c = a + b; printf("%d ", c); a = b; b = c; } return 0 ; }
c
#include int main() { int n, temp, rev = 0 ; scanf("%d", &n); temp = n; while(n > 0 ) { rev = rev * 10 + n % 10 ; n = n / 10 ; } if(temp == rev) printf("Palindrome"); else printf("Not Palindrome"); return 0 ; }
c
#include int main() { int n, temp, sum = 0 , r; scanf("%d", &n); temp = n; while(n > 0 ) { r = n % 10 ; sum = sum + r * r * r; n = n / 10 ;
printf("%d", count); return 0 ; }
c
#include int main() { char s[ 100 ]; int i, len = 0 ; scanf("%s", s); for(i = 0 ; s[i] != '\0'; i++) len++; for(i = len - 1 ; i >= 0 ; i--) printf("%c", s[i]); return 0 ; }
c
#include int main() { char s[ 100 ]; int i, j, len = 0 , flag = 1 ; scanf("%s", s); for(i = 0 ; s[i] != '\0'; i++) len++; j = len - 1 ; for(i = 0 ; i < len/ 2 ; i++) { if(s[i] != s[j]) flag = 0 ; j--; } if(flag) printf("Palindrome"); else printf("Not Palindrome");
PATTERN 12: ARRAY PROGRAMS (LOOP THROUGH ELEMENTS)
return 0 ; }
c
#include int main() { char s1[ 100 ], s2[ 100 ]; int i; scanf("%s", s1); for(i = 0 ; s1[i] != '\0'; i++) s2[i] = s1[i]; s2[i] = '\0'; printf("%s", s2); return 0 ; }
c
#include int main() { int a[ 100 ], n, i, sum = 0 ; scanf("%d", &n); for(i = 0 ; i < n; i++) scanf("%d", &a[i]); for(i = 0 ; i < n; i++) sum = sum + a[i]; printf("%d", sum); return 0 ; }
PATTERN 13: 2D ARRAY (NESTED LOOPS)
c
#include int main() { int a[ 100 ], n, i, j, temp; scanf("%d", &n); for(i = 0 ; i < n; i++) scanf("%d", &a[i]); i = 0 ; j = n - 1 ; while(i < j) { temp = a[i]; a[i] = a[j]; a[j] = temp; i++; j--; } for(i = 0 ; i < n; i++) printf("%d ", a[i]); return 0 ; }
c
#include int main() { int a[ 10 ][ 10 ], b[ 10 ][ 10 ], c[ 10 ][ 10 ], r, col, i, j; scanf("%d %d", &r, &col); for(i = 0 ; i < r; i++) for(j = 0 ; j < col; j++) scanf("%d", &a[i][j]); for(i = 0 ; i < r; i++) for(j = 0 ; j < col; j++) scanf("%d", &b[i][j]); for(i = 0 ; i < r; i++) for(j = 0 ; j < col; j++)
PATTERN 14: FUNCTIONS (REUSABLE CODE)
c[i][j] = a[i][j] + b[i][j]; for(i = 0 ; i < r; i++) { for(j = 0 ; j < col; j++) printf("%d ", c[i][j]); printf("\n"); } return 0 ; }
c
#include int main() { int a[ 10 ][ 10 ], t[ 10 ][ 10 ], r, col, i, j; scanf("%d %d", &r, &col); for(i = 0 ; i < r; i++) for(j = 0 ; j < col; j++) scanf("%d", &a[i][j]); for(i = 0 ; i < r; i++) for(j = 0 ; j < col; j++) t[j][i] = a[i][j]; for(i = 0 ; i < col; i++) { for(j = 0 ; j < r; j++) printf("%d ", t[i][j]); printf("\n"); } return 0 ; }
c
#include int sum(int a, int b) {
PATTERN 15: RECURSION (FUNCTION CALLS ITSELF)
int n; scanf("%d", &n); printf("%d", fact(n)); return 0 ; }
c
#include int fact(int n) { if(n <= 1 ) return 1 ; return n * fact(n - 1 ); } int main() { int n; scanf("%d", &n); printf("%d", fact(n)); return 0 ; }
c
#include int sum(int n) { if(n == 0 ) return 0 ; return n + sum(n - 1 ); } int main() { int n; scanf("%d", &n); printf("%d", sum(n));
PATTERN 16: POINTERS (ADDRESS MANIPULATION)
PATTERN 17: STRUCTURES (GROUP RELATED DATA)
return 0 ; }
c
#include void swap(int *a, int *b) { int t = *a; *a = *b; *b = t; } int main() { int x, y; scanf("%d %d", &x, &y); swap(&x, &y); printf("%d %d", x, y); return 0 ; }
c
#include struct Student { char name[ 50 ]; int roll; float marks; }; int main() { struct Student s; scanf("%s %d %f", s.name, &s.roll, &s.marks);