Answer:
Following are the program in the C++ Programming Language.
#include <iostream>
using namespace std;
//define function for swapping
void SwapValues(int* userVal1,int* userVal2){
//set integer variable to store the value
int z = *userVal1;
//interchange their value
*userVal1 = *userVal2;
//interchange their value
*userVal2 = z;
}
//define main method
int main()
{
//declare variables
int x,y;
//get input from the user
cin>>x>>y;
//Call the method to swap the values
SwapValues(&x,&y);
//print their values
cout<<x<<" "<<y;
return 0;
}
<u>Output</u>:
3 8
8 3
Explanation:
<u>Following are the description of the program</u>.
- Firstly, we define required header file and function 'SwapValues()', pass two pointer type integer variables in argument that is 'userVal1' and 'userVal2'.
- Set integer data type variable 'z' and initialize the value of 'userVal1' in it, then initialize the value of 'userVal2' in 'userVal1' and then initialize the value of 'z' in 'userVal2'.
- Finally, define the main method in which we set two integer type variables and get input from the user in it then, call and pass those variables and print it.
Answer:
telnet
Explanation:
<h2><u>Fill in the blanks </u></h2>
Terminal emulation, especially the unprotected <u>telnet </u>protocol, should be blocked from any access to all internal servers from the public network.
No longer produced or used; out of date.
Answer:
Following are the solution to the given choices:
Explanation:
Given:
double currentBalance[91];//defining a double array
In point a:
The name of the array is= currentBalance.
In point b:
91 double values could be saved in the array. It requires 8bytes to hold a double that if the array size is 91*8 = 728
In point c:
Each element's data type is double.
In point d:
The array index range of values is between 0 and 90 (every array index starts from 0 and ends in N-1, here N=91).
In point e:
To access first element use currentBalance[0], for middle currentBalance[91/2] , for last currentBalance[90]
23 bits would leave room for 512 node numbers.
