A、mustn't have
B、wouldn't have
C、shouldn't have
D、won't have
第1题:
A.put...up
B.put...away
C.put...down
D.put...off
第2题:
A、should
B、need
C、must
D、may
第3题:
A.may
B.can
C.ought to
D.need
第4题:
36. We ___________ keep the new traffic law and learn how to protect ourselves.
A.may.
B.should
C.can
D.need
第5题:
3.—__________ 1 go out for a while?
—No,you __________ You must finish your homework first.
A. Must,needn't
B. Can,may
C. May,mustn't
D. May,must
第6题:
A.put...away
B.put ...up
C.put...off
D.put...down
第7题:
Our tradition ______ be different _____ yours.
A、can;with
B、must;with
C、need;as
D、may;from
第8题:
May I take this book out of the reading room? No,you . You read it in here. ( )
A. mightn’t
B. won’t
C. need’t
D. mustn’t
第9题:
---I haven’t got the reference book yet, but I’ll have a test on the subject next month.
---Don’t worry. You______ have it by Friday.
A. could
B. shall
C. must
D. may
第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); }