[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fS5g6QGGZIoHKiUGo4GNzPofj0s_1AQFlIEGTJ9K5GXY":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":19,"related":20,"source":30,"type":31},[],"2024-12-03 21:48:37",168551648,[8,9,10,11],"广度优先生成树","子集树","深度优先生成树","排列树",{"count":13,"courseId":14,"courseImg":15,"courseName":16,"workId":17,"workName":18},27,"275e9e64f64491da611437cd86495060","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F48eba3395437dd881b1b9275a0ad1028.png","算法设计与分析","work_38984651","第5章 回溯法","回溯法解旅行售货员问题时的解空间树是( )",[21,32,42,51,61,66,71,74,81,86],{"answer":22,"createTime":5,"id":23,"options":24,"question":29,"source":30,"type":31},[],168396581,[25,26,27,28],"广度优先","最小耗费优先","深度优先","活结点优先","回溯法在解空间树T上的搜索方式是( )","v1",0,{"answer":33,"createTime":34,"id":35,"options":36,"question":41,"source":30,"type":31},[],"2024-12-01 17:36:22",168396582,[37,38,39,40],"2n","2n+1-1","n","\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Ff15ce6c5f8b341974762f2ffa0085c6a.png\">","对于含有n个物品的0-1背包问题,其解空间的叶结点数目为( )",{"answer":43,"createTime":5,"id":44,"options":45,"question":50,"source":30,"type":31},[],168396583,[46,47,48,49],"回溯法","动态规划法","回溯法和分支限界法","分支限界法","在对问题的解空间树进行搜索的方法中,一个活结点最多有一次机会成为活结点的是( )",{"answer":52,"createTime":53,"id":54,"options":55,"question":60,"source":30,"type":31},[],"2024-12-02 16:47:08",168396584,[56,57,58,59],"扩展结点","叶结点","活结点","死结点","在回溯法中,一个正在产生儿子的结点称为()",{"answer":62,"createTime":5,"id":63,"options":64,"question":65,"source":30,"type":31},[],168551640,[59,58,57,56],"一个自身已生成但其儿子还没有全部生成的节点称做()",{"answer":67,"createTime":53,"id":68,"options":69,"question":70,"source":30,"type":31},[],168551644,[39,40,38,37],"对于含有n个元素的排列树问题,其解空间的叶结点数目为( )",{"answer":72,"createTime":5,"id":6,"options":73,"question":19,"source":30,"type":31},[],[8,9,10,11],{"answer":75,"createTime":76,"id":77,"options":78,"question":79,"source":30,"type":80},[],"2024-12-02 20:34:40",168609079,[],"回溯法中的解空间树结构通常有两种,分别是 、",2,{"answer":82,"createTime":76,"id":83,"options":84,"question":85,"source":30,"type":80},[],168609080,[],"图的m着色问题:给定无向连通图G和m种不同的颜色.用这些颜色为图G的各顶点着色,每个顶点着一种颜色.如果有一种着色法使G中每条边的两个顶点着不同颜色,则称这个图是m可着色的.图的m着色问题是对于给定图G和m种颜色,找出所有不同的着色法. 用回溯法解该问题,构造的解空间树是()",{"answer":87,"createTime":76,"id":88,"options":89,"question":90,"source":30,"type":80},[],168609081,[],"0-1背包问题的回溯算法所需的计算时间为_____________,用动态规划算法所需的计算时间为____________"]