0% found this document useful (0 votes)
2 views6 pages

D- Answers

The document contains a collection of discrete mathematics questions, including truth tables, logical equivalences, and proofs using mathematical induction. It also covers topics such as functions, probability calculations for committee selections, and graph algorithms like Kruskal’s Algorithm. Each question is followed by an answer scheme indicating the expected format for responses.

Uploaded by

usmanalyt
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)
2 views6 pages

D- Answers

The document contains a collection of discrete mathematics questions, including truth tables, logical equivalences, and proofs using mathematical induction. It also covers topics such as functions, probability calculations for committee selections, and graph algorithms like Kruskal’s Algorithm. Each question is followed by an answer scheme indicating the expected format for responses.

Uploaded by

usmanalyt
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/ 6

COLLECTION

OF QUESTIONS
FOR
MATHEMATICS
(SCHEME)
PART B: DISCRETE MATHEMATICS

QUESTION 1

(a) Using the truth table, determine whether [(𝑝 → 𝑞) → 𝑟] is logically equivalent to
[(𝑝 → 𝑟) ∧ (𝑞 → 𝑟)].

(b) Based on the proposition given below, outline an argument using disjunctive
syllogism and modus tollens.

Proposition 1: Dahlia loves C++ programming.


Proposition 2: Dahlia spends at least one hour studying C++ programming.
Proposition 3: Dahlia score A in her final examination.

ANSWER SCHEME:

QUESTION 2

Evaluate the proof using the direct method, given that if T and R are odd integers, then T R is
odd.

ANSWER SCHEME:
QUESTION 3

For the function as depicted in Figure 1 below:

Figure 1

(a) Find the domain, codomain, and range of the function.


(b) State if the function is one-to-one, onto or both.
(c) Write the function as a rule that acts on each element of the domain.
(d) Write the function as a subset of the cartesian product of the domain and the
codomain.

ANSWER SCHEME:

QUESTION 4
Given a series of numbers 2, 4, 6, … , 2𝑛, ∀𝑛 ∈ ℤ+ .

(a) By using mathematical induction, generate the proof of


∀𝑛 ∈ ℤ+ , 2 + 4 + 6 + ⋯ + 2𝑛 = 𝑛(𝑛 + 1)

(b) Generate the sum of 8 + 10 + 12 + ●●● + 200.

ANSWER SCHEME:

QUESTION 5

A health and safety department of a manufacturing plant consists of 11 male and 13 female
staff. If the shareholder of the plant wants to select four of them to form a committee,
estimate the probability that the committee will include,

(a) One male and three female staff.


(b) Two male and two female staff.
(c) All are female staff.
ANSWER SCHEME:

QUESTION 6

(a) Based on the graph in Figure 2, illustrate the Minimum Spanning Tree by using
Kruskal’s Algorithm.

Figure 2: Graph of spanning tree.

(b) Show the ordering of vertices for the complete binary tree shown in Figure 3, if
preorder and postorder traversal are use.

B C

D E F G

H I J K L M N O

Figure 3: Binary tree.


ANSWER SCHEME:

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