BKU, VNU-HCM MIDTERM

FACULTY OF CS AND ENGINEERING Subject: Maths Modelling (CO2011)

Class: CC15KHMT Group: CC01
Time: 60 minutes (Closed book test)
Test date: March 26, 2018

Student’s Name: Student’s ID:

(There are 20 MCQs, each question is worth 0.5 points. Answers in bold : ; cancel out to deselect: @
 .)

Question 1. Which one of the following statements is true?


A

All sentences in predicate calculus are either satisfied by all models or by none.

B

No sentence in predicate calculus is satisfied by all models.
 
C

Some sentences in predicate calculus may be satisfied by one model, but not by
 another one.
D

Every sentence is satisfied by at least one model.
Question 2. If a linear program has an optimal solution, then

A

the feasible set is non-empty and objective function is bounded.

B

the objective function might not be bounded.
 
C

the feasible set can be empty.
 
D

only feasible set is non-empty.
Question 3. Consider a linear program finding minimum which has the initial simplex tableau as below.
1 1 1 0 0
x1 x2 x3 x4 x5 rhs
−1 1 2 0 0 2
1 0 −1 0 1 3
2 0 1 1 0 4
r1 r2 r3 r4 r5 0

Suppose that x2 , x5 , x4 are basic variables. Then, the value of reduced cost ri , for i = 1, 2, . . . , 5,
should be
   
A

(−2, 0, 1, 0, 0). B

(0, 2, 1, 0, 0) C

(0, 1, 2, 0, 0) D

(2, 0, −1, 0, 0)
Question 4. Consider the following linear program

min x1 + x3 − x4
xi
s. t. x1 − x3 = 1,
x3 + x4 = 6,
x2 − 2x3 = 3,
xi ≥ 0, for i = 1, 2, . . . , 4.

Then, the point (1, 3, 0, 6)

 
A

is a basic feasible solution. B is not a basic solution.
 


C

is not a basic feasible solution. D

is not in the feasible set.

Student’s Signature: . . . . . . . . . . . . . . Code 2631 Page 1

Question 5. Given the following predicates
Q(x) : x is a politician, T (z) : z is a time,
P (y) : y is a person, F (x, y, z) : person x fools person y at time z.

Represent the following sentences in predicate logic:


“Politicians can’t fool all ofthe 
people all of the time.”
A

∀x[Q(x) → ∀y∀z((P (y) ∧ T (z)) → ¬F (x, y, z))]. B

∀x[Q(x) → ∃y∃z((P (y) ∧ T (z)) → ¬F (x, y, z))].
  
C

∀x∃y∃z[Q(x) → (P (y) ∧ T (z) ∧ F (x, y, z))]. D

∀x[Q(x) → ∃y∃z(P (y) ∧ T (z) ∧ ¬F (x, y, z))].

Question 6. Consider the following program.

If we know that its (postcondition) is {x ≥ 9}, then which of the following is its precondition?
 
A

{(x ≥ −3 ∧ x < 5) ∨ (x ≥ 8)}. B

{(x ≤ −3) ∨ (x ≥ 3 ∧ x < 5) ∨ (x ≥ 8)}.
  
C

{(x ≤ −3) ∨ (x ≥ 3 ∧ x < 5)}. D

{(x < −3) ∨ (x > 8)}.
Question 7. Consider a general linear program

min − 2x1 + 3x2

x1 ,x2

s. t. 3x1 + 4x2 ≤ 24,

7x1 − 4x2 ≤ 16,
x1 , x2 ≥ 0.

Which one of followings can change the problem into standard form?

A

3x1 + 4x2 + x3 = 24, 7x1 − 4x2 + x4 = 16, where x3 , x4 ≤ 0.

B

3x + 4x2 − x3 = 24, 7x1 − 4x2 − x4 = 16, where x3 , x4 ≥ 0.
  1
C


 3 − 3x1 − 4x2
x = 24, x4 − 7x1 + 4x2 = 16, where x3 , x4 ≤ 0.
D

3x1 + 4x2 + x3 = 24, 7x1 − 4x2 + x4 = 16, where x3 , x4 ≥ 0.
Question 8. Consider the predicate formula φ as follow.

(∃xP (y, y) −→ ∃yP (y, z)).

 
What is the result of the substitution y ⇒ f (z)) φ?
 
A

(∃xP (f (z), f (z)) −→ ∃yP (f (z), z)). B

(∃xP (f (z), f (z)) −→ ∃y 0 P (y 0 , z)).
  
C

(∃zP (f (z), f (z)) −→ ∃zP (f (z), z)). D

(∃zP (f (z), f (z)) −→ ∃y 0 P (y 0 , z)).

Question 9. The two propositional operators | (or N AN D), and ⊕ (or XOR) are defined as follow, respec-
tively: p|q := ¬(p ∧ q), and p ⊕ q is the proposition with true value T if and only if there is
 exactly one of p, q with true value T. Which of the following is correct?
A

The set {|} is not an adequate set of propositional operators.

B

The set {|, ⊕} is not an adequate set of propositional operators.
 
C

The set {⊕} is an adequate set of propositional operators.
 
D

The set {|} is an adequate set of propositional operators.

Student’s Signature: . . . . . . . . . . . . . . Code 2631 Page 2

Question 10. Consider the following linear program

min 2x1 − 3x2 + 2x3 − 2x4

xi
s. t. 5x1 + 2x3 − 6x4 = 5,
3x2 − x3 + 2x4 = 5,
xi ≥ 0, for i = 1, 2, . . . , 4.

Given non-basic variables x2 and x4 , then the corresponding basic solution of the problem is
 
A

(3, 0, −5, 0), and also feasible. B

(3, 0, −5, 0), and not feasible.
  
C

(0, 3, 0, −5), and also feasible. D

(0, 3, 0, −5), and not feasible.
Question 11. The relaxation in branch-and-bound approach for solving a linear integer program, performs to

 
A

assign all variables into zero. B

assign all variables into one.
  
C

drop all integer variables D

drop integer constraint of variables.
Question 12. Which of the following formulas has the parse tree:

 
A

(p ∧ ¬q) ∨ (¬p ∧ q). B

(¬p ∧ q) ∨ (p ∧ ¬q).
  

∨ q) ∧ (p ∨ ¬q).
C (¬p
∨ ¬q) ∧ (¬p ∨ q).
D (p
Question 13. Let f and g be two functions from R to R. Then the negation of the formula “For each s in R,
 there exists r in R such that if f (r) > 0, then
 g(s) > 0” is the following formula.

A For every s in R, there exists r in R such
B For every s in R, there does not exist r in
 that f (r) > 0 and g(s) ≤ 0.  R such that if f (r) > 0, then g(s) > 0.

C There exists s in R and there exists r in R
D There exists s in R such that for every r
such that f (r) ≤ 0 and g(s) ≤ 0. in R, f (r) > 0 and g(s) ≤ 0.
Question 14. A basic feasible solution of a linear program consists of

A

all variables of zero

B

 basic variables of zero, non-basic variables of non-zero.

C

basic variable of non-nagative value, non-basic variables of zero.
 
D

basic variables of zero, non-basic variables of positive value.
Question 15. Consider a linear program finding minimum which has the simplex tableau for basic variables
{x2 , x5 , x4 } as below.

1 1 1 0 0
x1 x2 x3 x4 x5 rhs
−1 1 2 0 0 2
1 0 −1 0 1 3
2 0 1 1 0 4
2 0 −1 0 0 −f (x)

Since r3 < 0 and āi3 is not negative (for i = 1, 2, 3), we need to compute the next simplex
tableau. Hence, new basic variables should be
   
A

{x2 , x5 , x4 }. B

{x3 , x5 , x4 }. C

{x2 , x3 , x4 }. D

{x2 , x5 , x3 }.

Student’s Signature: . . . . . . . . . . . . . . Code 2631 Page 3

Question 16. If a linear program has an optimal solution, then the solution

A

is a point of the interior of the feasible set.

B

is an interior point of the boundary of the feasible set.
 
C

does not belong to the feasible set.
 
D

is an extreme point of the feasible set.
Question 17. Let φ be a propositional formula. Consider the following statements on φ.
I. φ is satisfiable or ¬φ is satisfiable.

II. φ is a tautology or ¬φ is a tautology.

 Then 
A

Both I and II are correct. B

Both I and II are incorrect.
  
C

I is correct and II is incorrect. D

I is incorrect and II is correct.
Question 18. Which of the following statements about Natural Deduction is true?

A

p ∨ ¬p cannot be proved in natural deduction.

B

Boxes are not used to delineate the scope of assumptions.
 
C

The rules Modus Tollens (MT) cannot be derived from the rules ∧i and ∧e alone.
 
D

Contradictions don’t play an important role in natural deduction.
Question 19. Consider a linear program finding minimum which has the simplex tableau for basic variables
{x2 , x5 , x4 } as below.

−2 3 0 0
x1 x2 x3 x4 rhs
3 4 1 0 24
7 −4 0 1 16
−2 3 0 0 0

Then, the pivot element (phần tử trục/xoay)


A

can not be determined.

B

ā = 3, with in-variable x1 and out-variable x3 .
 11
C

 ā21 = 7, with in-variable x1 and out-variable x4 .

D

ā12 = 4, with in-variable x2 and out-variable x3 .
Question 20. Suppose that we are proving the validity of the sequent

¬φ1 ∧ ¬φ2 ` φ1 → φ2

as follows.

1. ¬φ1 ∧ ¬φ2 premise

2. φ1 assumption
3. ¬φ1 ∧e1 1
4. ⊥ ¬e2,3
5. φ2 ⊥e4
6. φ1 → φ2 → i2,5

 Which of the following is correct? 

A

That is not a correct proof since Line 1 has B

That is not a correct proof since on Line
the premise ¬φ1 , so we are not allowed to 4 we have seen a contradiction.
introduce the assumption φ1 in Line 2. 
C

That is a correct proof. D

That is not a correct proof since we did
not use the fact ¬φ2 in the premise at all.

Student’s Signature: . . . . . . . . . . . . . . Code 2631 Page 4

 BKU, VNU-HCM MIDTERM ANSWER KEYS
FACULTY OF CS AND ENGINEERING Subject: Maths Modelling (CO2011)
Class: CC15KHMT Group: CC01
Time: 60 minutes (Closed book test)
Test date: March 26, 2018

Code: 2631
     
Question 1.

C Question 6.

B Question 11.

D Question 16.

D
      
A
Question 2.
D
Question 7.
D
Question 12.
C
Question 17.

     
Question 3.

D Question 8.

B Question 13.

D Question 18.

C
     
A
Question 4.
D
Question 9.
C
Question 14.
C
Question 19.

    
Question 5.

D Question 10.

B Question 15.

B Question 20.

Student’s Signature: . . . . . . . . . . . . . . Code 2631 Page 1

 BKU, VNU-HCM MIDTERM
FACULTY OF CS AND ENGINEERING Subject: Maths Modelling (CO2011)
Class: CC15KHMT Group: CC01
Time: 60 minutes (Closed book test)
Test date: March 26, 2018

Student’s Name: Student’s ID:

(There are 20 MCQs, each question is worth 0.5 points. Answers in bold : ; cancel out to deselect: @
 .)

Question 1. Consider the predicate formula φ as follow.

(∃xP (y, y) −→ ∃yP (y, z)).

 
What is the result of the substitution y ⇒ f (z)) φ?
 
A

(∃zP (f (z), f (z)) −→ ∃y 0 P (y 0 , z)). B

(∃xP (f (z), f (z)) −→ ∃yP (f (z), z)).
  
C

(∃xP (f (z), f (z)) −→ ∃y 0 P (y 0 , z)). D

(∃zP (f (z), f (z)) −→ ∃zP (f (z), z)).

Question 2. If a linear program has an optimal solution, then the solution


A

is an extreme point of the feasible set.

B

is a point of the interior of the feasible set.
 
C


 an interior point of the boundary of the feasible set.
is
D

does not belong to the feasible set.
Question 3. Let f and g be two functions from R to R. Then the negation of the formula “For each s in R,
 there exists r in R such that if f (r) > 0, then
 g(s) > 0” is the following formula.
A

There exists s in R such that for every r
B For every s in R, there exists r in R such
 in R, f (r) > 0 and g(s) ≤ 0.  that f (r) > 0 and g(s) ≤ 0.
C

For every s in R, there does not exist r in
D There exists s in R and there exists r in R
R such that if f (r) > 0, then g(s) > 0. such that f (r) ≤ 0 and g(s) ≤ 0.
Question 4. Consider the following linear program

min 2x1 − 3x2 + 2x3 − 2x4

xi
s. t. 5x1 + 2x3 − 6x4 = 5,
3x2 − x3 + 2x4 = 5,
xi ≥ 0, for i = 1, 2, . . . , 4.

Given non-basic variables x2 and x4 , then the corresponding basic solution of the problem is
 
A

(0, 3, 0, −5), and not feasible. B (3, 0, −5, 0), and also feasible.
 


C

(3, 0, −5, 0), and not feasible. D

(0, 3, 0, −5), and also feasible.
Question 5. Which one of the following statements is true?

A

Every sentence is satisfied by at least one model.

B

All sentences in predicate calculus are either satisfied by all models or by none.
 
C

No sentence in predicate calculus is satisfied by all models.
 
D

Some sentences in predicate calculus may be satisfied by one model, but not by
another one.

Student’s Signature: . . . . . . . . . . . . . . Code 2632 Page 1

Question 6. Consider the following program.

If we know that its (postcondition) is {x ≥ 9}, then which of the following is its precondition?
 
A

{(x < −3) ∨ (x > 8)}.
B {(x ≥ −3 ∧ x < 5) ∨ (x ≥ 8)}.
 
C

{(x ≤ −3) ∨ (x ≥ 3 ∧ x < 5) ∨ (x ≥ 8)}.
D {(x ≤ −3) ∨ (x ≥ 3 ∧ x < 5)}.

Question 7. The two propositional operators | (or N AN D), and ⊕ (or XOR) are defined as follow, respec-
tively: p|q := ¬(p ∧ q), and p ⊕ q is the proposition with true value T if and only if there is
 exactly one of p, q with true value T. Which of the following is correct?
A

The set {|} is an adequate set of propositional operators.

B

The set {|} is not an adequate set of propositional operators.
 
C

 The set {|, ⊕} is not an adequate set of propositional operators.

D

The set {⊕} is an adequate set of propositional operators.
Question 8. Consider a linear program finding minimum which has the simplex tableau for basic variables
{x2 , x5 , x4 } as below.

−2 3 0 0
x1 x2 x3 x4 rhs
3 4 1 0 24
7 −4 0 1 16
−2 3 0 0 0

Then, the pivot element (phần tử trục/xoay)


A

ā12 = 4, with in-variable x2 and out-variable x3 .

B

can not be determined.
 
C

ā = 3, with in-variable x1 and out-variable x3 .
 11
D

ā21 = 7, with in-variable x1 and out-variable x4 .
Question 9. Consider the following linear program

min x1 + x3 − x4
xi
s. t. x1 − x3 = 1,
x3 + x4 = 6,
x2 − 2x3 = 3,
xi ≥ 0, for i = 1, 2, . . . , 4.

Then, the point (1, 3, 0, 6)

 
A

is not in the feasible set. B

is a basic feasible solution.
  

not a basic solution.
C is
not a basic feasible solution.
D is

Student’s Signature: . . . . . . . . . . . . . . Code 2632 Page 2

Question 10. Suppose that we are proving the validity of the sequent

¬φ1 ∧ ¬φ2 ` φ1 → φ2

as follows.

1. ¬φ1 ∧ ¬φ2 premise

2. φ1 assumption
3. ¬φ1 ∧e1 1
4. ⊥ ¬e2,3
5. φ2 ⊥e4
6. φ1 → φ2 → i2,5

 Which of the following is correct? 

A

That is not a correct proof since we did B

That is not a correct proof since Line 1 has
not use the fact ¬φ2 in the premise at all. the premise ¬φ1 , so we are not allowed to
 introduce the assumption φ1 in Line 2.
C

That is not a correct proof since on Line D

That is a correct proof.
4 we have seen a contradiction.
Question 11. Which of the following formulas has the parse tree:

 
A

(p ∨ ¬q) ∧ (¬p ∨ q). B

(p ∧ ¬q) ∨ (¬p ∧ q).
  
C

(¬p ∧ q) ∨ (p ∧ ¬q). D

(¬p ∨ q) ∧ (p ∨ ¬q).
Question 12. A basic feasible solution of a linear program consists of

A

basic variables of zero, non-basic variables of positive value.

B

all variables of zero
 
C

basic variables of zero, non-basic variables of non-zero.
 
D

basic variable of non-nagative value, non-basic variables of zero.
Question 13. Consider a linear program finding minimum which has the initial simplex tableau as below.
1 1 1 0 0
x1 x2 x3 x4 x5 rhs
−1 1 2 0 0 2
1 0 −1 0 1 3
2 0 1 1 0 4
r1 r2 r3 r4 r5 0

Suppose that x2 , x5 , x4 are basic variables. Then, the value of reduced cost ri , for i = 1, 2, . . . , 5,
should be
   
A

(2, 0, −1, 0, 0) B

(−2, 0, 1, 0, 0). C

(0, 2, 1, 0, 0) D

(0, 1, 2, 0, 0)
Question 14. The relaxation in branch-and-bound approach for solving a linear integer program, performs to

 
A

drop integer constraint of variables. B assign all variables into zero.
 


C

assign all variables into one. D

drop all integer variables

Student’s Signature: . . . . . . . . . . . . . . Code 2632 Page 3

Question 15. Consider a linear program finding minimum which has the simplex tableau for basic variables
{x2 , x5 , x4 } as below.

1 1 1 0 0
x1 x2 x3 x4 x5 rhs
−1 1 2 0 0 2
1 0 −1 0 1 3
2 0 1 1 0 4
2 0 −1 0 0 −f (x)

Since r3 < 0 and āi3 is not negative (for i = 1, 2, 3), we need to compute the next simplex
tableau. Hence, new basic variables should be
   
A

{x2 , x5 , x3 }. B

{x2 , x5 , x4 }. C

{x3 , x5 , x4 }. D

{x2 , x3 , x4 }.
Question 16. If a linear program has an optimal solution, then

A

only feasible set is non-empty.

B

the feasible set is non-empty and objective function is bounded.
 
C

the objective function might not be bounded.
 
D

the feasible set can be empty.
Question 17. Which of the following statements about Natural Deduction is true?

A

Contradictions don’t play an important role in natural deduction.

B

p ∨ ¬p cannot be proved in natural deduction.
 
C

Boxes are not used to delineate the scope of assumptions.
 
D

The rules Modus Tollens (MT) cannot be derived from the rules ∧i and ∧e alone.
Question 18. Consider a general linear program

min − 2x1 + 3x2

x1 ,x2

s. t. 3x1 + 4x2 ≤ 24,

7x1 − 4x2 ≤ 16,
x1 , x2 ≥ 0.

Which one of followings can change the problem into standard form?

A

3x1 + 4x2 + x3 = 24, 7x1 − 4x2 + x4 = 16, where x3 , x4 ≥ 0.

B

3x + 4x2 + x3 = 24, 7x1 − 4x2 + x4 = 16, where x3 , x4 ≤ 0.
  1
C


 1 + 4x2 − x3
3x = 24, 7x1 − 4x2 − x4 = 16, where x3 , x4 ≥ 0.
D

x3 − 3x1 − 4x2 = 24, x4 − 7x1 + 4x2 = 16, where x3 , x4 ≤ 0.
Question 19. Given the following predicates
Q(x) : x is a politician, T (z) : z is a time,
P (y) : y is a person, F (x, y, z) : person x fools person y at time z.

Represent the following sentences in predicate logic:


“Politicians can’t fool all ofthe 
people all of the time.”
A

∀x[Q(x) → ∃y∃z(P (y) ∧ T (z) ∧ ¬F (x, y, z))]. B

∀x[Q(x) → ∀y∀z((P (y) ∧ T (z)) → ¬F (x, y, z))].
  
C

∀x[Q(x) → ∃y∃z((P (y) ∧ T (z)) → ¬F (x, y, z))]. D

∀x∃y∃z[Q(x) → (P (y) ∧ T (z) ∧ F (x, y, z))].

Question 20. Let φ be a propositional formula. Consider the following statements on φ.

I. φ is satisfiable or ¬φ is satisfiable.

II. φ is a tautology or ¬φ is a tautology.

 Then 
A

I is incorrect and II is correct. B Both I and II are correct.
 


C

Both I and II are incorrect. D

I is correct and II is incorrect.

Student’s Signature: . . . . . . . . . . . . . . Code 2632 Page 4

 BKU, VNU-HCM MIDTERM ANSWER KEYS
FACULTY OF CS AND ENGINEERING Subject: Maths Modelling (CO2011)
Class: CC15KHMT Group: CC01
Time: 60 minutes (Closed book test)
Test date: March 26, 2018

Code: 2632
    
Question 1.

C Question 6.

C Question 11.

A Question 16.

B
       
A
Question 2.
A
Question 7.
D
Question 12.
D
Question 17.

       
Question 3.

A Question 8.

D Question 13.

A Question 18.

A
     
C
Question 4.
B
Question 9.
A
Question 14.
A
Question 19.

      
Question 5.

D Question 10.

D Question 15.

C Question 20.

Student’s Signature: . . . . . . . . . . . . . . Code 2632 Page 1

 BKU, VNU-HCM MIDTERM
FACULTY OF CS AND ENGINEERING Subject: Maths Modelling (CO2011)
Class: CC15KHMT Group: CC01
Time: 60 minutes (Closed book test)
Test date: March 26, 2018

Student’s Name: Student’s ID:

(There are 20 MCQs, each question is worth 0.5 points. Answers in bold : ; cancel out to deselect: @
 .)

Question 1. Given the following predicates

Q(x) : x is a politician, T (z) : z is a time,
P (y) : y is a person, F (x, y, z) : person x fools person y at time z.

Represent the following sentences in predicate logic:


“Politicians can’t fool all ofthe 
people all of the time.”
A

∀x[Q(x) → ∀y∀z((P (y) ∧ T (z)) → ¬F (x, y, z))]. B

∀x[Q(x) → ∃y∃z(P (y) ∧ T (z) ∧ ¬F (x, y, z))].
  
C

∀x[Q(x) → ∃y∃z((P (y) ∧ T (z)) → ¬F (x, y, z))]. D

∀x∃y∃z[Q(x) → (P (y) ∧ T (z) ∧ F (x, y, z))].
Question 2. Which of the following statements about Natural Deduction is true?

A

p ∨ ¬p cannot be proved in natural deduction.

B

Contradictions don’t play an important role in natural deduction.
 
C

Boxes are not used to delineate the scope of assumptions.
 
D

The rules Modus Tollens (MT) cannot be derived from the rules ∧i and ∧e alone.
Question 3. Consider the following program.

If we know that its (postcondition) is {x ≥ 9}, then which of the following is its precondition?
 
A

{(x ≥ −3 ∧ x < 5) ∨ (x ≥ 8)}. B {(x < −3) ∨ (x > 8)}.
 


C

{(x ≤ −3) ∨ (x ≥ 3 ∧ x < 5) ∨ (x ≥ 8)}. D

{(x ≤ −3) ∨ (x ≥ 3 ∧ x < 5)}.
Question 4. Let f and g be two functions from R to R. Then the negation of the formula “For each s in R,
 there exists r in R such that if f (r) > 0, then g(s) > 0” is the following formula.
A

For every s in R, there exists r in R such B

There exists s in R such that for every r
 that f (r) > 0 and g(s) ≤ 0.  in R, f (r) > 0 and g(s) ≤ 0.
C

For every s in R, there does not exist r in D

There exists s in R and there exists r in R
R such that if f (r) > 0, then g(s) > 0. such that f (r) ≤ 0 and g(s) ≤ 0.
Question 5. A basic feasible solution of a linear program consists of

A

all variables of zero

B

basic variables of zero, non-basic variables of positive value.
 
C

basic variables of zero, non-basic variables of non-zero.
 
D

basic variable of non-nagative value, non-basic variables of zero.
Question 6. Let φ be a propositional formula. Consider the following statements on φ.
I. φ is satisfiable or ¬φ is satisfiable.

II. φ is a tautology or ¬φ is a tautology.

 Then 
A

Both I and II are correct. B I is incorrect and II is correct.
 


C

Both I and II are incorrect. D

I is correct and II is incorrect.

Student’s Signature: . . . . . . . . . . . . . . Code 2633 Page 1

 Question 7. If a linear program has an optimal solution, then the solution

A

is a point of the interior of the feasible set.

B

is an extreme point of the feasible set.
 
C

is an interior point of the boundary of the feasible set.
 
D

does not belong to the feasible set.
Question 8. Consider the following linear program

min 2x1 − 3x2 + 2x3 − 2x4

xi
s. t. 5x1 + 2x3 − 6x4 = 5,
3x2 − x3 + 2x4 = 5,
xi ≥ 0, for i = 1, 2, . . . , 4.

Given non-basic variables x2 and x4 , then the corresponding basic solution of the problem is
 
A

(3, 0, −5, 0), and also feasible. B

(0, 3, 0, −5), and not feasible.
  

0, −5, 0), and not feasible.
C (3,
3, 0, −5), and also feasible.
D (0,
Question 9. Consider a linear program finding minimum which has the simplex tableau for basic variables
{x2 , x5 , x4 } as below.

1 1 1 0 0
x1 x2 x3 x4 x5 rhs
−1 1 2 0 0 2
1 0 −1 0 1 3
2 0 1 1 0 4
2 0 −1 0 0 −f (x)

Since r3 < 0 and āi3 is not negative (for i = 1, 2, 3), we need to compute the next simplex
tableau. Hence, new basic variables should be
   
A

{x2 , x5 , x4 }. B

{x2 , x5 , x3 }. C

{x3 , x5 , x4 }. D

{x2 , x3 , x4 }.
Question 10. Consider a general linear program

min − 2x1 + 3x2

x1 ,x2

s. t. 3x1 + 4x2 ≤ 24,

7x1 − 4x2 ≤ 16,
x1 , x2 ≥ 0.

Which one of followings can change the problem into standard form?

A

3x1 + 4x2 + x3 = 24, 7x1 − 4x2 + x4 = 16, where x3 , x4 ≤ 0.

B

3x + 4x2 + x3 = 24, 7x1 − 4x2 + x4 = 16, where x3 , x4 ≥ 0.
  1
C

3x + 4x2 − x3 = 24, 7x1 − 4x2 − x4 = 16, where x3 , x4 ≥ 0.
  1
D

x3 − 3x1 − 4x2 = 24, x4 − 7x1 + 4x2 = 16, where x3 , x4 ≤ 0.
Question 11. If a linear program has an optimal solution, then

A

the feasible set is non-empty and objective function is bounded.

B

only feasible set is non-empty.
 
C

the objective function might not be bounded.
 
D

the feasible set can be empty.

Student’s Signature: . . . . . . . . . . . . . . Code 2633 Page 2

Question 12. Consider a linear program finding minimum which has the simplex tableau for basic variables
{x2 , x5 , x4 } as below.

−2 3 0 0
x1 x2 x3 x4 rhs
3 4 1 0 24
7 −4 0 1 16
−2 3 0 0 0

Then, the pivot element (phần tử trục/xoay)


A

can not be determined.

B

ā = 4, with in-variable x2 and out-variable x3 .
 12
C

ā = 3, with in-variable x1 and out-variable x3 .
 11
D

ā21 = 7, with in-variable x1 and out-variable x4 .
Question 13. Which of the following formulas has the parse tree:

 
A

(p ∧ ¬q) ∨ (¬p ∧ q). B

(p ∨ ¬q) ∧ (¬p ∨ q).
  
C

(¬p ∧ q) ∨ (p ∧ ¬q). D

(¬p ∨ q) ∧ (p ∨ ¬q).
Question 14. The relaxation in branch-and-bound approach for solving a linear integer program, performs to

 
A

assign all variables into zero. B

drop integer constraint of variables.
  
C

assign all variables into one. D

drop all integer variables
Question 15. Which one of the following statements is true?

A

All sentences in predicate calculus are either satisfied by all models or by none.

B

Every sentence is satisfied by at least one model.
 
C

No sentence in predicate calculus is satisfied by all models.
 
D

Some sentences in predicate calculus may be satisfied by one model, but not by
another one.
Question 16. Consider the following linear program

min x1 + x3 − x4
xi
s. t. x1 − x3 = 1,
x3 + x4 = 6,
x2 − 2x3 = 3,
xi ≥ 0, for i = 1, 2, . . . , 4.

Then, the point (1, 3, 0, 6)

 
A

is a basic feasible solution. B is not in the feasible set.
 


C

is not a basic solution. D

is not a basic feasible solution.

Student’s Signature: . . . . . . . . . . . . . . Code 2633 Page 3

Question 17. Consider a linear program finding minimum which has the initial simplex tableau as below.
1 1 1 0 0
x1 x2 x3 x4 x5 rhs
−1 1 2 0 0 2
1 0 −1 0 1 3
2 0 1 1 0 4
r1 r2 r3 r4 r5 0

Suppose that x2 , x5 , x4 are basic variables. Then, the value of reduced cost ri , for i = 1, 2, . . . , 5,
should be
   
A

(−2, 0, 1, 0, 0). B

(2, 0, −1, 0, 0) C

(0, 2, 1, 0, 0) D

(0, 1, 2, 0, 0)
Question 18. Suppose that we are proving the validity of the sequent

¬φ1 ∧ ¬φ2 ` φ1 → φ2

as follows.

1. ¬φ1 ∧ ¬φ2 premise

2. φ1 assumption
3. ¬φ1 ∧e1 1
4. ⊥ ¬e2,3
5. φ2 ⊥e4
6. φ1 → φ2 → i2,5

 Which of the following is correct? 

A

That is not a correct proof since Line 1 has B

That is not a correct proof since we did
the premise ¬φ1 , so we are not allowed to not use the fact ¬φ2 in the premise at all.
introduce the assumption φ1 in Line 2. 
C

That is not a correct proof since on Line D

That is a correct proof.
4 we have seen a contradiction.
Question 19. Consider the predicate formula φ as follow.

(∃xP (y, y) −→ ∃yP (y, z)).

 
What is the result of the substitution y ⇒ f (z)) φ?
 
A

(∃xP (f (z), f (z)) −→ ∃yP (f (z), z)). B

(∃zP (f (z), f (z)) −→ ∃y 0 P (y 0 , z)).
  
C

(∃xP (f (z), f (z)) −→ ∃y 0 P (y 0 , z)). D

(∃zP (f (z), f (z)) −→ ∃zP (f (z), z)).

Question 20. The two propositional operators | (or N AN D), and ⊕ (or XOR) are defined as follow, respec-
tively: p|q := ¬(p ∧ q), and p ⊕ q is the proposition with true value T if and only if there is
 exactly one of p, q with true value T. Which of the following is correct?

A The set {|} is not an adequate set of propositional operators.


B The set {|} is an adequate set of propositional operators.
 

C The set {|, ⊕} is not an adequate set of propositional operators.
 
D

The set {⊕} is an adequate set of propositional operators.

Student’s Signature: . . . . . . . . . . . . . . Code 2633 Page 4

 BKU, VNU-HCM MIDTERM ANSWER KEYS
FACULTY OF CS AND ENGINEERING Subject: Maths Modelling (CO2011)
Class: CC15KHMT Group: CC01
Time: 60 minutes (Closed book test)
Test date: March 26, 2018

Code: 2633
      
Question 1.

B Question 6.

D Question 11.

A Question 16.

A
     
D
Question 2.
B
Question 7.
D
Question 12.
B
Question 17.

    
Question 3.

C Question 8.

C Question 13.

B Question 18.

D
   
B
Question 4.
C
Question 9.
B
Question 14.
C
Question 19.

     
Question 5.

D Question 10.

B Question 15.

D Question 20.

Student’s Signature: . . . . . . . . . . . . . . Code 2633 Page 1

 BKU, VNU-HCM MIDTERM
FACULTY OF CS AND ENGINEERING Subject: Maths Modelling (CO2011)
Class: CC15KHMT Group: CC01
Time: 60 minutes (Closed book test)
Test date: March 26, 2018

Student’s Name: Student’s ID:

(There are 20 MCQs, each question is worth 0.5 points. Answers in bold : ; cancel out to deselect: @
 .)

Question 1. Consider the following program.

If we know that its (postcondition) is {x ≥ 9}, then which of the following is its precondition?
 
A

{(x ≥ −3 ∧ x < 5) ∨ (x ≥ 8)}. B {(x ≤ −3) ∨ (x ≥ 3 ∧ x < 5)}.
 


C

{(x ≤ −3) ∨ (x ≥ 3 ∧ x < 5) ∨ (x ≥ 8)}. D

{(x < −3) ∨ (x > 8)}.
Question 2. Consider the following linear program

min 2x1 − 3x2 + 2x3 − 2x4

xi
s. t. 5x1 + 2x3 − 6x4 = 5,
3x2 − x3 + 2x4 = 5,
xi ≥ 0, for i = 1, 2, . . . , 4.

Given non-basic variables x2 and x4 , then the corresponding basic solution of the problem is
 
A

(3, 0, −5, 0), and also feasible. B

(0, 3, 0, −5), and also feasible.
  
C

(3, 0, −5, 0), and not feasible. D

(0, 3, 0, −5), and not feasible.
Question 3. If a linear program has an optimal solution, then the solution

A

is a point of the interior of the feasible set.

B

 does not belong to the feasible set.

C

is an interior point of the boundary of the feasible set.
 
D

is an extreme point of the feasible set.
Question 4. Let φ be a propositional formula. Consider the following statements on φ.
I. φ is satisfiable or ¬φ is satisfiable.

II. φ is a tautology or ¬φ is a tautology.

 Then 
A

Both I and II are correct. B I is correct and II is incorrect.
 


C

Both I and II are incorrect. D

I is incorrect and II is correct.
Question 5. Let f and g be two functions from R to R. Then the negation of the formula “For each s in R,
 there exists r in R such that if f (r) > 0, then g(s) > 0” is the following formula.
A

For every s in R, there exists r in R such B

There exists s in R and there exists r in R
 that f (r) > 0 and g(s) ≤ 0.  such that f (r) ≤ 0 and g(s) ≤ 0.
C

For every s in R, there does not exist r in D

There exists s in R such that for every r
R such that if f (r) > 0, then g(s) > 0. in R, f (r) > 0 and g(s) ≤ 0.

Student’s Signature: . . . . . . . . . . . . . . Code 2634 Page 1

 Question 6. Which of the following statements about Natural Deduction is true?

A

p ∨ ¬p cannot be proved in natural deduction.

B

The rules Modus Tollens (MT) cannot be derived from the rules ∧i and ∧e alone.
 
C

Boxes are not used to delineate the scope of assumptions.
 
D

Contradictions don’t play an important role in natural deduction.
Question 7. The relaxation in branch-and-bound approach for solving a linear integer program, performs to

 
A

assign all variables into zero. B

drop all integer variables
  
C

assign all variables into one. D

drop integer constraint of variables.
Question 8. Consider a general linear program

min − 2x1 + 3x2

x1 ,x2

s. t. 3x1 + 4x2 ≤ 24,

7x1 − 4x2 ≤ 16,
x1 , x2 ≥ 0.

Which one of followings can change the problem into standard form?

A

3x1 + 4x2 + x3 = 24, 7x1 − 4x2 + x4 = 16, where x3 , x4 ≤ 0.

B

 x3 − 3x1 − 4x2 = 24, x4 − 7x1 + 4x2 = 16, where x3 , x4 ≤ 0.

C

3x + 4x2 − x3 = 24, 7x1 − 4x2 − x4 = 16, where x3 , x4 ≥ 0.
  1
D

3x1 + 4x2 + x3 = 24, 7x1 − 4x2 + x4 = 16, where x3 , x4 ≥ 0.
Question 9. Given the following predicates
Q(x) : x is a politician, T (z) : z is a time,
P (y) : y is a person, F (x, y, z) : person x fools person y at time z.

Represent the following sentences in predicate logic:


“Politicians can’t fool all ofthe 
people all of the time.”
A

∀x[Q(x) → ∀y∀z((P (y) ∧ T (z)) → ¬F (x, y, z))]. B

∀x∃y∃z[Q(x) → (P (y) ∧ T (z) ∧ F (x, y, z))].
  
C

∀x[Q(x) → ∃y∃z((P (y) ∧ T (z)) → ¬F (x, y, z))]. D

∀x[Q(x) → ∃y∃z(P (y) ∧ T (z) ∧ ¬F (x, y, z))].

Question 10. Consider the following linear program

min x1 + x3 − x4
xi
s. t. x1 − x3 = 1,
x3 + x4 = 6,
x2 − 2x3 = 3,
xi ≥ 0, for i = 1, 2, . . . , 4.

Then, the point (1, 3, 0, 6)

 
A

is a basic feasible solution. B is not a basic feasible solution.
 


C

is not a basic solution. D

is not in the feasible set.
Question 11. Consider the predicate formula φ as follow.

(∃xP (y, y) −→ ∃yP (y, z)).

 
What is the result of the substitution y ⇒ f (z)) φ?
 
A

(∃xP (f (z), f (z)) −→ ∃yP (f (z), z)). B

(∃zP (f (z), f (z)) −→ ∃zP (f (z), z)).
  
C

(∃xP (f (z), f (z)) −→ ∃y 0 P (y 0 , z)). D

(∃zP (f (z), f (z)) −→ ∃y 0 P (y 0 , z)).

Student’s Signature: . . . . . . . . . . . . . . Code 2634 Page 2

Question 12. Consider a linear program finding minimum which has the simplex tableau for basic variables
{x2 , x5 , x4 } as below.

1 1 1 0 0
x1 x2 x3 x4 x5 rhs
−1 1 2 0 0 2
1 0 −1 0 1 3
2 0 1 1 0 4
2 0 −1 0 0 −f (x)

Since r3 < 0 and āi3 is not negative (for i = 1, 2, 3), we need to compute the next simplex
tableau. Hence, new basic variables should be
   
A

{x2 , x5 , x4 }. B

{x2 , x3 , x4 }. C

{x3 , x5 , x4 }. D

{x2 , x5 , x3 }.
Question 13. Consider a linear program finding minimum which has the initial simplex tableau as below.
1 1 1 0 0
x1 x2 x3 x4 x5 rhs
−1 1 2 0 0 2
1 0 −1 0 1 3
2 0 1 1 0 4
r1 r2 r3 r4 r5 0

Suppose that x2 , x5 , x4 are basic variables. Then, the value of reduced cost ri , for i = 1, 2, . . . , 5,
should be
   
A

(−2, 0, 1, 0, 0). B

(0, 1, 2, 0, 0) C

(0, 2, 1, 0, 0) D

(2, 0, −1, 0, 0)
Question 14. Which one of the following statements is true?

A

All sentences in predicate calculus are either satisfied by all models or by none.

B

Some sentences in predicate calculus may be satisfied by one model, but not by
 another one.
C


 sentence in predicate calculus is satisfied by all models.
No
D

Every sentence is satisfied by at least one model.
Question 15. A basic feasible solution of a linear program consists of

A

all variables of zero

B

basic variable of non-nagative value, non-basic variables of zero.
 
C

 basic variables of zero, non-basic variables of non-zero.

D

basic variables of zero, non-basic variables of positive value.
Question 16. Consider a linear program finding minimum which has the simplex tableau for basic variables
{x2 , x5 , x4 } as below.

−2 3 0 0
x1 x2 x3 x4 rhs
3 4 1 0 24
7 −4 0 1 16
−2 3 0 0 0

Then, the pivot element (phần tử trục/xoay)


A

can not be determined.

B

ā = 7, with in-variable x1 and out-variable x4 .
 21
C

ā = 3, with in-variable x1 and out-variable x3 .
 11
D

ā12 = 4, with in-variable x2 and out-variable x3 .

Student’s Signature: . . . . . . . . . . . . . . Code 2634 Page 3

Question 17. The two propositional operators | (or N AN D), and ⊕ (or XOR) are defined as follow, respec-
tively: p|q := ¬(p ∧ q), and p ⊕ q is the proposition with true value T if and only if there is
 exactly one of p, q with true value T. Which of the following is correct?

A The set {|} is not an adequate set of propositional operators.


B The set {⊕} is an adequate set of propositional operators.
 

C The set {|, ⊕} is not an adequate set of propositional operators.
 
D

The set {|} is an adequate set of propositional operators.
Question 18. Which of the following formulas has the parse tree:

 
A

(p ∧ ¬q) ∨ (¬p ∧ q). B

(¬p ∨ q) ∧ (p ∨ ¬q).
  
C

(¬p ∧ q) ∨ (p ∧ ¬q). D

(p ∨ ¬q) ∧ (¬p ∨ q).
Question 19. Suppose that we are proving the validity of the sequent

¬φ1 ∧ ¬φ2 ` φ1 → φ2

as follows.

1. ¬φ1 ∧ ¬φ2 premise

2. φ1 assumption
3. ¬φ1 ∧e1 1
4. ⊥ ¬e2,3
5. φ2 ⊥e4
6. φ1 → φ2 → i2,5

 Which of the following is correct? 

A

That is not a correct proof since Line 1 has B

That is a correct proof.
the premise ¬φ1 , so we are not allowed to
introduce the assumption φ1 in Line 2. 
C

That is not a correct proof since on Line D

That is not a correct proof since we did
4 we have seen a contradiction. not use the fact ¬φ2 in the premise at all.
Question 20. If a linear program has an optimal solution, then

A

the feasible set is non-empty and objective function is bounded.

B

the feasible set can be empty.
 
C

the objective function might not be bounded.
 
D

only feasible set is non-empty.

Student’s Signature: . . . . . . . . . . . . . . Code 2634 Page 4

 BKU, VNU-HCM MIDTERM ANSWER KEYS
FACULTY OF CS AND ENGINEERING Subject: Maths Modelling (CO2011)
Class: CC15KHMT Group: CC01
Time: 60 minutes (Closed book test)
Test date: March 26, 2018

Code: 2634
   
Question 1.

C Question 6.

B Question 11.

C Question 16.

B
     
C
Question 2.
D
Question 7.
C
Question 12.
D
Question 17.

       
Question 3.

D Question 8.

D Question 13.

D Question 18.

D
    
B
Question 4.
D
Question 9.
B
Question 14.
B
Question 19.

      
Question 5.

D Question 10.

A Question 15.

B Question 20.

Student’s Signature: . . . . . . . . . . . . . . Code 2634 Page 1