Brainscape's Knowledge GenomeTM

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


See full index

CS2210: DSA > Week 6: Shortest Paths > Flashcards

Week 6: Shortest Paths Flashcards

1
Q

What is a weighted graph?

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

What is a shortest path?

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

What is dijkstra’s algorithm explained?

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

What is edge relaxation?

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

What is Dijkstra’s Algorithm?

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

What is the time complexity for Dijkstra’s algorithm when using:

Adjacency Matrix

Adjacency list

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

CS2210: DSA (16 decks)

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