A) It is unable to process large datasets. B) It is susceptible to rare events or rapid shocks. C) It requires more computing power than the median. D) It cannot handle time series data.
A) When the time series is purely random. B) When fluctuations are Laplace distributed. C) When fluctuations are normally distributed. D) When the data contains many anomalies.
A) It ignores the variance of the data. B) It places too much weight on the middle value. C) It assumes the mean is always zero. D) It does not place high probability on very large deviations.
A) Normal distribution. B) Uniform distribution. C) Poisson distribution. D) Laplace distribution.
A) By calculating the arithmetic mean. B) By using a regression model. C) By updating an indexable skiplist. D) By sorting the entire time series repeatedly.
A) Normal distribution filter. B) Weighted average model. C) Moving average regression. D) Median filter.
A) Image signal processing. B) Quantum physics. C) Weather prediction. D) Financial forecasting.
A) Eliminates all variance. B) Places lower probability on rare events. C) Makes the data perfectly linear. D) Places higher probability on rare events.
A) Parameters to be estimated. B) The median of the distribution. C) Random noise. D) Fixed constants.
A) Because they have the same statistical optimality. B) Because they are identical methods. C) Because they use the exact same calculation. D) Due to their similar names.
A) Constant variance B) Static median C) Rolling average D) Fixed summation
A) Differentiation B) Logarithmic scaling C) Integration D) Convolution
A) Because the boxcar function outlines its coefficients B) Because it was used in the train industry C) Because it moves like a boxcar D) Because it uses square root calculations
A) 1833 B) 1905 C) 1865 D) 1799
A) The Royal Statistical Society B) The London Stock Exchange C) The Bank of England D) The University of Cambridge
A) Stack B) FIFO / circular buffer C) Binary tree D) Hash table
A) Polynomial decay B) Gaussian kernel C) Sinc-in-frequency D) Cosine oscillation
A) ε/2 B) ε C) x - ε D) 2ε
A) (x1 + ... + xn) / (n+1) B) (x1 + ... + xn) / n C) (x1 * ... * xn) / n D) (x1 + ... + xn) * n
A) (xn+1 * n) + CAn / n+1 B) (xn+1 + n) * CAn / n C) (xn+1 + CAn) / n D) (xn+1 + n * CAn) / (n + 1)
A) Increasing image resolution B) Removing pixelization C) Color correction D) Encrypting image files
A) Arithmetical progression B) Logarithmic progression C) Exponential decay D) Uniform distribution
A) Volume filter B) Triangle integrator C) Fast filter D) Leaky integrator
A) Alan Turing B) John Stuart Hunter C) Isaac Newton D) Spencer
A) MEMA B) Linear EWMA C) Multivariate WMA D) MEWMA
A) Recursive summation B) Linear interpolation C) Fast Fourier Transform D) Matrix inversion |