[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fwsLRDWXevx4-S0rwgIePTKITY2iy4_807Fjz6ODyXkw":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":13,"question":20,"related":21,"source":31,"type":93},[],"2023-05-16 02:55:03",12136622,[8,9,10,11,12],"平面图","半哈密顿图","半欧拉图","二分图","连通图",{"count":14,"courseId":15,"courseImg":16,"courseName":17,"workId":18,"workName":19},10,"9bc6ef45d969b77a036e58f751e32373","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Ffb0773e0b2ccf61da9b9d862adfbc37a.png","离散数学","bd6271e38b5a47bcb25e0d73ce0a7dad","章节测试7","设G是一棵无向树,则G一定是()",[22,33,41,50,56,65,74,83,90,94],{"answer":23,"createTime":5,"id":24,"options":25,"question":30,"source":31,"type":32},[],12136614,[26,27,28,29],"10","5","3","2","设图G是有6个顶点的连通图,总度数为20,则从G中删去()条边后使之变成树","v1",0,{"answer":34,"createTime":5,"id":35,"options":36,"question":40,"source":31,"type":32},[],12136615,[37,38,29,39],"0","1","不确定","设G是一棵树,则G的生成树有()棵",{"answer":42,"createTime":5,"id":43,"options":44,"question":49,"source":31,"type":32},[],12136616,[45,46,47,48],"无回路的连通图","有n个结点,n−1条边的连通图","每对结点间都有路的图","连通但删去一条边则不连通的图","下面哪一种图不是树",{"answer":51,"createTime":5,"id":52,"options":53,"question":55,"source":31,"type":32},[],12136617,[29,28,54,27],"4","5个结点可构成的根树中,其元数m最多为()",{"answer":57,"createTime":5,"id":58,"options":59,"question":64,"source":31,"type":32},[],12136618,[60,61,62,63],"i=t−1","(m−1)i+1=t","(m−1)i=t","(m−1)t=i−1","完全m元树T中有t片树叶,i个分支,则有关系式()",{"answer":66,"createTime":5,"id":67,"options":68,"question":73,"source":31,"type":32},[],12136619,[69,70,71,72],"{11,00,10,01}","{a,b,c,ac,abc,bc}","{11,101,010,0001,0011}","{a,b,cb,cde}","下面给出的各符号串集合,哪个不是前缀码",{"answer":75,"createTime":5,"id":76,"options":77,"question":82,"source":31,"type":32},[],12136620,[78,79,80,81],"hdnibeajfkclgom","abdhinecfjkglmo","hnidebjkflomgcA","abcdefghijklmo","设T是如下的二元树T,下面()是对T先根遍历访问所有结点的结果?\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Fe2d795b870c5b7a9ede93d4c9405f8b9.png\">",{"answer":84,"createTime":5,"id":85,"options":86,"question":89,"source":31,"type":32},[],12136621,[29,87,88,28],"2.45","2.43","设6个字母在通信中出现的频率如下:a:35%,b:15%,c:20%,d:10%,e:15%,f:5%,用Huffman算法求传输它们的最佳前缀码.在这个前缀码中,编码一个字母需要的平均位数是多少",{"answer":91,"createTime":5,"id":6,"options":92,"question":20,"source":31,"type":93},[],[8,9,10,11,12],1,{"answer":95,"createTime":5,"id":96,"options":97,"question":102,"source":31,"type":93},[],12136623,[98,99,100,101],"强连通图","单向连通图","弱连通图","有向连通图","设G是一棵根树,则G一定是()"]