Saturday, April 30, 2011
Friday, April 29, 2011
Mid Term Solved Papers2011
CS504 Mid Term Solved Paper, Click here to Download
cs401 Mid Term Solved Papers, Click here to Download cs302 Mid Term Solved Papers, Click here to Download
cs304 Mid Term Solved Papers, Click here to Download
cs607 Mid Term Solved Papers, Click here to Download
mth202, eng201 and cs601Papers, Click here to Download
mth603 Mid Term Papers, Click here to Download
ECO401 Mid Term Solved Papers, Click here to Download
MKT501 Mid Term Solved Papers, Click here to Download
STA630 Mid Term Solved Papers, Click here to Download
Password: www.vuhelper.blogspot.com
Labels:
MID TERM PAPERS
Saturday, September 12, 2009
Draw A Diamond With Astericks(*) - : for cs201
// Justin C. Miller
// 3-27-2001
// made on: Unix Lab g++ compiler
// Title : creating a diamond shape
// Description: simple diamond shape using * 's
#include
{
int i , j ;
int maxWidth = 11 ; // max width of the diamond
// top half of diamond
for(i = 0 ; i < (maxWidth/2 + 1) ; i++)
{
for(j = i ; j < (maxWidth/2) ; j++) // used to align, putting in spaces
cout << " " ;
for(j = 1 ; j <= (i*2 + 1) ; j++) // puts in the actual astericks
cout << "*" ;
cout <<>
}
for(i = (maxWidth/2) ; i > 0 ; i--){
for(j = (maxWidth/2 + 1) ; j > i ; j--) // used to align, putting in spaces
cout << " " ;
for(j = (i*2 - 1) ; j > 0 ; j--) // puts in the actual astericks
cout << "*" ;
cout <<>
}
for(i = 0 ; i <>
if(i <= (maxWidth/2)){
for(j = i ; j < (maxWidth/2) ; j++) // used to align, putting in spaces
cout << " " ;
for(j = 1 ; j <= (i*2 + 1) ; j++) // puts in the actual astericks
cout << "*" ;
cout <<>
}
else{
for(j = (maxWidth/2 + 1) ; j > (maxWidth-i) ; j--) // used to align, putting in spaces
cout << " " ;
for(j = ((maxWidth-i)*2 - 1) ; j > 0 ; j--) // puts in the actual astericks
cout << "*" ;
cout <<>
}
}
}
Thursday, September 3, 2009
Program to enter an integer and print its total
Program to enter an integer and print its total value based on the formula'
x - 1/3!x^3 + 1/5!x^5 - 1/7!x^7 + 1/9!x^9':-
#include
#include
#include
int main()
{
clrscr();
float factorial=1;
float num,tot,term,total;
int i,n=20,index,j=1;
cout << "Enter a single-digit integer : \n"; cin>>num;
tot=num;
total=num;
for(i=2,index=3;i<=n;i++,index+=2)
{
for(j=1,factorial=1;j<=index;j++)
factorial*=j;
tot=tot*pow((double)(-1),(double)(2*i-1))*num*num;
term=tot/factorial;
total+=term;
}
cout << "Total = " << total << endl;
getch();
return 0;
}
x - 1/3!x^3 + 1/5!x^5 - 1/7!x^7 + 1/9!x^9':-
#include
#include
#include
int main()
{
clrscr();
float factorial=1;
float num,tot,term,total;
int i,n=20,index,j=1;
cout << "Enter a single-digit integer : \n"; cin>>num;
tot=num;
total=num;
for(i=2,index=3;i<=n;i++,index+=2)
{
for(j=1,factorial=1;j<=index;j++)
factorial*=j;
tot=tot*pow((double)(-1),(double)(2*i-1))*num*num;
term=tot/factorial;
total+=term;
}
cout << "Total = " << total << endl;
getch();
return 0;
}
Subscribe to:
Posts (Atom)