Patterns of Prime Numbers only
import java.util.Scanner; public class PrimePattern { public static boolean isPrime(int n) { int i; for(i=2;i<n;i++) if(n%i...
Java Program to find the 2nd Maximum and 2nd Minimum from an Array.
import java.util.Scanner; public class maxAndMin2nd { public static void main(String args[]) { Scanner sc=new Scanner(System.in); ...
ONLINE TEST OF FULL COURSE (FOR STUDENTS GSEB: XII STD.) - TEXT BOOK EXERCISE CONTENT
ONLINE TEST OF FULL COURSE (FOR STUDENTS GSEB: XII STD.) TEXT BOOK EXERCISE CONTENT Click here to start test.
ONLINE TEST OF CH NO. 4, 5 AND 6 (FOR STUDENTS GSEB: XII STD.)
ONLINE TEST OF CH NO. 4, 5 AND 6 (FOR STUDENTS GSEB: XII STD.) 0 Click here to start test.
First N Prime Numbers
#include<iostream> #include<iomanip> using namespace std; bool isPrime(int n) { if (n==1) return false; else { for(int ...
Prime Numbers Upto N
#include<iostream> #include<iomanip> using namespace std; bool isPrime(int n) { if (n==1) return false; else { for(int ...
Python | Operators
OPERATORS: =========== - Unary - Binary Arithmetic Operators ---------------------- + Addition - Subtraction * Multiplication / Divi...
Binary Search in Python (CBSE | CS | XI & XII)
#Binary Search a=[5,7,11,13,16,19,23,27,30,34,38,40,41,42,45] n=len(a) beg=0 last=n-1 print(a) srch=int(input('Enter the number to searc...
Download all Java Programs (for GSEB XII Std. Students)
Click here to download all the Java Programs
Randomly Generate Unique Sorted Values for 1D Array in C++
//Randomly Generate Sorted Array #include<iostream> #include<iomanip> #include<time.h> #include<stdlib.h> using name...
Binary Search in C++
//Binary Search in 1D Array #include<iostream> #include<iomanip> #include<time.h> #include<stdlib.h> using namespace...
Subscribe to:
Posts
(
Atom
)
