Y U No build Toilet for Babli ?
We’re a country of billions, we’re making a mark in enormous fields, progressing superbly. We’ve earned some respect for us in the world. In spite of all these feats, we’re considered to be a dirty nation. World doesn’t counts us when it comes to listing down clean countries. We are far behind from being called a clean & healthy country.
Why is this about India? Why can’t we feature in that list of clean countries? Are we so dirty? Are we so obsessed with that tagline “Daag acche hain” that we don’t want to clean ourselves or our nation?
Well, the answer lies within us. Facts & demographics about India clearly state that we haven’t been good enough in keeping our country clean.
The below graph showcases the transition state of sanitation in rural India,
One can clearly observe that there has been an increase in the number of toilets from the year 2001 to 2011, but this is very low as compared to the increase in population. This just doesn’t meets the need of the demand as we see a rise of just 5% toilets to satisfy the needs of 50% rise in the population.
Men & kids find a rescue to their sanitation problem by defecating behind the bushes or some dark corners, but what about women? They can’t just copy men in this matter of fact. Women have to walk miles just to pee. And all this is due to lack of toilets, directly increasing the probability of illnesses in women. Continue reading “Y U No build Toilet for Babli ?”
Substitution Cipher (Java)
import java.util.*; class SubCipher { public static void main(String args[]) { Scanner sc=new Scanner(System.in); System.out.println(“Enter the plain text”); String pl=sc.nextLine(); pl=pl.toUpperCase(); System.out.println(pl); System.out.println(“Enter the shift factor”); int n=sc.nextInt(); System.out.println(“Cipher Text:”); char a[]= pl.toCharArray(); for(int i=0;i<a.length;i++) { a[i]=(char)(n+(int)a[i]); } for(int i=0;i<a.length;i++) { System.out.print(a[i]); } System.out.println(); } } Continue reading Substitution Cipher (Java)
Transposition Cipher (Java)
import java.util.*;
class TransCipher
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
System.out.println(“Enter the plain text”);
String pl=sc.nextLine();
String demo=””;
String s=””;
int start=0;
for(int i=0;i<pl.length();i++)
{
if(pl.charAt(i)==’ ‘)
{
s=s+pl.substring(start,i);
start=i+1;
}
} Continue reading “Transposition Cipher (Java)”
Product Cipher (Java)
import java.util.*;
class ProductCipher {
public static void main(String args[]) {
System.out.println(“Enter the input to be encrypted:”);
String substitutionInput = new Scanner(System.in).nextLine();
System.out.println(“Enter a number:”);
int n = new Scanner(System.in).nextInt();
// Substitution encryption
StringBuffer substitutionOutput = new StringBuffer();
for(int i=0 ; i<substitutionInput.length() ; i++) {
char c = substitutionInput.charAt(i);
substitutionOutput.append((char) (c+5));
} Continue reading “Product Cipher (Java)”
Diffie Hellman Key Exchange Algorithm (Java)
import java.util.*; class DiffieHellman { public static void main(String args[]) { Scanner sc = new Scanner(System.in); System.out.println(“Enter the value of Xa & Xb”); int Xa=sc.nextInt(); int Xb=sc.nextInt(); System.out.println(“Enter a Prime no. p”); int p=sc.nextInt(); System.out.println(“Enter Primitive Root a, such that a<p”); int a=sc.nextInt(); int Ya=(int)((Math.pow(a,Xa))%p); int Yb=(int)((Math.pow(a,Xb))%p); int Ka=(int)((Math.pow(Yb,Xa))%p); int Kb=(int)((Math.pow(Ya,Xb))%p); if(Ka==Kb) { System.out.println(“Transmission successful”); } else { System.out.println(“Transmission failed”); } } } Continue reading Diffie Hellman Key Exchange Algorithm (Java)
Darshan Gajara 