GSEB - Revision Test - Ch-1 to Ch-5
Give Revision Test - Ch-1 to Ch-5 Click here or on Image to Give Test
Give Revision Test - Ch-1 to Ch-5 Click here or on Image to Give Test
#include<stdio.h> #include<string.h> int main() { char str[20]; int n, i, j, k=1, tmp; printf("Enter any string...
//Enter the Number of words and combine them into sentence. #include<stdio.h> #include<string.h> int main() { int n, i; ...
#Table of N n=int(input('Enter N to print its table:')) for i in range(1,11): print('{} x {} = {}'.format(n,i,n*i))
#include<iostream> using namespace std; struct Node { int data; struct Node *next; struct Node *prev; }; struct Node *head = NUL...
Dec2Oct { public static void main(String args[]) { int decN=2520, octN=0, i=1, j, tmp; tmp=j=decN; while(j>0) { octN=...
class Dec2Bin { public static void main(String args[]) { int decN=137, binN=0, i=1, j, tmp; tmp=j=decN; while(j>0) { ...
class MatrixMultiplication { public static void main(String args[]) { int a[][]={{1,2,3},{4,5,6},{7,8,9}},b[][]={{1,2,1},{2,4,6},{7,2...
import java.util.Scanner; public class PrimePattern { public static boolean isPrime(int n) { int i; for(i=2;i<n;i++) if(n%i...
import java.util.Scanner; public class maxAndMin2nd { public static void main(String args[]) { Scanner sc=new Scanner(System.in); ...
Download the File. Click here to Watch the Explanation & Developing Video