A hope
B have hoped
C had hoped
D hoped
第1题:
When did you last write to Peter? -Oh, I( )to him for ages.
A. didn’t write
B. don't write
C. wasn't writing
D. haven't written
第2题:
下面程序输出的结果是( )。 #include<iostream> using namespace std; void main() { char ch[][8]={"good","better","best"}; for(int i=1;i<3;++i) { cout<<ch[i]<<endl; } }
A.good better
B.better best
C.good best
D.good
第3题:
[A] get
[B] take
[C] work
[D] try
第4题:
3. Good. I'll _________ (有空)then.
第5题:
第6题:
I’m sorry; this kind of T-shirt is not ______ in your color and size.
A、unavailable
B、available
C、avoidable
D、able
第7题:
在下面附属类方法中的下划线处应填入的正确参数是( )。 public void writeData( ______ ) throws IOException{ GregorianCalendar calendar=new GregorianCalendar(); calendar.setTime(hireDay); out.println(name+"|"+salary+"|" +calendar.get(Calendar.YEAR)+"I" +(calendar.get(Calendar.MONTH)+1)+"|" +calendar.get(Calendar.DAY_OF_MONTH)); }
A.Employee[]e
B.employee.dat
C.PrintWriter out
D.BufferedWriter
第8题:
A、think
B、prefer
C、get
第9题:
第10题:
下面的代码用于输出字符数组ch中每个字符出现的次数,应该填入的代码是()public static void main(String[] args) { char[] ch = { 'a', 'c', 'a', 'b', 'c', 'b' }; HashMap map = new HashMap(); for (int i = 0; i < ch.length; i++) { < 填入代码 > } System.out.println(map); }
A.if (map.contains(ch[i])) { map.put(ch[i], map.get(ch[i]) + 1); } else { map.put(ch[i], 1); }
B.if (map.contains(ch[i])) { map.put(ch[i], (Integer) map.get(ch[i]) + 1); } else { map.put(ch[i], 1); }
C.if (map.containsKey(ch[i])) { map.put(ch[i], (int) map.get(ch[i]) + 1); } else { map.put(ch[i], 1); }
D.if (map.containsKey(ch[i])) { map.put(ch[i], (Integer) map.get(ch[i]) + 1); } else { map.put(ch[i], 1); }