Scribd
Upload
22 views3 pages

Exams CSC 008 Discrete Structure

This document contains a discrete structures exam with 6 questions covering topics like relations, functions, sets, graphs, and Boolean algebra. Some key points: - Question 1 defines relation and its properties, and asks students to identify true statements about relations between integers. It also asks students to prove a statement about set unions is false. - Question 2 covers equivalence relations, functions defined as sets of ordered pairs, and determining if a set of pairs is a function. - Question 3 asks students to identify ordered pairs that satisfy a given relation, and to determine which ordered pairs belong to different given relations on natural numbers. - Question 4 involves set operations like complement, intersection, and union on sets of prime numbers

Uploaded by

imukhtar44
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
22 views3 pages

Exams CSC 008 Discrete Structure

This document contains a discrete structures exam with 6 questions covering topics like relations, functions, sets, graphs, and Boolean algebra. Some key points: - Question 1 defines relation and its properties, and asks students to identify true statements about relations between integers. It also asks students to prove a statement about set unions is false. - Question 2 covers equivalence relations, functions defined as sets of ordered pairs, and determining if a set of pairs is a function. - Question 3 asks students to identify ordered pairs that satisfy a given relation, and to determine which ordered pairs belong to different given relations on natural numbers. - Question 4 involves set operations like complement, intersection, and union on sets of prime numbers

Uploaded by

imukhtar44
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/ 3

IBRAHIM BADAMASI BABANGIDA UNIVERSITY LAPAI SCHOOL OF

PRELIMINARY AND CONTINUE EDUCATION IBETO CENTRE


SECOND SEMESTER EXAMINATION
2019/2020 SESSION
CSC 008
DISCRETE STRUCTURE
TIME: 2:30 minutes
INSTRUCTION: Answer four (4) questions only

1. a. Define Relation and state three (3) properties of a relation with the mathematical notation
for each.
b. Consider the set of ordered pairs (x ρ y): x is greater than y and (x, y) ϵ ℤ which of these is
true?
a. (4 , 3)
b. (6 , 2)
c. (1 , 7)
d. (2.1 , 1)
c. Prove that the statement A ∪ B= A ∩ B is false .
2. a . Let be equivalence relation defined on a set S with x , y ∈ S∧x ∈ [ y ] .
Show that [ x ] =[ y ]
b . A function ismathematically put as ?
c .Consider the set of ordered pairs w= { (−3 ,2 ) , (−2 , 4 ) , ( 0 , 5 ) , (−2 ,6 ) , ( 3 , 8 ) } , find ;
i . the domain ( w )∧the range ( w )
ii . determine whether the givenrelation onthe set of ordered pair is a function∨not ?
3. a. Let S={ 1 ,2 , 4 } on the set S × S={ ( 1 , 1 ) , ( 1 , 2 )( 1 , 4 ) , ( 2 , 1 ) , ( 2 , 2 ) , ( 2 , 4 ) , ( 4 , 1 ) , ( 4 , 2 ) , ( 4 , 4 ) } .
y
What set of ordered pair satisfy the relation(x ρ y ): x = .
2
b.
For each of the following relations ρ on N , decide which of the given ordered Pairs belong¿ ρ .
a. x ρ y: x = y +1; (2, 2), (2, 3), (3, 3), (3, 2)
b. x ρ y:x divide’s y; (2, 4), (2, 5), (2, 6)
c. x ρ y:x is odd; (2, 3), (3, 4), (4, 5), (5, 6)
d. x ρ y:x >y2; (1, 2), (2, 1), (5, 2), (6, 4), (4, 3)
4. Suppose that we have the set U ={ n :0 ≤ n<100 } of whole numbers as our universal set .
Let P be the prime numbers∈U ; let E be the even numbers ∈U ,∧let F={ 1 ,2 , 3 ,5 , 8 , 13 , 21, 34 , 55 , 89 } .
Find :
i. E C,
ii. P ∩ F,
iii. P ∩ E,
iv. (F ∩ E) ∪ (F ∩E C)
v. F ∪ F C.
b. Sketch a graph having nodes {1, 2, 3, 4, 5}, arcs {a1, a2, a3, a4, a5, a6}, and function g(a1) = 1–2,
g(a2) = 1–3, g(a3) = 3–4, g(a4) = 3–4, g(a5) = 4–5, and g(a6) = 5–5.
5. a. Define equivalence relation
b. For Boolean matrices;
0 1 0 0 1 1
A=1 0 1 B=0 0 1
0 0 1 1 0 0
find A ∧ B , A ∨ B , A × B , and B× A

Find:

a. a walk 1→ 4 (not trail)


b. a trail 1→ 4
c. a walk 2→ 4
d. adjacent nodes of 2
e. isolated node
6. a. Define a Graph and name two types of graph with examples of each
0 1 0 1 1 0
b. for the Matrices A and B, does A × B = A ° B? A= 1 0 1 B=¿ 0 0 0
0 1 1 0 1 1

c. From the graph, find;


a. a path 1→ 4
b. a circuit 1→ 1 (not cycle)
c. a walk 1→ 4
d. adjacent nodes of 3
e. a cycle

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy