LawMint Sign in

Maharashtra and Goa SET (MH SET) Discrete Structures and Optimization Previous Year Questions

Try the preview and open any solution for a worked explanation.

Maharashtra and Goa SET (MH SET) practice pack

The practice pack for Maharashtra and Goa SET (MH SET) is coming soon to LawMint.

Question 1

Let ϕ,ψ\phi,\psi be formulas. ϕ⊨ψ\phi\models\psi if and only if ϕ→ψ\phi\to\psi is a:

Select one answer

Question 2

Which of the following relations defined on X = {1, 2, 3} is an equivalence relation ?

Select one answer

Question 3

Five people stand at the vertices of a pentagon, throwing frisbees to each other. They have two frisbees, initially at adjacent vertices as shown in the figure. In each time interval, each frisbee is thrown either to the left or to the right (along an edge of the pentagon) with equal probability. This process continues until one person is the target of two frisbees simultaneously, then game ends.
(Note: All throws are independent of past history)
Find the mean and variance of the number of pairs of throws.

Five vertices form a pentagon. Two frisbees start at the adjacent bottom vertices. Arrows from each starting vertex point along both incident edges.

Select one answer

Question 4

A rod divided into six segments is to be colored with one or more of 4 different colors. In how many ways can this be done?

Select one answer

Question 5

A committee is to be selected from 5 candidates a, b, c, d and e. The selection must satisfy all the following conditions :
• Either a or b must be included, but not both
• Either c or e or both must be included
• If d is included then b must be included
• Either a or c are included or neither is included.
• If e is included, then c and d must be included.
How should selection be made?

Select one answer

Question 6

The thickness of a graph G is defined as minimum number of (edge-disjoint) planar subgraphs into which G can be decomposed. The thickness of G is defined as θ \theta (G). What is the thickness of planar graph ?

Select one answer

Question 7

Let us consider the letters from a through h, and all 5-letter words are made using these letters. (words are just strings of letters). How many of these words contain no repeated letters ?

Select one answer

Question 8

What is the smallest number of colors that can be used to color the vertices of a cube so that no 2 adjacent vertices are colored identically?

A cube graph drawn as an outer square and an inner square, with corresponding corners joined; all eight vertices are unlabelled.

Select one answer

Question 9

Let us consider the following primal problem :
Maximize z = 2x1 + x2
Subject to x1– x2≤ 4,
x1– x2≤ 2,
x1, x2≥ 0
What will be its dual problem ?

Select one answer

Question 10

Consider the following linear programming problem :
Maximize z = 5x1 + 2x2 + 3x3– x4 + x5
Subject to : x1 + 2x2 + 2x3 + x4 = 8
3x1 + 4x2 + x3 + x5 = 7
x1, x2, x3, x4, x5≥ 0
What will be the basic feasible solution after iteration 1 ?

Select one answer

Continue practising

The practice pack for Maharashtra and Goa SET (MH SET) is coming soon to LawMint.

Maharashtra and Goa SET (MH SET) practice pack

The practice pack for Maharashtra and Goa SET (MH SET) is coming soon to LawMint.