Answer:
Explanation:
The minimum depth occurs for the path that always takes the smaller portion of the
split, i.e., the nodes that takes α proportion of work from the parent node. The first
node in the path(after the root) gets α proportion of the work(the size of data
processed by this node is αn), the second one get (2)
so on. The recursion bottoms
out when the size of data becomes 1. Assume the recursion ends at level h, we have
(ℎ) = 1
h = log 1/ = lg(1/)/ lg = − lg / lg
Maximum depth m is similar with minimum depth
(1 − )() = 1
m = log1− 1/ = lg(1/)/ lg(1 − ) = − lg / lg(1 − )
Answer:
The correct answer is PGP i.e "Pretty Good Privacy" .
Explanation:
Pretty Good Privacy is an encryption algorithm that gives the database interaction with the confidentiality and authorization.Pretty Good Privacy is security algorithm which gives the security into the mail . login ,decryption ,encryption are the example of the "Pretty Good Privacy" .
Pretty Good Privacy is a type of hybrid cryptosystem that incorporates cryptographic algorithms and it has de facto open source standard for the mail and the file storage .
O. In an AND gate both values need to be 1 to equal 1.
