ocp-361

QUESTION NO: 361
Given two different character sets (A and B), which of the following must be true for A to be considered a strict
superset of B? (Choose all that apply.)
A. A must contain all of the characters defined in B.
B. A must be Unicode.
C. The encoded values in A must match the encoded values in B for all characters defined in B.
D. A must be a multibyte character set.
E. The encoded values in A must match the encoded values in B for all numeric and alphabetic characters in
B.
Answer: A,C
A strict superset must contain all characters found in the other character set and have matching encoded
values for those characters.

---

鉴于两种不同的字符集（ A和B），关于A被认为是B的严格超集这一点，以下哪一个一定是真实的？

A. A一定包含所有B中定义的字符
C.对B中定义的所有字符来说， A中的编码值必须匹配B的编码值

一个严格的超集，必须包含在其他的字符集，并匹配这些字符的编码值的所有字符。

---