Skip to main content

Email validation and separating email id from email server name in java

//file name--> Email.java

import java.io.*;
import java.util.*;
class Email{
 public static void main(String args[])
 {
  Scanner input=new Scanner(System.in);
  String mail;
  boolean flag1=false,flag2=false;
  
  System.out.println("Enter Email Address:");
  mail=input.next();
  char emailid[]=mail.toCharArray();
  
  char server[]=new char[15];
  char id[]=new char[25];
  int i=0,j=0;
  for(char temp: emailid){
  
   if(temp=='@')
    flag1=true;
    
   if(flag1)
   {   
    if(temp=='.')
     flag2=true;
   }
   
   if(!flag1)
   {
    id[i++]=temp;
   }
   else
   {
    if(temp!='@')
     server[j++]=temp;
   }
  }
  
  if(flag1 && flag2)
  {
   System.out.println("\nOutput:It is valid address.");
   System.out.print("Email id:");
   
   for(char temp: id){
    System.out.print(temp);
   }
   
   System.out.print("\nEmail server address:");
   for(char temp: server){
    System.out.print(temp);
   }
  }
  else
  {
   System.out.println("\nOutput:Invalid Email Address");
  }
 }
 
}


OUTPUT

javac Email.java

java Email
Enter Email Address:
anand.patel1991@gmail.com

Output:It is valid address.
Email id:anand.patel1991
Email server address:gmail.com

java Email
Enter Email Address:
anand.patel1991@gmail

Output:Invalid Email Address


Comments

Popular posts from this blog

MVT (Multiprogramming Variable Task) in C Programming

#include< stdio.h> #include< conio.h> void main() { int i,os_m,nPage,total,pg[25]; clrscr(); printf("\nEnter total memory size:"); scanf("%d",&total); printf("\nEnter memory for OS:"); scanf("%d",&os_m); printf("\nEnter no. of pages:"); scanf("%d",&nPage); for(i=0;i< nPage;i++) { printf("Enter size of page[%d]:",i+1); scanf("%d",&pg[i]); } total=total-os_m; for(i=0;i< nPage;i++) { if(total>=pg[i]) { printf("\n Allocate page %d",i+1); total=total-pg[i]; } else printf("\n page %d is not allocated due to insufficient memory.",i+1); } printf("\n External Fragmentation is:%d",total); getch(); } OUTPUT Enter total memory size:1024 Enter memory for OS:256 Enter no. of pages:4 Enter size of page[1]:128 Enter size of page[2]:512 Enter size of page[3]:64 Enter size of page[4]:512 Allocate page 1 Al

implement Rail fence cipher in Java

// File Name: RailFence.java import java.util.*; class RailFenceBasic{ int depth; String Encryption(String plainText,int depth)throws Exception { int r=depth,len=plainText.length(); int c=len/depth; char mat[][]=new char[r][c]; int k=0; String cipherText=""; for(int i=0;i< c;i++) { for(int j=0;j< r;j++) { if(k!=len) mat[j][i]=plainText.charAt(k++); else mat[j][i]='X'; } } for(int i=0;i< r;i++) { for(int j=0;j< c;j++) { cipherText+=mat[i][j]; } } return cipherText; } String Decryption(String cipherText,int depth)throws Exception { int r=depth,len=cipherText.length(); int c=len/depth; char mat[][]=new char[r][c]; int k=0; String plainText=""; for(int i=0;i< r;i++) { for(int j=0;j< c;j++) { mat[i][j]=cipherText.charAt(k++); } } for(int i=0;i< c;i++) { for(int j=0;j< r;j++) { plainText+=mat[j][i]; } }

Deadlock Prevention using Banker’s Algorithm in C Programming

#include< stdio.h> #include< conio.h> void main() { int allocated[15][15],max[15][15],need[15][15],avail[15],tres[15],work[15],flag[15]; int pno,rno,i,j,prc,count,t,total; count=0; clrscr(); printf("\n Enter number of process:"); scanf("%d",&pno); printf("\n Enter number of resources:"); scanf("%d",&rno); for(i=1;i< =pno;i++) { flag[i]=0; } printf("\n Enter total numbers of each resources:"); for(i=1;i<= rno;i++) scanf("%d",&tres[i]); printf("\n Enter Max resources for each process:"); for(i=1;i<= pno;i++) { printf("\n for process %d:",i); for(j=1;j<= rno;j++) scanf("%d",&max[i][j]); } printf("\n Enter allocated resources for each process:"); for(i=1;i<= pno;i++) { printf("\n for process %d:",i); for(j=1;j<= rno;j++) scanf("%d",&allocated[i][j]); } printf("\n avai