第1题：
Inflectional morphemes are added to the end of words to show grammatical concepts.()
第2题：
属于事务控制的语句是()。
A.Begin Tran、Commit、RollBack
B.Begin、Continue、End
C.Create Tran、Commit、RollBack
D.Begin Tran、Continue、End
第3题：
Christopher bought 4 cans of soup for a total of $3.36,which included sales tax of $0.16. At the same per-can cost, what is the cost before the sales tax is added for 6 cans of the same soup?
A.$0.80
B.$0.84
C.$4.80
D.$5.04
E.$6.40
第4题：
设计下列伪程序的语句覆盖测试用例。 BEGIN INPUT（A,B,C） IF A>5 THEN X=10 ELSE X=1 END IF IF B>10 THEN Y=20 ELSE Y=2 END IF IF C>15 THEN Z=30 ELSE Z=3 END IF PRINT(X,Y,Z) END
因为每个判定表达式为真或假时均有赋值语句，为了使每个语句都至少执行一次，总共需要两组测试数据，以便使得每个判定表达式取值为真或假各一次。下面是实现语句覆盖的典型测试用例：
（1）使3个判定表达式之值全为假
输入：A=1，B=1，C=1
预期的输出：X=1，Y=2，Z=3
（2）使3个判定表达式之值全为真
输入：A=20，B=40，C=60
预期的输出：X=10，Y=20，Z=30
略
第5题：
29． Why are green plants and grass helpful?
A． Because they can hold the water．
B． Because they can stop the wind from blowing the earth away．
C． Because they can keep the earth wet．
D．All the above．
第6题：
A. end-to-end communications path
B. hosts on the same Layer 2 broadcast domain
C. hosts on the same Layer 3 broadcast domain
D. routing information on participating Layer 3 devices
第7题：
第8题：
Which traversal method for a binary tree does the following Pascal code illustrate? Procedure traverse(p：pointer)； Begin Ifp<>NIL Then begin Traverse (p^．left)； Process(p)； Traverse(p^．right) End； End_
A．pre_order
B．middle_order
C．none
D．last_order
第9题：
Which traversal method for a binary tree does the following Pascal code illustrate? procedure traverse (p:pointer); begin if p<>nil then begin traverse(p ↑ .left); process(p); traverse(p ↑ .right); end end;
A．preorder
B．postorder
C．reorder
D．inorder
第10题：
public class AssertStuff { public static void main（String [] args） { int x= 5； int y= 7； assert （x> y）： “stuff”； System.out.println（”passed”）； } } And these command line invocations：java AssertStuff java -ea AssertStuff What is the result？（）