Skip to content
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
14 changes: 14 additions & 0 deletions asiya/basicofprogramming/PATTERN 1.java.java
Original file line number Diff line number Diff line change
@@ -0,0 +1,14 @@
public class Pattern1 {
public static void main(String[]args)
{
for(int i=0 ;i<6;i++)
{
for(int j=0 ; j<=i ;j++)
{
System.out.print("*");
}
System.out.println();
}
}

}
14 changes: 14 additions & 0 deletions asiya/basicofprogramming/PATTERN 2.java.java
Original file line number Diff line number Diff line change
@@ -0,0 +1,14 @@
public class Pattern2 {
public static void main(String[]args)
{
for(int i=0 ;i<6; i++)
{
for(int j= 6 ;j> 0 ;j--)
{
System.out.println("*");
}
System.out.println();
}
}

}
23 changes: 23 additions & 0 deletions asiya/basicofprogramming/PATTERN 3.java.java
Original file line number Diff line number Diff line change
@@ -0,0 +1,23 @@
public class Pattern3 {
public static void main(String[]args)
{
for(int i= 0 ; i<6 ;i++)
{

for(int k=6 ; k>i ;k--)
{
System.out.print(" ");
}

for(int j = 0 ; j<i ;j++)
{
System.out.print("*");
}
System.out.println();

}



}
}
19 changes: 19 additions & 0 deletions asiya/basicofprogramming/PATTERN 4.java.java
Original file line number Diff line number Diff line change
@@ -0,0 +1,19 @@
public class Pattern4 {
public static void main(String[]args)
{
for(int i=0 ; i<5 ;i++)
{
for(int j =0 ;j<i ;j++)
{
System.out.print(" ");
}

for(int k =5; k>i ;k--)
{
System.out.print("*");
}

System.out.println();
}
}
}
27 changes: 27 additions & 0 deletions asiya/basicofprogramming/prime_number.java.java
Original file line number Diff line number Diff line change
@@ -0,0 +1,27 @@
package asiya.basicsofprogramming.gettingstarted;
import java.util.*;
public class prime_number {
public static void main(String[] args){
Scanner scn = new Scanner(System.in);
int n = scn.nextInt();
for (int i = 0;i<n;i++) {
prime(scn.nextInt());
}
scn.close();
}

public static void prime(int n) {
int t=0;
for(int i=2;i<=n/2;i++) {
if(n%i==0) {
t=1;
break;
}
}
if(t==0) {
System.out.println("prime");
} else {
System.out.println("not prime");
}
}
}