第 2 / 2 页
非代码面试题
显示 4 / 24 道匹配题目
答题状态：未尝试未正确已正确
ID题目领域难度题型进度权限
3487Why Entropy Is a Lower Bound, Not Always an Exact CountWhy does the Shannon entropy of the prior give only a lower bound on expected yes/no questions rather than always the exact optimum?数学中等essay未尝试面试订阅3488Why a None State Changes the Coding ProblemIn one-defective search problems, why does adding the possibility of no defect change the counting argument in a substantive way?数学中等essay未尝试面试订阅3489Why Prior Skew Should Change the Query TreeWhy should the optimal query tree usually isolate high-probability states earlier than low-probability states?数学中等essay未尝试面试订阅3490Why Branch Constraints Can Matter More Than Alphabet SizeWhy can two testing systems with the same maximum branch count per question have very different identification power once branch-specific follow-up rules are imposed?数学中等essay未尝试面试订阅