计算机问题求解一论题2-7 离散概率基础 2022年04月06日
计算机问题求解 – 论题2-7 - 离散概率基础 2022年04月06日
问题1： 你能否给我们讲讲书上那个关 于邮购商店的“故事”，那里 什么地方体现了“碰运气”？
If we have a table with 100 buckets and 50 keys to put in those buckets, it is possible that all 50 of those keys could be assigned (hashed)to the same bucket in the table.However,someone who is experienced with using hash functions will tell you that you'd never see this in a million years. But that same person might also tell you that neither would you ever see. in a million years,all the keys hash into different locations.In fact,it is far less likely that all 50 keys would hash into one place than that all 50 keys would hash into different places,but both events are quite unlikely.Being able to understand just how likely or unlikely such events are is a major reason for taking up the study of probability. 问题： 这里的you'd never..和neither would you ever... 有什么意义？
问题： 这里的you’d never…和neither would you ever… 有什么意义？
问题： 为什么算法性能分析和概率（运气）有 密切关系？
离散概率模型 间题3： 你能香以下面的过程为例解释 离散概率模型中的主要概念？ Outcome Sample space Event probability A process::掷一个色子两次
离散概率模型 A process: 掷一个色子两次 Outcome Sample space Event probability