题目内容

以下各题基于以下说明:设有如下图所示的两个关系S(sno,sname,sex)和SC(sno,cno,grade)。其中关系S的主码是sno,关系SC的主码是(sno,cno)。且关系SC的属性“no”是它的外码。要求grade的取值只能是0~100之间的整数。 关系 S 关系 SC sno sname sex sno cno grade S01 李红星 男 S01 C1 59 S10 洪宇宙 女 S01 C2 90 S20 张黎明 男 S03 NULL 120 关系数据库必须满足以下3类完整性规则: Ⅰ.实体完整性规则 Ⅱ.参照完整性规则 Ⅲ.用户定义的完整性规则 上述两个关系违背了______完整性规则。

A. 仅Ⅰ
B. 仅Ⅱ和Ⅲ
C. 仅Ⅰ和Ⅱ
D. Ⅰ、Ⅱ和Ⅲ

查看答案
更多问题

阅读下列函数说明和C代码,将应填入 (n) 处的字句写在对应栏内。[说明]HufTman树又称最优二叉树,是一类带权路径长度最短的树,在编码中应用比较广泛。构造最优二叉树的Huffman算法如下:①根据给定的n各权值{W1,w2,…,wn)构成n棵二叉树的集合F={T1,T2,…,Tn},其中每棵树Ti中只有一个带权为wi的根节点,其左右子树均空。②在F中选取两棵根节点的权值较小的树作为左右子树,构造一棵新的二叉树,置新构造二叉树的根节点的权值为其左右予树根节点的权值之和。③从F中删除这两棵树,同时将新得到的二叉树加入到F中。重复②③,直到F中只剩一棵树为止。函数中使用的预定义符号如下:#define INT MAX 10000#define ENCODING LENGTH 1000typedef enum(none,left_child,right_child) Which;/*标记是左孩子还足右孩子*/typedef char Elemtype;typedef struct TNode{//Huffman树节点Elemtype letter;intweight; //权值int parent; //父节点Which sigh;char *code; //节点对应编码}HTNode,*HuffmanTree;int n;char coding[50];//储存代码[函数]void Select(HuffmanTree HT,int end,int *sl,int *s2)/*在0~END之间,找出最小和次小的两个节点序号,返吲S1、S2*/{int i;int min 1=INT_MAX;int min 2=INT_MAX;for(i=0;i<=end;i++){/*找最小的节点序号*/if(( (1) )&&(HT[i].weight<minl)){*s1=i;min 1=HT[i].weight;}}for(i=0;i<=end;i++){/*找次小节点的序号*/if((HT[i].parent==0)&&( (2) )&&(min 2>HT[i].weight)){*s2=i;min 2=HT[i].weight;}}}void HuffmanTreeCreat(HuffmanTree&HT)/*建立HUFFMAN树*/{int i;int m=2*n-1;int s1,s2;for(i=n;i<m;i++){Select( (3) );HT[s1].parent=i;HT[s2].parent=i;HT[s1].sigh=left child;HT[s2].sigh=right child;HT[i].weight= (4) ;}}void HuffmanTreeEncoding(char sen[],HuffmanTree HT){ /*将句子进行编码*/int i=0;int j;while(sen[i] !=’\0’){for(j=0;j<n;j++){if(HT[j].letter==sen[i])(/*字母吻合则用代码取代*/strcat(coding, (5) );break;}}i++;if (Sen [1]==32) i++;}printf("\n%s",coding);} (1)处填()。

在窗体上画一个命令按钮,然后编写如下事件过程: Option Base1 Private Sub Command1_Click() Dim a s=Array(1,2,3,4) j=1 For i=4 To 1 Step-1 s=s+a(i)*j j=j*10 Next i Print S End Sub 运行上面的程序,单击命令按钮,其输出结果是 【15】 。

Because Web servers are platform and application (71) they can send or request data from legacy or external applications including databases. All replies, once converted into (72) mark-up language, can then be transmitted to a (73) . Used in this way, Intranets can (74) lower desktop support costs, easy links with legacy applications and databases and, (75) all, ease of use.

A. supertext
B. plaintext
C. hypertext
D. ciphertext

Questions 4 to 7 are based on the following conversation. At the end of the conversation, you will be given 20 seconds to answer the questions. Now listen to the conversation. Why did Miss Barnes refuse the man’s final offer

A. She feels her value wasn’t appreciated.
B. She wants a more interesting job.
C. She’s tired of working.
D. She wants more money.

答案查题题库