[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fZJA5rv8-NLtaVLyPTWJTSyFW5GJBPvNnb9t_b_kaIdE":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":19,"related":20,"source":30,"type":31},[],"2025-12-21 14:34:24",277745255,[8,9,10,11],"堆排序,冒泡排序","归并排序,冒泡排序","快速排序,堆排序","直接选择排序,归并排序",{"count":13,"courseId":14,"courseImg":15,"courseName":16,"workId":17,"workName":18},97,"53e1d2ef4961cca8eea3e23969ad2cb9","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F03a579384a6dc297c89809b582fcc767.png","默认课程","exam_167930247","2025计科专升本期末复习题","下列排序算法中,其中( )是稳定的",[21,32,41,50,59,68,71,80,89,98],{"answer":22,"createTime":5,"id":23,"options":24,"question":29,"source":30,"type":31},[],277745250,[25,26,27,28],"中序序列","层次序列","先序序列","后序序列","森林的先序遍历序列等同于对应的二叉树的( )","v1",0,{"answer":33,"createTime":5,"id":34,"options":35,"question":40,"source":30,"type":31},[],277745251,[36,37,38,39],"10至1 024之间","11至1 025之间","11","10","一个具有1025个结点的二叉树的高h为( )",{"answer":42,"createTime":5,"id":43,"options":44,"question":49,"source":30,"type":31},[],277745252,[45,46,47,48],"深度优先遍历","求最短路径","拓扑排序","求关键路径","下面( )方法可以判断出一个有向图是否有环",{"answer":51,"createTime":5,"id":52,"options":53,"question":58,"source":30,"type":31},[],277745253,[54,55,56,57],"nlogn","n+1","n-1","n","一个n个顶点的连通无向图,其边的个数至少为( )",{"answer":60,"createTime":5,"id":61,"options":62,"question":67,"source":30,"type":31},[],277745254,[63,64,65,66],"V7V3V5V4V6V1V2V0","V3V1V7V0V4V5V6V2","V0V1V2V3V4V5V6V7","V2V0V1V5V6V3V4V7","下列哪个不是下面无向图的广度优先搜索结果? \u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Fe0e28ed0cc6c38fea832ab3c1963ef61.webp\">",{"answer":69,"createTime":5,"id":6,"options":70,"question":19,"source":30,"type":31},[],[8,9,10,11],{"answer":72,"createTime":5,"id":73,"options":74,"question":79,"source":30,"type":31},[],277745256,[75,76,77,78],"ëlog2nû+1","log2n+1","ëlog2nû","log2n-1","一棵具有 n个结点的完全二叉树的高度(深度)是( )",{"answer":81,"createTime":5,"id":82,"options":83,"question":88,"source":30,"type":31},[],277745257,[84,85,86,87],"非空","空","指向最右孩子","指向最左孩子","利用二叉链表存储树,则根结点的右指针是( )",{"answer":90,"createTime":5,"id":91,"options":92,"question":97,"source":30,"type":31},[],277745258,[93,94,95,96],"F","D","E","C","对以下有向图(directed graph),若使用深度优先搜寻(depth-first search) 的顺序,从节点A开始进行搜寻,当某一节点具有一个以上的向外邻接点(outgoing link) 时,其越左方的邻接点优先权越高.令A为第一个遇到的节点,则第六个遇到的节点为( ). \u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F188eb7a1ac561044e8b749a6a78a60d3.webp\">",{"answer":99,"createTime":5,"id":100,"options":101,"question":106,"source":30,"type":31},[],277745259,[102,103,104,105],"1\u002F2 2","1\u002F2 1","2 1","2 2","在一个无向图中,所有顶点的度数之和等于所有边数( )倍,在一个有向图中,所有顶点的入度之和等于所有顶点出度之和的( )倍"]