myblog

2011-11-10T00:16:00.000-08:00

JAVA PROGRAM FOR HASHING

import java.io.*;

class hashing
{
public static void main(String args[])throws IOException
{
DataInputStream inp = new DataInputStream(System.in);
stack S = new stack();
System.out.print("Enter size of hash table : ");
int size = Integer.parseInt(inp.readLine());
int ht[] = new int[size];
int i,n = 0,val = 0;
for(i=0; i< size; i++)
ht[i] = -1;
do
{
System.out.print("Enter no. of elements wants to store in hash table : ");
n = Integer.parseInt(inp.readLine());
if (n > size)
{
System.out.println("ERROR ! Number of elements should be less than or equal to size of hash table....");
System.out.println("Enter again............");
}
}while(n > size);
System.out.println("Enter elements.............");
for(i=0; i
{
System.out.print("Enter value : ");
val = Integer.parseInt(inp.readLine());
inserthash(ht,val,size);
}
System.out.println("\nH A S H - T A B L E ");
System.out.println("--------------------------");
System.out.println(" Adress Value");
System.out.println("--------------------------");
for( i=0; i
System.out.println(" "+i+"\t\t"+ht[i]);
System.out.println("--------------------------");
System.out.print("Enter elements to be searched : ");
val = Integer.parseInt(inp.readLine());
boolean found = searchhash(ht,val,size);
if (found)
System.out.println(val + " is found.");
else
System.out.println(val + " is not present in hash table.");
}

public static int hash(int val, int sz)
{
return (val % sz);
}

public static void inserthash(int ht[], int val, int sz)
{
int addr = hash(val,sz);
int i = addr;
do
{
if(ht[i] == -1)
{
ht[i] = val;
break;
}
else
if (i == sz-1)
i = 0;
else
i = i+1;
}while(i != addr );
}

public static boolean searchhash(int ht[], int val, int sz)
{
int addr = hash(val,sz);
boolean found = false;
int i = addr;
do
{
if(ht[i] == val)
{
found = true;
break;
}
else
if (i == sz-1)
i = 0;
else
i = i+1;
}while( i != addr );
return found;
}
}

2011-11-10T00:11:00.000-08:00

A PROGRAM TO CREATE SINGLY OR DOUBLY LINKED LIST :

SINGLY LINKED LIST :

import java.io.*;
class snode
{
int info;
snode link;
snode()
{
info = 0;
link = null;
}
snode(int x)
{
info = x;
link = null;
}
}

class SList
{
snode head;
int count;
SList()
{
head = null;
count = 0;
}

snode getnode()throws IOException
{
DataInputStream inp = new DataInputStream(System.in);
System.out.print("Enter the data : ");
int val = Integer.parseInt(inp.readLine());
snode nn = new snode(val);
return nn;
}

void createlist() throws IOException
{
DataInputStream inp = new DataInputStream(System.in);
int ch = 0;;
snode nn;
snode last = null;
do
{
System.out.print("Wants to create the node (Yes - 1/No - 2) : ");
ch = Integer.parseInt(inp.readLine());
if(ch == 1)
{
nn = getnode();
count++;
if(head == null)
head = nn;
else
last.link = nn;
last = nn;
}
}while(ch == 1);
}

void printlist()
{
snode temp;
temp = head;
if(head == null)
System.out.println("List is Empty...");
else
{
System.out.println("\nTotal number of nodes in the List is = "+count);
System.out.println("Singly linked list is.......");
while(temp != null)
{
System.out.print(temp.info+" - > ");
temp = temp.link;
}
System.out.println("null");
}
}

void insertpos()throws IOException
{
DataInputStream inp = new DataInputStream(System.in);
System.out.print("\nEnter the position at node to be inserted : ");
int pos = Integer.parseInt(inp.readLine());
if(pos >0 && pos <= count +1)
{
snode nn = getnode();
count++;
if(pos == 1)
{
nn.link = head;
head = nn;
}
else
{
snode temp = head;
for(int i = 1;i
temp = temp.link;
nn.link = temp.link;
temp.link = nn;
}
}
else
System.out.println("Invalid position is entered.....");
}

void insertval()throws IOException
{
DataInputStream inp = new DataInputStream(System.in);
System.out.print("\nEnter the value of the node after new node to be inserted : ");
int val = Integer.parseInt(inp.readLine());
snode temp;
temp = head;
while(temp != null && temp.info != val)
temp = temp.link;
if(temp == null)
System.out.println(val+" is not present in the list....cannot insert.....");
else
{
snode nn = getnode();
nn.link = temp.link;
temp.link = nn;
count++;
}
}

void deletepos()throws IOException
{
DataInputStream inp = new DataInputStream(System.in);
System.out.print("\nEnter the position from which node to be deleted : ");
int pos = Integer.parseInt(inp.readLine());
snode temp;
if(pos >0 && pos <= count )
{
temp = head;
if(pos == 1)
head = temp.link;
else
{
snode prev = null;
for(int i = 1;i
{
prev = temp;
temp = temp.link;
}
prev.link = temp.link;
}
temp.link = null;
temp = null;
count--;
}
else
System.out.println("Invalid position is entered.....");
}

void sortlist()
{
snode curr,temp;
int x;
curr = head;
while(curr.link != null)
{
temp = curr.link;
while(temp != null)
{
if(curr.info > temp.info)
{
x = curr.info;
curr.info = temp.info;
temp.info = x;
}
temp = temp.link;
}
curr = curr.link;
}
}

void searchlist()throws IOException
{
snode temp = head;
int loc = 0;
DataInputStream inp = new DataInputStream(System.in);
System.out.print("\nEnter the element to be searched : ");
int val = Integer.parseInt(inp.readLine());
while(temp != null && temp.info != val)
{
temp = temp.link;
loc++;
}
if(temp == null)
System.out.println(val+" is not present in the list....");
else
System.out.println(val+ "is found at location "+(loc+1));
}

void deleteval()throws IOException
{
DataInputStream inp = new DataInputStream(System.in);
System.out.print("\nEnter the value to be deleted : ");
int val = Integer.parseInt(inp.readLine());
snode temp,prev = null;
temp = head;
while(temp != null && temp.info != val)
{
prev = temp;
temp = temp.link;
}
if(temp == null)
System.out.println(val+" is not present in the list....cannot delete.....");
else
{
prev.link = temp.link;
temp.link = null;
temp = null;
count--;
}
}

void reverselist()
{
snode next,temp,prev;
if(head != null)
{
temp = head;
do
{
prev = temp;
temp = temp.link;
next = temp.link;
if(prev == head)
prev.link = null;
temp.link = prev;
}while(next != null);
head = temp;
}
}

void deletelist()
{
snode temp;
while (head != null)
{
temp = head;
head = temp.link;
temp.link = null;
temp = null;
count--;
}
}
}

class SList
{
public static void main(String ar[]) throws IOException
{
DataInputStream inp = new DataInputStream(System.in);
int ch = 0;
SList SL = new SList();
SL.createlist();
SL.printlist();
System.out.println("M E N U for operations on Singly Linked List......");
System.out.println("1. Print list\n2. Insert by position\n3. Insert by value");
System.out.println("4. Delete by position\n5. Delete by value\n6. Sort list");
System.out.println("7. Search element\n8. Reverse the list\n9. Delete complete list\n10. Quit");
do
{
System.out.print("Enter your choice of operation : ");
ch = Integer.parseInt(inp.readLine());
switch(ch)
{
case 1 : SL.printlist();
break;
case 2 : SL.insertpos();
SL.printlist();
break;
case 3 : SL.insertval();
SL.printlist();
break;
case 4 : SL.deletepos();
SL.printlist();
break;
case 5 : SL.deleteval();
SL.printlist();
break;
case 6 : SL.sortlist();
System.out.println("Sorted list in ascending order is.........");
SL.printlist();
break;
case 7 : SL.searchlist();
break;
case 8 : SL.reverselist();
System.out.println("Reversed list is.........");
SL.printlist();
break;
case 9 : SL.deletelist();
SL.printlist();
break;
case 10 : break;
default : System.out.print("Error ! Entered invalid choice...... ");
}
}while(ch != 10);
}
}

DOUBLY LINKED LIST :

import java.io.*;
class dnode
{
int info;
dnode llink,rlink;
dnode()
{
info = 0;
llink = rlink = null;
}
dnode(int x)
{
info = x;
llink = rlink = null;
}
}

class dlist
{
dnode head;
int count;
dlist()
{
head = null;
count = 0;
}
dnode getnode()throws IOException
{

DataInputStrexx am inp = new DataInputStream(System.in);
System.out.print("Enter the data : ");
int val = Integer.parseInt(inp.readLine());
dnode nn = new dnode(val);
return nn;
}
void createlist() throws IOException
{
DataInputStream inp = new DataInputStream(System.in);
int ch = 0;;
dnode nn;
dnode last = null;
do
{
System.out.print("Wants to create the node (Yes - 1/No - 2) : ");
ch = Integer.parseInt(inp.readLine());
if(ch == 1)
{
nn = getnode();
count++;
if(head == null)
head = nn;
else
{
last.rlink = nn;
nn.llink = last;
}
last = nn;
}
}while(ch == 1);
}
void printlist()
{
dnode temp;
temp = head;
if(head == null)
System.out.println("List is Empty...");
else
{
System.out.println("Doubly linked list is.......");
System.out.print("null <- ");
while(temp != null)
{
System.out.print(temp.info+" < - > ");
temp = temp.rlink;
}
System.out.println("null");
}
}
void insertpos()throws IOException
{
DataInputStream inp = new DataInputStream(System.in);
System.out.print("Enter the position at node to be inserted : ");
int pos = Integer.parseInt(inp.readLine());
if(pos >0 && pos <= count +1)
{
dnode nn = getnode();
count++;
if(pos == 1)
{
nn.rlink = head;
head.llink = nn;
head = nn;
}
else
{
dnode temp = head;
for(int i = 1;i
temp = temp.rlink;
nn.rlink = temp.rlink;
if ( temp.rlink != null)
temp.rlink.llink = nn;
temp.rlink = nn;
nn.llink = temp;
}
}
else
System.out.println("Invalid position is entered.....");
}

void deletepos()throws IOException
{
DataInputStream inp = new DataInputStream(System.in);
System.out.print("Enter the position from which node to be deleted : ");
int pos = Integer.parseInt(inp.readLine());
dnode temp;
if(pos >0 && pos <= count )
{
temp = head;
if(pos == 1)
head = temp.rlink;
else
{
dnode prev = null;
for(int i = 1;i
{
prev = temp;
temp = temp.rlink;
}
prev.rlink = temp.rlink;
if ( temp.rlink != null)
temp.rlink.llink = prev;
}
temp.rlink = null;
temp.llink = null;
temp = null;
count--;
}
else
System.out.println("Invalid position is entered.....");
}

void sortlist()
{
dnode curr,temp;
int x;
curr = head;
while(curr.rlink != null)
{
temp = curr.rlink;
while(temp != null)
{
if(curr.info > temp.info)
{
x = curr.info;
curr.info = temp.info;
temp.info = x;
}
temp = temp.rlink;
}
curr = curr.rlink;
}
}
void searchlist()throws IOException
{
dnode temp = head;
int loc = 0;
DataInputStream inp = new DataInputStream(System.in);
System.out.print("Enter the element to be searched : ");
int val = Integer.parseInt(inp.readLine());
while(temp != null && temp.info != val)
{
temp = temp.rlink;
loc++;
}
if(temp == null)
System.out.println(val+" is not present in the list....");
else
System.out.println(val+ "is found at location "+(loc+1));
}

void deleteval()throws IOException
{
DataInputStream inp = new DataInputStream(System.in);
System.out.print("Enter the value to be deleted : ");
int val = Integer.parseInt(inp.readLine());
dnode temp,prev = null;
temp = head;
while(temp != null && temp.info != val)
{
prev = temp;
temp = temp.rlink;
}
if(temp == null)
System.out.println(val+" is not present in the list....cannot delete.....");
else
{
prev.rlink = temp.rlink;
if ( temp.rlink != null)
temp.rlink.llink = prev;
temp.rlink = null;
temp.llink = null;
temp = null;
count--;
}
}
}

class dlink
{
public static void main(String ar[]) throws IOException
{
DataInputStream inp = new DataInputStream(System.in);
int ch = 0;
dlist DL = new dlist();
DL.createlist();
DL.printlist();
System.out.println("M E N U for operations on Doubly Linked List......");
System.out.println("1. Print list\n2. Insert by position\n3.Delete by position\n4. Delete by value\n5. Sort list");
System.out.println("6. Search element\n7. Insert by value\n8. Quit");
do
{
System.out.print("Enter your choice of operation : ");
ch = Integer.parseInt(inp.readLine());
switch(ch)
{
case 1 : DL.printlist();
break;
case 2 : DL.insertpos();
break;
case 3 : DL.deletepos();
break;
case 4 : DL.deleteval();
break;
case 5 : DL.sortlist();
break;
case 6 : DL.searchlist();
break;
case 8 : break;
default : System.out.print("Error ! Entered invalid choice...... ");
}
}while(ch != 8);
}
}

2011-11-08T19:03:00.000-08:00

A PROGRAM TO IMPLEMENT VECTORS IN JAVA (ONLY FOR INTEGERS )
one can find basic idea on how vectors are implemented in java

// some expriments for NEW DATA TYPE !! :)

package kunal;
import java.util.*;
class DataNode
{
int data =0;
DataNode link = null;
int arr[];
int pos=0;
}

class ArrayBuffer
{
DataNode head;
DataNode tail;

ArrayBuffer()
{
create();
}

void put (int x)
{
tail.arr[tail.pos] = x;
tail.pos++;
if (tail.pos == 10)
this.expand();
}

int get(int position)
{
DataNode temp=head;
while( temp.data < position/10) temp = temp.link;
return temp.arr[position%10];
}

void del()
{
tail.pos--;
if (tail.pos == -1)
this.contract();
}

int size()
{
return (tail.data*10+tail.pos);
}

int capacity()
{
return ((tail.data +1 ) * 10 );
}

void expand ()
{
DataNode nn = new DataNode ();
nn.link=null;
nn.arr = new int[10];
tail.link = nn;
nn.data = tail.data+1;
tail=tail.link;
}

void create ()
{
DataNode nn = new DataNode ();
nn.data=0;
nn.link=null;
nn.arr = new int[10];
head = nn;
tail = head;
}

void contract ()
{
DataNode temp;
temp = head;
while ( temp.link != tail)
temp = temp.link;
temp.link=null;
tail = temp;
}
}

// IMPLEMENTION

class Datast
{
public static void main(String args[])
{
Scanner br = new Scanner( System.in);
ArrayBuffer now = new ArrayBuffer ();
System.out.println ("How many values do you want to enter:");
int n = br.nextInt();
for (int i=0 ; i< n;i++)
{
System.out.println("\nEntar "+(i+1)+" value");
now.put(br.nextInt());
System.out.println("size: "+now.size()+"Capacity : "+now.capacity());
}
System.out.println ("\n\nentered values : ");
for (int i=0;i
{
System.out.println((i+1)+"->"+now.get(i));
}

}

}

2011-11-08T06:16:00.000-08:00

Special for loop in java !

(..... this works only for array in java)

class Forloop
{
public static void main( String args[])
{
int arr[]={5,10,15,20,25,30,35,40};
int total =0;

for ( int x: arr)
{
total+=x;
}

System.out.println("total:"+total+"\t"+"Modified array :");

}
}

2011-11-08T05:29:00.000-08:00

JAVA PROGRAM TO PRINT TRUTH TABLES

package kunal ;

import java.io.*;
class Truthtable
{
static int n ;
public static void main (String args[])
{
BufferedReader br = new BufferedReader ( new InputStreamReader (System.in));

System.out.println(" Lets draw truth table ");
System.out.println( "choose any one of the following truth table ");
System.out.println("1: inverter"+'\n'+"2: and"+'\n'+"3: OR "+'\n'+"4: NAND"+'\n'+"5 NOR "+'\n'+"6 Ex-OR ");
int opt;
try
{ opt = Integer.parseInt(br.readLine());} catch(Exception e ){opt =0;}
if ( opt == 1)
{
System.out.println(" INVERTER "+ "\t\t\t\t" + " NOT");
System.out.println("\t"+"INPUT"+ "\t\t\t\t" + "OUTPUT");
System.out.println("\t"+"0"+"\t\t\t\t" + "1"+'\n'+"\t1\t\t\t\t0");
}
else
{
System.out.print("Enter no of logical varibles you want in truth table :");

try
{n = Integer.parseInt ( br.readLine());}catch (Exception e ){n = 2; }
if (n<2)
System.out.println (" insufficient operands ");
else
{
for (int i = 1 ; i <= n ; i++ )
{
System.out.print("\t"+"X"+i);
}
System.out.println("\t\t\t"+"Y");
switch (opt)
{
case 2 : logic.logicAnd(n); break;
case 3 : logic.logicOr(n);break;
case 4 : logic.logicNand(n);break;
case 5 : logic.logicNor(n);break;
case 6 : logic.logicExor(n);break;
default : break;
}
}
}
}
}
class logic
{

static void logicOr(int n)
{

int i = (n-1);
int count = 0;
while(i > 0)
{
count += Math.pow(2,i);
i --;
}
int change = 0;
int ans=0;
for ( i = 0 ; i <= (count+1) ; i++)
{
ans = 0;
lstack.create ();
change = i;
int j = n;
int rem;
while ( j > 0 )
{ rem = change%2;
lstack.push(rem);
ans +=rem;
if ( change == 1)
{change = 0;
}
change = change / 2;
j -- ;
}
lstack.printstak();
if(ans ==0)System.out.println("\t\t\t"+ans);
else System.out.println("\t\t\t"+'1');

}
}
static void logicAnd( int n)
{

int i = (n-1);
int count = 0;
while(i > 0)
{
count += Math.pow(2,i);
i --;
}
int change = 0;
int ans;
for ( i = 0 ; i <= (count+1) ; i++)
{
ans = 1;
lstack.create ();
change = i;
int j = n;
int rem;
while ( j > 0 )
{ rem = change%2;
lstack.push(rem);
ans *=rem;
if ( change == 1)
{change = 0;
}
change = change / 2;
j -- ;
}
lstack.printstak();
System.out.println("\t\t\t"+ans);

}

}
static void logicNand(int n)
{

int i = (n-1);
int count = 0;
while(i > 0)
{
count += Math.pow(2,i);
i --;
}
int change = 0;
int ans=1;
for ( i = 0 ; i <= (count+1) ; i++)
{
ans =1;
lstack.create ();
change = i;
int j = n;
int rem;
while ( j > 0 )
{ rem = change%2;
lstack.push(rem);
ans *=rem;
if ( change == 1)
{change = 0;
}
change = change / 2;
j -- ;
}
lstack.printstak();
if(ans ==1)System.out.println("\t\t\t"+'0');
else System.out.println("\t\t\t"+'1');

}
}
static void logicNor(int n)
{

int i = (n-1);
int count = 0;
while(i > 0)
{
count += Math.pow(2,i);
i --;
}
int change = 0;
int ans=0;
for ( i = 0 ; i <= (count+1) ; i++)
{
ans =0;
lstack.create ();
change = i;
int j = n;
int rem;
while ( j > 0 )
{ rem = change%2;
lstack.push(rem);
ans +=rem;
if ( change == 1)
{change = 0;
}
change = change / 2;
j -- ;
}
lstack.printstak();
if(ans ==0)System.out.println("\t\t\t"+'1');
else System.out.println("\t\t\t"+'0');

}
}
static void logicExor(int n)
{

int i = (n-1);
int count = 0;
while(i > 0)
{
count += Math.pow(2,i);
i --;
}
int change ;

for ( i = 0 ; i <= (count+1) ; i++)
{
lstack.create ();
change = i;
int j = n;
int rem;
int tern=0;
int store=0;
while ( j > 0 )
{ rem = change%2;
store += rem;
lstack.push(rem);
if ( change == 1)
{change = 0;
}
change = change / 2;
j -- ;
}
lstack.printstak();
if (store == 0 || store == n) System.out.println("\t\t\t"+'0');
else System.out.println("\t\t\t"+'1');

}
}
}

// program for stack (implement using linked list)
class lstack
{
static int count = 0;
static node topn;
static public void create ()
{
topn = new node ();
topn.no = -1;
count=0;
}
static void push( int num)
{
node nnode = new node ();
nnode.no = num;
nnode.link = topn;
topn = nnode;
count++;
}
static int pop ()
{
node temp = topn;
topn = topn.link;
count --;
return temp.no;
}
static int top ()
{
return topn.no;
}
static void printstak()
{
node temp;
temp = topn;
for ( int i = 0 ; i < count ; i++)
{ System.out.print("\t"+ temp.no);
temp = temp.link;}
}

}

class node
{
int no=0;
node link=null;
}