Trend Posts
Author
View LUQMAN's profile
Thursday, August 29, 2013
Design,develop and execute a program in C to stimulate the working of queue of integers using an array.Provide the following operations:
1.Insert 2.Delete 3.Display
CLICK HERE TO DOWNLOAD PROGRAM FILE
#include<stdio.h>
#include<conio.h>
#define MAX_SIZE 5
int front=-1,rear=-1,a,c,i,x,element;
int queue[MAX_SIZE];
void enqueue();
void dequeue();
void display();
void main()
{
clrscr();
while(1)
{
printf("\n++++MENU++++\n");
printf("============\n");
printf("1 for enqueue\n2 for dequeue\n3 for display");
printf("\n4 for exit\n");
printf("enter your choice:");
scanf("%d",&a);
switch(a)
{
case 1:
enqueue();
break;
case 2:
dequeue();
break;
case 3:
display();
break;
case 4:
exit(0);
break;
default:
printf("invalid..!");
break;
}
getch();
}
}
void enqueue()
{
if(rear==MAX_SIZE-1)
{
printf("queue full..!\n");
}
else
{
printf("enter a number:");
scanf("%d",&element);
rear++;
queue[rear]=element;
}
}
void dequeue()
{
if(front==rear)
{
printf("queue empty..!");
}
else
{
front++;
x=queue[front];
printf("deleted element is %d",x);
}
}
void display()
{
if(front==rear)
{
printf("queue empty..!");
}
else
printf("\nentered number:");
{
for(i=front+1;i<=rear;i++)
{
printf("%d",queue[i]);
}
}
}
______________________________//program ends
CLICK HERE TO DOWNLOAD PROGRAM FILE
screen shots:
Design, develop and execute a program in C to evaluate the given polynomial f(x)=a4x4+a3x3+a2x2+a1x+a0
Program No:4
=============
#include<stdio.h>
#include<conio.h>
void main() // Calling Main Function
{
float a[100],x,sum=0;
int i,n;
clrscr();
printf("Enter the power of polinomial equation");
scanf("%d",&n);
printf("Enter the values of X \n");
sanf("%f",&x);
printf("enter the values for co-efficients \n");
for(i=n;i>0;i--)
{
scanf("%f",&a[i]);
}
for(i=n;i>0;i--)
{
sum=(sum+a[i])*x;
}
sum=sum+a[0];
printf("\n the values of f(%.2f) sum=%.2f",x,sum);
getch();
}
===========
Program Ends
CLICKHERE! TO DOWNLOAD THIS PROGRAM
To more reference Wikipedia link
Screenshots:
for given value of x and the coefficients using Horner's method
Program No:4
=============
#include<stdio.h>
#include<conio.h>
void main() // Calling Main Function
{
float a[100],x,sum=0;
int i,n;
clrscr();
printf("Enter the power of polinomial equation");
scanf("%d",&n);
printf("Enter the values of X \n");
sanf("%f",&x);
printf("enter the values for co-efficients \n");
for(i=n;i>0;i--)
{
scanf("%f",&a[i]);
}
for(i=n;i>0;i--)
{
sum=(sum+a[i])*x;
}
sum=sum+a[0];
printf("\n the values of f(%.2f) sum=%.2f",x,sum);
getch();
}
===========
Program Ends
CLICKHERE! TO DOWNLOAD THIS PROGRAM
To more reference Wikipedia link
Screenshots:
Tuesday, August 27, 2013
Design,develop and execute a program in C to input N integer numbers into a single dimensional array,sort them in ascending order using dimensional array and perform a binary search for a given key integer number and report success or failure in the form of suitable message
CLICK HERE TO DOWNLOAD PROGRAM FILE!
Program No:3
=================
#include<stdio.h>
#include<conio.h>
#include<process.h>
void main()
{
int a[100],i,n,key,first,last,mid;
clrscr();
printf("enter the limit number of array elements\n");
scanf("%d",&n);
printf("enter the elements of array\n");
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
printf("My array elements...\n");
for(i=0;i<n;i++)
{
printf("%d \n",a[i]);
}
printf("enter your searching word\n");
scanf("%d",&key);
first=0;
last=n-1;
while(first<=last)
{
mid=(first+last)/2;
if(key==a[mid])
{
printf("\n %d is found at location =%d\n",key,mid+1);
getch();
exit(0);
}
else
{
if(key>a[mid])
{
first=mid+1;
}
else
{
last=mid-1;
}
}
}
printf("The %d is not found in the list ",key);
getch();
}
===================
Program Ends
CLICK HERE TO DOWNLOAD PROGRAM FILE!
To referance wikipedia link
screenshots:
CLICK HERE TO DOWNLOAD PROGRAM FILE!
Program No:3
=================
#include<stdio.h>
#include<conio.h>
#include<process.h>
void main()
{
int a[100],i,n,key,first,last,mid;
clrscr();
printf("enter the limit number of array elements\n");
scanf("%d",&n);
printf("enter the elements of array\n");
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
printf("My array elements...\n");
for(i=0;i<n;i++)
{
printf("%d \n",a[i]);
}
printf("enter your searching word\n");
scanf("%d",&key);
first=0;
last=n-1;
while(first<=last)
{
mid=(first+last)/2;
if(key==a[mid])
{
printf("\n %d is found at location =%d\n",key,mid+1);
getch();
exit(0);
}
else
{
if(key>a[mid])
{
first=mid+1;
}
else
{
last=mid-1;
}
}
}
printf("The %d is not found in the list ",key);
getch();
}
===================
Program Ends
CLICK HERE TO DOWNLOAD PROGRAM FILE!
To referance wikipedia link
screenshots:
Design,Develop,and execute a program in C to Read a sparse matrix of integer values and to search the sparse matrix for an element specified by the user. Print the result of the result of the search appropriately Use the triple <row,column,value> to represent an element in the sparse matrix
TO DOWNLOAD PROGRAM FILE CLICK HERE!
Program No:2
=============
Program ends
Screen-shots:
TO DOWNLOAD PROGRAM FILE CLICK HERE!to more reference:wikipedia link
TO DOWNLOAD PROGRAM FILE CLICK HERE!
Program No:2
=============
#include<stdio.h>
#include<conio.h>
#define MAX 50
struct term
{
int row;
int col;
int val;
};
struct term sparse[MAX];
void main()
{
int a[MAX][MAX],i,j,m,n,count=0,key,flag=0;
clrscr();
printf("enter the limit of the matrix \n");
scanf("%d%d",&m,&n);
printf("enter the elements of matrix \n ");
for(i=0;i<m;i++)
for(j=0;j<n;j++)
{
scanf("%d",&a[i][j]);
}
printf("your matrix elements...\n");
for(i=0;i<m;i++)
{
for(j=0;j<n;j++)
{
printf("%d",a[i][j]);
}
printf("\n");
}
printf("the matrix in alternative form...\n");
for(i=0;i<m;i++)
for(j=0;j<n;j++)
{
if(a[i][j]!=0)
{
++count;
sparse[count].row=i;
sparse[count].col=j;
sparse[count].val=a[i][j];
}
}
printf("<row\tcoloumn\tvalue\t>\n");
printf("%d\t%d\t%d\t\n",m,n,count);
sparse[0].row=m;
sparse[0].col=n;
sparse[0].val=count;
for(i=1;i<=count;i++)
{
printf("<%d\t%d\t%d\t>\n",sparse[i].row,sparse[i].col,sparse[i].val);
}
printf("enter the value for key\n");
scanf("%d",&key);
printf("searching key in sparse matrix \n");
for(i=1;i<=count;i++)
if(sparse[i].val==key)
{
flag=1;
printf("Key:%d is found at <%d\t%d\t>",key,sparse[i].row,sparse[i].col);
}
if(flag==0)
{
printf("the key is not found\n");
}
getch();
}
=======#include<conio.h>
#define MAX 50
struct term
{
int row;
int col;
int val;
};
struct term sparse[MAX];
void main()
{
int a[MAX][MAX],i,j,m,n,count=0,key,flag=0;
clrscr();
printf("enter the limit of the matrix \n");
scanf("%d%d",&m,&n);
printf("enter the elements of matrix \n ");
for(i=0;i<m;i++)
for(j=0;j<n;j++)
{
scanf("%d",&a[i][j]);
}
printf("your matrix elements...\n");
for(i=0;i<m;i++)
{
for(j=0;j<n;j++)
{
printf("%d",a[i][j]);
}
printf("\n");
}
printf("the matrix in alternative form...\n");
for(i=0;i<m;i++)
for(j=0;j<n;j++)
{
if(a[i][j]!=0)
{
++count;
sparse[count].row=i;
sparse[count].col=j;
sparse[count].val=a[i][j];
}
}
printf("<row\tcoloumn\tvalue\t>\n");
printf("%d\t%d\t%d\t\n",m,n,count);
sparse[0].row=m;
sparse[0].col=n;
sparse[0].val=count;
for(i=1;i<=count;i++)
{
printf("<%d\t%d\t%d\t>\n",sparse[i].row,sparse[i].col,sparse[i].val);
}
printf("enter the value for key\n");
scanf("%d",&key);
printf("searching key in sparse matrix \n");
for(i=1;i<=count;i++)
if(sparse[i].val==key)
{
flag=1;
printf("Key:%d is found at <%d\t%d\t>",key,sparse[i].row,sparse[i].col);
}
if(flag==0)
{
printf("the key is not found\n");
}
getch();
}
Program ends
Screen-shots:
TO DOWNLOAD PROGRAM FILE CLICK HERE!to more reference:wikipedia link
Monday, August 26, 2013
/*Design develop and execute a program in C to find and output all the roots of a given quadratic equation,for non-zero co-efficient*/
CLICK HERE TO DOWNLOAD PROGRAM FILE !
Program No:1
===============
#include<stdio.h>
#include<conio.h>
#include<process.h>
#include<math.h>
void main()
{
float a,b,c,d,real,img,real_value1,real_value2;
clrscr();
printf("enter the three values for co-efficient a,b,c from quadratic eqn \n");
scanf("%f%f%f",&a,&b,&c);
printf(" a=%f \n b=%f \n c=%f \n ",a,b,c);
if (a*b*c==0)
{
printf("Sorry! You can't Evaluate Equation \n");
exit(0);
}
else
{
d=(b*b)-(4*a*c);
if(d>0)
{
printf(" Roots for this Equation have Decimal Part \n");
real_value1=-b+sqrt(d);
real_value2=-b-sqrt(d);
printf("Root 1 =%f \n Root 2 = %f \n",real_value1,real_value2);
}
else if(d<0)
{
printf("Root's Values are Complex \n");
real=-b/(2*a);
img=sqrt(fabs(d/(2*a)));
printf("Root1= %f + i%f \n",real,img);
printf("Root2= %f - i%f \n",real,img);
}
else
{
printf("Root1 and Root2 are equal \n");
d=b/(2*a);
printf("Root for quadratic equation is\n",d);
}
}
getch();
}
=============
Program Ends
To more reference:wikipedia link
CLICK HERE TO DOWNLOAD PROGRAM FILE !
Screen Shot:
Note: this Program is given suitable form in TURBO C
CLICK HERE TO DOWNLOAD PROGRAM FILE !
Program No:1
===============
#include<stdio.h>
#include<conio.h>
#include<process.h>
#include<math.h>
void main()
{
float a,b,c,d,real,img,real_value1,real_value2;
clrscr();
printf("enter the three values for co-efficient a,b,c from quadratic eqn \n");
scanf("%f%f%f",&a,&b,&c);
printf(" a=%f \n b=%f \n c=%f \n ",a,b,c);
if (a*b*c==0)
{
printf("Sorry! You can't Evaluate Equation \n");
exit(0);
}
else
{
d=(b*b)-(4*a*c);
if(d>0)
{
printf(" Roots for this Equation have Decimal Part \n");
real_value1=-b+sqrt(d);
real_value2=-b-sqrt(d);
printf("Root 1 =%f \n Root 2 = %f \n",real_value1,real_value2);
}
else if(d<0)
{
printf("Root's Values are Complex \n");
real=-b/(2*a);
img=sqrt(fabs(d/(2*a)));
printf("Root1= %f + i%f \n",real,img);
printf("Root2= %f - i%f \n",real,img);
}
else
{
printf("Root1 and Root2 are equal \n");
d=b/(2*a);
printf("Root for quadratic equation is\n",d);
}
}
getch();
}
=============
Program Ends
To more reference:wikipedia link
CLICK HERE TO DOWNLOAD PROGRAM FILE !
Screen Shot:
Note: this Program is given suitable form in TURBO C
Subscribe to:
Posts (Atom)