选择题:●Suppose we have the relation schema R(A,B,C,D)with functional dependencies;F{A→B,B→C,C→D, 题目分类:软考初级 题目类型:选择题 查看权限:VIP 题目内容: ●Suppose we have the relation schema R(A,B,C,D)with functional dependencies;F{A→B,B→C,C→D,D→A},then R(A,B,C,D.at least is in (73) .(73) A.1NFB.2NFC.3NFD.BCNF 参考答案:
●In the Ethernet LAN,an algorithm was chosen to dynarnically adapt to the number of statio ●In the Ethernet LAN,an algorithm was chosen to dynarnically adapt to the number of statio 分类:软考初级 题型:选择题 查看答案
以下关于数字签名的说法中错误的是 (51) 。(51)A.能够检测报文在传输过程中是否被篡改B.能够对报 以下关于数字签名的说法中错误的是 (51) 。(51)A.能够检测报文在传输过程中是否被篡改B.能够对报 分类:软考初级 题型:选择题 查看答案
● 下列关于快捷方式的叙述中,正确的是(38) 。 (38)A.快捷方式是文件夹 B.快捷方式是文本文件 C.快 ● 下列关于快捷方式的叙述中,正确的是(38) 。 (38)A.快捷方式是文件夹 B.快捷方式是文本文件 C.快 分类:软考初级 题型:选择题 查看答案
●when a string constant is written in C program,the compiler creates (75) of characters co ●when a string constant is written in C program,the compiler creates (75) of characters co 分类:软考初级 题型:选择题 查看答案