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