Docsity
Docsity

Prepare for your exams
Prepare for your exams

Study with the several resources on Docsity


Earn points to download
Earn points to download

Earn points by helping other students or get them with a premium plan


Guidelines and tips
Guidelines and tips

Midterm Exam 1 Study Sheet - Discrete Structures | MTH 220, Assignments of Discrete Structures and Graph Theory

Material Type: Assignment; Class: Discrete Structures; Subject: Mathematics; University: Marshall ; Term: Spring 2008;

Typology: Assignments

Pre 2010

Uploaded on 07/31/2009

koofers-user-xy4-1
koofers-user-xy4-1 🇺🇸

10 documents

1 / 4

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
02/18/2008 MTH 220 (201)
STUDY SHEET for MIDTERM #1 (Monday, February 25)
- Ch. 1 (1.1 1.5)
- Ch. 2 (2.1, 2.2)
- Ch. 3 (3.1, 3.2, 3.3)
The best way to prepare to the midterm is to read the book and to do the homework
exercises. Please, take time to go over the material.
Here is what you have to have an idea about:
1. Sets and Subsets.
a) Special sets: Z+, N, Z, Q, and R.
b) Empty set.
c) Finite and infinite sets. Cardinality of a set.
d) Power set.
e) Venn diagrams.
2. Operations on Sets
a) Union of two sets.
b) Intersection of two sets.
c) Disjoint sets.
d) Complement of B with respect to A.
e) Complement of a set.
f) Symmetric difference of two sets.
g) Algebraic properties of set operations (commutative, associative, distributive,
etc.). De Morgan’s laws.
h) The addition principle.
3. Sequences
a) Finite and infinite sequences.
b) Recursive and explicit formulas.
c) Set corresponding to a sequence.
d) Characteristic functions and its properties.
e) Computer representation of sets and subsets by using characteristics functions.
f) Countable and uncountable sets.
4. Properties of Integers
a) Prime numbers.
b) Greatest common divisor (GCD) and its properties.
c) Relatively prime numbers.
d) Euclidean Algorithm to find GCD.
e) Least common multiple (LCM). Relationship between GCD and LCM.
pf3
pf4

Partial preview of the text

Download Midterm Exam 1 Study Sheet - Discrete Structures | MTH 220 and more Assignments Discrete Structures and Graph Theory in PDF only on Docsity!

02/18/2008 MTH 220 (201)

STUDY SHEET for MIDTERM #1 (Monday, February 25)

  • Ch. 1 (1.1 – 1.5)
  • Ch. 2 (2.1, 2.2)
  • Ch. 3 (3.1, 3.2, 3.3)

The best way to prepare to the midterm is to read the book and to do the homework exercises. Please, take time to go over the material.

Here is what you have to have an idea about:

  1. Sets and Subsets. a) Special sets: Z+, N, Z, Q, and R. b) Empty set. c) Finite and infinite sets. Cardinality of a set. d) Power set. e) Venn diagrams.
  2. Operations on Sets a) Union of two sets. b) Intersection of two sets. c) Disjoint sets. d) Complement of B with respect to A. e) Complement of a set. f) Symmetric difference of two sets. g) Algebraic properties of set operations (commutative, associative, distributive, etc.). De Morgan’s laws. h) The addition principle.
  3. Sequences a) Finite and infinite sequences. b) Recursive and explicit formulas. c) Set corresponding to a sequence. d) Characteristic functions and its properties. e) Computer representation of sets and subsets by using characteristics functions. f) Countable and uncountable sets.
  4. Properties of Integers a) Prime numbers. b) Greatest common divisor (GCD) and its properties. c) Relatively prime numbers. d) Euclidean Algorithm to find GCD. e) Least common multiple (LCM). Relationship between GCD and LCM.

f) Mod-n functions. g) Representation of integers in different bases.

  1. Matrices a) Square matrix. b) Diagonal matrix. c) Equal matrices. d) Addition of two matrices. Zero matrix. Properties of addition. e) Multiplication of two matrices. Identity matrix. Properties of multiplication. f) Transpose of a matrix and its properties. Symmetric matrices. g) Inverse matrix. Formula for inverse matrix in case of 22 matrices.
  2. Propositions and Logical Operations. a) Statements (propositions). b) Negation of a statement and its truth table. c) Conjunction of two statements and its truth table. d) Disjunction of two statements and its truth table. e) Quantifiers: predicate (propositional function), universal quantification, existential quantification. f) Implication (conditional proposition) and its truth table. Converse, contrapositive, and inverse of an implication. g) Equivalence (biconditional). h) Tautology, contradiction, and contingency. i) Logically equivalent propositions.
  3. Permutations a) Multiplication principle of counting. b) Number of permutations of n objects taken r at a time. c) Factorials. d) The number of distinguishable permutations with limited repeats.
  4. Combinations a) Number of combinations of n objects taken r at a time. b) Selection of objects without regard of order and with allowed repeats.
  5. Pigeonhole Principle a) Pigeonhole principle b) Extended pigeonhole principle.
  1. For any two finite sets, A and B ,

a) | A B | | A | | B | b) | A B | | A | | B | | A B | c) | A B | | A | | B | | A B | d) | A B | | A B |

  1. The infinite sequence 3, 7, 15, 31, 63, … can be defined by the recursive formula

a) a 1 (^) 3 , an an 1 an 2 , n 2 b) a 1 (^) 3 , an 2 an 1 1 , n 2 c) an n^2 , n 1 d) a 1 (^) 3 , an 2 an 1 , n 2

  1. Which of the following statements is a negation of the statement “For every x, x – 2 = 5”?

a) For every x , x – 2 5 b) There exists x such that x – 2 = 5 c) There exists x such that x – 2 5 d) For every x, x – 2 > 5

  1. Let p : I will study discrete structures; q : I will go to a movie; and r : I am in a good mood. Then the statement “If I am in a good mood and I will not go to the movie, then I will study discrete structures” can be expressed symbolically as follows:

a) (r q) p b) (r q) p c) p (r ~q) d) (r ~q) p

  1. A committee of three students is needed to be selected out of class of 20 students. In how many ways can this selection be done?

a) 20 P 3 c) 20 C 3 b) 203 d) 22 C 3