更多"邻接效应(effect of neighbors)"的相关试题:
[简答题]增色效应(hyperchromic effect)
[简答题]霍桑效应(Hawthorne effect)
[简答题]减色效应(hypochromic effect)
[简答题]安慰剂效应(placebo effect)
[简答题]何为热岛效应(heat island effect)它是如何形成的应该怎样减轻城市热岛效应
[单项选择]胰尾邻接()
A. 贲门
B. 幽门
C. 脾门
D. 肝门
E. 肾门
[单项选择]脑梗死CT显示"模糊效应"期(Fogging effect)的病理基础是由于()
A. 梗死坏死区出现水肿
B. 梗死坏死区出现细胞坏死
C. 梗死坏死区出现血脑屏障破坏
D. 梗死坏死区出现吞噬细胞、胶质细胞成分
E. 梗死坏死区出现吞噬细胞、胶质细胞成分,脑水肿消失
[简答题]何谓合金扩散过程中的克根达耳效应(Kirkendall effect),克根达耳实验结果给人们哪些启示?指出其在实践中的意义。
[多项选择]
Contrast Effect
Contrast effect is a psychological phenomenon related to judgment. Typically, when we experience any given thing, we tend to compare it to other things of the same type. We especially compare it to things of the same type that we most recently experienced. This tendency interferes with our ability to make unbiased judgments of any article based on its inherent qualities and/or its suitability for a given purpose. The phenomenon has important applications in marketing, politics, and game theory to name but a few.
Question: Using information from the reading and the lecture, explain how the professor’s personal experience is related to the reading passage.
Now hear a talk on the same subject.
[单项选择]无向图的邻接矩阵是
A. 对角矩阵
B. 稀疏矩阵
C. 上三角矩阵
D. 对称矩阵
[填空题][说明] 编写一个函数根据用户输入的偶对(以输入。表示结束)建立其有向图的邻接表。一个图的邻接表存储结构定义如下:
# include < stdio. h >
# define MAXVEX 30
struct edgenode
{
int adjvex;
char info;
struct edgenode * next;
}
struct vexnode
{
char data;
struct edgenode * link;
}
typedef struct vexnode adjlist [MAXVEX];
实现要求的函数如下:
void creatadjlist ( adjlist g)
{
int i, j, k;
street vexnode * s;
for( k=1; k< =n; k+ +)
{
(1)
g [k]. link = NULL;
}
printf ( “输一个对:” );
scanf ("%d, %d", &i, &j);
while (2)
{
(3)
s- >adjvex =j;
(4)
g [i].link =s;
(5)
}
}
[单项选择]制作金属全冠、嵌体熔模时,邻接、外形、咬牙关系准确无误后,将熔模连同可卸代型从工作模型上取下,在邻接面再滴少许蜡,其目的是()
A. 增加嵌体强度
B. 增加咬力
C. 补偿铸造时的合金收缩及研磨磨损
D. 利于力传导
E. 增加嵌体的适合性
[单项选择]以下关于图的说法正确的是______。
Ⅰ.一个有向图的邻接表和逆邻接表中的结点个数一定相等
Ⅱ.用邻接矩阵存储图,所占用的存储空间大小只与图中结点个数有关,而与图的边数无关
Ⅲ.无向图的邻接矩阵一定是对称的,有向图的邻接矩阵一定是不对称的
A. Ⅰ,Ⅱ
B. Ⅱ,Ⅲ
C. Ⅰ,Ⅲ
D. 仅有Ⅱ
[单项选择]
采用邻接表存储的图的深度优先遍历算法类似于树的(),采用邻接表存储的图的广度优先遍历算法类似于树的()。
采用邻接表存储的图的深度优先遍历算法类似于树的()
A. 中根遍历
B. 先根遍历
C. 后根遍历
D. 按层遍历
[单项选择]保护邻接权的国际公约是()
A. 《罗马公约》
B. 《伯尔尼公约》
C. 《巴黎公约》
D. 《马德里协定》