Skip to main content

Star patterns in java

//File name--> Pattern.java

import java.io.*;
class Pattern{
 public static void main(String args[])throws Exception
 {
  BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
  
  System.out.println("Enter your choice to print different pattern(1-5):");
  int choice=Integer.parseInt(br.readLine());
  System.out.println("Enter Number of lines you want:");
  int n=Integer.parseInt(br.readLine());
  switch(choice)
  {
   case 1:
       for(int i=1;i < =n;i++)
       {
        System.out.println();

        for(int j=1;j < =i;j++)
         System.out.print(" ");
        
        int a=i; 
        for(int k=0;k < =n-i;k++)
        {
         System.out.print(" "+a);
         a+=i;
        }
       }
       break;
   case 2:
       for(int i=0;i < n;i++)
       {
        System.out.println();

        for(int j=0;j < i;j++)
         System.out.print(" ");
         
        for(int k=0;k < n-i;k++)
         System.out.print("* ");
       }
         
       break;
   case 3:
       for(int i=0;i < n/2+1;i++)
       {
        System.out.println();

        for(int j=0;j < n/2-i;j++)
         System.out.print(" ");
         
        for(int k=0;k < =i;k++)
         System.out.print("* ");
       }
       for(int i=0;i < n/2;i++)
       {
        System.out.println();
        for(int j=0;j < i;j++)
         System.out.print(" ");
         
        for(int k=0;k < n/2-i;k++)
         System.out.print(" *");
       }
       break;



   case 4:
       for(int i=0;i < n;i++)
       {
        System.out.println();

        for(int j=0;j < i;j++)
         System.out.print(" ");
         
        for(int k=0;k < n-i;k++)
          System.out.print("*");
       }  
       break;
   case 5:
       for(int i=0;i < n/2+1;i++)
       {
        System.out.println();

        for(int j=0;j < n/2-i;j++)
         System.out.print(" ");
         
        for(int k=0;k < =i;k++)
         System.out.print("*");
       }
       for(int i=0;i < n/2;i++)
       {
        System.out.println();
        for(int j=0;j < =i;j++)
         System.out.print(" ");
         
        for(int k=0;k < n/2-i;k++)
         System.out.print("*");
       }
       break;
   default:
       System.out.println("Invalid choice");
           
  }
  
 }
}

OUTPUT

javac Pattern.java

java Pattern
Enter your choice to print different pattern(1-5):
1
Enter Number of lines you want:
5

  1 2 3 4 5
   2 4 6 8
     3 6 9
      4 8
        5
java Pattern
Enter your choice to print different pattern(1-5):
2
Enter Number of lines you want:
5

* * * * *
 * * * *
   * * *
     * *
      *
java Pattern
Enter your choice to print different pattern(1-5):
3
Enter Number of lines you want:
7

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

java Pattern
Enter your choice to print different pattern(1-5):
4
Enter Number of lines you want:
6

******
  *****
    ****
      ***
        **
          *
java Pattern
Enter your choice to print different pattern(1-5):
5
Enter Number of lines you want:
5

    *
  **
***
  **
    *


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

First Come First Serve (FCFS) Page replacement algorithm in C Programming

#include< stdio.h> #include< conio.h> int fsize; int frm[15]; void display(); void main() { int pg[100],nPage,i,j,pf=0,top=-1,temp,flag=0; clrscr(); printf("\n Enter frame size:"); scanf("%d",&fsize); printf("\n Enter number of pages:"); scanf("%d",&nPage); for(i=0;i< nPage;i++) { printf("\n Enter page[%d]:",i+1); scanf("%d",&pg[i]); } for(i=0;i< fsize;i++) frm[i]=-1; printf("\n page | \t Frame content "); printf("\n--------------------------------------"); for(j=0;j< nPage;j++) { flag=0; for(i=0;i< fsize;i++) { if(frm[i]==pg[j]) { flag=1; break; } } if(flag==0) { if(top==fsize-1) { top=-1; } pf++; top++; frm[top]=pg[j]; } printf("\n %d |",pg[j]); display(); } printf("\n--------------------------------------"); printf("\n total page fault:%d",pf); getch(); }

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