import java.util.Scanner; public class PrimePattern { public static boolean isPrime(int n) { int i; for(i=2;i<n;i++) if(n%i...

  //Various 7-Patterns Layout #include<stdio.h> //Global Variables int i, j, k, n=5, a;  char x; void Pattern1_1(){ for(i=1;i<=n;...

#include<iostream> #include<iomanip> using namespace std; void Pattern1(int n) { int i, j, k, x=1;  for(i=1;i<=n;i++) {...

import java.util.*; public class Pattern {     public static void Pattern1(int n, char ch)     {         int i, j;         for(i=1;i...

//Is Number is Prime or Not. //Prime Nos. upto N. //First N Prime Nos.  //Prime Nos. Pattern #include<iostream> #include<iom...

#include<iostream.h> #include<conio.h> #include<iomanip.h> void main() { int n,i,count=0,temp=1,sum=1; clrsc...

SELF PRACTICE OF PATTERNS

#include<iostream> #include<stdlib.h> using namespace std; int main() { int n, i, j, k, a[3][3]={{1,2,3},{4,5,6},{7,8,9}}...

#include<stdio.h> #include<conio.h> #include<dos.h> void main() { clrscr(); int a,b,n,c,d,x=0,y=1,l=1; printf(...

//New Pattern in Turbo C++ must try (For Students of XI & XII - CBSE) #include<iostream.h> #include<conio.h> #include...