program for check upper case lower case and number insert by the user

-

#include<stdio.h>

int main()
{
   char ch;

   printf("\nEnter The Character,number,special symbol : ");
   scanf("%c", &ch);
   if (ch >= 65 && ch <= 90)
     {
      printf("Character is Upper Case Letters");
     }
    else if(ch >= 97 && ch <= 122)
     {
      printf("Character is lower Case Letters");
     }
     else if(ch >= 48 && ch <= 57)
    {
      printf("this is a number");
    }
    else
    {
     printf("this is a special symbol");
    }
}

Location: NIT,Surathkal, Mangaluru, Karnataka, India

Comments

Post a Comment

Popular posts from this blog

BYTE STUFFING PROGRAM USING C

-
For Hadoop Tutorial Click Here #include<stdio.h> #include<string.h> void main(){   char frame[50][50],str[50][50]; char flag[10]; strcpy(flag,"flag"); char esc[10]; strcpy(esc,"esc"); int i,j,k=0,n; strcpy(frame[k++],"flag"); printf("Enter no.of String :\t"); scanf("%d",&n); printf("Enter String \n"); for(i=0;i<=n;i++)   { gets(str[i]);   } printf("You entered :\n"); for(i=0;i<=n;i++)     { puts(str[i]);   } printf("\n"); for(i=1;i<=n;i++)   {     if(strcmp(str[i],flag)!=0 && strcmp(str[i],esc)!=0)             {                    strcpy(frame[k++],str[i]);     }     else {           strcpy(frame[k++],"esc");           strcpy(frame[k++],str[i]);       }   } strcpy(frame[k++],"flag"); //frame[k++]='\0'; printf("------------------------------\n"); printf("Byte stuffing at sender s
Read more

Rotate a matrix 270 degree AntiClockWise

-
#include<stdio.h> void printMt(int mat[][4]) {     int i, j;     for (i = 0; i < 4; i++) {         for (j = 0; j < 4; j++) {             printf("%d ", mat[i][j]);         }         printf("\n");     } } void AntiClock90(int mat[][4]) {     int i, j, t;     for (i = 0; i < 4 / 2; i++) {         for (j = i; j < 4; j++) {             t = mat[4 - i - 1][j];             mat[4 - i - 1][j] = mat[i][j];             mat[i][j] = t;         }     }     printf("90 anticlock\n");     printMt(mat); } void Anti270(int mat1[][4]) {     int i,j,t;     for(i=0; i<4/2; i++)     {         for( j=i; j<4; j++)         {             t=mat1[j][4-i-1];             mat1[j][4-i-1]=mat1[j][i];             mat1[j][i]=t;         }     }     printf("270 anticlock \n");     printMt(mat1); } int main() {     int mat[4][4]= {{1,2,3,4},{5,6,7,8},{9,10,11,12},{13,14,15,16}};  
Read more

Finding the length of connected cells of 1's (regions) in an matrix of 1's and 0's

-
import java.io.*; class GFG {  static int max = 0;  static int count = 0;  public static void traverse(int a[][], int r, int c, int i, int j) {   if (i >= r || j >= c || i < 0 || j < 0) {    return;   }   if (a[i][j] == 0) {    return;   } else {    a[i][j] = 0;    count++;    traverse(a, r, c, i - 1, j);    traverse(a, r, c, i, j - 1);    traverse(a, r, c, i + 1, j);    traverse(a, r, c, i, j + 1);    traverse(a, r, c, i - 1, j - 1);    traverse(a, r, c, i + 1, j + 1);    traverse(a, r, c, i - 1, j + 1);    traverse(a, r, c, i + 1, j - 1);   }  }  public static void main(String[] args) {   int R = 5;   int C = 5;  int a[][] = { { 0, 0, 0, 0, 0}, { 0, 1, 1, 0, 0}, { 0, 0, 1, 0, 1}, { 1, 0, 0, 0, 1}, { 0, 1, 0, 1, 1} };   for (int i = 0; i < R; i++) {    for (int j = 0; j < C; j++) {     if (a[i][j] == 1) {      count = 0;      traverse(a, R, C, i, j);      if (count > max) {       max = count;
Read more