Brainscape's Knowledge GenomeTM


Top Flashcards (Certified)
All Flashcards

ALGORITHMICS > ADTs > Flashcards

ADTs Flashcards

1
Q

Array

A

Stores elements in a collection of fixed length

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

Create Array

A

Integer -> Array

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

Set Array

A

Array x Integer x Element -> Array

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

Get Array

A

Array x Integer -> Element

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

List

A

Stores elements in a collection of changeable length

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

Create List

A

List

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

IsEmpty List

A

List -> Boolean

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

Get List

A

List x Integer -> Element

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

Set List

A

List x Integer x Element -> List

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

Insert List

A

List x Integer x Element -> List

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

Delete List

A

List x Integer -> List

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

Stack

A

Last In First Out, can only access top

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

Create Stack

A

Stack

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

IsEmpty Stack

A

Stack -> Boolean

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

Push Stack

A

Stack x Element -> Stack

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

Peek Stack

A

Stack -> Element

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

Pop Stack

A

Stack -> Stack

18
Q

Queue

A

First In First Out

19
Q

Create Queue

20
Q

IsEmpty Queue

A

Queue -> Boolean

21
Q

Append Queue

A

Queue x Element -> Queue

22
Q

Peek Queue

A

Queue -> Element

23
Q

Serve Queue

A

Queue -> Queue

24
Q

Priority queue

A

FIFO but considers highest priority values first

25
Q

Create Priority queue

A

Priority queue

26
Q

IsEmpty Priority queue

A

Priority queue -> Boolean

27
Q

InsertWithPriority Priority queue

A

Priority queue x Element x Integer -> Priority queue

28
Q

GetMin (head) Priority queue

A

Priority queue -> Element

29
Q

RemoveMin (dequeue) Priority queue

A

Priority queue -> Priority queue

30
Q

Dictionary

A

Key-value pairs, data is stored as a value which is associated with a key

31
Q

Create Dictionary

A

Dictionary

32
Q

HasKey Dictionary

A

Dictionary x Element -> Boolean

33
Q

Add Dictionary

A

Dictionary x Element x Element -> Dictionary

34
Q

Update Dictionary

A

Dictionary x Element x Element -> Dictionary

35
Q

Remove Dictionary

A

Dictionary x Element -> Dictionary

36
Q

Get Dictionary

A

Dictionary x Element -> Element

37
Q

Graph

A

Collection of nodes and edges

38
Q

Create Graph

39
Q

AddNode Graph

A

Graph x Element -> Graph

40
Q

AddEdge Graph

A

Graph x Element x Element -> Graph

41
Q

Adjacent Graph

A

Graph x Element x Element -> Boolean

42
Q

Neighbours Graph

A

Graph x Element -> List

ALGORITHMICS (6 decks)

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