VCE Algorithmics (HESS)
VCE Algorithmics (HESS) External Assessment
Data ModellingEnglish
Exam overviewPractice session
A connected simple undirected graph G has 15 vertices. Five vertices have degree 4, four vertices have degree 3, and six vertices have degree 2. How many edges does G contain?
Loading your practice session…