下面的文件正确吗？为什么？用IE和本章中的解析器验证你的结论。 mes.dtd ＜!ELEMENT message ANY＞ ＜!ELEMENT persion (name,age?,lxfs)＞ ＜!ELEMENT lxfs (#PCDATA,tel|email)*＞ ＜!ELEMENT name (first,last)＞ ＜!ATTLIST name sex (male|female) "male"＞ ＜!ELEMENT first %pc; ＞ ＜!ELEMENT last %pc;＞ ＜!EL

Using the situation stated in the Special window, which WBS element is behind schedule but under budget?

A . Element P

B . Element Q

C . Element R

D . Element S

E None of the above.

101 Using the situation stated in the Special window, which WBS element is behind schedule but under budget?

A. Element P

B. Element Q

C. Element R

D. Element S

E. None of the above

Which of the following networking methods allows us to show that the last % of one element cannot be completed until % of a previous element has been completed?

A.PERT

B.ADM

C.PDM

D.All of the above.

E.A and C only.

In C launguage, when an array name is passed to a function, what is passed is the ______ of the beginning of the array.

A．data

B．value

C．location

D．element

A.（（Element）doc.getElementsByTagName（“PERSON”）.item（0））.getNodeValue（）

B.（（Element）doc.getElementsByTagName（“PERSON”）.item（0））.getElementsByTagName（“NAME”）.item（0）.getFirstChild（）.getNodeValue（）

C.（（Element）doc.getElementsByTagName（“PERSON”）.item（0））.getElementsByTagName（“NAME”）.item（0）.getNodeValue（）

D.（（Element）doc.getElementsByTagName（“PERSON”）.item（0））.item（0）.getNodeValue（）

161 Which of the following networking methods allows us to show that the last 10% of one element cannot be completed until 62% of a previous element has been completed?

A. PERT

B. ADM

C. PDM

D. All of the above.

E. A and C only

102 Using the situation stated in the Special window, which WBS element has a favorable cost variance of $150?

A. Element P

B. Element Q

C. Element R

D. Element S

E. None of the above

Using the situation stated in the Special window, which WBS element has a favorable cost variance of $150?

A . Element P

B . Element Q

C . Element R

D . Element S

E . None of the above.

函数Node *difference(A,B)用于求两个集合之差C=A-B，即当且仅当e是A中的一个元素，但不是B中的元素时，e是C中的元素。集合用有序链表实现，用一个空链表表示一个空集合，表示非空集合的链表根据元素之间按递增排列。执行C=A-B之后，表示集合A和B的链表不变，若结果集合C非空，则表示其链表根据元素之值按递增排列。函数append()用于在链表中添加节点。

[C函数]

typedef struct node{

int element;

struct node *link；

}Node；

Node *A，*B，*C；

Node *append(last，e)

Node *last；

int e；

{last-＞link=(Node *)malloc(sizeof(Node))；

last-＞link-＞element=e；

return(last-＞link)；

}

Node *difference(A,B)

Node *A，*B；

{ Node *c，*last；

C=last=(Node *)malloc(sizeof(Node))；

while( (1) )

if(A-＞element＜B-＞element){

last=append(last，A-＞element);

A=A-＞link：

}

else if( (2) ){

A：A-＞link；

B：B-＞link;

}

elSe

(3) ；

while( (4) ){

last=append(last，A-＞element)；

A=A-＞link：

}

(5) ;

last=c；

c=c-＞link;

free(last)；

return(c);

}