elm elm elm elm
tree elm elm elm
tree elm elm tree
tree elm tree elm
第1题:
finalclassTree{privatestaticStringtree="tree";StringgetTree(){returntree;}}classElmextendsTree{privatestaticStringtree="elm";publicstaticvoidmain(String[]args){newElm().go(newTree());}voidgo(Treet){Strings=t.getTree()+Elm.tree+tree+(newElm().getTree());System.out.println(s);}}结果为:()
A.elmelmelmelm
B.treeelmelmelm
C.treeelmtreeelm
D.编译失败
第2题:
下面程序段的输出结果为 public class Test { public static void main(String args[]) { boolean a,b,c; a=(3<5); b=(a==true); System.out.println(”a=”+a+”b=+b) ; c=(b==false); System.out.printhln(”b=”+b+”c=”+c) ; } }
A.a=true b=false b=true c=false
B.a=true b=false b=true c=true
C.a=true b=true b=tree c=false
D.a=false b=false b=tree c=false
第3题:
●Traversing a binary tree in preorder is equivalent to (68) .
(68) A.Traversing the forest corresponding to the binary tree in root-first order
B.Traversing the forest corresponding to the binary tree in root-last order
C.Traversing the forest corresponding to the binary tree in breadth-first order
D.None of the above
第4题:
A. spanning-tree mode rapid-pvst
B. spanning-tree uplinkfast
C. spanning-tree backbonefast
D. spanning-tree mode mst
第5题:
考虑如下代码:
class Tree{}
class Pine extends Tree{}
class Oak extends Tree{}
public class Forest {
public static void main( String[] args ) {
Tree tree = new Pine();
if( tree instanceof Pine )
System.out.println( "Pine" );
if( tree instanceof Tree )
System.out.println( "Tree" );
if( tree instanceof Oak )
System.out.println( "Oak" );
else
System.out.println( "Oops" );
}
}
则输出结果中有哪些?
A.Pine B.Tree C.Forest D.Oops E.无输出
第6题:
现有:
classTree{
privatestaticStringtree="tree";
StringgetTree(){returntree;}
}
classElmextendsTree{
privatestaticStringtree="elm";
publicstaticvoidmain(String[]args){
newElm().go(newTree());
}
}
voidgo(Treet){
Strings=t.getTree()+Elm.tree+tree+(newElm().getTree());
System.out.println(s);}
结果为:()
第7题:
Traversing a binary tree in preorder is equivalent to(68).
A.Traversing the forest corresponding to the binary tree in root-first order
B.Traversing the forest corresponding to the binary tree in root-last order
C.Traversing the forest corresponding to the binary tree in breadth-first order
D.None of the above
第8题:
It is believed that the tradition of having a pine tree as a Christmas Tree comes from Germany.()
第9题:
A. spanning-tree backbonefast
B. spanning-tree uplinkfast
C. spanning-tree portfast
D. spanning-tree cost512
第10题:
The cottonwood tree Mr. Flanagan found was an extremely tall tree with broad leaves.