Scribd
Upload
49 views2 pages

Beyeh

This document contains 3 questions regarding discrete mathematics concepts. Question 1 involves (a) determining the domain and range of a digraph and if the relation is anti-symmetric, and (b) properties of a graph including its size, examples of Hamiltonian paths/Euler paths/circuits, and a spanning tree. Question 2 involves (a) constructing a binary tree for an algebraic expression and its properties, and (b) decoding/encoding using a Huffman code. Question 3 involves (a) a binary relation on a set and determining its elements and graph, and (b) drawing a full binary tree for an algebraic expression.

Uploaded by

Alif Syah Razmi
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
49 views2 pages

Beyeh

This document contains 3 questions regarding discrete mathematics concepts. Question 1 involves (a) determining the domain and range of a digraph and if the relation is anti-symmetric, and (b) properties of a graph including its size, examples of Hamiltonian paths/Euler paths/circuits, and a spanning tree. Question 2 involves (a) constructing a binary tree for an algebraic expression and its properties, and (b) decoding/encoding using a Huffman code. Question 3 involves (a) a binary relation on a set and determining its elements and graph, and (b) drawing a full binary tree for an algebraic expression.

Uploaded by

Alif Syah Razmi
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

DISCRETE MATHEMATICS SEPT 2019 – Jan 2020 MAT210

Answer all questions.

QUESTION 1

a) Given the digraph representation of a relation R as shown in Figure 1

b
a

Figure 1

i. State the domain and range of R.


ii. State the relation R and determine if R is anti-symmetric. Give your reason.
(5 marks)

b) Given a graph G as shown in Figure 2.

B E
Figure 2

A D F G

C H

i. State the size of the graph.


ii. Give an example of Hamiltonian Path and justify your answer if the path does
NOT exist.
iii. Give an example of an Euler Path and justify your answer if the path does NOT
exist.
iv. Give an example of an Euler Circuit and justify your answer if the circuit does
NOT exist.
v. Give the example of a spanning tree rooted at node F with height 2.
(8 marks)
DISCRETE MATHEMATICS SEPT 2019 – Jan 2020 MAT210

QUESTION 2

3a 5
a) Given an algebraic expression .
8y  x
i. Construct a binary tree for the given expression.
ii. Determine the height of the tree.
iii. List all the leaves.
iv. State ancestors of 8.

(8 marks)

b) A Huffman Code is given in Figure 3.

0 1

1 Figure 3
0 1 0

B
F 0
1
0 1
0 E
O 1
L

T U

i. Decode 1000100111101 and 010001001001.


ii. Encode OBOE and FLUTE.
(4 marks)

QUESTION 3

a) Let A = {1, 2, 3, 4, 5, 6} and a binary relation R on A is defined by xRy if and only if


2 < x + y ≤ 5, for x, y  A.
i. Find A A .
ii. List all elements of set R.
iii. Draw a directed graph of R.
(6 marks)

b) Draw a full binary tree for the algebraic expression


 2a  3b5  10 .
ab  9
(4 marks)

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