6. Huffman coding is an efficient method of compressing data without losing information. Symbols that appear more often will be encoded as a shorter bit string, while symbols that are not used much will be encoded with longer strings. If Huffman coding is used to compress a sequence with 5 different codewords, which of the following probability distributions will lead to the WORST compression ratio? (A) 0.2, 0.2, 0.2, 0.2, 0.2 (B) 0.02, 0.02, 0.03, 0.03, 0.9 (C) 0.1, 0.1, 0.2, 0.3, 0.3 (D) 0.1, 0.2, 0.2, 0.2, 0.3 (E) 0.05, 0.05, 0.2, 0.2, 0.5

11. Which of the following statements about machine learning is CORRECT? (A) We can generate new features by linearly or non-linearly combining the original features, which is a method of feature engineering. (B) In a dataset, all pairwise combinations of data point vectors are called the support vectors of the dataset. (C) During the training process of a neural network, the validation loss typically fluctuates, but the training loss will always decrease. (D) In k-NN classification, k should be set equal to the size of the dataset so that the entire dataset is considered before making a decision. (E) When training a deep learning model, if the accuracy of the test set is higher than that of the training set, it should be considered evidence of overfitting.

相關試題

相關試卷