Practice Naive Algorithm For Computing Connectivity Relation (19.5)

Practise this section

9 questions

Flashcard drill
2 cards from this section. Quick, good the night before a test.
Exercise
6 questions · about 4 min · pass mark 70%. Hints available.
Sign up to start the exercise
Quiz
3 questions · about 2 min · pass mark 70%. Hints available.
Sign up to start the quiz

6 sample questions

Question 1.
What is a connectivity relation?
Show hintHide hint
Consider a directed graph.
Question 2.
How do you calculate R^n?
Show hintHide hint
Think about the definition of matrix multiplication.
3Question 3.
What is the main purpose of the connectivity relation?
- To show direct relationships only
- To indicate possible paths between elements
- To count elements in a set
Show hintHide hint
Think about what 'connectivity' means.
4Question 4.
The naive algorithm has a computational complexity of ...
- True
- False
Show hintHide hint
Recall the steps of the algorithm.
Question 5.
Given a directed graph representing friendships among students, construct the connectivity relation of the graph. Show how many levels of friendship exist between every two nodes.
Show hintHide hint
Visualize paths in the directed graph.
Question 6.
Discuss how an optimized algorithm could improve the computation of connectivity relations. What changes would you propose?
Show hintHide hint
Research alternatives that directly improve the performance.

5 more questions in this section. Enroll free to practise them all.