皮皮学，免费搜题
登录
搜题
【单选题】
向心轴承是以承受( )载荷为主。A.
径向
B.
轴向
C.
径向和轴向
D.
以上三者都可以
拍照语音搜题，微信中搜索"皮皮学"使用
参考答案：
参考解析：
知识点：
皮皮学刷刷变学霸
举一反三
【单选题】下面关于随机存取存储器(RAM)的叙述中,正确的是
A.
RAM分静态RAM（SRAM）和动态RAM（DRAM）两大类
B.
SRAM的集成度比DRAM的高
C.
DRAM的存取速度比SRAM的快
D.
DRAM中存储的数据无需“刷新”
【单选题】下面关于随机存取存储器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
【单选题】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
相关题目：