Standard Deck - Discrete Mathematics - Exam, Exams of Discrete Mathematics

This is the Exam of Discrete Mathematics which includes Recurrence Relation, Space Is Available, Answer, Number of Ways, Sum of Odd Integers, By Hand, Solution, Various Walks, Provided etc. Key important points are: Standard Deck, Cards Contains, Cards Numbered, Numbered Card Appears, Spades, Hearts, Diamonds, Clubs,, Probability, Students Seat

Typology: Exams

2012/2013

Uploaded on 02/21/2013

radheshyam
radheshyam 🇮🇳

51 documents

1 / 5

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Nc1,¯c2¯c3· · · ¯ct) = N[N(c1) + N(c2) + · · · +N(ct)]
+[N(c1c2) + N(c1c3) + · · · +N(c1ct) + · · · +N(c2c3) + · · · +N(ct1ct)]
[N(c1c2c3) + N(c1c2c4) + · · · +N(c1c2ct) + N(c1c3c4) + · · ·
+N(c1c3ct) + · · · +N(ct2ct1ct)] + · · · + (1)tN(c1c2c3· · · ct)
=S0S1+S2S3+· · · + (1)tSt
Em=Sm m+ 1
1!Sm+1 + m+ 2
2!Sm+2 · · · + (1)tm t
tm!St
Lm=Sm m
m1!Sm+1 + m+ 1
m1!Sm+2 · · · + (1)tm t1
m1!St
If nZ+,
n
r!= n+r1
r!
For all m,n Z+, a R,
(1 + x)n= n
0!+ n
1!x+ n
2!x2+· · · + n
n!xn
(1 xn+1)
(1 x)= 1 + x+x2+x3+· · · +xn
1
(1 x)= 1 + x+x2+x3· · · =
X
i=0
xi
1
(1 + x)n= n
0!+ n
1!x+ n
2!x2+· · ·
=
X
i=0 n
i!xi
= 1 + (1) n+ 1 1
i!x+ (1)2 n+ 2 1
2!x2+· · ·
=
X
i=0
(1)i n+i1
i!xi
1
(1 x)n= n
0!+ n
1!(x) + n
2!(x)2+· · ·
=
X
i=0 n
i!(x)i
= 1 + (1) n+ 1 1
i!(x)+(1)2 n+ 2 1
2!(x)2+· · ·
=
X
i=0 n+i1
i!xi
ve+ 2 = r, 3r2e, e 3v6
Xdeg(v) = 2|E|,Xdeg(Ri) = 2|E|
1
pf3
pf4
pf5

Partial preview of the text

Download Standard Deck - Discrete Mathematics - Exam and more Exams Discrete Mathematics in PDF only on Docsity!

N (¯c 1 , ¯c 2 c¯ 3 · · · ¯ct) = N − [N (c 1 ) + N (c 2 ) + · · · + N (ct)]

+[N (c 1 c 2 ) + N (c 1 c 3 ) + · · · + N (c 1 ct) + · · · + N (c 2 c 3 ) + · · · + N (ct− 1 ct)] −[N (c 1 c 2 c 3 ) + N (c 1 c 2 c 4 ) + · · · + N (c 1 c 2 ct) + N (c 1 c 3 c 4 ) + · · · +N (c 1 c 3 ct) + · · · + N (ct− 2 ct− 1 ct)] + · · · + (−1)tN (c 1 c 2 c 3 · · · ct) = S 0 − S 1 + S 2 − S 3 + · · · + (−1)tSt

Em = Sm −

( m + 1 1

) Sm+1 +

( m + 2 2

) Sm+2 − · · · + (−1)t−m

( t t − m

) St

Lm = Sm −

( m m − 1

) Sm+1 +

( m + 1 m − 1

) Sm+2 − · · · + (−1)t−m

( t − 1 m − 1

) St

If n ∈ Z+, (^) ( −n r

)

( n + r − 1 r

)

For all m, n ∈ Z+, a ∈ R,

(1 + x)n^ =

( n 0

)

( n 1

) x +

( n 2

) x^2 + · · · +

( n n

) xn

(1 − xn+1) (1 − x) = 1 + x + x^2 + x^3 + · · · + xn

1 (1 − x)

= 1 + x + x^2 + x^3 · · · =

∑^ ∞

i=

xi

1 (1 + x)n^

( −n 0

)

( −n 1

) x +

( −n 2

) x^2 + · · ·

∑^ ∞

i=

( −n i

) xi

( n + 1 − 1 i

) x + (−1)^2

( n + 2 − 1 2

) x^2 + · · ·

∑^ ∞

i=

(−1)i

( n + i − 1 i

) xi

1 (1 − x)n^

( −n 0

)

( −n 1

) (−x) +

( −n 2

) (−x)^2 + · · ·

∑^ ∞ i=

( −n i

) (−x)i

( n + 1 − 1 i

) (−x) + (−1)^2

( n + 2 − 1 2

) (−x)^2 + · · ·

∑^ ∞

i=

( n + i − 1 i

) xi

v − e + 2 = r, 3 r ≤ 2 e, e ≤ 3 v − 6 ∑ deg(v) = 2|E|,

∑ deg(Ri) = 2|E|

MACM 201 Final Examination, April 2006

R. Pyke

Aids allowed: nonprogrammable calculator and formula sheet (provided).

Marks for each question are indicated by [ ]. Total marks: 100.

Time allowed: 180 minutes. There are 13 questions.

NAME:

STUDENT NUMBER:

(1) [ ] A standard deck of 52 cards contains cards numbered 1 (Ace), 2,... , 10,

J (Jack), Q (Queen), and K (King). There are 4 suits; clubs, spades, hearts,

and diamonds. Each numbered card appears once in each suite (so for example,

there are 4 Aces; one each in clubs, spades, hearts, and diamonds). Thus,

52 = 13 × 4.

(a) Suppose a hand of 10 cards are dealt out (randomly) from the deck. What

is the probability that this hand will contain at least 1 card from each suit?

(b) What is the probability that this hand will contain at least one void (for

example, no clubs)?

(2) [ ] Ten students take a math test in a certain room. When the test is over the

students leave the room for a break and then return to the room to discuss the

answers to the test. If there are 14 chairs in this room, in how many ways can

the students seat themselves after the break so that no one is in the same chair

that they wrote the test in?

(3) [ ] Solve the following recurrence relation using generating functions.

an+1 + 3an + 1 = n^3 + 2n, a 0 = 1, a 1 = 2

Check your answer using a 2.

(b) Sketch the complement G¯ of G. Begin by arranging the vertices of G along

a circle, as given below.

(c) Is G bipartite? Explain.

(d) Is G planar? Explain.

(e) Is the graph below planar? Explain.

(9) [ ] Suppose T is a spanning tree of Kn, the complete graph on n vertices. Prove

or disprove: If an edge from e from Kn, e 6 ∈ T , is added to T to produce the

graph T ′, then T ′^ contains a cycle.

(10) [ ] Prove or disprove: If G is a planar graph on v ≥ 4 vertices, then G¯ is not

planar.

(11) [ ] List the vertices in the tree below when they are visited in a preorder

traversal and in a postorder traversal.

(12) [ ] Find the depth-first spanning tree for the graph below if the order of the

vertices is alphabetical.

(13) [ ] Consider the following graph G below;

(a) Use Dikjistra’s Algorithm to find the lengths of the shortest paths from

vertex a to all other vertices. What is the shortest path from a to d?

(b) Find a minimal spanning tree for G using Kruskal’s Algorithm (assume all

edges are undirected). Show the steps of the algorithm.

(c) Find a minimal spanning tree for G using Prim’s Algorithm (assume all

edges are undirected). Show the steps of the Algorithm.