Explore BrainMass

Discrete Structures

Tree Traversal.

Find the: 1. preorder transversal 2. inorder transversal 3. postorder transversal Of the tree attached in the Word document.

Relations for Symmetric Transitive Closures

S = {0, 1, 2, 4, 6} Test the binary relations on S for reflexivity, symmetry ,antisymmetry, and transitivity. Also find the reflexive, symmetric and transitive closure of each relations. A) P = {(0,0), (1,1), (2,2), (4,4), (6,6), (0,1), (1,2), (2,4), (4,6) } B) P {(0,1), (1,0), (2,4), (4,2), (4,6), (6,4)} C) P ((0

Equivalence Relations and Classes

Let L be a subset of {a,b}* Define a relation R (R sub L) on S* as follows: L for All of x, y is a member of S*, (x,y) are members of R if for all of z, xz are members of L iff yz are members of L A) Show that R is an equivalence relation B) Suppose L={a^i b^i where i >= 0} What can you say about the inde

Discrete Structures

11) Use generating functions to determine the number of different ways 12 identical action figures can be given to five children so that each child receives at most three action figures. 12) Use generating functions to find the number of ways to select 10 balls from an urn containing red, white and blue balls if: a. The

Discrete structures

6. A string that contains only 0s 1s and 2s is called a ternary string a) find a recurrence relation for the number of ternary strings that contain two consecutive 0s b) what are the initial conditions c) how many ternary strings of length six contain two consecutive 0s The next 3 problems deal with a variation of the

Standard deviation calculation by frequency table

Find the standard deviation of the data in the given frequency table. A company had 80 employees whose salaries are summarized in the frequency table below. Find the standard deviation. Salary Employees 5001-10000 17 10001-15000 16 15001-20000 20 20001-25000 15 25001-30000 12