Sheet11 - decomposed into prime factors. (See textbook 4.2...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
McMaster University Department of Computing and Software Dr. W. Kahl COMP SCI 1FC3 Exercise Sheet 11 COMP SCI 1FC3 — Mathematics for Computing 7 April 2009 Exercise 11.1 — Equivalence Reasoning in Propositional Logic Using the basic propositional logic equivalences (and documenting their use), derive the following equiv- alence: ( ( p q ) ∧ ( p r ) ) ( p → ( q r ) ) Exercise 11.2 — Quanti±ers (5%of Final 2008) Explain why the order of quantiFers and in a formula is important. Use an explicit example to illustrate your point. Exercise 11.3 — Strong Induction (8%of Final 2008) State the principle of Strong Induction. Use strong induction to prove that all positive integers can be
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: decomposed into prime factors. (See textbook 4.2 Example 2 pp. 285286.) Exercise 11.4 Syntax Trees (5%of Final 2008) Draw the tree that corresponds to the following expression: (( a-b ) / 3)*(5+ (1 /a )) . Give the post-Fx (or reverse Polish notation) version of that expression. Exercise 11.4 Graphs Strongly-connected components : Textbook 9.4 Exercises 1116 (pp. 630631) Shortest paths : Textbook 9.6 Exercises 114 (pp. 655656)...
View Full Document

This note was uploaded on 03/26/2011 for the course CS 1fc3 taught by Professor Kahl during the Spring '11 term at McMaster University.

Ask a homework question - tutors are online