 3.R.1RQ: a) Define the term algorithm.________________b)What are the differe...
 3.R.2RQ: a) Describe, using English, an algorithm for finding the largest in...
 3.R.3RQ: a) State the definition of the fact that f(n) is O(g(n)), where f(n...
 3.R.4RQ: ?List these functions so that each function is bigO of the next fu...
 3.R.5RQ: a) How can you produce a bigO estimate for a function that is the ...
 3.R.6RQ: a) Define what the worstcase time complexity, average case time co...
 3.R.7RQ: a) Describe the linear search and binary search algorithm for findi...
 3.R.8RQ: a) Describe the bubble sort algorithm.________________b) Use the bu...
 3.R.9RQ: a) Describe the insertion sort algorithm.________________b)Use the ...
 3.R.10RQ: a) Explain the concept of a greedy algorithm.________________b) Pro...
 3.R.11RQ: Define what it means for a problem to be tractable and what it mean...
Solutions for Chapter 3.R: Discrete Mathematics and Its Applications 7th Edition
Full solutions for Discrete Mathematics and Its Applications  7th Edition
ISBN: 9780073383095
Solutions for Chapter 3.R
Get Full SolutionsThis textbook survival guide was created for the textbook: Discrete Mathematics and Its Applications, edition: 7. Since 11 problems in chapter 3.R have been answered, more than 430803 students have viewed full stepbystep solutions from this chapter. This expansive textbook survival guide covers the following chapters and their solutions. Chapter 3.R includes 11 full stepbystep solutions. Discrete Mathematics and Its Applications was written by and is associated to the ISBN: 9780073383095.

CayleyHamilton Theorem.
peA) = det(A  AI) has peA) = zero matrix.

Column picture of Ax = b.
The vector b becomes a combination of the columns of A. The system is solvable only when b is in the column space C (A).

Cyclic shift
S. Permutation with S21 = 1, S32 = 1, ... , finally SIn = 1. Its eigenvalues are the nth roots e2lrik/n of 1; eigenvectors are columns of the Fourier matrix F.

Eigenvalue A and eigenvector x.
Ax = AX with x#O so det(A  AI) = o.

Elimination matrix = Elementary matrix Eij.
The identity matrix with an extra eij in the i, j entry (i # j). Then Eij A subtracts eij times row j of A from row i.

Factorization
A = L U. If elimination takes A to U without row exchanges, then the lower triangular L with multipliers eij (and eii = 1) brings U back to A.

Free variable Xi.
Column i has no pivot in elimination. We can give the n  r free variables any values, then Ax = b determines the r pivot variables (if solvable!).

Full column rank r = n.
Independent columns, N(A) = {O}, no free variables.

Graph G.
Set of n nodes connected pairwise by m edges. A complete graph has all n(n  1)/2 edges between nodes. A tree has only n  1 edges and no closed loops.

Independent vectors VI, .. " vk.
No combination cl VI + ... + qVk = zero vector unless all ci = O. If the v's are the columns of A, the only solution to Ax = 0 is x = o.

Kirchhoff's Laws.
Current Law: net current (in minus out) is zero at each node. Voltage Law: Potential differences (voltage drops) add to zero around any closed loop.

Minimal polynomial of A.
The lowest degree polynomial with meA) = zero matrix. This is peA) = det(A  AI) if no eigenvalues are repeated; always meA) divides peA).

Orthogonal matrix Q.
Square matrix with orthonormal columns, so QT = Ql. Preserves length and angles, IIQxll = IIxll and (QX)T(Qy) = xTy. AlllAI = 1, with orthogonal eigenvectors. Examples: Rotation, reflection, permutation.

Pivot columns of A.
Columns that contain pivots after row reduction. These are not combinations of earlier columns. The pivot columns are a basis for the column space.

Pseudoinverse A+ (MoorePenrose inverse).
The n by m matrix that "inverts" A from column space back to row space, with N(A+) = N(AT). A+ A and AA+ are the projection matrices onto the row space and column space. Rank(A +) = rank(A).

Spanning set.
Combinations of VI, ... ,Vm fill the space. The columns of A span C (A)!

Subspace S of V.
Any vector space inside V, including V and Z = {zero vector only}.

Symmetric factorizations A = LDLT and A = QAQT.
Signs in A = signs in D.

Vector space V.
Set of vectors such that all combinations cv + d w remain within V. Eight required rules are given in Section 3.1 for scalars c, d and vectors v, w.

Wavelets Wjk(t).
Stretch and shift the time axis to create Wjk(t) = woo(2j t  k).