Thanks to visit codestin.com
Credit goes to www.scribd.com

0% found this document useful (0 votes)
38 views4 pages

1 Computer Maths

This document is an examination paper for the Computer Mathematics course at Chinhoyi University of Technology, dated June 2024. It includes seven questions covering topics such as power sets, Venn diagrams, truth tables, relations, logical expressions, functions, proof methods, and graph theory. Candidates are instructed to answer all questions legibly and neatly within a duration of three hours.

Uploaded by

Sean Martin
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
0% found this document useful (0 votes)
38 views4 pages

1 Computer Maths

This document is an examination paper for the Computer Mathematics course at Chinhoyi University of Technology, dated June 2024. It includes seven questions covering topics such as power sets, Venn diagrams, truth tables, relations, logical expressions, functions, proof methods, and graph theory. Candidates are instructed to answer all questions legibly and neatly within a duration of three hours.

Uploaded by

Sean Martin
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 4
CHINHOYI UNIVERSITY OF TECHNOLOGY > Car SCHOOL OF ENGINEERING SCIENCE AND TECHNOLOGY DEPARTMENT OF ICT AND ELECTRONICS, (COURSE: COMPUTER MATHEMATICS MAIN EXAMINATION CODE: CUITM 102 DATE: JUNE 2024 | DURATION: 3 HOURS INSTRUCTIONS TO CANDIDATES Answer ALL questions in this paper. The paper has 7 questions The paper has 3 printed pages Write legibly. You are required to present your answers neatly in the answer scripts provided. Question One a) Specify the power set of each of the following sets: 1 {{9,0}} [2marks] nL {(0,1,23,{(0, 1} [4marks] LG [2marks} b) Draw the Venn diagrams for each of these combinations of the sets A, B, and C. ij) AN(B-C) — i)(ANB)U(ANC) iii) (AB) U(ANC) [6marks] Question Two a) Construct a truth table for (p + q) + (r+ s) [4marks] b) Show that each of the conditional statements below is a tautology by using axioms of logic. (Do not use truth tables). i(pAg—p_ ii)p (pv) iii)-p (p> a) __ iv) (PAQ)— (p> Q) [12marks] Question Three Determine whether the relation R on the set of all integers is reflexive, symmetric, antisymmetric, and/or transitive, where (x, y) € R if and only if a)x4y, — b)xy= 1, )x=y(mod 7), d)x isa multiple of y. [8marks] Question Four Let P(x) be “x is perfect”; let F(x) be “x is your friend”; and let the domain be all people. ‘Translate each of these statements into logical expressions using predicates, quantifiers, and logical connectives. a) No one is perfect. b) Not everyone is perfect. c) Atleast one of your friends is perfect. 4) Everyone is your friend and is perfect, ©) £) Not everybody is your friend or someone is not perfect. [L0marks] Question Five a). Sketch line graphs of each of the following relations, assuming x, y € R and determine the properties of each relation, Lo {(@yle= y+) I (@y) [xls taAbl2 TH. {(z,y) |x = y? [15 marks} b) Let g:Z + Rwhere g(x) = V¥and let f:R + Z where (x) = x mod 2 . Note that amod b returns the remainder after a is divided by b. Find f° g andg » f.1f they are not defined, state your reason(s). [4 marks] c) For each of the following functions, i. Determine if it is subjective and/or injective. ii, State the range of the function. iii, Find the inverse of the function ifit exists. i. f:R > R, f(x) = cos(x); ii, g:N > N,g(n) = 2n +3; iil, ALR > R,g@) =x(x-2X+2; [9 marks} Question Six a) Describe the following proof methods 1. Proof by counter-example I. Contraposition [4 marks] b) Prove that if'n is a positive integer, then n is odd if and only if Sn + 6 is odd. [Smarks} c) Translate these statements into English, where F(p) is “Printer p is out of service,” B(p) is “Printer p is busy,” L(j) is “Print job j is lost,” and Q(j) is “Print job j is queued.” i) Bp(F(p) A B(p)) + 3jLG) ii) VpB(p) > 34QG) iff) 3](QG) A LG) — 3pF(P) [6marks] Question Seven 2) Using an example describe a strongly connected graph. [5marks} b) How can be Breath First Search differ from Depth First Search in terms of the order in which odes are visited? [4marks} End of examination

You might also like