Scribd
Upload
36 views2 pages

For The Statement: "Silence Implies Consent", Change It in Words Into

This document contains 5 questions about logic, graphs, and passwords: 1) Build a truth table for the statement "If you do not succeed, then if you try again, you do succeed". 2) Analyze the conditional and other logical forms of the statement "Silence implies consent". 3) Determine if the argument "If the Umpire calls the runner out, we will lose the game" and "Either we do not lose the game or the Umpire calls the runner out" is valid using a truth table. 4) Use Fleury's and nearest neighbor algorithms to find Euler circuits and approximate minimum Hamilton circuits for a weighted graph. 5) Calculate the number of possible 3

Uploaded by

Siddharth Dungarwal
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
36 views2 pages

For The Statement: "Silence Implies Consent", Change It in Words Into

This document contains 5 questions about logic, graphs, and passwords: 1) Build a truth table for the statement "If you do not succeed, then if you try again, you do succeed". 2) Analyze the conditional and other logical forms of the statement "Silence implies consent". 3) Determine if the argument "If the Umpire calls the runner out, we will lose the game" and "Either we do not lose the game or the Umpire calls the runner out" is valid using a truth table. 4) Use Fleury's and nearest neighbor algorithms to find Euler circuits and approximate minimum Hamilton circuits for a weighted graph. 5) Calculate the number of possible 3

Uploaded by

Siddharth Dungarwal
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

QUESTION 1

We want to check on the Truth values for the following Statement: "If you do not succeed, then
if you try again, you do succeed".
Let s = "You succeed" and t = "try again", and build a Truth Table for the Statement.

QUESTION 2

  For the Statement: "Silence implies consent", change it in words into:


a) Its Conditional ("If ... then") form
b) Its Converse form
c) Its Inverse form
d) Its Contrapositive form
e) Its Disjunction ("or") form
f) Its Negation (based on the Disjunction form)

QUESTION 3

  For the following Argument, build a Truth Table and tell why the Argument is Valid or not:
"If the Umpire calls the runner out, we will lose the game"
"Either we do not lose the game or the Umpire calls the runner out"
"Therefore, we do not lose the game"

QUESTION 4
1. With the following Weighted Graph, use Fleury's Algorithm to find an Euler Circuit (if
possible) and use the Nearest Neighbor Algorithm at each Vertex to find the approximate
Minimum Hamilton Circuits and their Costs:

QUESTION 5
1. We have to create passwords for a new computer system.  We can use any of 5
letters (a, b, c, d, e) in both upper and lower case and any of 4 digits (0, 1, 2, 3).
a) How many 3-character passwords can we create?
b) How many 3-character passwords can we create if we cannot repeat any character?
c) Oops!  The new system is case-insensitive (it cannot tell upper case and lower case
apart)!  How many 3-character passwords do we now have?

You might also like