Scribd
Upload
15 views3 pages

Final Exam For CS

This document is a final exam for Discrete Mathematics at Arsi University, specifically designed for Computer Science students. It consists of three parts: true/false questions, fill-in-the-blank questions, and problem-solving questions, totaling 40% of the course grade. General instructions emphasize the importance of academic integrity and the legibility of answers.

Uploaded by

abexbekele
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
15 views3 pages

Final Exam For CS

This document is a final exam for Discrete Mathematics at Arsi University, specifically designed for Computer Science students. It consists of three parts: true/false questions, fill-in-the-blank questions, and problem-solving questions, totaling 40% of the course grade. General instructions emphasize the importance of academic integrity and the legibility of answers.

Uploaded by

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

Name__________________________________________________Id.

no_____________

ARSI UNIVERSITY
COLLEGE OF COMPUTATIONAL SCIENCES
DEPARTMENT OF MATHEMATICS
Discrete Mathematics Final Exam for Computer Science Students (40%)
Date: February 07, 2020
Time Allowed: 2.30 hrs.

General Instructions:
 Attempt all questions as per the instruction.

 Cheating or facilitating conditions for cheating will result in the cancellation of your
result

 Write your answers neatly and legibly

 Eligible (unreadable) answers may not be marked

 Do not use your own rough paper.

For instructor’s use only

Part I (6%)

Part II (10%)

Part III (24%)

Total (40%)

1
Prepared by: Abayneh B.
Name__________________________________________________Id.no_____________

Part I: Write True if the statement is correct and False if the statement is wrong. (1pt. each)
1. A simple graph is a graph with distinct edges.
2. 𝑎𝑛 = 6𝑎𝑛−1 𝑎𝑛−2 − 9𝑎𝑛−3 is linear homogeneous recurrence relation of order 3.
3. A vertex of degree zero is called isolated. _______
4. A complete graph with three vertices is not bipartite graph.
5. 𝑎𝑛 = 5 is a solution of a recurrence relation 𝑎𝑛 = 2𝑎𝑛−1 − 𝑎𝑛−2 .
6. All undirected graph (including Multi graph and pseudo graph) have symmetric adjacency
matrices.
Part II: Fill in the blank space. (2 pts each)

1. The number of edges of:


a. Complete graph with six vertices (𝐾6 ) is
b. Cycle graph with ten vertices (𝐶10 ) is
2. Suppose that a person deposits 1,000 Birr in a savings account at a bank yielding 10% per
year with interest compounded annually.
a. How much will be in the account after 2 years?
b. How much will be in the account after n years?
3. Suppose that a graph G has 2 vertices of degree four, 4 vertices of degree 3, and 2 vertices of
degree 5. Then G has ____________ edges.

Part III. Work out (18 %): Show all the necessary steps clearly and neatly. (3pts each)
4. Let 𝑎𝑛 = 2𝑎𝑛−1 + 4𝑎𝑛−2 − 8𝑎𝑛−3 + 𝐹(𝑛) with initial conditions a0 = 1, a1 =−2, and a2 =−1
Then find its solution if
a. 𝐹(𝑛) = 0
b. 𝐹(𝑛) = 𝑛3 2𝑛 − 2𝑛

5. Consider the following graph G with respect to the ordering of the vertices 𝑣1 , 𝑣2 , 𝑣3 , 𝑣4 , 𝑣5
and 𝑒1 , 𝑒2 , 𝑒3 , 𝑒4 , 𝑒5 , 𝑒6 , 𝑒7 , 𝑒8 respectively.

2
Prepared by: Abayneh B.
Name__________________________________________________Id.no_____________

a. Give the adjacency matrix of G


b. Give the incidence matrix of G.
6. Draw an undirected graph with the given adjacency matrix

7. Determine whether the graph is bipartite.

8. The Lucas numbers satisfy the recurrence relation 𝐿𝑛 = 𝐿𝑛−1 + 𝐿𝑛−2 with the initial
conditions 𝐿0 = 2 𝑎𝑛𝑑 𝐿1 = 1
a. Show that 𝐿𝑛 = 𝑓𝑛−1 + 𝑓𝑛+1 for 𝑛 = 2, 3, . . ., where 𝑓𝑛 is the nth Fibonacci number.
b. Find an explicit formula for the Lucas numbers.

3
Prepared by: Abayneh B.

You might also like