Math 201-803 Final Exam December 2009, Exams of Computer Science

The final exam for math 201-803, which took place on december 14, 2009. The exam covers various topics in boolean algebra, sets, venn diagrams, and matrix algebra. It includes multiple-choice questions, problems that require drawing venn diagrams, and problems that require using logical properties and properties of boolean algebra to simplify expressions.

Typology: Exams

2012/2013

Uploaded on 02/27/2013

malu_90
malu_90 🇮🇳

4.2

(6)

76 documents

1 / 5

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Math 201-803-Final Exam December 14, 2009 Page 1 of 5
1.(3) Evaluate the expressions:
(a) 10C4 (b) 10P4 (c) 15!4!
3!11!
2.(4) (a) In how many ways can a president, a vice president and a treasurer be selected for a club
with 7 members?
(b) Six students are going to be chosen at random from a class of 20 students to take a trip to
Ottawa. In how many ways can this be done?
3.(3) Let A={1,3,5},B={2,4,6}and U={xN: 1 x10}.
a) Are Aand Bequivalent? Explain.
b) Find A.
c) Find ABand AB
4.(2) Draw a Venn diagram and show by hatching the following set: (BC)(AC)
5.(5) For each expression, name the property from the given list and say whether it is a set property,
a network property, or a logic property: associative, closure, commutative, complement, con-
tradiction, DeMorgan, distributive, double complement, double negation, idempotent, identity,
property of 1 (or 0), tautology.
a) (pp)pb) AA=c) A·B=A+B
d) (p)pe) A+B·C= (A+B)·(A+C)
6.(1) What is a contradiction?
7.(4) Use a truth table to determine whether or not (NAND) distribute over (EOR).
That is, whether or not [p(qr)] is equivalent to [(pq)(pr)].
8.(6) Use a truth table to determine whether the argument is valid or not.
H: If there are two books on the table, then one of them belongs to Jane.
If one of the books belongs to Jane, then Jane is happy.
Jane is not happy.
C: There are not two books on the table.
9.(3) Use a Venn diagram to determine the validity of the argument.
H: All Pandas are black and white.
Some black and white animals are endangered.
C: Some Pandas are endangered.
10.(4) If you have a flu, then you must stay home for seven days.
a) Write the converse, the contrapositive, and the inverse of the implication above.
b) Say which among the four statements are equivalent.
pf3
pf4
pf5

Partial preview of the text

Download Math 201-803 Final Exam December 2009 and more Exams Computer Science in PDF only on Docsity!

(3) 1. Evaluate the expressions:

(a) 10C 4 (b) 10P^4 (c)

(4) 2. (a) In how many ways can a president, a vice president and a treasurer be selected for a club with 7 members? (b) Six students are going to be chosen at random from a class of 20 students to take a trip to Ottawa. In how many ways can this be done?

(3) 3. Let A = { 1 , 3 , 5 }, B = { 2 , 4 , 6 } and U = {x ∈ N : 1 ≤ x ≤ 10 }.

a) Are A and B equivalent? Explain. b) Find A. c) Find A ∩ B and A ∪ B

(2) 4. Draw a Venn diagram and show by hatching the following set: (B ∩ C) ∪ (A ∪ C)

(5) 5. For each expression, name the property from the given list and say whether it is a set property, a network property, or a logic property: associative, closure, commutative, complement, con- tradiction, DeMorgan, distributive, double complement, double negation, idempotent, identity, property of 1 (or 0), tautology.

a) (p ∧ p) ↔ p b) A ∩ A = ∅ c) A · B = A + B d) ∼ (∼ p) ↔ p e) A + B · C = (A + B) · (A + C)

(1) 6. What is a contradiction?

(4) 7. Use a truth table to determine whether or not ∧ (NAND) distribute over ∨ (EOR). That is, whether or not [p ∧ (q ∨ r)] is equivalent to [(p ∧ q) ∨ (p ∧ r)].

(6) 8. Use a truth table to determine whether the argument is valid or not.

H: If there are two books on the table, then one of them belongs to Jane. If one of the books belongs to Jane, then Jane is happy. Jane is not happy.

C: There are not two books on the table.

(3) 9. Use a Venn diagram to determine the validity of the argument.

H: All Pandas are black and white. Some black and white animals are endangered.

C: Some Pandas are endangered.

(4) 10.If you have a flu, then you must stay home for seven days.

a) Write the converse, the contrapositive, and the inverse of the implication above. b) Say which among the four statements are equivalent.

(4) 11.Find a Boolean table for the expression: a) A · B + A · B b) Write a logical statement which is analogous to this expression.

(2) 12.Draw a network to represent the given boolean expression: F [(A + CD) + (EF G)]

(5) 13.Simplify each expression, justifying each step using properties of Boolean algebra. a) A + AB + B b) AB + BC + B(C + B)

(6) 14.Classify each system below (without solving) as dependent or independent, consistent with one solution only, consistent with infinitely many solutions or inconsistent. Justify your answers.

a) 3 x − 2 y = 3 2 x − 3 y = 3

b) 5 x − 2 y = 3 2 y − 5 x = − 3

c) 3 x − y = 6 − 6 x + 2y = − 3

(5) 15.Given the system

2 x − 3 y = 7 −x + 3y = − 2 a) Estimate the solution by graphing. b) Solve the system algebraically by substitution or elimination. c) Compare results from a) and b) (Write a comment).

(12) 16.Given: A =

 B =

[

]

C =

[

]

D =

 I =

[

]

find each of the following, if possible. If an operation is not possible, say why. a) 3 B − 5 I b) C−^1 c) B^4 d) C + I e) AI f) AT^ D g) CD

(10) 17.Find the inverse of each matrix or explain why it does not exist.

a) A =

[

]

b) B =

 (^) c) C =

(4) 18.Given the linear system

x − y − 3 z = 0 −x + 2y + 4z = − 1 x + y = 3 a) write the system in matrix form AX = B.

b) If A−^1 =

, solve the system using A−^1.

  1. a) idempotent, logic b) complement, sets c) DeMorgan, network d) double negation, logic e) distributive, network
  2. Logical statement which is false in every case.
  3. Not equivalent
  4. Valid argument
  5. Invalid argument
  6. a) Converse: If you must stay home for seven days, then you have a flu. Contrapositive: If you don’t have to stay home for seven days, then you don’t have a flu. Inverse: If you don’t have a flu, then you don’t have to stay home for seven days.

b) The original statement is equivalent to contrapositive. The converse statement is equivalent to inverse.

  1. a) It is 0 when A 6 = B, (A = 1, B = 0 or A = 0, B = 1) and 1 when A = B(A = 1, B = 1 or A = 0, B = 0). b) p ↔ q (or equivalent statement (p ∧ q) ∨ (∼ p∧ ∼ q))

| −→ A −→ | | −→ | | −→ | −→ F −→ | | −→ C −→ D −→ | | −→ | | | −→ E −→ F −→ G −→ |

  1. a) 1 b) B
  2. a) different slopes, independent and consistent, one solution b) same line, dependent and consistent, infinitely many solutions c) same slope and different intercepts means parallel lines, independent and inconsistent sys- tem, no solution.
  3. a)The graph suggests that x ≃ 5 and y ≃ 1, which turns out to be the exact answer by b).

x

y

(0, − 37 )

(2,0) (0, − 32 ) ( 72 ,0)

(5,1)

  1. a)

[

]

b) no inverse, C is not square matrix c)

[

]

d) undefined e)

 (^) f)

[

]

g)

[

]

  1. a)

[

]

b)

3 2 −

3 2 −

1 2

 (^) c) No inverse, C can not be reduced to I.

  1. a)

x y z

 (^) b) X = A−^1 B =

  1. a)

x = 1 − 3 t y = 5 + 2t z = t

b)

x = − 5 y = 3 z = 0

x = − 6 y = 2 z = 1

  1. System inconsistent (no solution).