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

0% found this document useful (0 votes)
19 views2 pages

DSC Assign 1

This document outlines an examination for the BSc Hon. Computer Science/Informatics program at the National University of Science and Technology, focusing on Discrete Mathematics. It includes various questions on set theory, equivalence relations, probability, graph theory, recurrence relations, power sets, and functions. The total marks for the exam are 65, and candidates are instructed to answer all questions neatly.

Uploaded by

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

DSC Assign 1

This document outlines an examination for the BSc Hon. Computer Science/Informatics program at the National University of Science and Technology, focusing on Discrete Mathematics. It includes various questions on set theory, equivalence relations, probability, graph theory, recurrence relations, power sets, and functions. The total marks for the exam are 65, and candidates are instructed to answer all questions neatly.

Uploaded by

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

NATIONAL UNIVERSITY OF SCIENCE AND TECHNOLOGY

COMPUTER SCIENCE
DEPARTMENT
FACULTY OF APPLIED SCIENCES
BSc Hon. Computer Science/Informatics

MODULE: DISCRETEMATHEMATICS

CODE:SCS1102

INSTRUCTION TO CANDIDATES
Answer all questions. Write neatly.
Total Mark: 65

Question One
a) Is {1, 3, 2} = {2, 2, 2, 3, 3, 3, 1, 1, 1, 1}? Justify your answer. [2]
b) Symbolically express the concept of:
i) Intersection of sets. [1]
ii) Union. [1]
iii) Compliment. [1]
c) Given that A, B and Care finite sets.
Show by set algebra that (A' U B)' ∩ A' = Ø [5]
d) Let set V={n ∈ Z: n2 + 7 < 6n} and set W = {2, 3, 4}, where Z is a set of integers and
n represents some elements of set Z. Prove that V = W. [5]

Question Two
a) Let S = {1, 2, 3, . . ., 19, 20} and define an equivalence relation R on S by xRy⇐⇒
4|(x − y). Determine the equivalence classes of R. [5]

b) If A = {a, b, c} and B = {1, 2} then find A × B and B × A. [4]


c) A card is picked with replacement from a pack of playing cards with no jokers.
Calculate the probability that the card: i) is Black ii) is a Heart iii) has an
even number on it? [5]

d) For each of the following , either give an example or prove there are none:
i) A simple graph with 6 vertices, whose degrees are 2, 2, 2, 3, 4, 4. [2]
ii) A simple graph with 8 vertices, whose degrees are 0, 1, 2, 3, 4, 5, 6, 7. [2]
iii) A simple graph with degrees 1, 2, 2, 3. [2]
e) Solve the following recurrence relation: an = 4an-1 – 4an-2 for n≥ 1, a0 = 5 and a1 = 16.
[5]
Question Three
a) Given that A= {3, 4}
i. Write down an expression for the number of elements in any power set.[1]
ii. Find the power set of A. [2]
b) Find the number of subsets of the set {1,2,3,4,5,6,7,8,9,10,11} having 4 elements.
[4]

Question Four
a) Solve the following equations:
i. P(x, 3) = 6 * C(x, 4). [4]
ii. P(m + n, 2) = 56 and P(m-n, 2) = 12. [6]

b) Given that the function f(x) = 2x maps Natural numbers onto Natural numbers.
i. What is the domain of f(x)? [1]
ii. What is the Codomain of f(x)? [1]
iii. What is the Range of f(x)? [1]
iv. Find the inverse of f(x). [2]
v. Investigate whether f(x) is surjective or not. [3]

You might also like