‫بسم هللا الرحمن الرحيم‬

Faculty of Computer And Artificial Intelligence (FCAI)

Spring Semester - MTH112 - Friday 04-06-2021 - Dr. Eng. Moustafa R. A. Eltantawi
General Department – 1st Year - Take-Home-Exam 01- ODD-Serial-Numbers-Version Exam Duration: 2:30 PM- 5:30 PM

Choose The Correct Answer.

1. The number of vertices and edges of Kn , are respectively:
a. n, n2 . b. n, n (n -1). c. n, ½ n (n +1). d. n, ½ n (n - 1).

3. The number of vertices and edges of Wn are respectively:

a. n, 2 n + 1. b. n  1, 2 n. c. 2 n , n + 1 . d. 2 n + 1 , n .

5. The length of the longest simple circuit in K5 is:

a. 5. b. 10. c. 15. d. 20.

7. The length of the longest simple circuit in K410 is:

a. 40. b. 30 c. 20. d. 10.

9. The number of columns in the adjacency matrix for Kmn is:

a. m + n. b. m c. n. d. m n.

11. The numbers of 0s and 1s in the adjacency matrix for Cn, are respectively:
a. 2 n, n2 – 2n b. n, n2 – 2n c. n2  2 n, 2 n. d. n2  n, 2 n.

13. The number of rows and columns in the incidence matrix for Wn are respectively:
a. 2 n, n + 1 b. n  1, 2 n. c. 2 n + 1, n. d. n, 2 n + 1.

15. The values of all positive integers n such that Kn has an Euler circuit, are:
a. Any value. b. Even values. c. Odd values. d. None.

17. The values of all positive integers n such that Wn has an Euler circuit, are:
a. None. b. Even values. c. Any value. d. Odd values.

19. The values of all positive integers n such that Kn has a Hamilton circuit, are:
a. All n  3. b. Any value. c. All n  3. d. None.

21. The values of all positive integers n such that Qn has a Hamilton circuit, are:
a. Odd values. b. Even values. c. None. d. All n  2.

Discrete Math. Take-Home-Exam June-2021 ODD-Serial-Numbers 1 Dr. Eng. Moustafa Reda A. Eltantawi
 23. Every Hamilton circuit for Wn has length:
a. n. b. n  1. c. n2. d. n2 + 1.

25. A regular graph G has 10 vertices and 45 edges, then each vertex of G has degree:
a. 6. b. 9. c. 12. d. 15.

27. For n  3, the edge chromatic number of Wn is:

a. n for all values of n. b. (n + 1) for all values of n.
c. 3 iff is even, 2 iff n is odd. d. 3 iff is odd, 2 iff n is even.

29. For n  1, the edge chromatic number of Qn is:

a. 2n. b. n2.
c. n for all values of n. d. 2 n.

31 A graph with 7 vertices that has a Hamilton circuit but no Euler circuit is:
a. W6. b. C7. c. K7. d. K3,4.

33. A bipartite graph Bm,n that has a Hamilton circuit when:

a. m  n. b. m + n is odd. d. m > n . d. m + n is even.

35. For which positive integers n are the graph Qn, is regular:
a. None. b. All Values  0. c. n is Even. d. n is Odd.

37. Suppose G is a graph with vertices abcdef with the

shown adjacency matrix. (where alphabetical order is used to 0 1 0 1 0 0
determine the rows and columns of the adjacency matrix). 1 0 0 1 1 1 

0 0 0 0 1 1
Find:  
37.1 The number of edges in G. 1 1 0 0 1 0
a. 15. b. 12. c. 9. d. 6. 0 1 1 1 0 1
 
0 1 1 0 1 0
37.2 The degree sequence of the vertices.
a. 1, 1, 2, 2, 2, 4. b. 1, 1, 1, 3, 3, 4. c. 2, 2, 3, 3, 3, 3. d. 2, 2, 3, 3, 4, 4.

37.3 the length of the longest simple path in G.

a. 9. b. 8. c. 7. d. 6.

37.4 the distance between vertex a and vertex c.

a. 2. b. 3. c. 4. d. 5.

Discrete Math. Take-Home-Exam June-2021 ODD-Serial-Numbers 2 Dr. Eng. Moustafa Reda A. Eltantawi
 0 0 0 0 1 1 1 1 1
0 0 0 0 1 1 1 1 1
39. What is the graph represented by the given adjacency matrix:? 
0 0 0 0 1 1 1 1 1
a. Q3 b. K9  
0 0 0 0 1 1 1 1 1
c. B5,4 d. K4,5 1 1 1 1 0 0 0 0 0
 
1 1 1 1 0 0 0 0 0
1 1 1 1 0 0 0 0 0
 
1 1 1 1 0 0 0 0 0
41. For the graph given in R.H.S., answer the following: 1
 1 1 1 0 0 0 0 0
41.1 How many Cliques K4, are there:
a. 9. b. 8. c. 7. d. 6. d
e
41.2 How many Cliques K5, are there: c b
a. None. b. 1. c. 2. d. 3.
41.3 The chromatic number of its vertices is: f
a. 6. b. 5. c. 4. d. 3. . a
g k
41.4 The chromatic number of its edges is:
a. 5. b. 6. c. 5. d. 4.
41.5 The Independence number of the graph is: h
j
a. 7. b. 6. c. 7. d. 8. i

41.6 The Covering-Edge Number of the graph is: a. 4. b. 5. c. 6. d. 7.

41.7 The Matching Number of the graph is: a. 5. b. 6. c. 7. d. 8.

43. For the graph shown below:

43.1 Starting from vertex “g”, which of the following path, you advise a Sales Man to follow to
visit all the companies represented by the vertices of the given graph, once and only once:
a. C1: g-f-e-d-c-b-a-j-k-i-h-g. b. C2: g-h-f-d-e-c-b-a-j-k-i-g.
c. C3: g-i-k-j-a-b-c-d-e-f-h-g. d. C4: g-f-d-e-c-b-a- j - k-i-g.
43.2 The cost of that path is: a. 17. b. 19. c. 21. d. 23.
e 2 d
44.3 The costliest path, of the above indicated ones is:
a. C1. b. C2. c. C3. d. C4. 1 2 c
1 3 b
1
44.4 The rejected path, of the above indicated ones is: 4 5
a. C1. b. C2. c. C3. d. C4. f 1 4
3 2
g a
43.5 To have a MST, the number of 4
k
edges that must be removed is:
2
a. 13. b. 11. c. 9. d. 7. 1 2 1 1
2 2
43.6 The total length of that MST, is:
a. 14. b. 12. c. 10. d. 8. h j
1 i
43.7 The number of Minimum Hamilton’ Circuits for the given graph is:
a. 11! b. 10! c. 110 d. Does not exist.

Discrete Math. Take-Home-Exam June-2021 ODD-Serial-Numbers 3 Dr. Eng. Moustafa Reda A. Eltantawi
 b 35 d

40 20 50

a 15 f
Source Sink
25 10 25
50 40

c 25 e

45. Using a Max. Flow Algorithm, from “a” as a source, to “f” as a destination:
45.1 The Total Max. Flow, is: a. 120. b. 110. c. 100. d. 90.

45.2 The number of paths that give the Total Max. Flow, is:
a. 6. b. 5. c. 4. d. 3.

45.3 From these paths, some path contributes by a max capacity equals to:
a. 15. b. 20. c. 25. d. 35.

45. 4 From these paths, some are of same capacity, which equals to:
a. 20. b. 15. c. 10. d. 5.

b 35 d
47. For the given graph, Using Dijkstra Algorithm:
47.1 The destination of Min. Cost is:
40 20 50
a. “b”. b. “c”.
25
c. “e”. d. “f”. a
15 f
47.2 The cost, of that destination, is: Source 25
a. 10. b. 15. 10 40
50
c. 20. d. 25. e
c
25
47.3 The shortest path, from the source to vertex “d”, has the cost:
a. 65. b. 50. c. 40. d. 15.
47.4 How many vertices are of same shortest path relative to the given source:
a. Four. b. Three. c. Two. d. None.

Discrete Math. Take-Home-Exam June-2021 ODD-Serial-Numbers 4 Dr. Eng. Moustafa Reda A. Eltantawi
 49. The expression: [( A→B)  (B→C)] → (B→C) is:
a. Self Contradiction. b. Tautology. c. Consistent. d. Contrary.

51. The Boolean expression:

Z  A .B . C .D  A .B . C .D  A .B . C .D  A .B . C .D
 A .B . C .D  A .B . C .D  B .C .D  B . C .D  A .B .D
is simplified as:
a. A . B  C . b. A  B . C . c. A  D. d. B  D .

53. For the switching circuit shown in

R.H.S.: The output Z, in its simplest A
Z
form, in terms of the inputs A, B, and C B

of is:
a. Z  A  B.C b. Z = 1. C

c. Z  A. C  B. d. Z = 0.

55. When the conclusion ‫ النتيجة‬is False, the whole conditional is:
a. False. b. True. c. Can't be expected‫ا‬. d. Both b. and c.

Let p: "he is a clever man" & q: "he was a sloppy man". Put in a symbolic form:
57. It is not the case that he is not a clever man but he wasn't a sloppy one, and
it is the case that if he isn't a clever student then he is a sloppy one .
a. p  q b. p  q c. p  q d. p  q

59. It is not the case that if he isn't a clever student then he is a sloppy one.
a. p  q b. p  q c. p  q d. p  q

61. It the case that not being clever is sufficient for being sloppy.
a. p  q b. p  q c. p  q d. p  q

63. He is either not clever or was sloppy, and he is neither not clever nor was sloppy.
a. (p  q)  (p  q) b. [(p  q)  (p  q])
b.  [(p  q)  (p  q)] d. (p  q)  (p  q)

Discrete Math. Take-Home-Exam June-2021 ODD-Serial-Numbers 5 Dr. Eng. Moustafa Reda A. Eltantawi
 65. It is not the case that he is not clever If and only If he was sloppy.
a. (p  q)
b. (p  q)  (p  q)
c. (p  q)  (p  q)
d. (p  q)

The negation of: 67. At least one student is committed, is:

a. No student is committed.
b. Not every student is committed.
c. All students are not committed.
d. Some students are committed.

69. Every absent mind pays no attention for the due date, is:
a. Some absent mind doesn’t pay attention for the due date.
b. At least one absent mind pays attention for the due date.
c. Not all absent mind pay no attention for the due date.
d. Every absent mind pays attention for the due date.

Let 𝑓, 𝑔: ℝ → ℝ, 𝑓(𝑥) = 𝑥 3 − 1 and 𝑔(𝑥) = 2𝑥 − 3, then: 71. (𝑓 ∘ 𝑔)(𝑥) = ⋯

a. 2𝑥 3 − 4
b. 2𝑥 3 − 5
c. 2(𝑥 3 − 1) − 3
d. 8𝑥 3 − 28

Let the function F(x) = x + 1 , 73. F:set of real numbers to the set of real numbers, is
a. One to one function.
b. Onto function.
c. Bijection .
d. otherwise.

A sequence {𝑎𝑛 } is defined recursively as follows 𝑎𝑛 = 𝑎𝑛−1 + 5𝑎𝑛−2 .

75. Find 𝑎5 , if 𝑎0 = 1 and 𝑎1 = 2.
a. a5 = 173.
b. a5 = 137.
c. a5 = 145.
d. a5 = 154.

Discrete Math. Take-Home-Exam June-2021 ODD-Serial-Numbers 6 Dr. Eng. Moustafa Reda A. Eltantawi
 True or False.
Don’t Correct the False Statement
77. Are the following two graphs G and H isomorphic?

d c 1

2 3
G e b H
4 5
f
f a 6

79. Are the following two graphs are isomorphic?

1 6 b
c a

G2 5
H
`
d f
e
3 4

81. The number of minimum Hamilton’s Circuits in a complete graph “Kn” is: (n -1)

83. The incidence matrix of a directed graph is always symmetric.

85. The Chromatic number of “Kn”, after removing a single edge from it, is ”n - 2”.

87. The representation matrix of a directed graph is essentially symmetric.

89. The degree of any vertex, other than the root, in a binary tree is three.

Discrete Math. Take-Home-Exam June-2021 ODD-Serial-Numbers 7 Dr. Eng. Moustafa Reda A. Eltantawi
 91. A message uses a set of characters with specific repetition for each one. An
encoding process was achieved, as indicated in the table shown below. Discuss the
following
Char. Freq. Code
91.1 The encoding process satisfies the prefix property? A 10 000
E 15 001
91.2 The encoding process satisfies the Huffman’s I 12 010
S 3 011
Algorithm?
T 4 100
P 13 101
91.3 The encoding process is memory-size saver? Newline 1 110

91.4 Is the following Coding Tree represents the given code?

Discrete Math. Take-Home-Exam June-2021 ODD-Serial-Numbers 8 Dr. Eng. Moustafa Reda A. Eltantawi