Quiz-4 GMath

4/7/22, 10:46 AM Quiz 4_GMath 2nd Semester 2022
2221719@slu.edu.ph
Answer the following questions below by selecting the letter that represents
the best answer.
A) CBEC
B) ABEA
C) BCDCB
D) None of the Above
https://docs.google.com/forms/d/e/1FAIpQLSdmn9il_KhYfwCbg0378G3wg3AdIb9GmXsyKGIMbxhMYB9ZnA/viewscore?viewscore=AE0zAgDjaLJ6Fr2vtpC7v… 2/26
A) FEBA
B) FBCCD
C) FEABCD
D) All of the Above
A) d(E) = 6
B) d(B) = 4
C) d (C)=3
D) d(F) = 4
A) AEDC
B) AEFC
C) AEDFC
D) AEC
A) 4
B) 5
C) 6
D) 7
A) AEFEBCD
B) ABCD
C) AFEBCD
D) AEFCD
A) BC
B) DC
C) AE
D) None of the above
A) There is a circuit.
B) There are multiple edges.
C) It is a connected graph.
D) A loop exists.
A) 24
B) 25
C) 276
D) 300
A) 2
B) 3
C) 4
D) 5
A) Euler Trail
B) Euler Tour
C) Hamilton Cycle
D) Hamilton Path
A) Euler Trail
B) Euler Tour
https://docs.google.com/forms/d/e/1FAIpQLSdmn9il_KhYfwCbg0378G3wg3AdIb9GmXsyKGIMbxhMYB9ZnA/viewscore?viewscore=AE0zAgDjaLJ6Fr2vtpC7… 10/26
C) Hamilton Cycle
D) Hamilton Path
A) Euler Trail
B) Euler Tour
C) Hamilton Cycle
D) Hamilton Path
A) Euler Trail
B) Euler Tour
C) Hamilton Cycle
D) Hamilton Path
A) G1
B) G1, G2
C) G3, G4
D) G4
A) Euler Tour
B) Hamiltonian Cycle
C) Both
D) Neither
A) Statements I and II are both True
B) Statement I is True while statement II is False
C) Statement I is False while statement II is True
D) Both statements are False
A) Hamiltonian cycle can be converted to a Hamiltonian path by removing one of its

edge.
B) Every graph that contains a Hamiltonian cycle also contains a Hamiltonian path
and vice versa is true.
C) There may exist more than one Hamiltonian paths and Hamiltonian cycle in a
graph.
D) A connected graph has as Euler trail if and only if it has at most two vertices of odd
degree
A) two vertices and an edge
B) all vertices
C) two edges and the vertex connecting them
D) all edges
A) The path a-b-c-d of G2 is a Hamilton path.
B) The cycle a-b-c-d-e-a of G1 is a Hamilton cycle thus G1 is a Hamilton graph.
C) G2 is not a Hamilton graph.
D) G3 is a Hamilton graph.
A) non-negativity restrictions
B) objective function
C) feasible solution region
D) constraints
A) Quadrant 1
B) Quadrant II
C) Quadrant III
D) Quadrant IV
A) maximization
B) minimization
C) inequality
D) non-negativity constraints
A) at the intersection of the non-negativity constraints.
B) at the intersection of a non-negativity constraint and a resource constraint.
C) at the intersection of the objective function and a constraint.
D) at the intersection of two or more constraints.
A. 3x+4y≤9
B. 3x-4y≤9
C. 3x+4y≥-9
D. 3x+4y≥-9
A. (0,0)
B. (0,-6)
C. (0,-3)
D. (-3,1)
A. (0,2), (0,0), (4,0), (3,1.5),(2,2)
B. (2,2), (3,1.5), (6,0), (4,0),(0,0), (0,2)
C. (3,1.5), (4,0), (6,0)
D. (0,6), (3,1.5), (4,0), (0,0),(0,2), (0,3)
A. (3,1.5)
B. (0,4)
C. (6,0)
D. (2,2)
A. I
B. II
C. I and II
D. III and IV
A) (40,48)
B) (120,0)
C) (180,120)
D) (30,36)
A) I only
B) II and III.
C) III and IV
D) IV only
A) Bounded feasible regions have both a minimum and a maximum value.
B) Unbounded feasible regions have both a minimum and a maximum value.
C) If a feasible region is unbounded, then a maximum value for the objective function
does not exist.
D) If a feasible region is unbounded, and the objective function has only positive
coefficients, then a minimum value exists.
≤
≤ ≤ ≥ ≥
A) A
B) B
C) C
D) E
A) I only
B) II only
C) I and II only
D) II and III only
A) In most cases, for the inequality with ≤, the corresponding solution set is the area
below the line
B) The feasible region is a set of values which satisfies ALL the constraints.
C) The optimal solution is the pair of values for the variables that provide the
maximum (or minimum) value for the objective function.
D) The optimal solution is not found in the corner points of the feasible region.
A. (10, 0)
B (10/3 10/3)
B. (10/3, 10/3)
C. (0, 10)
D. none of the above
This form was created inside of Saint Louis University, Inc..
Forms

Quiz-4 GMath

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Quiz-4 GMath

Uploaded by

Copyright:

Available Formats

4/7/22, 10:46 AM Quiz 4_GMath 2nd Semester 2022

D) None of the Above

D) All of the Above

D) None of the above

B) There are multiple edges.

A) Statements I and II are both True

B) Statement I is True while statement II is False

C) Statement I is False while statement II is True

D) Both statements are False

A) Hamiltonian cycle can be converted to a Hamiltonian path by removing one of its

A) two vertices and an edge

C) two edges and the vertex connecting them

A) The path a-b-c-d of G2 is a Hamilton path.

B) The cycle a-b-c-d-e-a of G1 is a Hamilton cycle thus G1 is a Hamilton graph.

C) G2 is not a Hamilton graph.

C) feasible solution region

A) at the intersection of the non-negativity constraints.

B) at the intersection of a non-negativity constraint and a resource constraint.

C) at the intersection of the objective function and a constraint.

D) at the intersection of two or more constraints.

A. (0,2), (0,0), (4,0), (3,1.5),(2,2)

B. (2,2), (3,1.5), (6,0), (4,0),(0,0), (0,2)

C. (3,1.5), (4,0), (6,0)

D. (0,6), (3,1.5), (4,0), (0,0),(0,2), (0,3)

A) Bounded feasible regions have both a minimum and a maximum value.

B) Unbounded feasible regions have both a minimum and a maximum value.

D) II and III only

D. none of the above

This form was created inside of Saint Louis University, Inc..

You might also like