Practice International Institute Of Information Technology - Bangalore (4.1.2)

Practice: International Institute of Information Technology - Bangalore

Lesson 4.1.2Prof. Ashish Choudhury

Practise this section

8 questions

Flashcard drill
3 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
2 questions · about 1 min · pass mark 70%. Hints available.
Sign up to start the quiz

6 sample questions

Question 1.
What is vertex connectivity?
Show hintHide hint
Think about how many nodes you could take out to break a path.
Question 2.
If a graph has n vertices, what is the maximum number of edges it can have?
Show hintHide hint
This counts every connection.
3Question 3.
What defines vertex connectivity?
- The number of edges
- Minimum vertex removal for disconnection
- Minimum edges to maintain connection
Show hintHide hint
Think about how you'd keep a group connected.
4Question 4.
True or False: Every complete graph has vertex connectivity equal to n-1.
- True
- False
Show hintHide hint
Consider how many edges are possible in a complete structure.
Question 5.
Construct two graphs where vertex and edge connectivity varies but both achieve the same minimum degree. Explain how it's achieved.
Show hintHide hint
Use different configurations to maintain degree but vary edges.
Question 6.
Design a simple graph with 6 vertices, ensuring that vertex connectivity is 4, while edge connectivity is lesser. Show configurations.
Show hintHide hint
Think about groups that rely on fewer vertices while maintaining edge diversity.

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