DMMR: Study guide for Chapter 11 of the textbook by K. Rosen

STUDY all of SECTION 11.1, the parts of Section 11.2 on Decision Trees, and definition of spanning tree and minimum spanning tree from section 11.4 and 11.5, and Prim's algorithm.

Key concepts. (This is not a complete list of all the content.)

Parts of Chapter 11 that were NOT covered in this course

Most of Section 10.2, except for Decision Trees, which were covered; All of Section 10.3; Most of section 10.4, except for definition of spanning trees; in Section 11.5 the parts relating to Kruskal's algorithm, and the proof of correctness of Prim's algorithm, were not covered.

Home : Teaching : Courses : Dmmr 

Informatics Forum, 10 Crichton Street, Edinburgh, EH8 9AB, Scotland, UK
Tel: +44 131 651 5661, Fax: +44 131 651 1426, E-mail:
Please contact our webadmin with any comments or corrections. Logging and Cookies
Unless explicitly stated otherwise, all material is copyright © The University of Edinburgh