Answer:A zero-day vulnerability is a vulnerability in a system or device that has been disclosed but is not yet patched. An exploit that attacks a zero-day vulnerability is called a zero-day exploit.
Explanation:
```
#!/usr/local/bin/python3
import sys
def print_factorial( user_val ):
if( user_val < 1 ):
return( 1 )
else:
return( print_factorial( user_val - 1 ) * user_val )
if( __name__ == "__main__" ):
if( len( sys.argv ) == 2 ):
print( print_factorial( int ( sys.argv[ 1 ] ) ) )
else:
sys.stderr.write( "usage: %s <integer>\n" % sys.argv[ 0 ] )
exit( 0 )
```
Answer:
Explanation:
Since all of the items in the array would be integers sorting them would not be a problem regardless of the difference in integers. O(n) time would be impossible unless the array is already sorted, otherwise, the best runtime we can hope for would be such a method like the one below with a runtime of O(n^2)
static void sortingMethod(int arr[], int n)
{
int x, y, temp;
boolean swapped;
for (x = 0; x < n - 1; x++)
{
swapped = false;
for (y = 0; y < n - x - 1; y++)
{
if (arr[y] > arr[y + 1])
{
temp = arr[y];
arr[y] = arr[y + 1];
arr[y + 1] = temp;
swapped = true;
}
}
if (swapped == false)
break;
}
}
Answer:
#include <stdio.h>
void interchangeCase(char phrase[],char c){
for(int i=0;phrase[i]!='\0';i++){
if(phrase[i]==c){
if(phrase[i]>='A' && phrase[i]<='Z')
phrase[i]+=32;
else
phrase[i]-=32;
}
}
}
int main(){
char c1[]="Eevee";
interchangeCase(c1,'e');
printf("%s\n",c1);
char c2[]="Eevee";
interchangeCase(c2,'E');
printf("%s\n",c2);
}
Explanation:
- Create a function called interchangeCase that takes the phrase and c as parameters.
- Run a for loop that runs until the end of phrase and check whether the selected character is found or not using an if statement.
- If the character is upper-case alphabet, change it to lower-case alphabet and otherwise do the vice versa.
- Inside the main function, test the program and display the results.
