《计算机软件技术基础》复习题及答案(完美打印版).pdf

《《计算机软件技术基础》复习题及答案(完美打印版).pdf》由会员分享，可在线阅读，更多相关《《计算机软件技术基础》复习题及答案(完美打印版).pdf（37页珍藏版）》请在淘文阁 - 分享文档赚钱的网站上搜索。

1、计算机软件技术基础试题1.线性表的链式存储结构与顺序存储结构相比优点是 CD 。A.所有的操作算法实现简单B.便于随机存取C.便于插入和删除D.便于利用零散的存储器空间2.线性表是具有n 个 C 的有限序列。A.表元素B.字符C.数据元素D.数据项E.信息项3.若长度为n 的线性表采用顺序存储结构，在其第 I 个位置插入一个新元素的算法的时间复杂度为 C 。（1 I n+1）A.O(0)B.O(1)C.O(n)D.O(n2)4.设 A是一个线性表(a1,a2,an)，采用顺序存储结构，则在等概率的前提下，平均每插入一个元素需要移动的元素个数为 B ，平均每删除一个元素需要移动的元素个数为 A

2、；若元素插在ai与 ai+1之间(0 I n-1)的概率为)1()(2nnin，则平均每插入一个元素所要移动的元素个数为 C ；A.21nB.2nC.312 nD.413n5.下列函数中，按它们在n时的无穷大阶数，最大的是 D 。A.logn B.nlogn C.2n/2D.n!6.将下图所示的s 所指结点加到p 所指的结点之后，其语句应为：D 。A.s-next=p+1;p-next=s;B.(*p).next=s;(*s).next=(*p).next;C.s-next=p-next;p-next=s-next;D.s-next=p-next;p-next=s;7.将两个各有n 个元素的有

3、序表归并为一个有序表时，其最少的比较次数是 A 。A.n B.2n-1 C.n-1 D.2n 8.下面的程序段是合并两个无头结点链表(ha 和 hb)为一个无头结点链表ha 的过程，作为参数的两个链表都是按结点的data 域由大到小链接的。合并后新链表的结点仍按此方式链接。请填写下述空框，使程序能正确运行。#define NULL 0 s p next next next typedef struct node int data;struct node*next;node,linklisttype;void combine(linklisttype*ha,linklisttype*hb)lin

4、klisttype*h,*p;h=(linklisttype*)malloc(sizeof(linklisttype);h-next=NULL;p=h;while(ha!=NULL&hb!=NULL)if(ha-data=hb-data)/*较大的元素先插入*/p-next=(1);p=(2);(3);else p-next=(4);p=(5);(6);if(ha=NULL)(7);if(hb=NULL)(8);ha=h-next;free(h);参考答案：(1)ha(2)p-next (3)ha=ha-next(4)hb(5)p-next (6)hb=hb-next(7)p-next=hb(

5、8)p-next=ha 9.如果表A 中所有元素(a1,a2,an)与表B 的一个顺序子表(bk,bk+1,bk+n-1)完全相同（即a1=bk,a2=bk+1,an=bk+n-1），则称表A包含在表B中。设 ha，hb 为带头结点的单链表，分别表示有序表A和 B，下面的函数用于判别表A是否包含在表B中，若是，则返回true，否则返回 false。（提示：用递归实现）#define true 1#define false 0#define NULL 0 typedef struct node int data;struct node*next;node,linklisttype;int inc

6、lusion(linklisttype*ha,linklisttype*hb)linklisttype*pa,*pb;pa=ha-next;pb=hb-next;文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W

7、6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U

8、6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10

9、W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T

10、1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW

11、6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X

12、8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6 (1

13、);while(2)if(pa-data=pb-data)(3);else (4);(5);参考答案：(1)if(pa=NULL)return(true)(2)pb!=NULL&pa-data=pb-data(3)return(inclusion(pa,pb)(4)pb=pb-next;(5)return(false)10.在本题的程序中，函数create_link_list(n)建立一个具有n 个结点的循环链表；函数josephus(n,I,m)对由 create_link_list(n)所建立的具有n 个结点的循环链表按一定的次序逐个输出，并删除链表中的所有结点。参数n(n0)指明循环链表

14、的结点个数，参数I(1I n)指明起始结点，参数m（m0是步长），指明从起始结点或前次被删除并输出的结点之后的第m个结点作为本次被输出并删除的结点。例如，对于下图所示的具有6 个结点的循环链表，在调用josephus(6,3,2)后，将输出5,1,3,6,4,2。请在空框处填上适当内容，每框只填一个语句。#define NULL 0 typedef struct node int data;struct node*next;node,linklisttype;linklisttype*create_link_list(int n)linklisttype*head,*p,*q;int I;he

15、ad=NULL;if(n0)head=(linklisttype*)malloc(sizeof(linklisttype);p=head;for(I=1;Idata=I;q=(linklisttype*)malloc(sizeof(linklistttype);(1);(2);p-data=n;(3);/*建立从尾链到首的环形结构*/return(head);文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M

16、7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z

17、6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:

18、CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M

19、3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6

20、HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3

21、X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B

22、9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6 void Josephus(int n,int j,int m)linklisttype*p,*q;int j;p=create_link_list(n);for(;I1;I-)p=p-next;(4);while(jn)for(I=1;Inext;(5);printf(“%8d”,q-data);(6);free(q);j=j+1;参考答案：(1)p-next=q;(2)p=q;(3)p-next=

23、head(4)j=0(5)q=p-next;(6)p-next=q-next 11.在下列程序中，函数 difference(A,B)用于求两集合之差C=A-B，即当且仅当e 是 A中的一个元素，且不是B中的元素时，e 是 C中的一个元素。集合用有序链表实现，用一个空链表表示一个空集合，表示非空集合的链表根据元素之值按递增排列，执行 C=A-B之后，表示集合 A和 B的链表不变，若结果集合C非空，则表示它的链表应根据元素之值按递增序排列。函数 append()用于在链表中添加结点。#include#define NULL 0 typedef struct node int data;struc

24、t node*next;NODE;NODE*append(NODE*last,int x)last-next=(NODE*)malloc(sizeof(NODE);last-next-data=x;return(last-next);NODE*difference(NODE*A,NODE*B)文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T

25、1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW

26、6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X

27、8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编

28、码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W

29、6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U

30、6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10

31、W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6NODE*C,*last;C=last=(NODE*)malloc(sizeof(NODE);while(1)if(A-data data)last=append(last,A-data);A=A-next;else if(2)A=A-next;B=B-next;else (3);while(4)last=append(last,A-data);A=A-next;(5);last=C;C=C-next;free(last);return(C);参考答案：(1)A!=NU

32、LL&B!=NULL(2)A-data=B-data(3)B=B-next;(4)A!=NULL(5)last-next=NULL;12.阅读以下算法，填充空格，使其成为完整的算法。其功能是在一个非递减的顺序存储线性表中(从下标 1 处开始存储)，删除所有值相等的多余元素。#define MAXSIZE 30 typedef struct int elemMAXSIZE;int length;/*表长*/sqlisttype;void exam21(sqlisttype*L)int i,j;i=1,j=2;while(1)if(L-elemi!=L-elemj)文档编码:CC6W6M3Y9U6

33、 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W

34、3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1

35、B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6

36、M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8

37、Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码

38、:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6

39、M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6if(j!=(i+1)(2);L-length=L-length-(j-i-1);(3);else (4);if(jL-length)(5);参考答案：(1)jlength(2)for(int k=j

40、;klength;k+)L-elemk-(j-i-1)=L-elemk;(3)i+,j=i+1;(4)j+;(5)L-length=L-length-(j-i-1);break;13.用单链表表示的链式队列的队头在链表的 A 位置。A.链头B.链尾C.链中14.若用单链表表示队列，则应该选用 B 。A.带尾指针的非循环链表B.带尾指针的循环链表C.带头指针的非循环链表D.带头指针的循环链表15.在解决计算机主机与打印机之间速度不匹配问题时，通常设置一个打印数据缓冲区，主机将要输出的数据依次写入该缓冲区，而打印机则从该缓冲区中取出数据打印，先放入打印缓冲区的数据先被打印。该缓冲区应该是一个 B

41、结构。A.堆栈B.队列C.数组D.线性表16.若用一个大小为6 的数组来实现循环队列，且当前rear和 front的值分别为0 和 3。当从队列中删除一个元素，再加入两个元素后，rear 和 front的值分别为 B 。A.1 和 5 B.2和 4 C.4 和 2 D.5 和 1 17.设栈的输入序列为1,2，,10，输出序列为a1,a2,a10，若 a5=10，则 a7为 C 。A.4 B.8 C.不确定D.7 18.设栈的输入序列是1,2,3,4，则 D 不可能是其出栈序列。A 1243 B.2134 C.1432 D.4312 19.以下 D 是 C语言中”abcd321ABCD”的子串

42、。A.abcd B.321AB C.“abcABC”D.“21AB”20.若串 S=”software”，其子串的数目是 C 。A.8 B.37 C.36 D.9 21.将一个A1:100,1:100的三对角矩阵，按行优先存入一维数组B1:298中，A 中元素A66,65(即该元素的下标)在 B数组中位置k 为 B 。A.198 B.195 C.197 D.196 文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 Z

43、W6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3

44、X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档

45、编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6

46、W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9

47、U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM1

48、0W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10

49、T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z6文档编码:CC6W6M3Y9U6 HM10W3X10T1B9 ZW6M7N3X8Z622.设高为 h 的二叉树只有度为0 和 2 的结点，则此类二叉树的结点数至少为 B ，至多为 F 。高为 h 的完全二叉树的结点数至少为 E ，至多为 F 。A 2h B.2h-1 C.2h+1 D.h+1 E.2h-1F.2h-1 G.2h+1-1 H.2h+1 23.一棵有 124 个叶结点的完全二叉树，最多有 B 个结点。A.247 B.248 C.249 D.251 24.若从二叉树的任

50、一结点出发到根的路径上所经过的结点序列按其关键字有序，则该二叉树是 C 。A.满二叉树B.哈夫曼树C.堆D.二叉查找树25.前序遍历和中序遍历结果相同的二叉树为 F ；前序遍历和后序遍历结果相同的二叉树为 B 。A.一般二叉树B.只有根结点的二叉树C.根结点无左孩子的二叉树D.根结点无右孩子的二叉树E.所有结点只有左孩子的二叉树F.所有结点只有右孩子的二叉树26.具有 n 个结点的完全二叉树，已经顺序存储在一维数组A1.n中，下面的算法是将A中顺序存储变为二叉链表存储的完全二叉树。请填写适当语句在下面的空格内，完成上述算法。#define MAXSIZE 30 typedef struct b