Answer:
a. grep 'b[au]nk$' myLine
Explanation:
grep is a command used for searching a specified pattern in a given text.
Our goal is to match the character sequence - bank or bunk at the end of line in a given line referenced by myLine.
The regular expression for the specified match criterion is:
b[au]nk$
The second character can be either a or u.
$ indicates match at end of line.
So the overall grep command is :
grep 'b[au]nk$' myLine
Answer:
O(n^2)
Explanation:
The number of elements in the array X is proportional to the algorithm E runs time:
For one element (i=1) -> O(1)
For two elements (i=2) -> O(2)
.
.
.
For n elements (i=n) -> O(n)
If the array has n elements the algorithm D will call the algorithm E n times, so we have a maximum time of n times n, therefore the worst-case running time of D is O(n^2)
Answer:
Option a
Explanation:
The Critical Path Method is the arrangement of booked exercises that decides the term of the task. These planned exercises must be performed if the venture is to be viewed as a triumph.
Therefore, options b, c, d and e can't be true because:
b. Activities in the Critical Path Method has no or zero slack.
c. The duration of the critical path in CPM determined on the basis of the latest activity and the earliest initiation.
d. The CPM method schedules the activity of the longest duration.
Answer:
All the message I sent were from the same routers
Explanation:
All the message I sent were from the same routers
