Transform Summation - Discrete Structures - Exam, Exams of Discrete Structures and Graph Theory

This exam paper is very easy to understand and very helpful to built a concept about the foundation of computers and discrete structures.The key points in these exam are:Transform Summation, Summation Form, Subsets of Universal Set, Set Identities, Rational Numbers, Statement by Contradiction, Mathematical Induction, Math Induction, Bijection Function, Inverse of Function

Typology: Exams

2012/2013

Uploaded on 04/27/2013

ashakiran
ashakiran 🇮🇳

4.5

(27)

261 documents

1 / 1

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Page 1
Discrete Structures - Fall 1993 Exam 2
1. Circle the correct answer:
i. 26 mod 7 = a. 3.714285714286 b. 0 c. 5 d. 3 e. 182
ii. 26 div 7 = a. 3.714285714286 b. 0 c. 5 d. 3 e. 182
2. Rewrite in expanded form.
3. Rewrite 3 - 3(5) + 3(52) - 3(53) +...- 3(511) in summation form.
4. Transform the summation using the rule i = k - 1.
5. Let A = {1,2,3,4,5}, B = {2,4,6,8}, and C = {0,3,6,9} be subsets of the Universal set
U = {0,1,2,3,4,5,6,7,8,9}. Find: a. (A ∩ B) (B C)C b. P(A B)
6. Use the Set Identities to show: For all sets A and B, (BC (BC AC))C = B.
(Hint: If X and Y are any sets, then X Y X)
7. Circle T if the following statements are true or F if they are false.
T F 2 {1,2,3} T F 2 {1,2,3}
T F {2} {1,2,3} T F {2} { {1},{2} }
T F 2 { {1},{2} } T F {2} { {1},{2} }
8. Let Σ ={x,y} be an alphabet. Find Σ1 × Σ2 .
10. Do any 2 of the 3 proofs below. You get credit for the first two that you prove only
(so don’t do all three!).
a. Prove that if r and s are rational numbers with r < s, then there is a rational number x
such that r < x < s.
b. Prove the following statement by contradiction: If m2 is even, then m is even.
c. Prove, by Mathematical Induction, that
7m
m0=
4
k2
k1+
------------
k1=
5
ii 1()
nn 1()n1+()
3
-------------------------------------=
i2=
n
Docsity.com

Partial preview of the text

Download Transform Summation - Discrete Structures - Exam and more Exams Discrete Structures and Graph Theory in PDF only on Docsity!

Page 1

Discrete Structures - Fall 1993 Exam 2

  1. Circle the correct answer: i. 26 mod 7 = a. 3.714285714286 b. 0 c. 5 d. 3 e. 182 ii. 26 div 7 = a. 3.714285714286 b. 0 c. 5 d. 3 e. 182
  2. Rewrite in expanded form.
  3. Rewrite 3 - 3(5) + 3(5 2 ) - 3(5^3 ) +...- 3(5 11 ) in summation form.
  4. Transform the summation using the rule i = k - 1.
  5. Let A = {1,2,3,4,5}, B = {2,4,6,8}, and C = {0,3,6,9} be subsets of the Universal set

U = {0,1,2,3,4,5,6,7,8,9}. Find: a. (A ∩ B) ∪ (B ∪ C) C^ b. P(A ∩ B)

  1. Use the Set Identities to show: For all sets A and B, (B C^ ∪ (B C^ ∩ AC^ )) C^ = B. (Hint: If X and Y are any sets, then X ∩ Y ⊆ X)
  2. Circle T if the following statements are true or F if they are false. T F 2 ∈ {1,2,3} T F 2 ⊆ {1,2,3} T F {2} ∈ {1,2,3} T F {2} ∈ { {1},{2} } T F 2 ∈ { {1},{2} } T F {2} ⊆ { {1},{2} }
  3. Let Σ ={x,y} be an alphabet. Find Σ^1 × Σ^2.
  4. Do any 2 of the 3 proofs below. You get credit for the first two that you prove only (so don’t do all three!). a. Prove that if r and s are rational numbers with r < s , then there is a rational number x such that r < x < s. b. Prove the following statement by contradiction : If m^2 is even, then m is even.

c. Prove, by Mathematical Induction, that

7 m m = 0

4

k^2 k + 1


k = 1

5

i i ( – 1 ) n n (^^ –^1 )^ ( n^^ +^1 ) 3

= ------------------------------------- i = 2

n

Docsity.com