Answer:
The power function can be written as a recursive function (using Java) as follows:
- static int power(int x, int n)
- {
- if(n == 0){
- return 1;
- }
- else {
- return power(x, n-1 ) * x;
- }
- }
Explanation:
A recursive function is a function that call itself during run time.
Based on the question, we know x to the 0th power is 1. Hence, we can just create a condition if n = 0, return 1 (Line 3 - 5).
Next, we implement the logic "x to the nth power can be obtained by multiplying x to the n-1'th power with x " from the question with the code: return power(x, n-1 ) * x in the else block. (Line 6 -8)
In Line 7, power() function will call itself recursively by passing x and n-1 as arguments. Please note the value of n will be reduced by one for every round of recursive call. This recursive call will stop when n = 0.
Just imagine if we call the function as follows:
int result = power(2, 3);
What happen will be as follows:
- run Line 7 -> return power(2, 2) * 2
- run Line 7 -> return power(2, 1) * 2
- run Line 7 -> return power(1, 0) * 2
- run Line 4 -> return 1 (Recursive call stop here)
Next, the return value from the inner most recursive call will be return to the previous call stack:
- power(1, 0) * 2 -> 1 * 2
- power(2, 1) * 2 -> 1 * 2 * 2
- power(2, 2) * 2 -> 1 * 2 * 2 * 2 - > 8 (final output)
Answer: True
Explanation:
Yes, the given statement is true that the SaaS (Software as a service) provide the different types of services to the organization which basically require the infrastructure like CRM (Customer relationship management) and it is the standard business processing in the organization.
The software as a service is the fundamental technology of the business which basically include the CRM, e-mails and the various types of sale and financial management.
Answer:
You can't call a function unless you've already defined it. Move the def createDirs(): block up to the top of your file, below the imports.
Explanation:
Some languages allow you to use functions before defining them. For example, javascript calls this "hoisting". But Python is not one of those languages.
Answer:
Please check the attachment.
Explanation:
The adjacency matrix is the matrix that has nodes as rows and columns. The nodes if connected is stated as 1 or else 0. And the adjacency list representation is the list with nodes and connected nodes. The nodes that are not connected are not being listed. The diagram and list as well as matrix can be found in the attachment.
Note: The matrix referred to in the question is: ![M = \left[\begin{array}{ccc}1/2&1/3&0\\1/2&1/3&0\\0&1/3&1\end{array}\right]](https://tex.z-dn.net/?f=M%20%3D%20%5Cleft%5B%5Cbegin%7Barray%7D%7Bccc%7D1%2F2%261%2F3%260%5C%5C1%2F2%261%2F3%260%5C%5C0%261%2F3%261%5Cend%7Barray%7D%5Cright%5D)
Answer:
a) [5/18, 5/18, 4/9]'
Explanation:
The adjacency matrix is
To start the power iteration, let us start with an initial non zero approximation,
![X_o = \left[\begin{array}{ccc}1\\1\\1\end{array}\right]](https://tex.z-dn.net/?f=X_o%20%3D%20%5Cleft%5B%5Cbegin%7Barray%7D%7Bccc%7D1%5C%5C1%5C%5C1%5Cend%7Barray%7D%5Cright%5D)
To get the rank vector for the first Iteration:
![X_1 = \left[\begin{array}{ccc}1/2&1/3&0\\1/2&1/3&0\\0&1/3&1\end{array}\right]\left[\begin{array}{ccc}1\\1\\1\end{array}\right] \\\\X_1 = \left[\begin{array}{ccc}5/6\\5/6\\4/3\end{array}\right]\\](https://tex.z-dn.net/?f=X_1%20%3D%20%20%5Cleft%5B%5Cbegin%7Barray%7D%7Bccc%7D1%2F2%261%2F3%260%5C%5C1%2F2%261%2F3%260%5C%5C0%261%2F3%261%5Cend%7Barray%7D%5Cright%5D%5Cleft%5B%5Cbegin%7Barray%7D%7Bccc%7D1%5C%5C1%5C%5C1%5Cend%7Barray%7D%5Cright%5D%20%5C%5C%5C%5CX_1%20%3D%20%5Cleft%5B%5Cbegin%7Barray%7D%7Bccc%7D5%2F6%5C%5C5%2F6%5C%5C4%2F3%5Cend%7Barray%7D%5Cright%5D%5C%5C)
Multiplying the above matrix by 1/3
![X_1 = \left[\begin{array}{ccc}5/18\\5/18\\4/9\end{array}\right]](https://tex.z-dn.net/?f=X_1%20%3D%20%5Cleft%5B%5Cbegin%7Barray%7D%7Bccc%7D5%2F18%5C%5C5%2F18%5C%5C4%2F9%5Cend%7Barray%7D%5Cright%5D)
