"The first step to getting the things you want out of life is this: Decide what you want"
KNOW JULz???
Saturday, September 24, 2011
Tuesday, May 10, 2011
determinant
#include iostream.h
#include conio.h
#define MAX 3
//function prototype
void inputMAt();
void determinant();
int matrix[MAX][MAX];
int x=0,y=0;
int inputMat(int i, int j){
int next=10;
cout<<"\n\n\tINPUT A NUMBER : ";
for(i=0;i>matrix[i][j];
}
next=next+8;
}
return (i,j);
}
void determinant(){
//int result;
}
void main(){
int x=0,y=0;
char ans;
do{
{
cout<<"\tMilloza, Julius S.";
cout<<"\t\t\t\tMay 11, 2011";
inputMat(x,y);
determinant();
gotoxy(10,10);
cout<<"Determinant : ";
}
cout<<"\n\n\tTRY AGAIN(Y/N)? : "; cin>>ans;
clrscr();
}while(ans=='y'||ans=='Y');
}
#include conio.h
#define MAX 3
//function prototype
void inputMAt();
void determinant();
int matrix[MAX][MAX];
int x=0,y=0;
int inputMat(int i, int j){
int next=10;
cout<<"\n\n\tINPUT A NUMBER : ";
for(i=0;i
}
next=next+8;
}
return (i,j);
}
void determinant(){
//int result;
}
void main(){
int x=0,y=0;
char ans;
do{
{
cout<<"\tMilloza, Julius S.";
cout<<"\t\t\t\tMay 11, 2011";
inputMat(x,y);
determinant();
gotoxy(10,10);
cout<<"Determinant : ";
}
cout<<"\n\n\tTRY AGAIN(Y/N)? : "; cin>>ans;
clrscr();
}while(ans=='y'||ans=='Y');
}
Thursday, May 5, 2011
search for-loop
#include
#include
int max=0, min=0, numb;
int num[6], next=0;
char answer, ans;
void main(){
do{
next=15;
cout<<"Enter Number : ";
for(int i=0;i<5;i++){
gotoxy(next,2);
cin>>numb;
num[i]=numb;
next=next+10;
max=max>numb? max : numb;
min=min<<"\nCHOICES :";
cout<<"\n\t[A] - Find Number ";
cout<<"\n\t[B] - Find MAX ";
cout<<"\n\t[C] - Find Min ";
cout<<"\n\nChoosen Letter? : ";
cin>>answer;
if(answer=='a'||answer=='A'){
cout<<"\nEnter Number to search : "; cin>>numb;
cout<<"\nFound "<<<" at position ";
for(int j=0;j<5;j++){
if(num[j]==numb){
cout<numb){
cout<<"\nMax Value : "<<<"\nMin Value : "<<<"\n\nTRY ANOTHER NUMBERS? : ";cin>>ans;
clrscr();
}
while(ans=='y');
gotoxy(28,10);
cout<<"COMPUTER PROGRAMMING 103";
gotoxy(29,11);
cout<<"MIDTERM PRACTICAL EXAM";
}
#include
int max=0, min=0, numb;
int num[6], next=0;
char answer, ans;
void main(){
do{
next=15;
cout<<"Enter Number : ";
for(int i=0;i<5;i++){
gotoxy(next,2);
cin>>numb;
num[i]=numb;
next=next+10;
max=max>numb? max : numb;
min=min
cout<<"\n\t[A] - Find Number ";
cout<<"\n\t[B] - Find MAX ";
cout<<"\n\t[C] - Find Min ";
cout<<"\n\nChoosen Letter? : ";
cin>>answer;
if(answer=='a'||answer=='A'){
cout<<"\nEnter Number to search : "; cin>>numb;
cout<<"\nFound "<
for(int j=0;j<5;j++){
if(num[j]==numb){
cout<
cout<<"\nMax Value : "<
clrscr();
}
while(ans=='y');
gotoxy(28,10);
cout<<"COMPUTER PROGRAMMING 103";
gotoxy(29,11);
cout<<"MIDTERM PRACTICAL EXAM";
}
Wednesday, May 4, 2011
SORTING
#include
int num[6];
int number, tmp;
char choice;
void main(){
for(int i=0;i<5;i++){
cout<<"Enter Number : ";
cin>>number;
num[i]=number;
}
cout<<"\nUnsorted : \n";
for(int j=0;j<5;j++){
cout<<"\t "< cout<<" ";
}
cout<<"\n\nChoices [i]Increasing || [d]Decreasing ";
cout<<"\nChoose ? : ";cin>>choice;
if(choice=='i'||choice=='I'){
for(int next=1;next<5;next++){
tmp=num[next];
int moveItem=next;
while((moveItem>0)&&(num[moveItem-1]>tmp))
{
num[moveItem]=num[moveItem-1];
moveItem--;
}
num[moveItem]=tmp;
}
cout<<"\nSorted[Increasing] Array : \n";
for(j=0;j<5;j++){
cout<<"\t "< cout<<" ";
if(choice=='d'||choice=='D'){
for(int next=1;next<5;next++){
tmp=num[next];
int moveItem=next;
while((moveItem>0)&&(num[moveItem-1]>tmp))
{
num[moveItem]=num[moveItem-1];
moveItem--;
}
num[moveItem]=tmp;
}
cout<<"\nSorted[Increasing] Array : \n";
for(j=0;j<5;j++){
cout<<"\t "< cout<<" ";
}
}
}
}
}
int num[6];
int number, tmp;
char choice;
void main(){
for(int i=0;i<5;i++){
cout<<"Enter Number : ";
cin>>number;
num[i]=number;
}
cout<<"\nUnsorted : \n";
for(int j=0;j<5;j++){
cout<<"\t "<
}
cout<<"\n\nChoices [i]Increasing || [d]Decreasing ";
cout<<"\nChoose ? : ";cin>>choice;
if(choice=='i'||choice=='I'){
for(int next=1;next<5;next++){
tmp=num[next];
int moveItem=next;
while((moveItem>0)&&(num[moveItem-1]>tmp))
{
num[moveItem]=num[moveItem-1];
moveItem--;
}
num[moveItem]=tmp;
}
cout<<"\nSorted[Increasing] Array : \n";
for(j=0;j<5;j++){
cout<<"\t "<
if(choice=='d'||choice=='D'){
for(int next=1;next<5;next++){
tmp=num[next];
int moveItem=next;
while((moveItem>0)&&(num[moveItem-1]>tmp))
{
num[moveItem]=num[moveItem-1];
moveItem--;
}
num[moveItem]=tmp;
}
cout<<"\nSorted[Increasing] Array : \n";
for(j=0;j<5;j++){
cout<<"\t "<
}
}
}
}
}
Sunday, January 30, 2011
GREEN HORNET TEAM
Thursday, January 27, 2011
im getting started to this!!!
im getting started to this!!!im getting started to this!!!im getting started to this!!!im getting started to this!!!im getting started to this!!!im getting started to this!!!im getting started to this!!!im getting started to this!!!im getting started to this!!!im getting started to this!!!im getting started to this!!!im getting started to this!!!im getting started to this!!!im getting started to this!!!im getting started to this!!!im getting started to this!!!im getting started to this!!!im getting started to this!!!im getting started to this!!!im getting started to this!!!im getting started to this!!!im getting started to this!!!im getting started to this!!!im getting started to this!!!im getting started to this!!!
:) :) :)
:) :) :)
Subscribe to:
Posts (Atom)