Discrete Math

Module Seven Homework

General:

· Before beginning this homework, be sure to read the textbook readings and the module notes.

· For additional practice, each homework problem has some ungraded examples and sample problems from the text that you can review, and they directly correspond with your graded homework. Work on those problems if needed, and post your questions to this week’s ungraded discussion forum.

· Work within this document for your homework, and be sure to show all steps for arriving at your solution.

Section 7.1 Homework

Refer to Figure HW 7 for problems 1–5.

Figure HW 7

1) List all of the following:

a) Level-2 vertices

b) Leaves

c) Siblings of v6

d) Descendants of v6

a.) Level-2 vertices: V4, V5, V6, V7, V8, V9

b.) Leaves: V4, V5, V10, V11, V7, V8, V9

c.) Siblings of v6 : None

d.) Descendants of v6 : V10, V11

2) Is this an n-tree? If so, for what integer n? This is similar to problems 7.1.9, 7.1.10, 7.1.14, and 7.1.15.

Yes. For all values of n as integer greater than 1

4) Draw the digraph of the binary positional tree that corresponds to Figure HW 7 from section 7.1 of this homework assignment. Below are images you can use to create the diagraph. You may copy/paste the arrow and alter the directions and length as needed. This problem is similar to examples 5 and 6 and problems 7.3.31 and 7.3.32.

image1.png

image2.png

image3.png

image4.png

image5.png

image6.png

image7.png

image8.png

image9.png

image10.png

image11.png

image12.png

image13.png

image14.jpeg