Answer:
backup() {
read dirname;
if [[ whereis . /`$dirname` 2> sterr.exe]]
then
mkdir $dirname
for f in . / *.cpp
do
cp f "path_to_dirname"
echo "file backup complete"
}
backup( )
Explanation:
The bash script above is used to backup C++ source files in a directory to a backup directory which is created if it does not exist, and copy's each .cpp file to backup, then sends a message to declare its completion.
Answer:
A and B have different output:
A output will be 1
B output will be 123
Explanation:
A
X = 0
do x < 3
x = x+1
print x
while
B
X = 0
do x = x+ 1
print x
while x < 3
For statement A the condition statement which suppose to be after "while" is not set therefore the value of x will be printed.
For statement B the condition statement is set "x < 3" in front of "while" thereby result in iteration until the condition is false.
Statement A output will be 1
Statement B output will be 123
Answer:
No, las sustancias homogéneas pueden ser mezclas.
Answer:
ICANN
Explanation:
It handles the installation and processing of various databases related to network domains and provides a consistent and secure networking service and there are incorrect options are described as follows:
- IAB, which provides a protocol for managing IETF, is therefore incorrect.
- W3C is used in web development.
- ISOC is used to provide Internet access.
Answer:
Check the explanation
Explanation:
We can utilize the above algorithm with a little in modification. If in each of the iteration, we discover a node with no inward edges, then we we’re expected succeed in creating a topological ordering.
If in a number of iteration, it becomes apparent that each of the node has a minimum of one inward edge, then there must be a presence of cycle in the graph.
So our algorithm in finding the cycle is this: continually follow an edge into the node we’re presently at (which is by choosing the first one on the adjacency list of inward edges to decrease the running time).
Since the entire node has an inward edge, we can do this continually or constantly until we revisit a node v for the first time.
The set of nodes that we will come across among these two successive visits is a cycle (which is traversed in the reverse direction).
