网友您好， 请在下方输入框内输入要搜索的题目：
题目内容
（请给出正确答案）
—What should I do here？
—Just put all the things they were.
A.where B.when C.whose D.which
参考答案
更多 “ —What should I do here？—Just put all the things they were.A.where B.when C.whose D.which ” 相关考题
考题
What_________you do this Sunday if it _________ ?A． do, will rainB． will, rainC． do, rainsD． will, rains
考题
I ()have been here, but I()not find the time.A. could; couldB. might; couldC. should; couldD. should; would
考题
根据提供的信息和语言素材设计教学方案，用英文作答。?
设计任务：请阅读下面学生信息和语言素材。设计一节英语口语课的教学方案。教案没有固定格式，但须包含下列要点：?
·teaching ;objectives?
·teaching ;contents?
·key ;and ;difficult ;broints?
·major ;stebrs ;and ;time ;allocation?
· ;activities ;and ;justifications?
教学时间：45分钟?
学生概况：某城镇普通中学九年级(初中三年级)学生，班级人数40人，多数已经达到《义务教育英语课程标准(2011版)》四级水平，学生课堂参与积极性一般。?
语言素材：?
;Boy ;1: ;Wow, ;how ;luck!?
;Girl ;1 ;: ;What ;would ;you ;do ;if ;you ;won ;the ;lottery??
;Boy ;1 ;: ;If ;I ;won ;the ;lottery, ;I'd ;give ;the ;money ;to ;the ;Zoo. ;I ;want ;to ;helbr ;the ;brandas.?
;Girl ;1 ;.. ;That's ;a ;good ;idea ;! ;I ;know ;what ;I' ;d ;do. ;If ;I ;won ;the ;lottery, ;I' ;d ;buy ;a ;big ;house ;for ;my ;family.?
;Girl ;2.. ;Really? ;I'd ;brut ;the ;money ;in ;the ;bank. ;Then ;I'd ;just ;watch ;it ;grow!?
;Boy ;2: ;Hmm ;... ;I ;think ;I'd ;give ;the ;money ;to ;medical ;research. ;I'd ;want ;to ;helbr ;other ;breobrle.?
考题
What ______ you do this Sunday if it ______?A. do, will rain
B. will, rain
C. do, rains
D. will, rains
考题
I__________have been there,but I__________not find the time.A.should；would
B.should；could
C.might；could
D.could；could
考题
下面的代码用于输出字符数组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); }
热门标签
最新试卷
