Answer: (A) Firewall; implement an ACL on the interface
Explanation:
According to the question, for re-mediate the issue firewall should be implemented the ACL (Access control list) on the given interface. The access control list is one of the type of logic which selectively give permission or deny the number of packet in the system which to through the interface.
Firewall is the type of device that basically examine the traffic in the network system and also make several decisions in the system. ACL is the set of rule which mainly define the route of the packet in the router interface state.
Answer:
vowels = ("a", "e", "i", "o", "u")
word = input("Enter a word: ")
is_all = True
for c in vowels:
if c not in word:
is_all = False
if is_all == True:
print(word + " is a vowel word.")
else:
print(word + " is not a vowel word.")
Explanation:
Initialize a tuple, vowels, containing every vowel
Ask the user to enter a word
Initially, set the is_all as True. This will be used to check, if every vowel is in word or not.
Create a for loop that iterates through the vowels. Inside the loop, check if each vowel is in the word or not. If one of the vowel is not in the vowels, set the is_all as False.
When the loop is done, check the is_all. If it is True, the word is a vowel word. Otherwise, it is not a vowel word.
Everyone
B.
Citizens
C.
Adults
D.
Women
Correct Answer: citizens
User enters:
lemur parrot cat rock
Outputs:
You have a lemur with a total of 1 pet(s)
You have a parrot with a total of 2 pet(s)
You have a cat with a total of 3 pet(s)
Following are the python program to use the loop to count the number of pets until the user enters the "rock":
c = 0#defining a variable c that initilzes with 0
p = input()#defining a variable p that input value
while p != 'rock':#defining a loop that check p value not equal to rock
c += 1#using c variable for counts total number of pets
print('You have a %s with a total of %d pet(s)' %(p,c))#print total number of pet
p = input() #input value
Output:
Please find the attached file.
Program Explanation:
Find out more about the loop here:
Answer:
Linear search can be suitable for searching over an unsorted array. whereas, Elements in the array need to be in sorted order for binary search. The binary search algorithm uses the divide-and-conquer approach, it does not scan every element in the list. Hence, It is the best search algorithm
pls mrk me brainliest
Answer:
Algorithm:
1.Create a variable N.
2.Read the value of N from user.
3.for i=1 to N.
3.1 Print value of i.
4.end program.
Implementation in C++:
#include <bits/stdc++.h>
using namespace std;
// main function
int main()
{
// variable
int N;
cout<<"Enter value of N:";
// read the value of N
cin>>N;
cout<<"Natural number from 1 to "<<N<<" are:";
for(int i=1;i<=N;i++)
{
// print the numbers
cout<<i<<" ";
}
return 0;
}
Output:
Enter value of N:6
Natural number from 1 to 6 are:1 2 3 4 5 6
Answer:
adaddsad
Explanation: