Check your mirrors and blind spots
Answer:
C++.
Explanation:
#include <iostream.h>
void main(int argc,char* arg[]) {
// Arrays
int x[100];
int y[50];
int z[50];
////////////////////////////////////////////////////////////////////////////
int count = 0;
for (int i = 0; i < 100; i+=2) {
z[count] = x[i] * y[count];
count++;
}
for (int i =0; i < 5; i++) {
cout<<z[i]<<endl;
}
getche();
}
Answer:
Following are the code in the C language .
int max(int x) // function definition
{
static int largest=0; // variable declaration
if (x>largest) // checking the condition
largest=x; // assign the value of input in the largest variable
return largest; // return the largest number
}
Explanation:
Following are the description of code .
- Decalred a function max of int type which hold a parameter x of int datatype.
- In this function compared the number x with the largest .If this condition is true then largest number hold the value of x variable
- Finally return the largest number .
Answer:In general, the longer your time horizon, the better you can handle fluctuations in value and take more risk in order to reap greater rewards.
Explanation:
Answer:
The number of characters to shift each letter in the alphabet.
Explanation:
Caeser Cipher is the technique of encryption of data, to make it secure by adding characters between alphabets. These are the special characters that make the message secure while transmitting.
According to the standards, For Decryption, we remove these special characters between alphabets to make message understandable.
<em>So, we can say that,to de-crypt the message, the number of characters to shift each letter in the alphabet.</em>
