TMA1211

Question 1

Based on Constructed truth table for the following expression:
(P∨Q)∧(¬Q→R)
What is the correct answer for the final part from Top to Down

• TTTFTTFF

• FFFTFFTT

• TTTFTFFF

• FFFTTFTT

Translate into Logic based on attached Picture

• (Q→S)∨(R→S)

• (Q→R)∨(R→S)

• (S→Q)∧(R→S)

• (Q→S)∨(R→¬S)

Correct Answer?

• B ∨ ¬D

• ¬B ∧ ¬D

• B∨D

• B ∧ D

Which of the following best represents the meaning of the logical expression below?

• A. The meeting is scheduled, and if the leader joins, then an announcement will be made.

• B. It is not true that the meeting is scheduled and the leader joins the session.

• C. The meeting is not scheduled, or the leader does not join the session.

• D. It is not true that the meeting is scheduled and, if the leader joins, then an announcement is made.

Determine whether R is an equivalence relation?why?

• Not an equivalence relation.
  Reflexive: ✓

  • Symmetric: ✓

  • Transitive: ✗

• • Not an equivalence relation.

  • Reflexive: ✗

  • Symmetric: ✓

  • Transitive: ✗

• Yes is an equivalence relation.
  Reflexive: ✓

  • Symmetric: ✓

  • Transitive: ✓

• • Not an equivalence relation.

  • Reflexive: ✗

  • Symmetric: ✗

  • Transitive: ✗

Find: S ∘ R

• S∘R = {(p,q), (q,s), (r,p), (s,q)}

• S∘R = {(p,r), (q,s), (r,p), (s,q)}

• S∘R = {(p,r), (q,s), (r,p), (r,q)}

• S∘R = {(p,r), (r,s), (r,p), (s,q)}

Determine if the graph has an Euler circuit? What about Euler Path?

• Euler Circuit? Yes
  Euler Path? Yes

• Euler Circuit? Yes
  Euler Path? No

• Euler Circuit? No
  Euler Path? Yes

• Euler Circuit? No
  Euler Path? No

based on attachment , which one is Correct answer?

• No

• Yes but for all natural numbers n

• Yes but for any real numbers n

• Yes but for any Integers n

An edge e that connects a point v back to itself is called (a)  

Any comments or suggestions for the class so far? Both positive and negative feedback are most welcome and appreciated!