皮皮学，免费搜题
登录
搜题
【单选题】
设长度为n的队列用单循环表示且仅设头指针,则进队操作的时间复杂度为( ) 。A.
O(1)
B.
O(log 2 n)
C.
O(n)
D.
O(n 2 )
拍照语音搜题，微信中搜索"皮皮学"使用
参考答案：
参考解析：
知识点：
皮皮学刷刷变学霸
举一反三
【单选题】When is a switched network that is running the Spanning Tree Protocol considered to be fully converged?
A.
when all switches have the same BID as the root switch
B.
when all switches have received the MAC address of each neighboring switch
C.
when every enabled switch port has been assigned a unique identifier
D.
when every operating switch port is in either the blocking or forwarding state
E.
when all switches are in either client, server, or transparent mode
【简答题】连词成句。 1. the, tree, behind, is, who (?) __________________________________________________________ 2. Jenny, is, where (?) __________________________________________________________ 3. is, in, front, ...
【单选题】When the apples______ the tree are red ,you can always see many boys ______ the tree. [ ]
A.
in；on
B.
in；in
C.
on；on
D.
on；in
相关题目：