(61) A. 泄露 B. 隐藏 C. 篡改 D.否认
(62) A. 泄露 B. 否认 C. 篡改 D.隐藏
(63) A. 数字签名 B. 身份认证 C. 数字证书 D.公钥加密
(64) A. Key B. Certs C. MAC D.Ticket
(65) A. PGP B. SSL C. SHTTP D.SOCKS
● A typical __(66)__ language contains an applicative sub-language which approximates the mathematical abstractions of "timeless" functions applied to 'spaceless'values, where the actual operation sequences and use of storage space during expression evaluation are organized behind the __(67)__ .In this setting, values are data structures of low volume, typically a few computer words or less, which means that an illusion of spacelessness can be realized by having __(68)__ results during expression evalution stored at the discretion of the
language implementation, and effecting parameter __(69)__ and __(70)__ operations through value copying.
(66) A. imperative B. mandatory C. compulsory D. voluntary
(67) A. foreground B. background C. screen D. scenes
(68) A. middle B. intermediate C. previous D. final
(69) A. tranverse B. transportation C. transmmision D. translation
(70) A. assignment B. design C. value D. dispatch
● Most computer systems are __(71)__ to two different groups of attacks:
Insider attacks and outsider attacks. A system that is known to be __(72)__ to an outsider attack by preventing __(73)__ from outside can still be vulnerable to the insider attacks accomplished by abusive usage of __(74)__ users. Detecting such abusive usage as well as attacks by outsides not only provides information on damage assessment, but also helps to prevent future attacks. These attacks are usually __(75)__ by tools referred to as Intrusion Detection Systems.
(71) A. vulnerable B. week C. sensitively D. helpless
(72) A. reliable B. secure C. indestructible D. steady
(73) A. visit B. access C. I/O D. read/write
(74) A. power B. rights C. authorized D. common
(75) A. searched B. checked C. tested D. detected
(38) A. ρ={HK,HI,IJ,JKL,HL} B. ρ={HIL,IKL,IJL}
C. ρ={HJ,IK,HL}
D. ρ={HI,JK,HL}
(39) A. SELECT* FROM R WHERE E<'2’ B. SELECT B,E FROM R WHERE B<'2’
C. SELECT B,E FROM R HAVING E<'2’
D. SELECT* FROM R WHERE '5'<B
(3) A. 参数多态 D. 过载多态 C. 隐含多态 D. 重置多态
(4) A. 重置多态 B. 过载多态 C. 隐含多态 D. 包含多态
(5) A. 参数多态 D. 隐含多态 C. 过载多态 D. 包含多态
● 已知一不确定的有穷自动机(NFA)如下图所示,采用于集法将其确定化为 DFA 的过程如下表示。
I
I0
I1
{S,1,2,3 }
{1,3,4,5,Z}
{2,3}
{1,3,4,5,Z}
T1
T3
{2,3}
{4,5,Z}
{2,3}
T2
{6}
T3
T1
{1,3,4,5,6,Z}
{5,Z}
{6}
T3
{5,Z}
{5,Z}
{6}
T3
状态集 T1 中不包括编号为__(6)__的状态;状态集 T2 中的成员有__(7)__;状态集 T3 等于__(8)__;该自动机所识别的语言可以用正规式__(9)__表示。
(6) A. 2 B. 4 C. 3 D. 5
(7) A. 1,3,4,5,Z B. 2,3 C. 6 D. 4,5,Z
(8) A. {Z} B. {6} C. {4,5,Z} D. { }
(9) A. (0|1)* B. (0*|1*)*001 C. (0*|1*)*0(0|1)* D. (0*|1*)0(0|1)*
(18) A. 2,4,6,8,10,12,16,18,20,28,30 B. 6,2,10,4,8,12,28,30,20,16,18
C. 12,2,10,20,6,18,4,16,30,8,28
D. 30,10,20,12,2,4,16,6,8,28,18
(19) A. 10,6,18,8,4,2,12,20,16,30,28 B. 6,2,10,4,8,12,28,30,20,16,10
C. 2,4,6,8,10,12,16,18,20,28,30
D. 6,10,8,28,20,18,2,4,12,30,16
(20) A. 10,6,18,8,4,2,12,20,16,30,28 B. 1,12,10,20,6,18,4,16,30,8,28
C. 2,4,6,8,10,12,16,18,20,28,30
D. 30,10,20,12,2,4,16,6,8,28,18
(21) A. 2,12,16,8,28,30,4,6,10,18,20 B. 2,12,16,30,8,28,4,10,6,20,18
C. 12,2,16,8,28,30,4,6,10,28,18
D. 12,2.10,20,6,18,4,16,30,8,28
(22) A. 30,28,20,12,18,16,4,10,2,6,8 B. 2O,30,28,12,18,4,16,10,2,8,6
C. 2,6,4,10,8,28,16,30,20,12,18
D. 2,4,10,6,12,28,16,20,8,30,18
●在表示多个数据流与加工之间关系的符号中,下列符号分别表示__(23)__和__(24)__
(23) A. 若 A,则 ((B或C) 或 (B与C)) B.若 A 或 B,则 C
C. 若 A与 B,则 C
D.若 A,则 (B或C) 但非 (B与C)
(24) A. 若 A,则 ((B或C) 或 (B与C)) B.若 A 或 B,则 C
C. 若 A 与 B,则 C
D.若 A,则 (B或C) 但非 (B与C)