Question

c++

page 2 ]. Write a C++ program that uses a recursive function to compute factorial (n!) Include comments in your code. dawoe llustrate with a ]. [extra credit] What are function or class "templates" in C++ ? ] Provide (short!) C++ code fragments which demonstrate how to write and re files. your code fragment should include preprocessor directive(s), all needed I/O declarations, and illustrative code for writing and reading data.eb ert benistno geami 10]. Write C++ code to sort the elements in an integer array. (iust write the sc imsvb ert ni etsb pnitsluq evomex dnonoevome tous Emo Explain the advantage of your method of sorting. 111. Which of these three statements are legal C++ code? Which (if any) are eq each other? Explain your answer. [Presume that cirPtr is a pointer to a member element radius. a) b) cirPtr.radius = 10 820t ob of le (cirPtr).radius = 10 cirPtr->radius= 10 ; drwetbced c) 12]. EXACTLY Wwhat will h

Answer 1

QUESTION 7:

C++ Code:

#include <iostream> using namespace std 11 / Declaration of factorial function 12 long factorial(int); 10 13 int main() 14 15 // Integer variable to store value from the user int num; 16 17 // Prompting cout << "Enter Number "; // Storing 18 user to enter the number 19 input to num variable 20 user cin 21 num; // Calculating the factorial and displaying the output using factorial function call cout < "Factorial of " << num << " is " << factorial(num) << endl; 22 23 24 return 0; 25 26 27

27 /Function to calculate factorial using long factorial(int n){ if(n==0) Base case of factorial 28 recursion */ 29 30 31 return 1; else 32 return n factorial(n-1); //calling the factorial function recursively 33 34 35

Output Snapshot:

Enter Number :5 Factorial of 5 is 120

Text Code:

#include <iostream>
using namespace std;
// Declaration of factorial function
long factorial(int);

int main()
{
// Integer variable to store value from the user
int num;
// Prompting user to enter the number
cout << "Enter Number :";
// Storing user input to num variable
cin >> num;
// Calculating the factorial and displaying the output using factorial function call
cout << "Factorial of " << num << " is " << factorial(num) << endl;

return 0;
}

/* Function to calculate factorial using recursion */
long factorial(int n){
if(n==0) // Base case of factorial   
return 1;
else
return n*factorial(n-1); // calling the factorial function recursively
}

Explanation:

• Please refer code comments for the understanding purpose.

QUESTION 8 :

Function templates are generic type of function which can be operated. The template feature allows us in code reusability. It helps use to create a template of function that could be adapted to multiple type, which can be done without repeating the whole code of different datatypes :

Class templates are also generic type of class which can be operated by different datatypes. The programmer can create a template of the class which is adapted to multiple datatypes without writing the whole code of class again.

QUESTION 10

C++ Code:

#include <iostream> 10 using namespace std; 11 int main() 12 13 //Declaring and Initial ization of integer array of size 10 int array0fInt[10] = {10, 50, -5, 14, 18, 100, -9, 1, 5, 50}; // Displaying Array values to user before applying bubble sort cout < "Array Before Bubble Sorting :" <« endl; for (int i=0; i<10; i++) cout << arrayOfInt[i] cout<endl; 14 15 16 17 18 19 20 21

21 //Sorting the array 22 for(int i-0; i<(10-1); i++){ 23 for (int j-0; j<(10-i-1); j++){ 24 if(array0fInt[j] > arrayOfInt[j+1]){ int swap 25 array0f Int [j]; = array0fInt[j+1]; 26 arrayOf Int [j] arrayOfInt[j+1] = swap; } 27 28 29 30 } 31 // Displaying the array values after applying the bubble sort algorithm cout << "Array After Bubble Sorting :" <« endl; for(int i-0; i<10; it+) cout << arrayOfInt[i] << " cout <<endl; 32 33 34 11 35 36 37 38 return 0; 39 40

Output Snapshot:

Array Before Bubble Sorting 10 505 14 18 100 9 1 5 50 Array After Bubble Sorting : 9-5 1 5 10 14 18 50 50 100

Text Code:

#include <iostream>
using namespace std;

int main()
{
// Declaring and Initialization of integer array of size 10
int arrayOfInt[10] = {10, 50, -5, 14, 18, 100, -9, 1, 5, 50};
// Displaying Array values to user before applying bubble sort
cout << "Array Before Bubble Sorting :" << endl;
for(int i=0; i<10; i++)
cout << arrayOfInt[i] << " ";
cout << endl;
  
// Sorting the array
for(int i=0; i<(10-1); i++){
for(int j=0; j<(10-i-1); j++){
if(arrayOfInt[j] > arrayOfInt[j+1]){
int swap = arrayOfInt[j];
arrayOfInt[j] = arrayOfInt[j+1];
arrayOfInt[j+1] = swap;
}
}
}
// Displaying the array values after applying the bubble sort algorithm
cout << "Array After Bubble Sorting :" << endl;
for(int i=0; i<10; i++)
cout << arrayOfInt[i] << " ";
cout << endl;
  
return 0;
}

Explanation:

• The program uses the Bubble Sort algorithm for sorting the integer array in ascending order.
• Please refer code comments for the understanding purpose

Advantages of Bubble Sort:

• The bubble sort algorithm is understandable very easily.
• Implementation of the bubble sort is very simple and easy.
• This sorting algorithm does not requires external memory to store the data for sorting purpose.
• The performance of this sorting algorithm is great when array is almost sorted.

QUESTION 11:

When cirPtr is a pointer to a structure member element named radius, the expression a (*cirPtr.radius = 10) is invalid and expression b ((*cirPtr).radius=10) and c (cirPtr->radius = 10). In fact both, expression b and c are equal to each other.

As cirPtr is a pointer to the structure and (*cirPtr) represents the value at the pointer addressing by cirPtr, hence (*cirPtr).radius represents the value of radius member which is pointed by cirPtr pointer. The alternate method to write it is, (cirPtr -> radius). Hence

(*cirPtr).radius is equivalent to cirPtr->radius.