Scribd
Upload
44 views

Fundamenals of Programming: Assignment #04

This document contains 8 questions related to fundamentals of C++ programming. It includes programs to find an element in an array, calculate a factorial, analyze properties of an array, manipulate strings, transpose a 2D matrix, check for alphabetic characters in a string, print a 2D array, and more. The programs are presented to Sir. Arslan Ahmed Khan by 4 students - Muhammad Saqib Sajjad, Faizan Ali, Danish Maqbool, and Waqas Munir.

Uploaded by

HUDA ZULFIQAR
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
44 views

Fundamenals of Programming: Assignment #04

This document contains 8 questions related to fundamentals of C++ programming. It includes programs to find an element in an array, calculate a factorial, analyze properties of an array, manipulate strings, transpose a 2D matrix, check for alphabetic characters in a string, print a 2D array, and more. The programs are presented to Sir. Arslan Ahmed Khan by 4 students - Muhammad Saqib Sajjad, Faizan Ali, Danish Maqbool, and Waqas Munir.

Uploaded by

HUDA ZULFIQAR
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 11

FUNDAMENALS OF PROGRAMMING

Assignment #04

Presented by:
Muhammad Saqib Sajjad –1629
Faizan Ali- 1633
Danish Maqbool - 1587
Waqas Munir - 1598

PRESENTED TO:
SIR. ARSLAN AHMED KHAN
Q 1)

#include<iostream>

using namespace std;

int main()

int F[10],i,num,count=0;

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

cin>>F[i];

cout<<"\nEnter any Element\n";

cin>>num;

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

if(F[i]==num)

cout<<"\nElement Found\n"<<F[i];

count = count + 1;

else

cout<<"\nElement is not present here\n";

} cout<<"\nElement Repeated\n"<<count<<"\tTimes";

return 0;}
Q 2)

Flow Chart : -
Start

Read Num

I=1

Fact = 1

I=I+1

Fact = Fact * I

I<=Num

Print Fact

Stop
Program : -

#include<iostream>

using namespace std;

int main()

int Num,Fact,I;

cout<<"Enter Number\n";

cin>>Num;

I = 1;

Fact = 1;

do

Fact=Fact*I;

I++;

}while (I<=Num);

cout<<"Factorial of "<<Num<<" is \n"<<Fact;

return 0;

}
Q 3)

#include<iostream>

using namespace std;

int main()

int b[]={100, 200 , 14 , 53, 80, 45, 90 },i,count=0,count1=0;

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

if(b[i]%2==0)

count = count + 1;

}}

cout<<"\nEven Numbers";

cout<<"\n"<<count;

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

if(b[i]%2!=0)

count1 = count1 +1;

cout<<"\nOdd Numbers\n";

cout<<count1;

float sum=0,average;

for(i=0;i<7;i++)
{

sum = sum + b[i];

average = sum/7.0;

cout<<"\nAverage is = "<<average;

int num=0;

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

if(b[i]>90)

num = num + 1;

}cout<<"\n"<<num<<" Elements are Greater than 90";

return 0;

Q 4)

Correct Form : -

#include<stdio.h>

int main()
{

char s[] = "Introduction to Computer Programming";

printf("\n First element is - %c\n",s[0]);

for(int I = 0 ; I < 36 ; I++)

printf("%c",s[I]);

printf("\n Sentense is - %s ",s);

scanf(" %s ",&s);

printf("\n what you entered is - %s",s);

return 0;

Q 6)

#include<iostream>

using namespace std;

int main()

int matrix[3][3] = {{1,2,3},{4,5,6},{7,8,9}};

int i,j;

cout<<"Before Swapping\n";

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

for(j=0;j<3;j++)
{

cout<<matrix[i][j];

}cout<<endl;

cout<<"After Swapping\n";

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

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

cout<<matrix[j][i];

}cout<<endl;

return 0;

Q 7)

#include<iostream>

using namespace std;


int main()

char a[25];

int i;

cout<<"Enter Your Name\n";

cin>>a;

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

if(a[i]>='a'&&a[i]<='z'||a[i]>='A'&&a[i]<='Z')

continue;

}cout<<"Your name is\n";

cout<<a;

return 0;

Q 8)

a)

#include<stdio.h>

int main()

{
char s[5][9] = {"Today","is","my","birthday"};

int i;

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

printf("%s", s[i]);

b)

#include<stdio.h>

int main()

char s[5][9] = {"Today","is","my","birthday"};

int i;

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

printf("%c", s[i]);

return 0;

}
c)

#include<stdio.h>

int main()

char s[5][9] = {"Today","is","my","birthday"};

int i;

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

printf("%c", s[i][0]);

return 0;

d) A two dimensional array of characters.

You might also like