【单选题】【消耗次数:1】
7.He looked around and caught a man____his hand into the pocket of a passenger.
put
to be put
to put
putting
参考答案:
复制
纠错
相关题目
【单选题】 He looked around and caught a man________his hand into the pocket of a passenger.
①  put
②  to be putting
③  to put
④  putting
【单选题】 He looked around and caught a man ____ his hand into the pocket of a passenger.
①  ?put
②  ?to be putting
③  ? to put
④  putting
【单选题】 He put all his things [] his suitcase.
①  in
②  into
【单选题】 16. He was put into prison, but he never _____ ,and continued his fight.
①  gave up
②  gave in
③  stopped
④  gave way
【单选题】 It was his fault,but he put the blame on others—thats _______ we cant agree.
①  where
②  what
③  how
④  which
【单选题】 7.He saw the police cars ______ around the corner.
①  scream
②  jolt
③  screech
④  cling
【单选题】 The date is put at the [] corner.
①  upper right-hand
②  upper left-hand
【判断题】 A: May I put my books here? B: Yes, put them please.
①  正确
②  错误
【判断题】 Don’t put your dirty clothes here. Put them away.
①  正确
②  错误
【单选题】 My brother can take his car apart and put it back together again. I certainly wish he______ me how.
①  would teach
②  has taught
③  will teach
④  teaches
随机题目
【单选题】 下列广义表是线性表的有
①  E=(a,(b,c))
②  E=(a,E)
③  E=(a,b)
④  E=(a,L);L=()
【单选题】 设某有向图的邻接表中有n个表头结点和m个表结点,则该图中有()条有向边。
①  n
②  n-1
③  m
④  m-1
【单选题】 若有18个元素的有序表存放在一维数组A[19]中,第一个元素放A[1]中,现进行二分查找,则查找A[3]的比较序列的下标依次为()
①  1,2,3
②  9,5,2,3
③  9,5,3
④  9,4,2,3
【单选题】 设一组权值集合W=(15,3,14,2,6,9,16,17),要求根据这些权值集合构造一棵哈夫曼树,则这棵哈夫曼树的带权路径长度为()。
①  129
②  219
③  189
④  229
【单选题】 设无向图G中的边的集合E={(a,b),(a,e),(a,c),(b,e),(e,d),(d,f),(f,c)},则从顶点a出发进行深度优先遍历可以得到的一种顶点序列为()。
①  aedfcb
②  acfebd
③  aebcfd
④  aedfbc
【单选题】 设指针q指向单链表中结点A,指针p指向单链表中结点A的后继结点B,指针s指向被插入的结点X,则在结点A和结点B插入结点X的操作序列为()。
①  s-next=p-next;p-next=-s
②  q-next=s;s-next=p
③  p-next=s-next;s-next=p
④  p-next=s;s-next=q
【单选题】 设二叉排序树上有n个结点,则在二叉排序树上查找结点的平均时间复杂度为()。
①  O(n)
②  O(n2)
③  O(nlog2n)
④  O(1og2n)
【单选题】 设有6个结点的无向图,该图至少应有()条边才能确保是一个连通图。
①  5
②  6
③  7
④  8
【单选题】 若线性表最常用的操作是存取第i个元素的值,则采用_______存储方式节省时间。
①  单链表
②  双链表
③  单循环链表
④  顺序表
【单选题】 设指针变量front表示链式队列的队头指针,指针变量rear表示链式队列的队尾指针,指针变量s指向将要入队列的结点X,则入队列的操作序列为()。
①  front-next=s;front=s;
②  s-next=rear;rear=s;
③  rear-next=s;rear=s;
④  s-next=front;front=s;