Brainscape's Knowledge GenomeTM

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


See full index

Data Structures & Algorithms > Data Structure Characteristics > Flashcards

Data Structure Characteristics Flashcards

1
Q

Arrays (no order)
Random Access Supported?

A

Yes

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

Array List (no order)
Random Access Supported?

A

Yes

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

Linked List (no order)
Random Access Supported?

A

No

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

Linked List (ordered)
Random Access Supported?

A

No

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

Stack
Random Access Supported?

A

No

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

Queue
Random Access Supported?

A

No

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

Binary Tree
Random Access Supported?

A

No

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

HashSet
Random Access Supported?

A

No

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

Arrays (no order)
Type of Ordering

A

None

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

Heaps
Random Access Supported?

A

No

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

Array List (No order)
Type of Ordering

A

None

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

Array List (Ordered)
Type of Ordering

A

User Defined

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

Linked List (No Order)
Type of Ordering

A

None

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

Linked List (Ordered)
Type of Ordering

A

User Defined

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

Stacks
Type of Ordering

A

Data Structure Defined
LIFO

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

Queue
Type of Ordering

A

Data Structure Defined
FIFO

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

Binary Tree
Type of Ordering

A

User Defined

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

HashSet
Type of Ordering

A

None

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

Heap
Type of Ordering

A

Min / Max at top only

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

Array (No Order)
Search Support? If yes, Big O notation

A

Linear - O(n)

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

Array List (No Order)
Search Support? If yes, Big O notation

A

Linear - O(n)

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

Array List (Ordered)
Search Support? If yes, Big O notation

A

Binary - O(log n)

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

Linked List (No order)
Search Support? If yes, Big O notation

A

Linear - O(n)

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

Linked List (Ordered)
Search Support? If yes, Big O notation

A

Yes - O(n)

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

Stacks
Search Support? If yes, Big O notation

A

No - only top is accessible

25
Q

Queue
Search Support? If yes, Big O notation

A

No - only first is accessible

26
Q

Binary Trees
Search Support? If yes, Big O notation

A

Yes - O(log n)

27
Q

HashSets
Search Support? If yes, Big O notation

A

Yes - O(1)

28
Q

Heaps
Search Support? If yes, Big O notation

A

No - only the top is in a known state
O(1) for top only

29
Q

Array (No order)
Size - If dynamic, Big O notation

A

Fixed

30
Q

Array List (No order)
Size - If dynamic, Big O notation

A

Dynamic. Auto-resize
O(n)

31
Q

Array List (Ordered)
Size - If dynamic, Big O notation

A

Dynamic. Auto-resize
O(n)

32
Q

Linked List (No order)
Size - If dynamic, Big O notation

A

Dynamic- O(1)

33
Q

Linked List (Ordered)
Size - If dynamic, Big O notation

A

Dynamic- O(1)

34
Q

Stacks
Size - If dynamic, Big O notation

A

Dynamic - O(1)

35
Q

Queues
Size - If dynamic, Big O notation

A

Dynamic - O(1)

36
Q

Binary Trees
Size - If dynamic, Big O notation

A

Dynamic - O(1)

37
Q

HashSets
Size - If dynamic, Big O notation

A

Dynamic - Auto Resize
O(n) on Bucket Resizing

38
Q

Heaps
Size - If dynamic, Big O notation

A

Dynamic - may need to resize if heap full
O(n)

39
Q

Array (No order)
Big O notation of add

A

O(n)

40
Q

Array List (No order)
Big O notation of add

A

O(n)

41
Q

Array List (Ordered)
Big O notation of add

A

O(n)

42
Q

Linked List (No order)
Big O notation of add

A

O(1)

43
Q

Linked List (Ordered)
Big O notation of add

A

O(1)

44
Q

Stacks
Big O notation of add

A

O(1)

45
Q

Queues
Big O notation of add

A

O(1)

46
Q

Binary Trees
Big O notation of add

A

O(1)

47
Q

HashSets
Big O notation of add

A

O(1)

48
Q

Heaps
Big O notation of add

A

O(log n) if re-order is required

49
Q

Array (No order)
Big O Notation of delete

A

O(n)

50
Q

Array List (No order)
Big O Notation of delete

A

O(n)

51
Q

Array List (Ordered)
Big O Notation of delete

A

O(n)

52
Q

Linked List (No Order)
Big O Notation of delete

A

O(1)

53
Q

Linked List (Ordered)
Big O Notation of delete

A

O(1)

54
Q

Stacks
Big O Notation of delete

A

O(1)

55
Q

Queue
Big O Notation of delete

A

O(1)

56
Q

Binary Trees
Big O Notation of delete

A

O(log n)

57
Q

HashSet
Big O Notation of delete

A

O(1)

58
Q

Heaps
Big O Notation of delete

A

O(log n)

59
Q

Array List (Ordered)
Random Access Supported?

A

Yes

Data Structures & Algorithms (2 decks)

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