lOMoARcPSD|20174076

Gmath-QUIZ 4 - nasa net lahat to

BS Accountancy (Saint Louis University (Philippines))

Studocu is not sponsored or endorsed by any college or university

Downloaded by Kenji Hikamura (kenjihikamura@gmail.com)
 lOMoARcPSD|20174076

Multiple Choice
Answer the following questions below by selecting the choice that represents
the best answer.

The graph below has*

a Hamiltonian Cycle
both an Euler Tour and a Hamiltonian Cycle
an Euler Tour
neither an Euler Tour and a Hamiltonian Cycle

Which of the following graphs is Hamiltonian?*

G4
G1, G2
G3, G4
G1

The shaded region in the given figure illustrates an unbounded feasible region. Which
of the following is true? *

Downloaded by Kenji Hikamura (kenjihikamura@gmail.com)

 lOMoARcPSD|20174076

I and II
II
III and IV
I

In the graph of a linear programming model, the region defined by the constraints and
the non-negative restrictions is the:*
constraints
non-negativity restrictions
feasible solution region
objective function

Touching all vertices in a graph without repeating or picking up your pencil and starting
and stopping at a different spot.*
Hamilton Cycle
Euler Trail
Euler Tour
Hamilton Path

Which of the following is NOT a walk from A to D?*

AFEBCD
ABCD
AEFCD
AEFEBCD

Which is NOT a correct statement about the degree of a vertex in the graph?*

d(F) = 4
d(E) = 6
d(B) = 4
d(C)=3

Which of the following ordered pairs is a solution to the given inequality?*

(-3,1)

Downloaded by Kenji Hikamura (kenjihikamura@gmail.com)

 lOMoARcPSD|20174076

(0,-3)
(0,0)
(0,-6)

The number of vertices in K25 is*

24
276
300
25

The solution set of the non-negativity constraints is located at*

Quadrant IV
Quadrant III
Quadrant I
Quadrant II

In order for a linear programming problem to have a unique solution, the solution must
exist*
at the intersection of the objective function and a constraint.
at the intersection of a non-negativity constraint and a resource constraint.
at the intersection of the non-negativity constraints.
at the intersection of two or more constraints.

Which of the following statement/s is/are true or false?*

Statement I is False while statement II is True

Both statements are False
Statement I is True while statement II is False
Statements I and II are both True

Touching all edges in a graph without repeating or picking up your pencil and starting
and stopping at a different spot.*
Hamilton Cycle
Euler Tour
Hamilton Path
Euler Trail

Touching all vertices in a graph without repeating or picking up your pencil and starting
and stopping at same spot.*
Euler Tour
Hamilton Path
Hamilton Cycle
Euler Trail

A Hamilton cycle touches*

two edges and the vertex connecting them

Downloaded by Kenji Hikamura (kenjihikamura@gmail.com)

 lOMoARcPSD|20174076

two vertices and an edge

all vertices
all edges

If the objective function is to Max Z=2x+3y, what will be the optimal solution of the
feasible region shown below?*

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

It requires that each variable to be greater than or equal to zero*

maximization
minimization
non-negativity constraints
inequality

Which of the following inequality has a graph and solution as illustrated?*

3x-4y≤-9
3x-4y≤9
3x+4y≤9
3x+4y≤-9

If a complete graph has degree 3 for each vertex, then how many diagonals are in the
graph?*
3
4
5
2

Which of the following is false?*

There may exist more than one Hamiltonian paths and Hamiltonian cycle in a graph.
Hamiltonian cycle can be converted to a Hamiltonian path by removing one of its edge.
Every graph that contains a Hamiltonian cycle also contains a Hamiltonian path and vice versa is
true.
A connected graph has as Euler trail if and only if it has at most two vertices of odd degree

Downloaded by Kenji Hikamura (kenjihikamura@gmail.com)

 lOMoARcPSD|20174076

Which one of the following statements is NOT true about this graph?*

It is a connected graph.
There is a circuit.
There are multiple edges.
A loop exists.

Consider the following linear programming problem. Which of the following points (X, Y)
could be a feasible corner point?*

(120,0)
(40,48)
(30,36)
(180,120)

Find the solution set in the figure below satisfying the following constraints: 3x + 2y
≤5; 2x + 5y ≤6; 3x −y ≤1; x ≥0, y ≥0*

B
E
C
A

Given the illustration below, what are the corner points of the feasible region?*

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

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

Downloaded by Kenji Hikamura (kenjihikamura@gmail.com)

 lOMoARcPSD|20174076

When the constraint is composing of only one variable, the form of the line is I. a
horizontal line II. a vertical line III. a diagonal line*
II and III only
II only
I only
I and II only

Which of the following is NOT a circuit in the graph?*

ABEA
None of the Above
BCDCB
CBEC

Which of the following statements is not true?*

If a feasible region is unbounded, and the objective function has only positive coefficients, then a
minimum value exists.
If a feasible region is unbounded, then a maximum value for the objective function does not exist.
Bounded feasible regions have both a minimum and a maximum value.
Unbounded feasible regions have both a minimum and a maximum value.

What is the order of the graph?*

7
5
4
6

Given the following constraints as shown in the graph below. At which point is the cost
function � = 5� + 2� maximized with respect to the feasible region described?*

Downloaded by Kenji Hikamura (kenjihikamura@gmail.com)

 lOMoARcPSD|20174076

none of the above

(0, 10)
(10, 0)
(10/3, 10/3)

Which of the following is not true?*

G2 is not a Hamilton graph.

G3 is a Hamilton graph.
The cycle a-b-c-d-e-a of G1 is a Hamilton cycle thus G1 is a Hamilton graph.
The path a-b-c-d of G2 is a Hamilton path.

Which of the following vertices are adjacent to vertex B?*

A, E, D, C
A, E, D, F, C
A, E, C
A, E, F, C

Touching all edges in a graph without repeating or picking up your pencil and starting
and stopping at same spot.*
Euler Tour
Hamilton Path
Hamilton Cycle
Euler Trail

Which of the following statements is false?*

The feasible region is a set of values which satisfies ALL the constraints.
The optimal solution is the pair of values for the variables that provide the maximum (or minimum)
value for the objective function.
The optimal solution is not found in the corner points of the feasible region.
In most cases, for the inequality with ≤, the corresponding solution set is the area below the line

The shaded region in following figure illustrates the unbounded feasible region of a
linear programming problem. Given the objective function P = 2x + 3y, which of the

Downloaded by Kenji Hikamura (kenjihikamura@gmail.com)

 lOMoARcPSD|20174076

following is TRUE? I. The maximum of P is 18 at A = (0, 6). II. The minimum of P is 0 at

O = (0, 0). III. The maximum of P is 21 at D = (7, 0).IV. The minimum of P is 11 at C =
(4, 1).*

IV only
III and IV
II and III.
I only

Which of the following is a loop?*

None of the above

DC
BC
AE

Which of the following is NOT a path in the graph?*

FEBA
FEABCD
FBCCD
All of the Above

Downloaded by Kenji Hikamura (kenjihikamura@gmail.com)