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