[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fd797yV8uwJYsePkwpErdjG9xOUuhCkch5lcIvgIN7ZA":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":10,"question":16,"related":17,"source":27,"type":43},[],"2023-05-10 03:01:16",88978819,[8,9],"对","错",{"courseId":11,"courseImg":12,"courseName":13,"workId":14,"workName":15},"1000063122","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F3556e68aca20d907d8778d02515aa8c4.png","离散数学（下）","35657985","离散数学（下）教程考试","哈夫曼算法可用来求解最优二叉树,且最优树唯一",[18,29,38,44,54,63,72,81],{"answer":19,"createTime":5,"id":20,"options":21,"question":26,"source":27,"type":28},[],88978705,[22,23,24,25],"n","n-1","m-n-1","m-n+1","n阶m条边的无向连通图G,则其生成树T的弦的条数为","v2",0,{"answer":30,"createTime":5,"id":31,"options":32,"question":37,"source":27,"type":28},[],88978717,[33,34,35,36],"1","2","3","5","\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F349032e0ba21924c4fedfc0a327d74d4.PNG\">",{"answer":39,"createTime":5,"id":40,"options":41,"question":42,"source":27,"type":43},[],88978740,[8,9],"欧拉图一定是强连通图",3,{"answer":45,"createTime":5,"id":46,"options":47,"question":52,"source":27,"type":53},[],88978760,[48,49,50,51],"a","b","c","d","设<G, *>是循环群,G={a,b,c,d},"*"运算定义如下,则群的生成元是*abcdaabcdbbcdaccdabddabc",1,{"answer":55,"createTime":5,"id":56,"options":57,"question":62,"source":27,"type":28},[],88978761,[58,59,60,61],"半群可以有无穷多个右单位元","半群一定有一个右单位元","半群如果有右单位元则一定有左单位元","半群一定至少有一个左单位元","关于半群,下列说法正确的是",{"answer":64,"createTime":5,"id":65,"options":66,"question":71,"source":27,"type":28},[],88978766,[67,68,69,70],"不能构成群","不一定能构成群","必能构成群","能构成交换群","任意具有多个等幂元的半群,下列说法正确的是",{"answer":73,"createTime":5,"id":74,"options":75,"question":80,"source":27,"type":28},[],88978791,[76,77,78,79],"半群","独异点","群","交换群","\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F63552fcfe39b3e305b6caa243aee3999.PNG\">",{"answer":82,"createTime":5,"id":6,"options":83,"question":16,"source":27,"type":43},[],[8,9]]