更多“I tried phoning her office, but I couldn’t _______.A. get along B. get on C. get to D. ”相关问题
  • 第1题:

    snmp有五种消息,包括get-request、set-request、get-next-request、get-response、trap,其中由manager发给agent的有()

    A.get-request

    B.set-request

    C.get-next-request

    D.get-response


    参考答案:ABC

  • 第2题:

    定义属性错误的是()。

    A、public int A{ get {return "100"}}

    B、public int A( get;set;)

    C、public int A{ get;set;}

    D、public int A{ get;}


    正确答案:B

  • 第3题:

    As a teacher, we should try to _______ it _______ to our students how helpful a correct learning method is.

    A.get, about
    B.get; away
    C.get; across
    D.get; off

    答案:C
    解析:
    本题考查动词短语辨析
    C选项,句意为“作为老师,我们应该尽量让学生理解一种正确的学习方法是多么的有帮助”。get across在此意为“使……被理解”,符合题意,综上,C选项正确。
    A选项,get about “四处走走;(消息等)传播出去”,故排除。
    B选项,get away“离开;逃脱,逃跑”,故排除。
    D选项,get off “动身;逃脱惩罚”,故排除。
    故正确答案为 C项。

  • 第4题:

    snmpv1实现的请求/响应原语包括()。

    A.get-request、set-request、get-next-request、get-response、trap

    B.get、getNext、set、trap

    C.get-request、set-request、get-next-request、get-response

    D.get、set、trap


    参考答案:A

  • 第5题:

    YouhaveanExchangeServer2010organization.Youneedtoidentifythefollowinginformationforauser’sailbox:ThesizeofitemsintheInboxfolderThenumberofitemsintheDeletedItemsfolderYoumustachievethisgoalbyusingtheminimumamountofadministrativeeffort.Whichcmdletshouldyourun?()

    A.Get-Mailbox Folder

    B.Get-Mailbox Folder Statistics

    C.Get-Mailbox Statistics

    D.Get-Store Usage Statistics


    参考答案:B

  • 第6题:

    下面的代码用于输出字符数组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); }


    if (map.containsKey(ch[i])) { map.put(ch[i], (Integer)map.get(ch[i]) + 1); } else { map.put(ch[i], 1); }