Brainscape's Knowledge GenomeTM

Browse over 1 million classes created by top students, professors, publishers, and experts.


See full index

Interviews > Big O > Flashcards

Big O Flashcards

1
Q

Array average access time complexity

A

O(1)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Array List average search time complexity

A

O(n)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Array average insertion time complexity

A

O(n)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Array average deletion time complexity

A

O(n)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Array worst access time complexity

A

O(1)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Array worst search time complexity

A

O(n)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Array worst insertion time complexity

A

O(n)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Array worst deletion time complexity

A

O(n)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Array worst space time complexity

A

O(n)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Stack average access time complexity

A

O(n)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Stack List average search time complexity

A

O(n)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

Stack average insertion time complexity

A

O(1)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

Stack average deletion time complexity

A

O(1)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Stack worst access time complexity

A

O(n)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

Stack worst search time complexity

A

O(n)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

Stack worst insertion time complexity

A

O(1)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
17
Q

Stack worst deletion time complexity

A

O(1)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
18
Q

Stack worst space time complexity

A

O(n)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
19
Q

Queue average access time complexity

A

O(n)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
20
Q

Queue average search time complexity

A

O(n)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
21
Q

Queue average insertion time complexity

A

O(1)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
22
Q

Queue average deletion time complexity

A

O(1)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
23
Q

Queue worst access time complexity

A

O(n)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
24
Q

Queue worst search time complexity

A

O(n)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
25
Q

Queue worst insertion time complexity

A

O(1)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
26
Q

Queue worst deletion time complexity

A

O(1)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
27
Q

Queue worst space time complexity

A

O(n)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
28
Q

Singly-Linked List average access time complexity

A

O(n)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
29
Q

Singly-Linked List average search time complexity

A

O(n)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
30
Q

Singly-Linked List average insertion time complexity

A

O(1)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
31
Q

Singly-Linked List average deletion time complexity

A

O(1)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
32
Q

Singly-Linked List worst access time complexity

A

O(n)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
33
Q

Singly-Linked List worst search time complexity

A

O(n)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
34
Q

Singly-Linked List worst insertion time complexity

A

O(1)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
35
Q

Singly-Linked List worst deletion time complexity

A

O(1)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
36
Q

Singly-Linked List worst space time complexity

A

O(n)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
37
Q

Doubly-Linked List average access time complexity

A

O(n)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
38
Q

Doubly-Linked List average search time complexity

A

O(n)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
39
Q

Doubly-Linked List average insertion time complexity

A

O(1)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
40
Q

Doubly-Linked List average deletion time complexity

A

O(1)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
41
Q

Doubly-Linked List worst access time complexity

A

O(n)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
42
Q

Doubly-Linked List worst search time complexity

A

O(n)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
43
Q

Doubly-Linked List worst insertion time complexity

A

O(1)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
44
Q

Doubly-Linked List worst deletion time complexity

A

O(1)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
45
Q

Doubly-Linked List worst space time complexity

A

O(n)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
46
Q

Skip List average access time complexity

A

O(log(n))

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
47
Q

Skip List average search time complexity

A

O(log(n))

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
48
Q

Skip List average insertion time complexity

A

O(log(n))

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
49
Q

Skip List average deletion time complexity

A

O(log(n))

50
Q

Skip List worst access time complexity

A

O(n)

51
Q

Skip List worst search time complexity

A

O(n)

52
Q

Skip List worst insertion time complexity

A

O(n)

53
Q

Skip List worst deletion time complexity

A

O(n)

54
Q

Skip List worst space time complexity

A

O(n log(n))

55
Q

Hash Table average search time complexity

A

O(1)

56
Q

Hash Table average insertion time complexity

A

O(1)

57
Q

Hash Table average deletion time complexity

A

O(1)

58
Q

Hash Table worst search time complexity

A

O(n)

59
Q

Hash Table worst insertion time complexity

A

O(n)

60
Q

Hash Table worst deletion time complexity

A

O(n)

61
Q

Hash Table worst space time complexity

A

O(n)

62
Q

Binary Search Tree average access time complexity

A

O(log(n))

63
Q

Binary Search Tree average search time complexity

A

O(log(n))

64
Q

Binary Search Tree average insertion time complexity

A

O(log(n))

65
Q

Binary Search Tree average deletion time complexity

A

O(log(n))

66
Q

Binary Search Tree worst access time complexity

A

O(n)

67
Q

Binary Search Tree worst search time complexity

A

O(n)

68
Q

Binary Search Tree worst insertion time complexity

A

O(n)

69
Q

Binary Search Tree worst deletion time complexity

A

O(n)

70
Q

Binary Search Tree worst space time complexity

A

O(n)

71
Q

Cartesian Tree average search time complexity

A

O(log(n))

72
Q

Cartesian Tree average insertion time complexity

A

O(log(n))

73
Q

Cartesian Tree average deletion time complexity

A

O(log(n))

74
Q

Cartesian Tree worst search time complexity

A

O(n)

75
Q

Cartesian Tree worst insertion time complexity

A

O(n)

76
Q

Cartesian Tree worst deletion time complexity

A

O(n)

77
Q

Cartesian Tree worst space time complexity

A

O(n)

78
Q

B-Tree average access time complexity

A

O(log(n))

79
Q

B-Tree average search time complexity

A

O(log(n))

80
Q

B-Tree average insertion time complexity

A

O(log(n))

81
Q

B-Tree average deletion time complexity

A

O(log(n))

82
Q

B-Tree worst access time complexity

A

O(log(n))

83
Q

B-Tree worst search time complexity

A

O(log(n))

84
Q

B-Tree worst insertion time complexity

A

O(log(n))

85
Q

B-Tree worst deletion time complexity

A

O(log(n))

86
Q

B-Tree worst space time complexity

A

O(n)

87
Q

Red-Black Tree average access time complexity

A

O(log(n))

88
Q

Red-Black Tree average search time complexity

A

O(log(n))

89
Q

Red-Black Tree average insertion time complexity

A

O(log(n))

90
Q

Red-Black Tree average deletion time complexity

A

O(log(n))

91
Q

Red-Black Tree worst access time complexity

A

O(log(n))

92
Q

Red-Black Tree worst search time complexity

A

O(log(n))

93
Q

Red-Black Tree worst insertion time complexity

A

O(log(n))

94
Q

Red-Black Tree worst deletion time complexity

A

O(log(n))

95
Q

Red-Black Tree worst space time complexity

A

O(n)

96
Q

Splay Tree average search time complexity

A

O(log(n))

97
Q

Splay Tree average insertion time complexity

A

O(log(n))

98
Q

Splay Tree average deletion time complexity

A

O(log(n))

99
Q

Splay Tree worst search time complexity

A

O(log(n))

100
Q

Splay Tree worst insertion time complexity

A

O(log(n))

101
Q

Splay Tree worst deletion time complexity

A

O(log(n))

102
Q

Splay Tree worst space time complexity

A

O(n)

103
Q

AVL Tree average access time complexity

A

O(log(n))

104
Q

AVL Tree average search time complexity

A

O(log(n))

105
Q

AVL Tree average insertion time complexity

A

O(log(n))

106
Q

AVL Tree average deletion time complexity

A

O(log(n))

107
Q

AVL Tree worst access time complexity

A

O(log(n))

108
Q

AVL Tree worst search time complexity

A

O(log(n))

109
Q

AVL Tree worst insertion time complexity

A

O(log(n))

110
Q

AVL Tree worst deletion time complexity

A

O(log(n))

111
Q

AVL Tree worst space time complexity

A

O(n)

112
Q

KD Tree average access time complexity

A

O(log(n))

113
Q

KD Tree average search time complexity

A

O(log(n))

114
Q

KD Tree average insertion time complexity

A

O(log(n))

115
Q

KD Tree average deletion time complexity

A

O(log(n))

116
Q

KD Tree worst access time complexity

A

O(n)

117
Q

KD Tree worst search time complexity

A

O(n)

118
Q

KD Tree worst insertion time complexity

A

O(n)

119
Q

KD Tree worst deletion time complexity

A

O(n)

120
Q

KD Tree worst space time complexity

A

O(n)

Interviews (1 decks)

Brainscape helps you reach your goals faster, through stronger study habits.
© 2024 Bold Learning Solutions. Terms and Conditions