Categories
- 4th semester (27)
- 5th semester (3)
- ADA (13)
- Assembly Level Language (12)
- BE (45)
- C Language Programming (5)
- C language (20)
- C++ Language (5)
- CCP Lab programing (3)
- Computer Programming Lab (3)
- DAA Lab Programming (13)
- Data Structure and C++ laboratory Program (6)
- Data Structure and C++ labotary Program (5)
- Design and Analysis of algorithm (14)
- First Year (5)
- MASM (12)
- Microprocessor (12)
- Microprocessor lab program (12)
- System Software & OS Laboratory (5)
- Unix program (4)
- bachelor of engineering (30)
- basic (1)
- basic mathematics (2)
- beginners (10)
- c++ program (9)
- calculations (7)
- computer science (30)
- downloadable (5)
- engineering syllabus (4)
- simple program (6)
Trend Posts
Blogger news
Author
Followers
Showing posts with label First Year. Show all posts
Showing posts with label First Year. Show all posts
Monday, July 21, 2014
#include<stdio.h>
#include<conio.h>
void main()
{
/*col,row variables are used to store number of columns and rows respectively,
mat is a two dimensional array is used to store the matrix, i,j is used as an indexing the elements from matrix*/
int col,row,mat[100][100],i,j;
clrscr(); //clear the screen
printf(“enter the number of rows \n”);
scanf(“%d”,&row);
printf(“enter the number of coloumns \n”);
scanf(“%d”,&col);
printf(“number of rows:%d ,number of columns:%d”,row,col);
printf(“enter the value of matrix \n”);
for(i=0;i<row;i++) //outer loop represents to the row
for(j=0;j<col;j++) // inner loop represents to the column
scanf(“%d”,&mat[i][j]);
printf(“your matrix is ….\n”);
//following code is used to print each elements of matrix in row wise
for(i=0;i<row;i++)
{
for(j=0;j<col;j++)
{
Printf(“%d\t”,mat[i][j]);
}
printf(“\n”);
}
getch();
}
Monday, September 2, 2013
#include<stdio.h>
#include<conio.h>
void main()
{
int i,a[i],m;
clrscr();
printf("enter the limit of array\n");
scanf("%d",&m);
printf("enter your array elements\n");
for(i=0;i<m;i++)
{
scanf("%d",&a[i]);
}
printf("your array elements...\n");
for(i=0;i<m;i++)
{
printf("%d\n",a[i]);
}
getch();
}
#include<conio.h>
void main()
{
int i,a[i],m;
clrscr();
printf("enter the limit of array\n");
scanf("%d",&m);
printf("enter your array elements\n");
for(i=0;i<m;i++)
{
scanf("%d",&a[i]);
}
printf("your array elements...\n");
for(i=0;i<m;i++)
{
printf("%d\n",a[i]);
}
getch();
}
Labels:
array,
beginners,
C language,
CCP,
First Year,
for loop,
simple,
vtu Engineering syllabus 2013
|
0
comments
Thursday, August 29, 2013
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:
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)



