Mathematics · Information Theory
n समान रूप से संभावित परिणामों वाले एक असतत यादृच्छिक चर (discrete random variable) के लिए अधिकतम एंट्रॉपी (maximum entropy) क्या होती है?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1n log2(n)
- 21
- 3log2(n)✓
- 40
सही उत्तर देखें
log2(n)
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
👥
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Online Test Series
Start Free Mock Test →Preparing for Mathematics?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Information Theory MCQs →Want more practice questions on Information Theory?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Mathematics · Information Theory