<span>The answer is true.
Once documents are created, they may be accessed again and have envelopes pointing to them even when the documents are empty.</span>
Answer:
it is payal because 1/2 is a half
Explanation:
there you go
Answer:
B.O(n).
Explanation:
Since the time complexity of visiting a node is O(1) in iterative implementation.So the time complexity of visiting every single node in binary tree is O(n).We can use level order traversal of a binary tree using a queue.Which can visit every node in O(n) time.Level order traversal do it in a single loop without doing any extra traversal.
Answer:Weak session ID generation algorithm
Explanation: Session hijacking is the hacking by disguising as the authenticated user and illegally exploit the particular computer session. IP packets are invoked by the disguised attacker into the active session between the legal computer user. It is also called session key.
It gives the hacker to use the data and services of the computer in an unauthorized manner. It arises due to the session of communication are not secure and strong,key used for session is weak etc.
