皮皮学，免费搜题
登录
搜题
【单选题】
要实现 ,JK触发器的J、K取值应为 ( )。A.
J=1，K=1
B.
J=0，K=1
C.
J=1，K=0
D.
J=0，K=0
手机使用
分享
复制链接
新浪微博
分享QQ
微信扫一扫
反馈参考答案：
举一反三
【单选题】下面关于随机存取存储器RAM的叙述中，正确的是( )
A.
RAM分静态RAM（SRAM）和动态RAM（DRAM）两大类，我们通常所讲的内存由DRAM组成，SRAM主要用来做高速缓冲存储器。
B.
SRAM的集成度比DRAM高
C.
DRAM的存取速度比SRAM快
D.
DRAM中存储的数据无须“刷新”
【单选题】In the Dijkstra’s algorithm example discussed in the lecture, each node label represents:
A.
Estimated shortest distance from the source to that node
B.
Estimated shortest distance between that node and one of its neighboring nodes
C.
Estimated shortest distance between that node to the final destination
D.
None of the options given
【简答题】尸冷(algor mortis)(名词解释)
【多选题】赵某在其公司的加班费1000元一直没有得到,由劳动行政部门责令限期支付加班费,期公司仍未支付,劳动行政部门责令加付赔偿金。下列各项中可以作为方某赔偿金的有 )元。
A.
550
B.
800
C.
1000
D.
2000
【单选题】The Dijkstra’s algorithm is a greedy algorithm because:
A.
At each step, the algorithm picks the link with the smallest cost
B.
At each step, the algorithm picks the node with the smallest estimated distance
C.
At each step, the algorithm picks the path with the smallest number of links
D.
None of the options given
【简答题】尸冷（algor mortis）
【简答题】尸冷 ( algor mortis)
【单选题】In the Dijkstra’s algorithm example discussed in the lecture, after all nodes are considered,
A.
Every possible shortest path between any two nodes are found
B.
Shortest paths from the source to every other nodes are found
C.
Every possible shortest path made up of different number of links are found
D.
All of the options given
相关题目：
参考解析：
知识点：
题目纠错 0
发布
