成考院校在线答案
- 2022-09-12 [判断] <p class="MsoNormal" align="left" style="margin-bottom:7.5pt;text-align:left; mso-pagination:widow-orphan;background:white">7、<span style="font-size:12.0pt; font-family:Microsoft Yahei;mso-ascii-font-family:"Times New Roman";mso-hansi-font-family: "Times New Roman";color:windowtext">在任何图中，奇数度的结点数必是偶数。</span><span lang="EN-US" style="mso-bidi-font-size:10.5pt;color:windowtext;mso-font-kerning: 0pt"> <o:p></o:p></span></p>
- 2022-09-12 [判断] <p class="MsoNormal" style="mso-pagination:widow-orphan">15、<span style="font-size:12.0pt;font-family:Microsoft Yahei;mso-bidi-font-family:Arial;color:windowtext; mso-font-kerning:0pt">任何连通图<span lang="EN-US">G</span>至少存在一棵生成树。</span><span lang="EN-US" style="mso-bidi-font-size:10.5pt;color:windowtext;mso-font-kerning: 0pt"> <o:p></o:p></span></p>
- 2022-09-12 [判断] <p class="MsoNormal" align="left" style="margin-bottom:7.5pt;text-align:left; mso-pagination:widow-orphan;background:white">14、<span style="font-size:12.0pt; font-family:Microsoft Yahei;mso-bidi-font-family:Arial;color:windowtext;mso-font-kerning: 0pt">若关系<span lang="EN-US">R</span>是对称的，则其关系图中若两个结点之间有弧线，就一定是有双向两条弧。</span><span lang="EN-US" style="mso-bidi-font-size:10.5pt;color:windowtext;mso-font-kerning: 0pt"> <o:p></o:p></span></p>
- 2022-09-12 [判断] <p class="MsoNormal" align="left" style="margin-bottom:7.5pt;text-align:left; mso-pagination:widow-orphan;background:white">4、<span style="font-size:12.0pt; font-family:Microsoft Yahei;mso-bidi-font-family:Arial;color:windowtext;mso-font-kerning: 0pt">强连通图一定是单向连通图。</span><span lang="EN-US" style="mso-bidi-font-size:10.5pt; color:windowtext;mso-font-kerning:0pt"> <o:p></o:p></span></p>
- 2022-09-12 [判断] <p class="MsoNormal" align="left" style="margin-bottom:7.5pt;text-align:left; mso-pagination:widow-orphan;background:white">16、<span style="font-size:12.0pt; font-family:Microsoft Yahei;mso-bidi-font-family:Arial;color:windowtext;mso-font-kerning: 0pt">大于<span lang="EN-US">100</span>的整数集合可以表示为<span lang="EN-US">{101,102,103</span>，<span lang="EN-US">…}</span>。 </span><span lang="EN-US" style="mso-bidi-font-size:10.5pt; color:windowtext;mso-font-kerning:0pt"> <o:p></o:p></span></p>
- 2022-09-12 [判断] <p class="MsoNormal" align="left" style="margin-bottom:7.5pt;text-align:left; mso-pagination:widow-orphan;background:white">15、<span lang="EN-US" style="font-size:12.0pt;font-family:Microsoft Yahei;mso-bidi-font-family:Arial;color:windowtext; mso-font-kerning:0pt"><span style="mso-spacerun:yes"> </span></span><span style="font-size:12.0pt;font-family:Microsoft Yahei;mso-bidi-font-family:Arial;color:windowtext; mso-font-kerning:0pt">一个从<span lang="EN-US">A</span>到<span lang="EN-US">B</span>的二元关系是有序偶的集合<span lang="EN-US">R</span>，在每一个有序偶中，第一个元素取自<span lang="EN-US">A</span>，第二个元素取自<span lang="EN-US">B</span>。</span><span lang="EN-US" style="mso-bidi-font-size:10.5pt; color:windowtext;mso-font-kerning:0pt"> <o:p></o:p></span></p>
- 2022-09-12 [判断] <p class="MsoNormal" align="left" style="margin-bottom:7.5pt;text-align:left; mso-pagination:widow-orphan;background:white">11、<span style="font-size:12.0pt; font-family:Microsoft Yahei;mso-bidi-font-family:Arial;color:windowtext;mso-font-kerning: 0pt">不同的生成树的基本割集可能不一样，但基本割集的个数是固定的。</span><span lang="EN-US" style="mso-bidi-font-size: 10.5pt;color:windowtext;mso-font-kerning:0pt"> <o:p></o:p></span></p>
- 2022-09-12 [判断] <p class="MsoNormal" align="left" style="margin-bottom:7.5pt;text-align:left; mso-pagination:widow-orphan;background:white">20、<span style="font-size:12.0pt; font-family:Microsoft Yahei;mso-ascii-font-family:"Times New Roman";mso-hansi-font-family: "Times New Roman";color:windowtext">只由一个孤立结点构成的图称为平凡图。</span><span lang="EN-US" style="mso-bidi-font-size:10.5pt;color:windowtext;mso-font-kerning: 0pt"> <o:p></o:p></span></p>
- 2022-09-12 [判断] <p class="MsoNormal" align="left" style="margin-bottom:7.5pt;text-align:left; mso-pagination:widow-orphan;background:white">17、<span style="font-size:12.0pt; font-family:Microsoft Yahei;mso-bidi-font-family:Arial;color:windowtext;mso-font-kerning: 0pt">不含有任何元素的集合，称为空集，记作</span><span lang="EN-US" style="font-size:12.0pt; font-family:Symbol;mso-ascii-font-family:Microsoft Yahei;mso-hansi-font-family:Microsoft Yahei; mso-bidi-font-family:Arial;color:windowtext;mso-font-kerning:0pt;mso-char-type: symbol;mso-symbol-font-family:Symbol"><span style="mso-char-type:symbol; mso-symbol-font-family:Symbol">F</span></span><span style="font-size:12.0pt; font-family:Microsoft Yahei;mso-bidi-font-family:Arial;color:windowtext;mso-font-kerning: 0pt">。</span><span lang="EN-US" style="mso-bidi-font-size:10.5pt;color:windowtext; mso-font-kerning:0pt"> <o:p></o:p></span></p>
- 2022-09-12 [判断] <p class="MsoNormal" align="left" style="margin-bottom:7.5pt;text-align:left; mso-pagination:widow-orphan;background:white">9、<span style="font-size:12.0pt; font-family:Microsoft Yahei;mso-bidi-font-family:Arial;color:windowtext;mso-font-kerning: 0pt">克鲁斯卡尔<span lang="EN-US">(Kruskal)</span>算法可以求最小生成树。</span><span lang="EN-US" style="mso-bidi-font-size:10.5pt;color:windowtext;mso-font-kerning: 0pt"> <o:p></o:p></span></p>