Answer:
A. grep -E "(John|Bob)" salesemployees.csv
Explanation:
The grep command is used to search text. It searches the given file for lines containing a match to the given strings or words.
How to use Grep Command:
grep 'letter' filename – Search any line that contains word 'letter' in filename on Linux
grep -i 'Alphabet' file1 – A case-insensitive search for the word ‘Alphabet’ in Linux and Unix
grep -R 'root' . – Search all files in the current directory and in all of its subdirectories in Linux for the word ‘root’
The risk vulnerability assessment is the answer
Answer:
Python file with appropriate comments given below
Explanation:
#Take the input file name
filename=input('Enter the input file name: ')
#Open the input file
inputFile = open(filename,"r+")
#Define the dictionary.
list={}
#Read and split the file using for loop
for word in inputFile.read().split():
#Check the word to be or not in file.
if word not in list:
list[word] = 1
#increment by 1
else:
list[word] += 1
#Close the file.
inputFile.close();
#print a line
print();
#The word are sorted as per their ASCII value.
fori in sorted(list):
#print the unique words and their
#frequencies in alphabetical order.
print("{0} {1} ".format(i, list[i]));
Answer:
- def is_prime(n):
- for i in range(2, n):
- if(n % i == 0):
- return False
- return True
-
- prime_truths = [is_prime(x) for x in range(2,101)]
- print(prime_truths)
Explanation:
The solution code is written in Python 3.
Presume there is a given function is_prime (Line 1 - 5) which will return True if the n is a prime number and return False if n is not prime.
Next, we can use the list comprehension to generate a list of True and False based on the prime status (Line 7). To do so, we use is_prime function as the expression in the comprehension list and use for loop to traverse through the number from 2 to 100. The every loop, one value x will be passed to is_prime and the function will return either true or false and add the result to prime_truth list.
After completion of loop within the comprehension list, we can print the generated prime_truths list (Line 8).
Answer:
Option a: a sorted array
Explanation:
Since the expectation on the data structure never need to add or delete items, a sorted array is the most desirable option. An array is known for its difficulty to modify the size (either by adding item or removing item). However, this disadvantage would no longer be a concern for this task. This is also the reason, linked list, binary search tree and queue is not a better option here although they offer much greater efficiency to add and remove item from collection.
On another hand, any existing items from the sorted array can be easily retrieved using address indexing and therefore the data query process can be very fast and efficient.
