-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathFGSstructure.html
4077 lines (4025 loc) · 98.4 KB
/
FGSstructure.html
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
<!DOCTYPE html>
<html lang="en">
<head>
<meta charset="UTF-8">
<meta name="viewport" content="width=device-width, initial-scale=1.0">
<title>福工商数据结构 数据2024</title>
</head>
<body>
<h1>福工商数据结构 数据2024</h1>
<h3>STESEN</h3>
</body>
<!-- 为题目赋予id -->
<!--
var list = []
var dataname = '数据库名'
var typename = 'single' | 'multi' | 'blank'
list.map((e,i) => {
e.id = dataname + '_' + typename + '_' + i;
return e;
})
-->
<!-- 生成索引 -->
<!--
var list = [] // 包含id的题库
list.map((e,i) => {
return [e.id, i];
})
-->
<script>
/*
1、导入题库
2、导入完成发出消息
*/
// 导入完毕后发送事件
function importJSExam() {
// 数据库标记 =======================
var datasourceName = 'FGSstructure';
var datasourceVer = '1（2024-6-16）';
var datasourceNameChinese = '数据结构'
// =================================
localStorage.removeItem('quesLimitOpts');
localStorage.removeItem('singleQuestion');
localStorage.removeItem('blankQuestion');
localStorage.removeItem('multiQuestion');
// 导入单选
var dataJson = [
{
"description": "下说法错误的是()。",
"options": [
"数据项是数据的最小单位",
"数据元素是数据的基本单位",
"数据结构是带有结构的各数据项的集合",
"一些表面上很不相同的数据可以有相同的逻辑结构"
],
"source": "第一章",
"correctAnswer": [
3
],
"id": "FGSstructure_single_0"
},
{
"description": "数据结构是带“结构＂的()的集合。",
"options": [
"数据",
"数据项",
"数据元素",
"数据对象"
],
"source": "第一章",
"correctAnswer": [
3
],
"id": "FGSstructure_single_1"
},
{
"description": "算法分析的目的是()。",
"options": [
"找出数据结构的合理性",
"研究算法中的输入和输出的关系",
"分析算法的效率以求改进",
"分析算法的易懂性和文档性"
],
"source": "第一章",
"correctAnswer": [
3
],
"id": "FGSstructure_single_2"
},
{
"description": "算法分析的两个主要方面是()。",
"options": [
"空间复杂性和时间复杂性",
"正确性和简明性",
"可读性和文档性",
"数据复杂性和程序复杂性"
],
"source": "第一章",
"correctAnswer": [
1
],
"id": "FGSstructure_single_3"
},
{
"description": "计算机算法指的是()。",
"options": [
"计算方法",
"排序方法",
"解决问题的有限运算序列",
"调度方法"
],
"source": "第一章",
"correctAnswer": [
3
],
"id": "FGSstructure_single_4"
},
{
"description": "计算机算法必具备输入、输出和()等五个特性。",
"options": [
"可行性、可移植性和可扩充性",
"可行性、确定性和有穷性",
"确定性、有穷性和稳定性",
"易读性、稳定性和安全性"
],
"source": "第一章",
"correctAnswer": [
2
],
"id": "FGSstructure_single_5"
},
{
"description": "下述哪一条是顺序存储结构的优点()。",
"options": [
"可方便地用于各种逻辑结构的存储表示",
"插入运算方便",
"删除运算方便",
"存储密度大"
],
"source": "第一章",
"correctAnswer": [
4
],
"id": "FGSstructure_single_6"
},
{
"description": "在数据结构中,从逻辑上可以把数据结构分成()。",
"options": [
"动态结构和静态结构",
"紧凑结构和非紧凑结构",
"线性结构和非线性结构",
"内部结构和外部结构"
],
"source": "第一章",
"correctAnswer": [
3
],
"id": "FGSstructure_single_7"
},
{
"description": "在数据结构中,从存储结构上可以将之分为()。",
"options": [
"动态结构和静态结构",
"顺序存储和非顺序存储",
"紧凑结构和非紧凑结构",
"线性结构和非线性结构"
],
"source": "第一章",
"correctAnswer": [
2
],
"id": "FGSstructure_single_8"
},
{
"description": "某算法的时间复杂度是O(n^2),表明该算法的()。",
"options": [
"执行时间与n^2成正比",
"问题规模是n^2",
"执行时间等于n^2",
"问题规模与n^2成正比"
],
"source": "第一章",
"correctAnswer": [
1
],
"id": "FGSstructure_single_9"
},
{
"description": "执行下面程序段的时间复杂度为（）。",
"options": [
"O(2n)",
"O(n)",
"O(n2)",
"O(log2n)"
],
"source": "第一章",
"correctAnswer": [
3
],
"id": "FGSstructure_single_10"
},
{
"description": "以下数据结构中,()是非线性数据结构。",
"options": [
"树",
"字符串",
"队",
"栈"
],
"source": "第一章",
"correctAnswer": [
1
],
"id": "FGSstructure_single_11"
},
{
"description": "顺序存储,存储单元的地址()。",
"options": [
"一定连续",
"一定不连续",
"不一定连续",
"部分连续,部分不连续"
],
"source": "第一章",
"correctAnswer": [
1
],
"id": "FGSstructure_single_12"
},
{
"description": "评价一个算法性能好坏的重要标准是()。",
"options": [
"算法的正确性",
"算法易于调试",
"算法的时间和空间复杂度",
"算法易于理解"
],
"source": "第一章",
"correctAnswer": [
3
],
"id": "FGSstructure_single_13"
},
{
"description": "组成数据的基本单位是（）。",
"options": [
"数据项",
"数据类型",
"数据元素",
"数据变量"
],
"source": "第一章",
"correctAnswer": [
3
],
"id": "FGSstructure_single_14"
},
{
"description": "在计算机的存储器中表示时,物理地址和逻辑地址相同并且是连续的,称之为()。",
"options": [
"逻辑结构",
"顺序存储结构",
"链式存储结构",
"以上都对"
],
"source": "第一章",
"correctAnswer": [
2
],
"id": "FGSstructure_single_15"
},
{
"description": "一个算法必须在执行有穷步之后结束，这是算法的（）。",
"options": [
"正确性",
"有穷性",
"确定性",
"可行性"
],
"source": "第一章",
"correctAnswer": [
2
],
"id": "FGSstructure_single_16"
},
{
"description": "算法分析的目的是()。",
"options": [
"找出数据结构的合理性",
"研究算法中的输入和输出的关系",
"分析算法的效率以求改进",
"分析算法的易懂性和文档性"
],
"source": "第一章",
"correctAnswer": [
3
],
"id": "FGSstructure_single_17"
},
{
"description": "执行下面程序段的时间复杂度为（）。",
"options": [
"O(2n)",
"O(n)",
"O(n2)",
"O(log2n)"
],
"source": "第一章",
"correctAnswer": [
2
],
"id": "FGSstructure_single_18"
},
{
"description": "在计算机的存储器中表示时,物理地址和逻辑地址相同并且是连续的,称之为()。",
"options": [
"逻辑结构",
"顺序存储结构",
"链式存储结构",
"以上都对"
],
"source": "第一章",
"correctAnswer": [
2
],
"id": "FGSstructure_single_19"
},
{
"description": "线性表的顺序存储结构是一种()的存储结构。",
"options": [
"随机存取",
"索引存取",
"顺序存取",
"散列存职"
],
"source": "第二章",
"correctAnswer": [
1
],
"id": "FGSstructure_single_20"
},
{
"description": "线性表的链式存储结构是一种()的存储结构。",
"options": [
"随机存取",
"索引存取",
"顺序存取",
"散列存职"
],
"source": "第二章",
"correctAnswer": [
3
],
"id": "FGSstructure_single_21"
},
{
"description": "下列叙述中，正确的是()。",
"options": [
"线性表的顺序存储结构优于链表存储结构",
"线性表的顺序存储结构适用于频繁插入/删除数据元素的情况",
"线性表的链表存储结构适用于频繁插入/删除数据元素的情况",
"线性表的链表存储结构优于顺序存储结构"
],
"source": "第二章",
"correctAnswer": [
3
],
"id": "FGSstructure_single_22"
},
{
"description": "不带头结点的单链表head为空的判定条件是()。",
"options": [
"head == NULL",
"head->next == NULL",
"head->next == head",
"head != NULL"
],
"source": "第二章",
"correctAnswer": [
1
],
"id": "FGSstructure_single_23"
},
{
"description": "带头结点的单链表head为空的判定条件是()。",
"options": [
"head == NULL",
"head->next == NULL",
"head->next == head",
"head != NULL"
],
"source": "第二章",
"correctAnswer": [
2
],
"id": "FGSstructure_single_24"
},
{
"description": "在一个单链表中，已知q所指结点是p所指结点的前驱结点，若在q和p之间插入s结点，则执行()。",
"options": [
"s->next = p->next; p->next = s;",
"p->next = s->next; s->next = p;",
"q->next = s; s->next = p;",
"p->next = s; s->next = q;"
],
"source": "第二章",
"correctAnswer": [
3
],
"id": "FGSstructure_single_25"
},
{
"description": "在一个单链表中，若p所指结点不是最后结点，在p之后插入s所指结点，则执行()。",
"options": [
"s->next = p; p->next = s;",
"s->next = p->next; p->next = s;",
"s->next = p->next; p = s;",
"p->next = s; s->next = p;"
],
"source": "第二章",
"correctAnswer": [
2
],
"id": "FGSstructure_single_26"
},
{
"description": "在一个单链表中，若删除p所指结点的后续结点，则执行()。",
"options": [
"p->next = p->next->next;",
"p = p->next; p->next = p->next->next;",
"p->next = p->next;",
"p = p->next->next;"
],
"source": "第二章",
"correctAnswer": [
1
],
"id": "FGSstructure_single_27"
},
{
"description": "若某线性表最常用的操作是存取任一指定序号的元素和在最后进行插入和删除运算，则利用()存储方式最节省时间。",
"options": [
"顺序表",
"双链表",
"带头结点的双循环链表",
"单循环链表"
],
"source": "第二章",
"correctAnswer": [
1
],
"id": "FGSstructure_single_28"
},
{
"description": "设某顺序表中第一个元素的地址是se(下标从1开始),每个结点占m个单元,则第i个结点的地址为()。",
"options": [
"se+(i-1)×m",
"se+(i+1)×m",
"se+i×m",
"se-i×m"
],
"source": "第二章",
"correctAnswer": [
1
],
"id": "FGSstructure_single_29"
},
{
"description": "某线性表中最常用的操作是在最后一个元素之后插入一个元素和删除第一个元素，则采用()存储方式最节省运算时间。",
"options": [
"单链表",
"仅有尾指针的单循环链表",
"仅有头指针的单循环链表",
"双链表"
],
"source": "第二章",
"correctAnswer": [
2
],
"id": "FGSstructure_single_30"
},
{
"description": "若长度为n的线性表采用顺序存储结构,在其第i个位置插入一个新元素的算法的时间复杂度为()。",
"options": [
"O(n)",
"O(0)",
"O(1)",
"O(n^2)"
],
"source": "第二章",
"correctAnswer": [
1
],
"id": "FGSstructure_single_31"
},
{
"description": "在单链表指针为p的结点之后插入指针为s的结点,正确的操作是()。",
"options": [
"s->next=p->next;p->next=s;",
"p->next=s;s->next=p->next;",
"p->next=s;p->next=s->next;",
"p->next=s->next;p->next=s;"
],
"source": "第二章",
"correctAnswer": [
1
],
"id": "FGSstructure_single_32"
},
{
"description": "循环链表的主要优点是()。",
"options": [
"不再需要头指针了",
"已知某个结点的位置后，很容易找到它的直接前驱结点",
"在进行删除后，能保证链表不断开",
"从表中任一结点出发都能遍历整个链表"
],
"source": "第二章",
"correctAnswer": [
4
],
"id": "FGSstructure_single_33"
},
{
"description": "设指针变量p指向单链表结点A，则删除结点A的后继结点B需要的操作为()。",
"options": [
"p->next=p->next->next",
"p=p->next",
"p=p->next->next",
"p->next=p"
],
"source": "第二章",
"correctAnswer": [
1
],
"id": "FGSstructure_single_34"
},
{
"description": "在n个结点的顺序表中，算法的时间复杂度是O（1）的操作是()。",
"options": [
"访问第i个结点（1≤i≤n）和求第i个结点的直接前驱（2≤i≤n）",
"在第i个结点后插入一个新结点（1≤i≤n）",
"删除第i个结点（1≤i≤n）",
"将n个结点从小到大排序"
],
"source": "第二章",
"correctAnswer": [
1
],
"id": "FGSstructure_single_35"
},
{
"description": "线性表若采用链式存储结构时，要求内存中可用存储单元的地址:()。",
"options": [
"必须是连续的",
"部分地址必须是连续的",
"一定是不连续的",
"连续或不连续都可以"
],
"source": "第二章",
"correctAnswer": [
4
],
"id": "FGSstructure_single_36"
},
{
"description": "在循环双链表的p所指结点之后插入s所指结点的操作是()。",
"options": [
"p->right=s; s->left=p; p->right->left=s; s->right=p->right;",
"p->right=s; p->right->left=s; s->left=p; s->right=p->right;",
"s->left=p; s->right= p->right; p->right=s; p->right->left=s;",
"s->left=p; s->right=p->right; p->right->left=s; p->right=s;"
],
"source": "第二章",
"correctAnswer": [
4
],
"id": "FGSstructure_single_37"
},
{
"description": "单链表中，增加头结点的目的是为了()。",
"options": [
"方便运算的实现",
"标识单链表",
"使单链表中至少有一个结点",
"用于标识起始结点的位置"
],
"source": "第二章",
"correctAnswer": [
1
],
"id": "FGSstructure_single_38"
},
{
"description": "在以下的叙述中，错误的是()。",
"options": [
"顺序表必须占用一片地址连续的存储单元",
"链表不必占用一片地址连续的存储单元",
"顺序表可以随机存取任一元素",
"链表可以随机存取任一元素"
],
"source": "第二章",
"correctAnswer": [
4
],
"id": "FGSstructure_single_39"
},
{
"description": "线性链表中各链节点之间的地址()。",
"options": [
"必须连续",
"部分地址必须连续",
"不一定连续",
"以上都不对"
],
"source": "第二章",
"correctAnswer": [
3
],
"id": "FGSstructure_single_40"
},
{
"description": "链栈与顺序栈相比，有一个较明显的优点是()。",
"options": [
"通常不会出现栈满的情况",
"通常不会出现栈空的情况",
"插入操作更加方便",
"删除操作更加方便"
],
"source": "第二章",
"correctAnswer": [
1
],
"id": "FGSstructure_single_41"
},
{
"description": "在双向循环链表的p所指结点之后插入s所指结点的操作是()。",
"options": [
"p->right=s; s->left=p; p->right->left=s; s->right=p->right;",
"p->right=s; p->right->left=s; s->left=p; s->right=p->right;",
"s->left=p; s->right= p->right; p->right=s; p->right->left=s;",
"s->left=p; s->right=p->right; p->right->left=s; p->right=s;"
],
"source": "第二章",
"correctAnswer": [
4
],
"id": "FGSstructure_single_42"
},
{
"description": "一个栈的入栈序列a，b，c，d，e，则栈的不可能的输出序列是。",
"options": [
"e,d,c,b,a",
"d,e,c,b,a",
"d,c,e,a,b",
"a,b,c,d,e"
],
"source": "第三章",
"correctAnswer": [
3
],
"id": "FGSstructure_single_43"
},
{
"description": "若5个元素的出栈序列为1，2，3，4，5，则进栈序列可能是。",
"options": [
"2,4,3,1,5",
"2,3,1,5,4",
"3,1,4,2,5",
"3,1,2,5,4"
],
"source": "第三章",
"correctAnswer": [
4
],
"id": "FGSstructure_single_44"
},
{
"description": "以下不是栈的应用的是。",
"options": [
"函数调用",
"表达式求解",
"数制的转换",
"舞伴问题"
],
"source": "第三章",
"correctAnswer": [
4
],
"id": "FGSstructure_single_45"
},
{
"description": "一个栈以向量V[l..n]存储，初始栈顶指针top设为0，则元素x进栈的正确操作是。",
"options": [
"top++;V[top]=x;",
"V[top]=x;top++;",
"top--;V[top]=x;",
"V[top]=x;top--;"
],
"source": "第三章",
"correctAnswer": [
1
],
"id": "FGSstructure_single_46"
},
{
"description": "栈S和队列Q的初始状态为空，元素A1、A2、A3、A4、A5和A6依次进入栈S，一个元素出栈后即进入Q，若6个元素出队的序列是A2、A4、A3、A6、A5和A1，则栈S的容量至少应该是。",
"options": [
"2",
"3",
"4",
"6"
],
"source": "第三章",
"correctAnswer": [
2
],
"id": "FGSstructure_single_47"
},
{
"description": "栈S和队列Q的初始状态为空，元素A1、A2、A3、A4、A5和A6依次进入栈S，一个元素出栈后即进入Q，若6个元素出队的序列是A2、A4、A6、A5、A3和A1，则栈S的容量至少应该是。",
"options": [
"2",
"3",
"4",
"6"
],
"source": "第三章",
"correctAnswer": [
3
],
"id": "FGSstructure_single_48"
},
{
"description": "环队列存储在数组A[O,…,m-1]中，则入队时的操作为。",
"options": [
"rear=rear+1",
"rear=(rear+1)%(m-1)",
"rear=(rear+1)%m",
"rear=(rear+1)%(m+1)"
],
"source": "第三章",
"correctAnswer": [
3
],
"id": "FGSstructure_single_49"
},
{
"description": "最大容量为n的循环队列，队尾指针是rear，队头是front，则队满的条件是。",
"options": [
"(rear+1)%n==front",
"rear==front",
"rear+1==front",
"(rear-1)%n==front"
],
"source": "第三章",
"correctAnswer": [
1
],
"id": "FGSstructure_single_50"
},
{
"description": "栈和队列都是。",
"options": [
"限制存取点的非线性结构",
"顺序存储的线性结构",
"链式存储的非线性结构",
"限制存取点的线性结构 "
],
"source": "第三章",
"correctAnswer": [
4
],
"id": "FGSstructure_single_51"
},
{
"description": "设计一个判别表达式中括号是否匹配出现的算法,采用的数据结构最佳。",
"options": [
"栈",
"顺序表",
"队列",
"单链表"
],
"source": "第三章",
"correctAnswer": [
1
],
"id": "FGSstructure_single_52"
},
{
"description": "表达式a*(b+c)-d的后缀表达式是。",
"options": [
"abc*+d-",
"cb+ad-",
"abc+d-",
"abcd+-"
],
"source": "第三章",
"correctAnswer": [
3
],
"id": "FGSstructure_single_53"
},
{
"description": "递归过程或函数调用时,处理参数及返回地址需要用一种的数据结构。",
"options": [
"栈",
"队列",
"多维数组",
"线性表"
],
"source": "第三章",
"correctAnswer": [
1
],
"id": "FGSstructure_single_54"
},
{
"description": "最大容量为n的循环队列,队尾指针为rear,队头指针为front,则队空的条件是。",
"options": [
"rear==front",
"(rear+1)%n==front",
"rear+1==front",
"(rear-l)%n==front"
],
"source": "第三章",
"correctAnswer": [
1
],
"id": "FGSstructure_single_55"
},
{
"description": "用带头结点的单链表表示队长大于1的队列时,其队头指针指向队头结点,其队尾指针指向队尾结点,则在进行删除操作时。",
"options": [
"仅修改队头指针",
"仅修改队尾指针",
"队头.队尾指针都要修改",
"队头,队尾指针都可能要修改"
],
"source": "第三章",
"correctAnswer": [
1
],
"id": "FGSstructure_single_56"
},
{
"description": "对于一个具有n个结点的单链表,在已知的结点p后插入一个新结点的时间复杂度和在给定值为x的结点后插入一个新结点的时间复杂度分别为。",
"options": [
"O(1),O(n)",
"O(n),O(n)",
"O(1),O(1)",
"O(n),O(1)"
],
"source": "第三章",
"correctAnswer": [
1
],
"id": "FGSstructure_single_57"
},
{
"description": "在下列数据结构中，具有先进先出特性，具有先进后出特性。",
"options": [
"线性表",
"栈",
"队列",
"广义表"
],
"source": "第三章",
"correctAnswer": [
3
],
"id": "FGSstructure_single_58"
},
{
"description": "栈中元素的进出原则是。",
"options": [
"先进先出",
"后进先出",
"栈空则进",
"栈满则出"
],
"source": "第三章",
"correctAnswer": [
2
],
"id": "FGSstructure_single_59"
},
{
"description": "某一队列的入队顺序是a,b,c,d,e,经过一次出队操作后，下一个将要出队的是。",
"options": [
"a",
"b",
"c",
"d"
],
"source": "第三章",
"correctAnswer": [
2
],
"id": "FGSstructure_single_60"
},
{
"description": "若用一个大小为6的数组来实现循环队列，且当前front和rear的值分别为3和0，当从队列中删除一个元素，再加入两个元素后，front和rear的值分别为。",
"options": [
"5和1",
"4和2",
"2和4",
"1和5"
],
"source": "第三章",
"correctAnswer": [
2
],
"id": "FGSstructure_single_61"
},
{
"description": "4个元素按A、B、C、D顺序连续进栈S后，第一次进行Pop（S，x）操作后，x的值为。",
"options": [
"A",
"B",
"C",
"D"
],
"source": "第三章",
"correctAnswer": [
4
],
"id": "FGSstructure_single_62"
},
{
"description": "队列中元素的进出原则是。",
"options": [
"先进先出",
"后进先出",
"栈空则进",
"栈满则出"
],
"source": "第三章",
"correctAnswer": [
1
],
"id": "FGSstructure_single_63"
},
{
"description": "某一队列的入队顺序是a,b,c,d,e,经过三次出队操作后，下一个将要出队的是。",
"options": [
"a",
"b",
"c",
"d"
],
"source": "第三章",
"correctAnswer": [
4
],
"id": "FGSstructure_single_64"
},
{
"description": "设栈的输入序列是（1，2，3，4），则不可能是其出栈序列的是。",
"options": [
"1243",
"2134",
"1432",
"4312"
],
"source": "第三章",
"correctAnswer": [
4
],
"id": "FGSstructure_single_65"
},
{
"description": "以下数据结构中，哪一种适合用于进制转换。",
"options": [
"队列",
"多维数组",
"栈",
"线性表"
],
"source": "第三章",
"correctAnswer": [
3
],
"id": "FGSstructure_single_66"