Programming on your Tips

What is Java and why is java needed?

2013-04-19T04:48:00.001-07:00

The question what is Java is now almost an absurd one because it has emerged as the top 10 computer discoveries in the year 1995 and ever since. Java is an object oriented programming language that was developed by James Gosling at SUN Microsystems. The writing of this language started in June, 1991 by Mike Sheridan, Patrick Naughton and James Gosling and was released in 1995. Java is designed specially to be platform independent widely called WORA (Write Once Run Anywhere).

History of Java:

The start and release date has never been the issue but the naming for JAVA has always been since the name changed from OAK to JAVA.
SUN couldn’t continue with the name OAK because of the copyright issues as it was a trademark for OAK Technologies.
So a team was called upon for brainstorming and many names did come like DNA, Silk, Java, ruby, WRL.

But nothing was much appropriate than JAVA. However there is not any particular justified reason yet but the two reasonable did come:-

Developers memorable Journey to Local coffee shop.
JAVA often referred to as a short form for James Gosling, Arthur Van Hoff, Andy Bechtolsheim.

Need for Java?

Many of you have following questions in your mind:-

What is java?
Why is java needed?
Any alternative for JAVA?

No one can say that without JAVA networking and application development wasn't there. It worked fine without java too. Still there are 4% websites that need Java to run server side applications and .2% websites for client side applications. That doesn't implies that the rest 95.8% websites are obsolete.
JAVA is needed because it is reliable, easy, fast and secure. From mobiles through laptops and Tabs to gaming devices everywhere is Java. Many applications on the browsers need java and moreover now every browser has Java Plugin installed or rather integrated in their browser.
Almost every secured site https: needs Java to be installed for transactions to accept the commands like submit etc which also works on javascript.

Incoming terms: why do we need Java, What exactly is java, No need for JAVA.

Character array c / chracter array java

2013-04-16T12:58:00.000-07:00

Character array in c and character array in java can be implemented in two ways:

1. Character array using pointers:

char *arr="hello";

char *arr;

arr="hello"

printf("%c", arr);

printf("\n%c",arr+3);

OUTPUT:
h
l

You can also use it for string array:-

printf("%s",arr);

printf("%s",arr+1);

printf("%s",arr+2);

OUTPUT:
hello
ello
llo

2. Character array using Default Datatypes:-

Character array in Java:-

We have a String datatype so no problem at all. You can just implement the array using string datatype in array.

String a[]={"character","array","in","java"};
for(i=0;i<5;i++)
{ System.out.println(a[i]);
}

OUTPUT:

character
array
in
java

Character array in C:-

It is almost similar to that in Java but there we have to use char datatype.

char a[4][10]={"character","array","in","c"};
for(i=0;i<4;i++)
{
printf("%s",a[i]);
}

OUTPUT:
character
array
in
c

Tags: Character array in c, Character array in java.

How to Null a string or empty a string array

2013-03-24T03:33:00.005-07:00

Null a String/ Empty a string array

Null a string in C using pointer string or array string. Many times the string is nullified assigning arr[0]='\0' but this will not nullify the array as only the first index will be NULL.

1. Null a string using pointer string.

char *ptr="hello";
printf("%s" , ptr);
*ptr='\0';
printf("\n %s and %s ",ptr,ptr+1);

TO show that array/pointer is not actually empty or null the first array null but the rest of array characters are still on the same address.

ptr="";
printf("%s and %s", ptr,ptr+1);

OUTPUT:

hello
and ello

2. Null a string using array string

Null a string using an array is not efficient as though the first index is nullified but the rest of the characters still have the same address.

char arr[30]="hello";
arr[0]='\0';
printf("null string=%s and %c",arr,arr[2]);

OUTPUT:

null string= and l

C Program to count prime numbers in given range

2013-03-14T10:11:00.001-07:00

This is the program to count total number of Prime numbers with in 1 to specified range

#include<math.h>
long countprime(long a,long k)
{
long i;
for(i=a;i>=2;i--)
{

if(k%i==0)
return 0;
}
return 1;
}
void main()
{
long i,range;
long count=1;
double x;
printf("Enter the range: ");
scanf("%ld\n",&range);
for(i=3;i<range;i++)
{
x=sqrt(i);
count+=countprime(floor(x),i);
}
printf("\n Total number of prime numbers are %ld",count);
getch();
}

Output

These are the some sample output which you can check using this programs.

1	10	4
2	100	25
3	1,000	168
4	10,000	1,229
5	100,000	9,592
6	1,000,000	78,498
7	10,000,000	664,579
8	100,000,000	5,761,455
9	1,000,000,000	50,847,534

tags: Prime Numbers, Program to find total number of prime numbers

C Program for Bit Stuffing

2013-03-08T09:18:00.001-08:00

Bit Stuffing: In bit stuffing following rules hold:-

To the given bits add the string 01111110 to both the starting and the end of the string
To add 0 to each set of 5 one's i.e. after every five consecutive 1's appear a zero

#include
#include
void main()
{
int i=0,count=0;
char a[100],p[8]="01111110";
clrscr();
printf("enter the bits : ");
scanf("%s",a);

printf("After bit stuffing \n");
printf("%s",p);
for(i=0;a[i]!='\0';((a[i]==1)? count++ : count==0))
{
printf("%c",a[i]);
if(count==5)
{
printf("0");
count=0;
}
}
printf("%s",p);
getch();
}

Tags: Write a C program for bit stuffing, bit-stuffing

C Program to implement CRC (Cyclic Redundancy Code)

2013-03-05T12:43:00.000-08:00

This is a C Program for implementing CRC (Cyclic Redundancy Check Code)

#include<stdio.h>
#include<conio.h>
#include<string.h>
void main()
{

int i,j,keylen,msglen;
char input[100], key[30],temp[30],quot[100],rem[30],key1[30];
clrscr();
printf("Enter Data: ");
gets(input);
printf("Enter Key: ");
gets(key);
keylen=strlen(key);
msglen=strlen(input);
strcpy(key1,key);
for(i=0;i<keylen-1;i++)
{
input[msglen+i]='0';
}
for(i=0;i<keylen;i++)
temp[i]=input[i];
for(i=0;i<msglen;i++)
{
quot[i]=temp[0];
if(quot[i]=='0')
for(j=0;j<keylen;j++)
key[j]='0';
else
for(j=0;j<keylen;j++)
key[j]=key1[j];
for(j=keylen-1;j>0;j--)
{
if(temp[j]==key[j])
rem[j-1]='0';
else
rem[j-1]='1';
}
rem[keylen-1]=input[i+keylen];
strcpy(temp,rem);
}
strcpy(rem,temp);
printf("\nQuotient is ");
for(i=0;i<msglen;i++)
printf("%c",quot[i]);
printf("\nRemainder is ");
for(i=0;i<keylen-1;i++)
printf("%c",rem[i]);
printf("\nFinal data is: ");
for(i=0;i<msglen;i++)
printf("%c",input[i]);
for(i=0;i<keylen-1;i++)
printf("%c",rem[i]);
getch();
}

Output:

tags: Error Checking and Correction, CRC program, C program of CRC,Cyclic Redundancy Check Code, protocols

C Program for Add two Numbers without using Operator

2013-03-05T11:39:00.002-08:00

This is the simple c program which takes two numbers as input and give addition of those number as output. this program doesn't use any operator for that purpose.

Program 1:

#include"stdio.h"
#include"conio.h"

void main()
{
int a,b,sum;
char *p;
clrscr();
printf("Enter 2 values : ");
scanf("%d%d",&a,&b);
p = (char *)a;
sum = (int)&p[b];
printf("\nSum : %d",sum);
getch();
}

Program 2:

#include"stdio.h"
#include"conio.h"

void main()
{
int a,b,sum;
char *p;
clrscr();
printf("Enter 2 values : ");
scanf("%d%d",&a,&b);
printf("\nResult is: %d",printf("%*c%*c",a,' ',b,' '));
getch();
}

Output:

tags: C program for addition of two numbers without using operators, addition on number, C program,without Operator addition, Operator less addition

C Program for Implementation of Regular Expession

2013-03-02T21:43:00.000-08:00

C Program for implementing DFA of Regular Expression

(a+aa*b)*

In this program you have to enter a string and output will be shown as whether string will be accepted or not. Program is implemented using transition table not jumping on different states. It can be easily modifiable for other regular expressions.

#include<stdio.h>
#include<conio.h>
#include<string.h>

void main()
{
int table[2][2],i,j,l,status=0,success;
char input[100];
printf("Program for implmenting DFA of language (a+aa*b)*\n\n\nEnter Input String \n");
table[0][0]=1;
table[0][1]=-1;
table[1][0]=1;
table[1][1]=0;
scanf("%s",input);
l=strlen(input);

for(i=0;i<l;i++)
{
if(input[i]!='a'&&input[i]!='b')
{
printf("Value entered is wrong");
getch();
exit(0);
}
if(input[i]=='a')
status=table[status][0];
else
status=table[status][1];

if(status==-1)
{
printf("String not Accepted by this Language");
break;
}
}
if(i==l)
printf("String Accepted");
getch();
}

OUTPUT:

If you find any difficulty in this program than please comment you problem here. We will happily solve you problem.

tags: Compiler Design, DFA implementation, Regular expression implementation, C program for DFA

C Program for Recursive Descent Parser

2013-03-02T21:30:00.000-08:00

C Program for implementation of Recursive Descent Parser for language given below

E-> TE'
E'-> +TE' | -TE' | null
T-> FT'
T'-> *FT'| /FT' | null
F-> id/ (E)/ num

Here 'id' can be a single letter. And 'num' can be a single digit number.

#include<stdio.h>
#include<string.h>
char input[100];
char prod[100][100];
int pos=-1,l,st=-1;
char id,num;
void E();
void T();
void F();
void advance();
void Td();
void Ed();
void advance()
{
pos++;
if(pos<l)
{
if(input[pos]>='0'&& input[pos]<='9')
{
num=input[pos];
id='\0';
}
if((input[pos]>='a' || input[pos]>='A')&&(input[pos]<='z' || input[pos]<='Z'))
{id=input[pos];
num='\0';
}
}
}
void E()
{
strcpy(prod[++st],"E->TE'");
T();
Ed();
}
void Ed()
{
int p=1;
if(input[pos]=='+')
{
p=0;
strcpy(prod[++st],"E'->+TE'");
advance();
T();
Ed();
}
if(input[pos]=='-')
{ p=0;
strcpy(prod[++st],"E'->-TE'");
advance();
T();
Ed();
}
if(p==1)
{
strcpy(prod[++st],"E'->null");
}
}

void T()
{
strcpy(prod[++st],"T->FT'");
F();
Td();
}
void Td()
{
int p=1;
if(input[pos]=='*')
{
p=0;
strcpy(prod[++st],"T'->*FT'");
advance();
F();
Td();
}
if(input[pos]=='/')
{ p=0;
strcpy(prod[++st],"T'->/FT'");
advance();
F();
Td();
}
if(p==1)
strcpy(prod[++st],"T'->null");
}
void F()
{
if(input[pos]==id) {
strcpy(prod[++st],"F->id");
advance(); }
if(input[pos]=='(')
{
strcpy(prod[++st],"F->(E)");
advance();
E();
if(input[pos]==')') {
//strcpy(prod[++st],"F->(E)");
advance(); }
}
if(input[pos]==num)
{
strcpy(prod[++st],"F->num");
advance();
}
}
int main()
{
int i;
printf("Enter Input String ");
scanf("%s",input);
l=strlen(input);
input[l]='$';
advance();
E();
if(pos==l)
{
printf("String Accepted\n");
for(i=0;i<=st;i++)
{
printf("%s\n",prod[i]);
}
}
else
{
printf("String rejected\n");
}
getch();
return 0;
}

OUTPUT:

If you like this then please share this page. You can comment you queries here. Or you can also ask for a program. We are happy to help you.

tags: C program for Recursive Decsent parser, compiler design programs, parsing techniques

program in Java/ Bluej to display the present date and the date after N days

2013-02-27T10:35:00.000-08:00

Q. Write a program to input the number of days, year and integer N and display the present date and date after N Days.

class iscdate2
{
void calc(int yr,int cd,int n1)
{
String m[]={"jan","feb","march","april","may","june","july","august","september","october","november", "december"};
{
int a[]={31,29,31,30,31,30,31,31,30,31,30,31};
int b[]={31,28,31,30,31,30,31,31,30,31,30,31};
int t=0,d,c,i;
c=(n1/30+1);
for(i=0;i<c;i++)
{
if(yr%4==0)
t+=a[i];
else
t+=b[i];
if(t>n1)
{
if(n1>30)
d=n1-t+a[i];
else
d=n1;
if(cd==1)
System.out.println("present date:"+d+m[i]+yr);
else
System.out.println("date after"+cd+"day is:"+d+m[i]+yr);
break;
}
}}}
public static void main(int y,int n,int N)
{
iscdate2 ob=new iscdate2();
ob.calc(y,1,n);
if(n+N>366)
{
int z=n+N-366;
ob.calc(y+1,N,2);
}
else
ob.calc(y,N,n+N);
}}

How is windows8 different from windows7

2012-11-18T18:52:00.001-08:00

Windows 8 in growing its demand however Microsoft is putting it hard to establish the market since their expectations were much more. Here we will mention the differences between windows 8 and windows 7, list the extra features of windows 8, and tell why Windows 8 is superior to windows 7.

1. Windows 8 is best suited for touchscreen devices. It gives the look of a tablet etc and the representation of icons is in the form of Apps. In-fact windows 8 is basically brought for users to build their own applications and suit their purpose.

Windows 8= Windows 7 + Windows RT(Runtime)

This is where the main concept of windows 8 is- it includes the windows RT(Windows runtime) which takes less power to run Apps thus decreasing the battery power consumption. Critics say that windows 7 is much more user friendly however soon windows 8 will adjust in the market and grab the seat.

2. Their is no start button instead a whole start screen where your applications icons are placed and moreover you can switch to the windows 7 look by clicking the desktop.

3. There is no X(close) button - rather you have to grab the windows downward and close it.

4. The best of all feature is its copy , move etc all merged into one with pause and resume option included. So those who are using Tera Copy or such software need to do so. Their features are included in Windows 8.

5. Those who are using Daemon tools or similar softwares - stop using it. Windows 8 has inbuilt feature of mount and unmount a disk or drive of an image (ISO file).

6. You can create you Bootable flash drive also without using a third party software.

7. Easier windows restore option and handling.

8. Improved task manager.

Tags: Windows 8 superior to windows 7, differences between windows 8 and windows 7, how is windows 8 different to windows 7.

Java program for producing prime numbers for given range

2012-11-15T23:27:00.001-08:00

Program to print all prime numbers between 100 to 10000 or whatever given range.

class prime
{
public static void main()
{
int i,j,k;
for(i=101;i<10000li++)
{
k=0;
for(j=2;j<i;j++)
{
if(i%j==0)
k++;
}
if(k==0)
System.out.print(i+" ");
}
}
}

OUTPUT:

Tags: bluej program to find the prime numbers between 100 to 1000, prime numbers for a given range.

Program to find difference between two dates java

2012-11-15T08:54:00.001-08:00

Java program to find out the number of days elapsed between two dates.
Java program to find out the difference between two dates given as DD-MM-YY.

import java.io.*;
class datedif
{
public static void main(String args[])throws IOException
{
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
System.out.println("enter the first date:");
System.out.print("enter the days=");
int d1=Integer.parseInt(br.readLine());
System.out.print("enter the month=");
int m1=Integer.parseInt(br.readLine());
System.out.print("enter the year=");
int y1=Integer.parseInt(br.readLine());
System.out.println("enter the second date coming after the first date:");
System.out.print("enter the days=");
int d2=Integer.parseInt(br.readLine());
System.out.print("enter the month=");
int m2=Integer.parseInt(br.readLine());
System.out.print("enter the year=");
int y2=Integer.parseInt(br.readLine());
int c,i,j,t=0;
int a[]={31,29,31,30,31,30,31,31,30,31,30,31};
int b[]={31,28,31,30,31,30,31,31,30,31,30,31};
c=y2-y1;

for(i=0;i<c;i++)
{
for(j=m2-1;j>=0;j--)
{
if(y2%4==0)
t+=a[j];
else
t+=b[j];
}
m2=12;
}
for(i=m2-1;i>=m1;i--)
{
if(y1%4==0)
t+=a[i];
else
t+=b[i];
}
t+=(d2-d1);
System.out.println("number of days elapsed between two dates="+t);
}
}

OUTPUT:

Tags: program to find out the difference between two dates in java / bluej / c.

Java program for string in circular fashion.

2012-11-15T07:54:00.002-08:00

Write a program to input any string and output it in the following format:

hello

elloh

llohe

lohel

ohell

class circularstring

{

public static void main(String args[])

{

String str=args[0],p,s="";

int i,j;

for(i=0;i<str.length();i++)
{

p=str.substring(i,l);

s=str.substring(0,i);

System.out.println(p+s);

}

OUTPUT:

hello

elloh

llohe

lohel

ohell

Tags: java program for circular string, bluej program for circulating the string in each line, program for string in round robin fashion.

C Program for Binary Search Tree (BST)

2012-11-07T08:48:00.003-08:00

This is a c program for Binary search tree. In a BST smaller element is the left child and larger element is the right child.

DOWNLOAD THE .C FILE OF BST USING THIS LINK:-

C program for binary search tree(bst)

OUTPUT:

Tags: c program for bst, c program for binary search tree.

C Program for Priority Heap

2012-11-07T06:13:00.001-08:00

void maxheapify(int [],int,int);

void buildmaxheap(int arr[],int n)

{

int i;

for(i=n/2;i>=1;i--)

maxheapify(arr,i,n);

}

void maxheapify(int arr[],int i,int n)

{

int l,r,largest,temp;

l=2*i;

r=(2*i)+1;

if(l<=n&&arr[l]>arr[i])

largest=l;

else

largest=i;

if(r<=n&&arr[r]>arr[largest])

largest=r;

if(largest!=i)

{

temp=arr[i];

arr[i]=arr[largest];

arr[largest]=temp;

maxheapify(arr,largest,n);

}

int heapmaximum(int arr[])

{

return arr[1];

}

int heapextractmax(int arr[], int n)

{

int max;

if(n<1)

{

printf("\nHeap Underflow");

return -1;

}

else

{

max=arr[1];

arr[1]=arr[n];

n=n-1;

maxheapify(arr,1,n);

return max;

}}

void heapincreasekey(int arr[],int i,int key)

{int temp;

if (key<=arr[i])

{

printf("\nThevalue of key is Less Than Or Equal To Existing Key");

}

else

{

arr[i]=key;

while(i>1&&arr[i/2]<arr[i])

{

temp=arr[i];

arr[i]=arr[i/2];

arr[i/2]=temp;

i=i/2;

}

void maxheapinsert(int arr[],int key,int n)

{

arr[n]=-100;

heapincreasekey(arr,n,key);

}

void main()

{

int i,n,arr[50],cho,max,key;

clrscr();

printf("\nEnterThe Size Of Array");

scanf("%d",&n);

for(i=1;i<=n;i++)

{

printf("\nEnter The Element %d\n",i);

scanf("%d",&arr[i]);

}

buildmaxheap(arr,n);

printf("\nEnter Your Choice");

printf("\n1. Heap Maximum");

printf("\n2. Heap Extract Max");

printf("\n3. Heap Increase Key");

printf("\n4. Max Heap Insert\n");

scanf("%d",&cho);

switch(cho)

{

case 1:max=heapmaximum(arr);

printf("\nMaximum Element= %d",max);

break;

case 2:max=heapextractmax(arr,n);

n=n-1;

printf("\n Maximum Element Extracted Is= %d",max);

printf("\nAfter Extracting Array Is");

for(i=1;i<=n;i++)

printf("\n%d",arr[i]);

break;

case 3:printf("\nEnterThe Value Of Key ");

scanf("\n%d",&key);

printf("\nEnter The Value Of Index ");

scanf("%d",&i);

heapincreasekey(arr,i,key);

printf("\nAfter Increasing Key Array Is");

for(i=1;i<=n;i++)

printf("\n%d",arr[i]);

break;

case 4:printf("\Enter The Value Of Key ");

scanf("%d",&key);

n=n+1;

maxheapinsert(arr,key,n);

printf("\nAfter Inserting Array Is");

for(i=1;i<=n;i++)

printf("\n%d",arr[i]);

break;

}

getch();

}

OUTPUT:

Tags: c program for priority heap, priority heap sort program in c, program for priority heap in c

C program for Kruskal Algorithm

2012-11-06T10:42:00.001-08:00

Kruskals Algorithm is used to find minimum spanning tree in a connected weighted graph. Kruskal algorithm is a greedy algorithm that finds the minimum cost to traverse every node of a tree. Here is a c program for kruskals algorithm that will tell you the edges selected and the minimum cost too.

#include<stdio.h>

#define INF 1000

char vertex[10];

int wght[10][10];

int span_wght[10][10];

int source;

struct Sort

{

int v1,v2;

int weight;

}que[20];

int n,ed,f,r;

int cycle(int s,int d)

{

int j,k;

if(source==d)

return 1;

for(j=0;j<n;j++)

if(span_wght[d][j]!=INF && s!=j)

{

if(cycle(d,j))

return 1;

}

return 0;

}

void build_tree()

{

int i,j,w,k,count=0;

for(count=0;count<n;f++)

{

i=que[f].v1;

j=que[f].v2;

w=que[f].weight;

span_wght[i][j]=span_wght[j][i]=w;

source=i;

k=cycle(i,j);

if(k)

span_wght[i][j]=span_wght[j][i]=INF;

else

count++;

}

void swap(int *i,int *j)

{

int t;

t=*i;

*i=*j;

*j=t;

}

void main()

{

int i,j,k=0,temp;

int sum=0;

clrscr();

printf("\tKRUSKAL'S ALGORITHM TO FIND SPANNING TREE\n");

printf("\n\tEnter the No. of Nodes : ");

scanf("%d",&n);

for(i=0;i<n;i++)

{

vertex[i]=i+1;

for(j=0;j<n;j++)

{

wght[i][j]=INF;

span_wght[i][j]=INF;

}

printf("Getting Weight\n");

for(i=0;i<n;i++)

for(j=i+1;j<n;j++)

{

printf("Enter 0 if path Doesn't exist between %d to %d : ",vertex[i],vertex[j]);

scanf("%d",&ed);

if(ed>=1)

{

wght[i][j]=wght[j][i]=ed;

que[r].v1=i;

que[r].v2=j;

que[r].weight=wght[i][j];

if(r)

{

for(k=0;k<r;k++)

if(que[k].weight>que[r].weight)

{

swap(&que[k].weight,&que[r].weight);

swap(&que[k].v1,&que[r].v1);

swap(&que[k].v2,&que[r].v2);

}

r++;

}

//clrscr();

printf("\n\tORIGINAL GRAPH WEIGHT MATRIX\n\n");

printf("\n\tweight matrix\n\n\t");

for(i=0;i<n;i++,printf("\n\t"))

for(j=0;j<n;j++,printf("\t"))

printf("%d",wght[i][j]);

build_tree();

printf("\n\n\t\tMINIMUM SPANNING TREE\n\n");

printf("\n\t\tLIST OF EDGES\n\n");

for(i=0;i<n;i++)

for(j=i+1;j<n;j++)

if(span_wght[i][j]!=INF)

{

printf("\n\t\t%d ------ %d = %d ",vertex[i],vertex[j],span_wght[i][j]);

sum+=span_wght[i][j];

}

printf("\n\n\t\tTotal Weight : %d ",sum);

getch();

}

OUTPUT

Tags: Program to implement Kruskal Algorithm, MST using Kruskal Algorithm, C program for Kruskal Algorithm

Program for Heap sort in C Language

2012-11-06T08:01:00.002-08:00

void maxheap(int [],int,int);
void buildmaxheap(int a[],int n)
{
int i;
for(i=n/2;i>=1;i--)
{
maxheap(a,i,n);
}
}
void maxheap(int a[],int i,int n)
{
int R,L,largest,t;
L=2*i;

R=2*i+1;
if((L<=n) && (a[L]>a[i]))
largest=L;
else
largest=i;
if((R<=n) && (a[i]>a[largest]))
largest=R;
if(largest!=i)
{
t=a[i];
a[i]=a[largest];
a[largest]=t;
maxheap(a,largest,n);
}
}
void heapsort(int a[],int n)
{
int i,temp;
buildmaxheap(a,n);
for(i=n;i>=2;i--)
{
temp=a[1];
a[1]=a[i];
a[i]=temp;
maxheap(a,1,i-1);
}
}
void main()
{
int a[50],i,n;
clrscr();
printf("Enter the size of array : ");
scanf("%d",&n);
printf("Enter the elements of array \n");
for(i=1;i<=n;i++)
{
scanf("%d",&a[i]);
}
heapsort(a,n);
printf("sorted array is \n");
for(i=1;i<=n;i++)
{
printf("%d\t",a[i]);
}
getch();
}

C program for Prim's Algorithm

2012-11-06T07:59:00.004-08:00

#define IN 99
int dist[10],path[10];
int extract_min(int Q[], int n)
{
int i,temp[10],t=0,pos;
for(i=0;i<n;i++)
{
if(Q[i]!=-1)
temp[i]=1;
else
temp[i]=0;
}

for(i=0;i<n;i++)
{
if(t==0 && temp[i]==1)
{pos =i;
t=1;
continue;
}
if(temp[i]==1)
if(dist[i]<dist[pos])
pos=i;
}
return pos;
}
int contain(int Q[],int v,int n)
{
int i;
for(i=0;i<n;i++)
if(Q[i]==v+1)
return 1;
return 0;
}
int isempty(int Q[], int n)
{
int i;
for(i=0;i<n;i++)
{
if(Q[i]!=-1)
return 0;
}
return 1;
}
void initialize(int n,int s)
{
int i;
for(i=0;i<n;i++)
{
dist[i]=IN;
path[i]=-1;
}
dist[s]=0;
}

//Module which implement prim algorithm

void prim(int edge[10][10],int n,int s)
{
int Q[10],i,u,v,alt;

//Initialization step

initialize(n,s);
for(i=0;i<n;i++)
Q[i]=i+1;
while(isempty(Q,n)==0)
{
u=extract_min(Q,n);
Q[u]=-1;
if(dist[u]==IN)
break;
for(i=0;i<n;i++)
{
if(edge[u][i]!=0 && edge[u][i]!=IN)
{
v=i;
if(edge[u][i]<dist[v] && contain(Q,v,n)==1)
{
dist[v]=edge[u][i];
path[v]=u+1;
}
}
}
}
}

void main()
{
int n,edge[10][10],i,j,s,t,wt=0;
clrscr();
printf("Enter total number of vertices");
scanf("%d",&n);

//printf("\nEnter Edge matrix in row major order");

printf(": Enter 99 for Infinity\n");
for(i=0;i<n;i++)
{
for(j=i+1;j<n;j++)
{
printf("Enter the edge between %d and %d: ",i+1,j+1);
scanf("%d",&edge[i][j]);
edge[j][i]=edge[i][j];
}
edge[i][i]=0;
}
printf("\n");
printf("Enter the source for MST: ");
scanf("%d",&s);
prim(edge,n,s-1);
printf("\nPATH OF MINIMUM SPANNING TREE is\n");
for(i=0;i<n;i++)
{
if(s-1==i)
continue;
if(dist[i]==IN)
{
printf("PATH from %d to %d not exist\n",i+1,s);
}
else
{
printf("PATH from %d to %d is %d:",i+1,s,i+1);
t=i;
for(j=1;j<n;j++)
{
printf("<--%d",path[t]);
if(path[t]==s)
break;
t=path[t]-1;
}
printf("\n");
}
wt+=dist[i];
}
printf("\nMinimum Weight of a Graph is %d",wt);
getch();
}

OUTPUT

Tags: Prim's algorithm implementation, C program for Prim's algorithm, Minimum Spanning Tree , algorithm to find Minimum Spanning Tree

Program for Merge Sort in C

2012-11-06T07:15:00.001-08:00

#include<stdio.h>
#include<conio.h>
void mergesort(int [],int,int);
void merge(int [],int,int,int);
void main()
{
int ar[30],p,n,r,i;
clrscr();
printf("\n enter the size of array \n");
scanf("%d",&n);
printf("\n enter the values of array \n");
for(i=1;i<=n;i++)
{

scanf("%d",&ar[i]);
}
p=1;
r=n;
mergesort(ar,p,r);
printf("AFTER SORTING \n");
for(i=1;i<=r;i++)
{
printf("%d \n",ar[i]);
}
getch();
}
void mergesort(int ar[],int p,int r)
{
int q;
if(p<r)
{
q=(p+r)/2;
mergesort(ar,p,q);
mergesort(ar,q+1,r);
merge(ar,p,q,r);
}
}
void merge(int ar[30],int p,int q,int r)
{
int i,j,k,n1,n2;
int lar[30],rar[30];
n1=q-p+1;
n2=r-q;
for(i=1;i<=n1;i++)

lar[i]=ar[p+i-1];
for(j=1;j<=n2;j++)
rar[j]=ar[q+j];
lar[n1+1]=32000;
rar[n2+1]=32000;
i=1;
j=1;
for(k=p;k<=r;k++)
{
if(lar[i]<=rar[j])
{
ar[k]=lar[i];
i++;
}
else
{
ar[k]=rar[j];
j++;
}
}
}

Draw a Line using Equation y=mx+c in C

2012-11-05T09:29:00.001-08:00

#include<math.h>

#include<graphics.h>

void draw_line(float,float,float,float);

int round(float);

main()

{ int driver,mode;

float x1,y1,x2,y2;

clrscr();

printf("Enter the two end-points of the line:");

printf("nx1 =");

scanf("%f",&x1);

printf("y1 =");

scanf("%f",&y1);

printf("x2 =");

scanf("%f",&x2);

printf("y2 =");

scanf("%f",&y2);

clrscr();driver = DETECT;

initgraph(&driver,&mode,"c:\\tc\\bgi");

draw_line(x1,y1,x2,y2);

getch();

closegraph();}

void draw_line(float x1,float y1,float x2,float y2)

{ float m,c;

float x,y;

m = (y2 - y1)/(x2 - x1);

c = y1 - m * x1;

for(x = x1; x<x2; x++)

{ y = m * x + c;

y = round(y);

putpixel(x,(int)y,EGA_WHITE);

}}

int round(float x)

{

float temp;

int val = (x + 0.5);

return val;

}

OUTPUT:

Tags:Line Drawing algorithm, Draw line using its eqation, C Program for line drawing, Line drawing using y=mx+c

Draw Concentric Circle in C

2012-11-05T09:26:00.001-08:00

#include<math.h>

#include<graphics.h>

void main()

{

int rc, rb, xc, yc, i;

float x,y;

int gd=DETECT, gm;

initgraph(&gd,&gm,"c:\\tc\\bgi");

printf("enter the radius of the outer circle \n");

scanf("%d",&rc);

printf("enter the radius of the inner circle \n");

scanf("%d", &rb);

printf("enter the center of the circle");

scanf("%d",&xc);

scanf("%d",&yc);

for(i=1;i<=360;i++)

{

x=xc+(rb*(cos(i)));

y=yc+(rb*(sin(i)));

putpixel(x,y,7);

}

for(i=1;i<=360;i++)

{

x=xc+(rc*(cos(i)));

y=yc+(rc*(sin(i)));

putpixel(x,y,7);

}

getch();

closegraph();

}

OUTPUT

Tags: Cicrle drawing, concentric circles, how to draw concentric circle in C, program in C to draw Concentric Circle

C Program for Drawing a Scenery using Graphics

2012-11-05T09:21:00.002-08:00

#include<graphics.h>
#include<math.h>
void tree(int t,int q)
{
int r=15;

r=15;
setfillstyle(6,BROWN);
rectangle(150+t,390+q,170+t,340+q);
floodfill(151+t,342+q,2);
setfillstyle(11,GREEN);
fillellipse(142+t,347+q,r,r);
fillellipse(160+t,330+q,r,r);
fillellipse(175+t,340+q,r,r);
fillellipse(180+t,350+q,r,r);
}
void main()
{
int gd=DETECT,gm;
int i,j,k,t,q,r;
float x,y;
initgraph(&gd,&gm,"c:\\tc\\bgi");
setcolor(2);
rectangle(0,0,getmaxx(),getmaxy());
for(i=0;i<getmaxx();i+=120)
{
line(i,250,i+60,170);
line(i+60,170,i+120,250);
}

t=10;
line(0,400,getmaxx(),350);
B:line(50+t,280,50+t,320);
line(50+t,320,60+t,320);
line(60+t,320,70+t,320);
line(70+t,320,80+t,320);
line(130+t,320,80+t,320);
line(70+t,320,70+t,300);
line(60+t,300,60+t,320);
line(70+t,300,60+t,300);
line(80+t,320,80+t,280);
line(130+t,320,130+t,280);
line(80+t,280,130+t,280);
line(50+t,280,80+t,280);
line(50+t,280,65+t,260);
line(65+t,260,80+t,280);
line(65+t,260,110+t,260);
line(130+t,280,110+t,260);
setfillstyle(SOLID_FILL,DARKGRAY);
floodfill(51+t,282,2);
setfillstyle(SOLID_FILL,RED);
floodfill(61+t,302,2);
setfillstyle(SOLID_FILL,YELLOW);
floodfill(81+t,282,2);
setfillstyle(SOLID_FILL,MAGENTA);
floodfill(66+t,270,2);
setfillstyle(4,BROWN);
floodfill(100+t,270,2);
if(t==10)
{
t=320;
goto B;
}

tree(0,-10);
tree(100,-20);
tree(30,-100);
tree(350,-60);
tree(160,-50);
//circle();

setfillstyle(SOLID_FILL,12);
fillellipse(150,80,35,35);

setfillstyle(2,LIGHTBLUE);
floodfill(10,10,2);

setfillstyle(SOLID_FILL,CYAN);
floodfill(1,getmaxy()-1,2);

setfillstyle(SOLID_FILL,LIGHTGREEN);
floodfill(49,270,2);

//x=150;
//y=80;
for(i=36;i<80;i++)
for(j=0;j<=360;j+=10)
{
x=150+i*cos(((float)j*3.14)/180);
y=80+i*sin(((float)j*3.14)/180);
putpixel(x,y,LIGHTRED);
}

getch();
}

OUTPUT:

Tags: Computer Graphics, Scenery Drawing using C, Graphics program, Pattern Filling using C, Boundary Fill, Scenery drawing program

C Program for Sunrise Animation using Graphics

2012-11-05T09:18:00.001-08:00

#include<graphics.h>
#include<math.h>
void main()
{
int gd=DETECT,gm;
int i,j,k,t,q;
float x,y;
initgraph(&gd,&gm,"c:\\tc\\bgi");

setcolor(2);

rectangle(0,0,getmaxx(),getmaxy());
setcolor(2);
i=0;
for(t=0;t<getmaxx();t+=120)
{
line(t,250,t+60,170);
line(t+60,170,t+120,250);
}
line(0,400,getmaxx(),350);
setfillstyle(11,CYAN);
floodfill(2,420,2);
setfillstyle(4,LIGHTGREEN);
floodfill(1,300,2);

i=0;
while(i!=150)
{

setcolor(BLACK);
setfillstyle(SOLID_FILL,BLACK);
fillellipse(k,j,30,30);
setfillstyle(SOLID_FILL,LIGHTRED);
fillellipse(170+i,235-i,30,30);
j=235-i;
k=170+i;
i++;
setcolor(2);
for(t=0;t<getmaxx();t+=120)
{
line(t,250,t+60,170);
line(t+60,170,t+120,250);
}
setfillstyle(1,GREEN);
floodfill(202,200,GREEN);
delay(25);
}

for(i=36;i<80;i++)
for(j=0;j<=360;j+=20)
{
x=319+i*cos(((float)j*3.14)/180);
y=86+i*sin(((float)j*3.14)/180);
putpixel(x,y,LIGHTRED);
delay(1);
}
getch();
}

OUTPUT:

tags: Computer Graphics, Sunrise Animation , Animation using C , Graphics in C

Program in C for COIN TOSS

2012-11-05T09:14:00.003-08:00

#include <stdio.h>

#include <conio.h>

#include <dos.h>

#include<graphics.h>

int main(void)

{

int gd=DETECT,gm,errorcode;

int midx,midy,k=1,b=0,a=60;

int xradius,yradius=60;

initgraph(&gd,&gm,"d:\\tc\\bgi");

errorcode =graphresult();

if (errorcode != grOk)

{

printf("Graphics error: %s\n", grapherrormsg(errorcode));

printf("Press any key to halt:");

getch();

exit(1);

}

midx = getmaxx() / 2;

midy = getmaxy() / 2;

setcolor(getmaxcolor());

settextstyle(2,0,0);

while(!kbhit())

{

for(a=60;a>=0;a=a-1)

{

cleardevice();

xradius=a;

if(a==0)

{

k=k+1;

for(b=a;b<=60;b++)

{

cleardevice();

xradius=b;

if(k%2==0)

{

outtextxy(midx-10,midy-90,"TAIL");

setfillstyle(4,1);

}

else

{

outtextxy(midx-10,midy-90,"HEAD");

setfillstyle(5,3);

}

if(b>0 && b<57)

{

int xradius1=b-3;

fillellipse(midx,midy,xradius1+1, yradius);

fillellipse(midx,midy,xradius1+2, yradius);

fillellipse(midx,midy,xradius1+3, yradius);

}

outtextxy(10,5,"PROGRAM:TO SHOW THE ROTATION OF A COIN");

fillellipse(midx,midy,xradius, yradius);

delay(25);

}

if(a<57>0)

{

int xradius1=a+3;

fillellipse(midx,midy,xradius1-1, yradius);

fillellipse(midx,midy,xradius1-2, yradius);

fillellipse(midx,midy,xradius1-3, yradius);

}

if (k%2==0)

{

outtextxy(midx-10,midy-90,"TAIL");

setfillstyle(4,1);

}

else

{

outtextxy(midx-10,midy-90,"HEAD");

setfillstyle(5,3);

}

outtextxy(10,5,"PROGRAM:TO SHOW THE ROTATION OF A COIN");

fillellipse(midx,midy,xradius, yradius);

delay(25);

}

getch();

closegraph();

return 0;}

OUTPUT:

Tags: c program for coin toss, c program for tossing coin, graphics program for rotating coin.

Programming on your Tips

What is Java and why is java needed?

Incoming terms: why do we need Java, What exactly is java, No need for JAVA.

Character array c / chracter array java

OUTPUT:hlYou can also use it for string array:-

characterarrayinjavaCharacter array in C:-

OUTPUT: characterarrayinc

How to Null a string or empty a string array

OUTPUT:

OUTPUT:

null string= and l

C Program to count prime numbers in given range

Output

C Program for Bit Stuffing

C Program to implement CRC (Cyclic Redundancy Code)

Output:

C Program for Add two Numbers without using Operator

Output:

C Program for Implementation of Regular Expession

OUTPUT:

C Program for Recursive Descent Parser

OUTPUT:

program in Java/ Bluej to display the present date and the date after N days

How is windows8 different from windows7

Java program for producing prime numbers for given range

OUTPUT:

Program to find difference between two dates java

Java program to find out the number of days elapsed between two dates.Java program to find out the difference between two dates given as DD-MM-YY.

OUTPUT:

Java program for string in circular fashion.

C Program for Binary Search Tree (BST)

C Program for Priority Heap

OUTPUT:

C program for Kruskal Algorithm

OUTPUT

Program for Heap sort in C Language

C program for Prim's Algorithm

OUTPUT

Program for Merge Sort in C

Draw a Line using Equation y=mx+c in C

OUTPUT:

Draw Concentric Circle in C

OUTPUT

C Program for Drawing a Scenery using Graphics

OUTPUT:

C Program for Sunrise Animation using Graphics

OUTPUT:

Program in C for COIN TOSS

OUTPUT:

OUTPUT:
h
l

You can also use it for string array:-

character
array
in
java

Character array in C:-

OUTPUT:
character
array
in
c

Java program to find out the number of days elapsed between two dates.
Java program to find out the difference between two dates given as DD-MM-YY.