An 10-bit password is required to access a system. A hacker systematically works through all possible 10-bit patterns. Let be the number of patterns tested until the correct password is found. (a) find and the pmf of . Let be the event that the password has not been found after 24 tries. (b) find the conditional pmf of given . (c) find () and ( | ).
Answers
Answered by
0
You can search on internet or google sorry I earned the points
Similar questions