Útmutatóhoz kapcsolódó kvíz · Közepes Szint

Markov Chains Quiz

Tests the Markov property, transition-matrix rows, two-step weather paths, stationary distributions, state design, and limits of simple chains.

Kapcsolódó útmutató utakMarkov Chains
kérdés 1 -ból 8

In this guide, what does the Markov property say about predicting the next state?

Tekintse meg az összes kérdést8 kérdéseket

A válaszok és magyarázatok megjelennek a kvíz kitöltésekor.

  1. In this guide, what does the Markov property say about predicting the next state?
    • Only the first state matters, regardless of the current one
    • The next state is fixed once the current state is named
    • Given the current state, earlier states add no information under the model
    • The process must have no hidden real-world history
  2. Why must each row of the guide's transition matrix sum to one?
    • A row gives probabilities for every prior state
    • A row contains only the stationary probabilities
    • Every entry in a probability matrix must be identical
    • It lists all mutually exclusive next-state probabilities from one current state
  3. If today is sunny in the guide's illustrative matrix, what is the probability of rain tomorrow?
    • 0.8
    • 0.2
    • 0.4
    • 0.6
  4. Starting sunny, what is the guide's illustrative probability of rain two days later?
    • 0.20, using only the direct one-step route
    • 0.60, using only the rainy-state row
    • 0.80, using the sunny-to-sunny probability
    • 0.28, adding paths through sunny and rainy tomorrow
  5. What makes a state distribution stationary for a transition matrix?
    • It changes as quickly as possible after each step
    • Applying one more transition leaves that distribution unchanged
    • It describes only the initial state before any transitions
    • It assigns equal probability to every state in every chain
  6. Which sunny/rainy mixture is stationary for the guide's illustrative matrix?
    • One-third sunny and two-thirds rainy
    • One-half sunny and one-half rainy
    • Two-thirds sunny and one-third rainy
    • All sunny and no rainy days
  7. A machine's failure risk depends on how long it has been running, but the state records only working or broken. What is the concern?
    • The chosen state may omit history needed to model the next transition
    • Every transition probability must become zero
    • The stationary distribution is automatically uniform
    • Two states make transition matrices impossible
  8. Why can a simple short-state Markov model struggle with longer passages of text?
    • It may miss long-range language dependencies outside its state
    • A fixed transition matrix makes every next token equally likely
    • It cannot assign a next-token probability unless the entire text is stored
    • More training observations automatically add the missing earlier context to the state