Scribd
Upload
13 views4 pages

Exam 2022

The document is an examination paper for the Discrete Mathematics course (F17SC) for Semester 2 of the 2021/22 academic year, consisting of 11 questions totaling 100 marks. Questions cover various topics including relations, mathematical induction, probability, graph theory, and linear algebra. Students are required to show appropriate working to obtain full credit for their answers.

Uploaded by

Sateesh Singamsetti
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
13 views4 pages

Exam 2022

The document is an examination paper for the Discrete Mathematics course (F17SC) for Semester 2 of the 2021/22 academic year, consisting of 11 questions totaling 100 marks. Questions cover various topics including relations, mathematical induction, probability, graph theory, and linear algebra. Students are required to show appropriate working to obtain full credit for their answers.

Uploaded by

Sateesh Singamsetti
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/ 4

SCHOOL OF MATHEMATICAL AND COMPUTER SCIENCES

Department of Mathematics

F17SC

Discrete Mathematics

Semester 2 – 2021/22

Attempt all questions

Appropriate working must be shown to obtain full credit.


F17SC

2022 Examination for Discrete Maths (F17SC2)


Attempt All Questions. There are a total of 100 marks on the paper.

1. (9 marks) For the set of all integer numbers Z one defines a relation R on Z as

R = {(a, b)|a − b − 2 is divisible by 4}

Find two distinct examples of pairs belonging to R. Determine which of the following
properties this relation possesses: symmetry, anti-symmetry, reflexivity, transitivity. Jus-
tify your answers either by counterexamples or by a general argument. Note that by
definition 0 is divisible by any integer.

2. (10 marks) Prove by the method of mathematical induction that for any integer n ≥ 1
the expression
8n + 13
is divisible by 7.

3. (10 marks) Consider a set of numbers B = {n ∈ Z| 1 ≤ n ≤ 900} Answer the following


questions.

(a) How many elements in B are divisible by 4 or by 9?

(b) How many elements in B are two-digit numbers or are divisible by 4 or are divisible
by 9?

4. (8 marks) At the beginning of the week a forecaster estimated the probability of having
rain on Tuesday as 0.5 and the probability of having rain on Wednesday as 0.3. She also
found that the probability of having rain on Tuesday or Wednesday is 0.6. After it did
rain on Tuesday how should she update the probability that it will rain on Wednesday?

CONTINUED

1
F17SC

5. (9 marks) A graph G has 105 vertices of which there are 13 vertices of degree 3, 33
vertices of degree 5 and the rest of the vertices have degrees greater or equal than 2 and
smaller or equal than 7. Based on the Handshaking lemma what are the smallest and the
largest numbers of edges G can have?

6. (9 marks) For the directed graph depicted below do the following

(a) find the adjacency matrix

(b) find the strongly connected components

(c) determine whether this digraph is weakly connected, explain your answer

7. (7 marks) When 3 edges are removed from a graph G without removing any vertices
the resulting graph G0 is a forest graph with 5 connected components. The numbers of
edges in these components are 11, 5, 7, 10 and 16. Find the number of vertices and the
number of edges in G.

CONTINUED

2
F17SC
8. (8 marks) For the weighted graph depicted below apply Prim’s algorithm to find a
minimal spanning tree. Show the steps of the algorithm, draw the resulting spanning tree
and determine its total weight.

9. (10 marks) A computer system considers a string of the digits 0, 1, 2, 3 a valid codeword
if it has no two consecutive 1’s. For example 01213 is a valid codeword of length 5 while
11320, 1022110, and 211133 are not valid. Let an be the number of valid codewords of
length n. Find a recurrence relation for an and hence use it to find a4 .

10. (10 marks) Find the general solution of the system of linear equations

x − y + 2z + v = 2
2x − 2y + z + 5v + 2w = 2
3x − 3y + 6z + 7v + w = 8

Indicate the row operations you use.

11. (10 marks) Find the eigenvalues and eigenvectors of the matrix
 
8 −1
B=
2 5

Show your working.


END OF EXAM

You might also like