Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

Assignment (100 marks) 1) Which of the following sentences are propositions? What are the truth values of those that are propositions? (5 marks) (a) Open

image text in transcribed
image text in transcribed
image text in transcribed
image text in transcribed
image text in transcribed
image text in transcribed
Assignment (100 marks) 1) Which of the following sentences are propositions? What are the truth values of those that are propositions? (5 marks) (a) Open the door. (b) I like mathematics. (c) 2+ 4 = 6 (d) x + 3 = 12 (e) Will you pass the examination? 2) What is the negation of each of these propositions? (3 marks) (a) Charles has a smartphone. (b) There is no pollution in London (c) 3+2=5 3) State the converse, contrapositive and inverse of each of these conditional statements: (4 marks) (a) If it snows today, I will ski tomorrow. (b) I come to class whenever there is going to be a test. (6) come to class whenever there is going to be a test. 4) Construct a truth table for each of these compound propositions: a (6 marks) (a) (p ) + (-9) (b) (pvq) (p) (c) (p = q) (19) 5) Translate the given statements into propositional logic using the propositions provided: (a) You cannot edit a protected site entry unless you are an administrator. (1 mark) Let p be the proposition statement "You can edit a protected site", and q be the proposition statement "You are the administrator". 5) (cont.) (b) You can graduate if you have completed the requirements of your course and you do not owe money to the university and you do not have an overdue library loan. (2 marks) Leto be the proposition statement "You can graduate". q be the proposition statement "You owe money to the university": r be the proposition statement "You have completed the requirements of your course" and s be the proposition statement --You have an overdue library book". 6) (a) Show that p = and (p Aq) (p^rq) are logically equivalent. (b) Show that p- ( 91) and + (pvr) are logically equivalent. (3 marks) (4 marks) 7) Show that each of these conditional statements is a tautology by using truth tablest (a) (AG) (2 marks) (b) (p+q) (2 marks) (4 marks) 8) What is the cardinality of each of these sets: (a) x) (b) {x}} (c) {x,{x} (d) {x,{x}. {x.x!!! marco d) {x,{x},{x{x}}} (4 marks) 9) Find the power set of each of these sets, where x, y are distinct clements: (a) {x,y) (b) {x,y,z) (4 marks) 10) Let A={a,b.c,d) and B-fxy. Find: (a) AXB (b) (4 marks) 11) Let A = {1,2,3,4,5) and B-{0,3,6). Find: (a) AUB (b) AB (c) A-B (d) B-A 12) Draw the Venn diagrams for each of these combinations of the sets A, B, and C: (a) An(B-C) (2 marks) (b) (ABASC) (3 marks) 13) Let f(x)=x+1 and g(x) = x + 2 are relations on the set of real numbers, (a) Decide whether f(x) and g(x) are function, if so, state whether they are injection, surjection or bijection (4 marks) (b) Does either f(x) or g(x) have an inverse? If so, find the inverse. (3 marks) (c) Find fg and g f. 8 (6 marks) 14) For cach of the following relations on the set {1. 2. 3. 4. decide whether it is reflexive, whether it is symmetric, whether it is antisymmetric, and whether it is transitive: (6 marks) a2.2), (2, 3), (2.4),(3,2).(3.3).(3.4) b){(1.1).0.2), (2.1). (2.2), (3, 3), (4,4)} e) {(2,4),(4.2); 15) Let A = 17.9.10.12). B = {1,2,3,4) and consider the relations: R = {(a,b)AXB-2623 G = a,b) a Abe Band (a+b)-12) H-{(ab) aeB beBand (a+b) > 5 (m) List all the elements of the relation and give its cardinality (b) Find the range and domain of the relation R (c) Find the inverse relation R (d) Find the sets of ordered pair in G and H. (c) Draw the diagraphs of G and H (D Give the Boolean-matrix representations of G and H. (4 marks) (2 marks) (2 marks (6 marks) (6 marks) (2 marks) 0 (f) Give the Boolean-matrix representations of G and H. (0 marks) (2 marks) 16) Determine whether each of these functions is a bijection from R to R, where R is the set of real numbers, justify your answers: (6 marks) (a) f(x)=2x+1 (b) f(x)=x2 +1 (c) f(x)=x? 3 16C ASH AG

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Database Driven Web Sites

Authors: Joline Morrison, Mike Morrison

2nd Edition

? 061906448X, 978-0619064488

More Books

Students also viewed these Databases questions