Pattern 1

            #include
              #include
              int main()
              { int i, j, n, m, k, l, s;
                clrscr();
                printf("\nEnter the Number:: ");
                scanf("%d",&n);
                if(n%2==0)
                 {m=n;
                  n=n-1;
                 }
                 else
                 m=n+1;
                s=1;
                for(k=0;k<(m/2)-1;k++)
                {  for(i=0;i<s;i++)
                   printf("* ");
                   for(j=(n-(s*2));j>0;j--)
                   printf("  ");
                   for(i=0;i<s;i++)
                   printf("* ");
                   s++;
                   printf("\n");
                }
              
                  for(i=0;i<n;i++)
                   printf("* ");
              
                 s=(m/2)-1;
                 for(k=0;k<(m/2)-1;k++)
                {  printf("\n");
                   for(i=0;i<s;i++)
                   printf("* ");
                   for(j=(n-(s*2));j>0;j--)
                   printf("  ");
                   for(i=0;i<s;i++)
                   printf("* ");
                   s--;
                }
                getch();
                return 0;
              }
          

            *           *
            *  *     *  *
            *  *  *  *  *
            *  *     *  *
            *           *
          

            import java.util.*;
            class Pgm1
            {
            public static void main(String[] args)
            { 
              int s;
              int m;
              Scanner sc = new Scanner(System.in);
              System.out.print("\nEnter the Number:: ");
                int n=sc.nextInt();
                if(n%2==0)
                 {m=n;
                  n=n-1;
                 }
                 else
                 m=n+1;
                s=1;
                for(int k=0;k<(m/2)-1;k++)
                {  for(int i=0;i<s;i++)
                  System.out.print("* ");
                   for(int j=(n-(s*2));j>0;j--)
                     System.out.print("  ");
                   for(int i=0;i<s;i++)
                     System.out.print("* ");
                   s++;
                   System.out.print("\n");
                }
            
                  for(int i=0;i<n;i++)
                    System.out.print("* ");
            
                 s=(m/2)-1;
                 for(int k=0;k<(m/2)-1;k++)
                {  System.out.print("\n");
                   for(int i=0;i<s;i++)
                     System.out.print("* ");
                   for(int j=(n-(s*2));j>0;j--)
                     System.out.print("  ");
                   for(int i=0;i<s;i++)
                   System.out.print("* ");
                   s--;
                }
                 sc.close();
            }
            }
            
          

            *           *
            *  *     *  *
            *  *  *  *  *
            *  *     *  *
            *           *
          

            #include<iostream>
            using namespace std;
            int main(){
              int main(){
              int i, j, n, m, k, l, s;
              cout<<"\nEnter the Number:: ";
              cin>>n;
              if(n%2==0)
              {m=n;
                n=n-1;
              }
              else
              m=n+1;
              s=1;
              for(k=0;k<(m/2)-1;k++)
              {  for(i=0;i<s;i++)
                cout<<"* ";
                for(j=(n-(s*2));j>0;j--)
                cout<<"  ";
                for(i=0;i<s;i++)
                cout<<"* ";
                s++;
                printf("\n");
              }

                for(i=0;i<n;i++)
                cout<<"* ";

              s=(m/2)-1;
              for(k=0;k<(m/2)-1;k++)
              {  cout<<"\n";
                for(i=0;i<s;i++)
                cout<<"* ";
                for(j=(n-(s*2));j>0;j--)
                cout<<"  ";
                for(i=0;i<s;i++)
                cout<<"* ";
                s--;
              }
              return 0;
            }
          

            *           *
            *  *     *  *
            *  *  *  *  *
            *  *     *  *
            *           *