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:
Check the explanation
Explanation:
Kindly check the attached images below to see the step by step explanation to the question above.
Answer:
Option D
Explanation:
Artificial intelligence is a technology where the information gathered in the past is processed for the future actions.
Here, based on the preferences of customer in the past and purchase history, AI can suggest the customer new products and services
Hence, option D is correct
Answer:
a) 6
b) 11
c) 11
Explanation:
Given
Prime value q =n= 19
primitive root (a) =10
Alice secret key = 4
Bob secret key = 6
a) The value Alice Sends to Bob
aPrivate key of Alice mod n
= 10^4 mod 19
= 10000 mod 19
=6
b)The value Bob sends to Alice
aPrivate key of Bob mod n
= a3 mod n
= 10^6 mod 19
=1000000 mod 19
= 11
c)
Both the parties calculate the value of secret key at their respective side.
secret key obtained by Alice
= 11
secret key obtained by Bob
= 11
Finally, both the parties obtain the same value of secret key.
The value of common secret key = 17
