• 2022-06-03 问题

    What type of personality does the lecturer belong to? A: Type-O personality B: Type-B personality C: Type- C personality D: Type-A personality

    What type of personality does the lecturer belong to? A: Type-O personality B: Type-B personality C: Type- C personality D: Type-A personality

  • 2022-05-26 问题

    One of the parents is type A and the other is type B. the possible blood type of their children is A: It can only be type AB B: It can only be type A or type B C: It can only be type A, B and AB D: Type A, B, AB, O E: It can only be type AB or type O

    One of the parents is type A and the other is type B. the possible blood type of their children is A: It can only be type AB B: It can only be type A or type B C: It can only be type A, B and AB D: Type A, B, AB, O E: It can only be type AB or type O

  • 2022-06-07 问题

    3. A man’s blood type is A, whose father is AB and mother is O. If he married a woman whose father is O and mother is B. Then their children’s blood type can be A: Any type B: A and O C: B and O D: A and B

    3. A man’s blood type is A, whose father is AB and mother is O. If he married a woman whose father is O and mother is B. Then their children’s blood type can be A: Any type B: A and O C: B and O D: A and B

  • 2022-10-24 问题

    跳跃链表的查找效率为( )‍ 未知类型:{'options': ['', 'O(1)', 'O(n)', 'O(n*n)'], 'type': 102}

    跳跃链表的查找效率为( )‍ 未知类型:{'options': ['', 'O(1)', 'O(n)', 'O(n*n)'], 'type': 102}

  • 2022-06-05 问题

    下列算法的时间复杂度是( ) 未知类型:{'options': ['O(2)', ' O(n)', ' O(log2n)', ' O(n[img=6x17]17da426f2bdb8ab.jpg[/img])'], 'type': 102}

    下列算法的时间复杂度是( ) 未知类型:{'options': ['O(2)', ' O(n)', ' O(log2n)', ' O(n[img=6x17]17da426f2bdb8ab.jpg[/img])'], 'type': 102}

  • 2022-10-29 问题

    下列代码的时间复杂度是: 未知类型:{'options': ['O(N×i)', ' O(N)', ' O([img=19x17]17e43c62279c498.jpg[/img])', ' O(NlogN)'], 'type': 102}

    下列代码的时间复杂度是: 未知类型:{'options': ['O(N×i)', ' O(N)', ' O([img=19x17]17e43c62279c498.jpg[/img])', ' O(NlogN)'], 'type': 102}

  • 2022-05-29 问题

    快速排序算法在最好情况下的时间复杂度为 未知类型:{'options': ['O(n)', '', 'O(nlog2n)', 'O(log2n)'], 'type': 102}

    快速排序算法在最好情况下的时间复杂度为 未知类型:{'options': ['O(n)', '', 'O(nlog2n)', 'O(log2n)'], 'type': 102}

  • 2022-06-26 问题

    采用简单选择排序,总的时间复杂度是()。 未知类型:{'options': ['O(n)', ' O(log2n)', ' O(n[img=6x17]17e0a6b1cb8543b.jpg[/img])', ' O(nlog2n)'], 'type': 102}

    采用简单选择排序,总的时间复杂度是()。 未知类型:{'options': ['O(n)', ' O(log2n)', ' O(n[img=6x17]17e0a6b1cb8543b.jpg[/img])', ' O(nlog2n)'], 'type': 102}

  • 2022-06-26 问题

    采用简单选择排序,总的时间复杂度是()。 未知类型:{'options': ['O(n)', ' O(log2n)', ' O(n[img=6x17]17e0a6b1cb8543b.jpg[/img])', ' O(nlog2n)'], 'type': 102}

    采用简单选择排序,总的时间复杂度是()。 未知类型:{'options': ['O(n)', ' O(log2n)', ' O(n[img=6x17]17e0a6b1cb8543b.jpg[/img])', ' O(nlog2n)'], 'type': 102}

  • 2022-10-29 问题

    下面代码段的时间复杂度是()。 未知类型:{'options': ['O(n)', ' O([img=16x18]17da57a0443d17d.jpg[/img])', ' O(1)', ' O([img=34x18]17da57a04e0132c.jpg[/img])'], 'type': 102}

    下面代码段的时间复杂度是()。 未知类型:{'options': ['O(n)', ' O([img=16x18]17da57a0443d17d.jpg[/img])', ' O(1)', ' O([img=34x18]17da57a04e0132c.jpg[/img])'], 'type': 102}

  • 1 2 3 4 5 6 7 8 9 10