Lecturer: 25-01-2021 Approved by: 25-01-2021

Head of Department of Computer Science

Nguyễn An Khương
Nguyễn Tiến Thịnh

Semester/Academic year 1 2020-2021

FINAL EXAM
Date 28-01-2021
Course title Mathematical Modeling
UNIVERSITY OF TECHNOLOGY Course ID CO2011
FACULTY OF CSE Duration 80 mins Question sheet code 2811
Notes: - One single sheet (both sides) of A4 paper of hand-written notes is allowed.
- Stu. ID and Stu. Fullname fields at the bottom of the question sheet must be filled in.
- Submit the answer sheet together with the question sheet when finishing the test.
- Mark the correct answers in the answer sheet.
- The test consists of 25 multi-choice questions, each of which has the score of 0.4.

In this final examiniation, for all questions concerning dynamical systems, we consider the following
initial-value problem (
ẋ(t) = f (x), t > t0 ≥ 0,
(1)
x(t0 ) = x0 ,
where x is a real-value function dependent on t and f is a real-value function dependent on x.

Use the following information to answer the questions 1–5. The following initial-value problem is a
model of vapour pressure of water in the air of a greenhouse

U φ k(C − x)
ẋ(t) = + , t > t0 ≥ 0,

Ah h (2)
x(t ) = x .
0 0

a) x(t) (pa) represents the vapour pressure in the greenhouse air at time t, x0 = x(t0 ) is a constant,
and ẋ, the time derivative of x, is the rate change of vapour pressure.

b) The constants C = 2986 (pa), h = 1.94 (kg·m·J−1 ), A = 100 (m2 ), U = 85% (dimensionless),
and φ = 1.39 (kg/s) are respectively the saturated vapour pressure at the canopy temperature,
the capacity of the greenhouse air to store water vapour, the area of the greenhouse floor, the
control value of the fogging system, and the capacity of the fogging system.

c) k (kg·m−2 ·pa−1 ·s−1 ), the vapour exchange coefficient dependent on x (pa), satisfies
1
k= . (3)
8x2 − 47713x + 79259056
Noting that every coefficient on the right-hand side of (3) has its own unit, which is omitted
here for simplicity.

d) For pressure, 1 (bar) = 100000 (pa).

Question 1. (L.O.2.1)
Which of the following units
 is equivalent to pa?  
A J/m . 3 B kg/J. C J/m. D bar/s.

Question 2. (L.O.2.1)
At a given time, what is the value of vapour exchange coefficient k (kg·m−2 ·bar−1 ·s−1 ) if the
vapour pressure of waterin the greenhouse air is 0.01
 (bar)? 
A 0.00516 B 0.00253 C 0.00158 D 0.00216

Stu. ID: . . . . . . . . . . . . . . Stu. Fullname: . . . . . . . . . . . . . . Code: 2811 Page 1/5

 Question 3. (L.O.2.1)
What is the rate change (pa/s) of vapour pressure in the greenhouse air at a given time if the
vapour pressure in the greenhouse
 air at that time
is 2500 (pa)? 
A 0.00725 B 0.00231 C 0.00611 D 0.00815

Question 4. (L.O.2.4)
Asssume x0 = 2500 (pa), what is the approximate of x (pa) in the next 10 minutes using forward
Euler’s method with twotime steps?  
A 2503.67 B 2503.22 C 2503.10 D 2503.91

Question 5. (L.O.2.4)
The 1/2-rule for solving problem (1) is given as follows.
1
Step 1: xn+ 1 = xn + f (xn )∆t.
2 2 
Step 2: xn+1 = xn + f xn+ 1 ∆t.
2

Here, ∆t > 0 is the time step and xn is an approximate of x(tn ) for n = 0, 1, 2, . . .

Consider problem (2). Asssume x0 = 2500 (pa), what is the approximate of x (pa) in the next
10 minutes using the 1/2-rule
 with one time step only.
 
A 2503.22 B 2503.10 C 2503.91 D 2503.67

Use the following information to answer the questions 6–9. The 3/2-rule for solving problem (1) is
given by
3
Step 1: xn+ 3 = xn + f (xn )∆t.
2
2 
2 1 
Step 2: xn+1 = xn + f (xn ) + f xn+ 3 ∆t.
3 3 2

Here ∆t > 0 is the time step and xn is an approximate of x(tn ) for n = 0, 1, 2, . . .

Question 6. (L.O.2.1)
The 1/2-rule is
 
A an implicit method. B an explicit method.

Question 7. (L.O.2.1)
For z ∈ C, the stability function of 3/2-rule is
  2−z
A Φ(z) = 1 + z 3 . B Φ(z) = for z 6= −2.
2+z
 z2  1
C Φ(z) = 1 + z + . D Φ(z) = for z 6= 1.
2 1−z
Question 8. (L.O.2.1)
Is 3/2-rule an A-stable method?
 
A No. B Yes.

Question 9. (L.O.2.4)
Consider the problem (1) where f (x) = −3x + 2 and x0 = 1. What is the approximate value of
x2 using the 3/2-rule with
 ∆t = 0.15?  
A 0.91 B 0.95 C 1.22 D 1.24

Question 10. (L.O.2.4)

For given time step ∆t > 0, the local truncation error of the backward Euler method is propor-
tional to   
A ∆t4 . B ∆t2 . C ∆t5 . D ∆t3 .

Stu. ID: . . . . . . . . . . . . . . Stu. Fullname: . . . . . . . . . . . . . . Code: 2811 Page 2/5

Question 11. (L.O.2.2)
Given an arbitrary non-deterministic finite automaton (NFA) with N states, the maximum
number of states in an equivalent minimized DFA is at least?
   
A 2N . B N 2. C N !. D N.

Question 12. (L.O.2.2)

Let S and T be language over {a, b} represented by the regular expressions (a + b∗ )∗ and (a + b)∗ ,
respectively. Which of the
 following is true?  
A S ⊂ T. B S = T. C T ⊂ S. D S ∩ T = ∅.

Question 13. (L.O.3.2)

Consider the following deterministic finite state

automaton M . Let S denote the set of seven bit
binary strings in which the first, the fourth, and
the last bits are 1. The number of strings in S
that are accepted by M is
   
A 8. B 5. C 7. D 10.

Question 14. (L.O.2.2)

Consider the NFA M shown below. Let the

language accepted by M be L. Let L1 be the
language accepted by the NFA M1 , obtained
by changing the accepting state of M to a
non-accepting state and by changing the non-
accepting state of M to accepting states. Which
of the following statements is true?

   
A L1 = {0, 1}∗ \ L. B L1 ⊆ L. C L1 = L. D L1 = {0, 1}∗ .

Question 15. (L.O.3.2)

The following finite state machine accepts all those binary strings in which the number of 1’s
and 0’s are respectively.

 
A divisible by 3 and 2. B old and even.
 
C even and odd. D divisible by 2 and 3.

Question 16. (L.O.2.2)

Consider the languages L1 = ∅ and L2 = {a}. Which one of the following represents L1 L∗2 ∪ L∗1 ?
   
A ∅. B {}. C {a∗ }. D {, a}.

Stu. ID: . . . . . . . . . . . . . . Stu. Fullname: . . . . . . . . . . . . . . Code: 2811 Page 3/5

Question 17. (L.O.2.2)
What is the complement of the language accepted by the NFA shown below?

   
A ∅. B {a, }. C {}. D {a∗ }.

Question 18. (L.O.3.2)

Match the following NFAs with the regular expressions they correspond to:

1.  + 0 (01∗ 1 + 00)∗ 01∗ 3.  + 0 (10∗ 1 + 10)∗ 1

2.  + 0 (10∗ 1 + 00)∗ 0 4.  + 0 (10∗ 1 + 10)∗ 10∗

 
A P - 2, Q - 1, R - 3, S - 4. B P - 1, Q - 3, R - 2, S - 4.
 
C P - 3, Q - 2, R - 1, S - 4. D P - 1, Q - 2, R - 3, S - 4.

Question 19. (L.O.2.2)

Reduce the following expression
  + 1∗ (011)∗ (1∗ (011) ∗ ∗
 ) ? 
A (1 + 011)∗ . B (1∗ (011)∗ ). C (1 + (011)∗ )∗ . D (1011)∗ .

Question 20. (L.O.2.2)

Which one of the following language is regular?

A {an bn | n ≥ 0}.

B {w | w has (3k + 1) characters b0 s, for some k ∈ N with Σ = {a, b}}.

C {an | n is prime }.

D {ww | w ∈ Σ∗ with Σ = {0, 1}}.

Question 21. (L.O.2.3)

If s is a string over (0 + 1)∗ then let n0 (s) denote the number of 0’s in s and n1 (s) the number
of 1’s in s. Which one of the following languages is NOT regular?

A L = {s ∈ (0 + 1)∗ | n0 (s) is a 3-digit prime }.

B L = {s ∈ (0 + 1)∗ | for every prefix s’ of s | n0 (s0 ) − n1 (s0 ) |≤ 2}.

C L = {s ∈ (0 + 1)∗ | |n0 (s) − n1 (s)| ≤ 4}.

D L = {s ∈ (0 + 1)∗ | n0 (s) mod 7 = n1 (s) mod 5 = 0}.

Stu. ID: . . . . . . . . . . . . . . Stu. Fullname: . . . . . . . . . . . . . . Code: 2811 Page 4/5

Question 22. (L.O.3.2)
Consider the machine M given below. The language recognized by M is:


A {w ∈ {a, b}∗ | every a ∈ w is followed by exactly two b0 s}.

B {w ∈ {a, b}∗ | w contains the substring “abb”}.

C {w ∈ {a, b}∗ | w does not contain “aa” as a substring}.

D {w ∈ {a, b}∗ | every a ∈ w is followed by at least two b0 s}.

Question 23. (L.O.2.2)

Given two following languages

L1 = {x ∈ Σ∗ |x contains an even number of bits 0},

L2 = {x ∈ Σ∗ |x contains an odd number of bits 1}.

states in L1 ∪ L2 is
Then the number of final  
A 4. B 2. C 5. D 3.

Question 24. (L.O.2.2)

Consider the following Deterministic Finite Automata. Which of the following is true?

 
A It only accepts strings with substring as B It only accepts strings with prefix as
“aababb”. “aababb”.
C It only accepts strings with suffix as D None of the others.
“aababb”.
Question 25. (L.O.2.2)
Which of the following transformations on automata use eliminations of states?
 
A Convert DFA to NFA. B Convert NFA to DFA.
 
C Convert DFA to regular expression. D All three conversions in three other choices
need to use eliminations of states.

Stu. ID: . . . . . . . . . . . . . . Stu. Fullname: . . . . . . . . . . . . . . Code: 2811 Page 5/5