Rajasthan SET (RSET) Discrete Structures and Optimization Previous Year Questions
Try the preview and open any solution for a worked explanation.
Rajasthan SET (RSET) practice pack
The practice pack for Rajasthan SET (RSET) is coming soon to LawMint.
Question 1
Which of the following propositions is logically equivalent to the statement ¬(p ↔ q) ?
Question 2
Let [B, –, ∨, ∧] be a Boolean algebra of order 4, and let f be a Boolean function of two variables on B. How many different boolean functions are there of two variables ?
Question 3
Let A = {1, 2, 3}. What is the total number of distinct equivalence relations that can be defined on Set A ?
Question 4
Let f be the function from {a, b, c, d} to {1, 2, 3, 4} with f(a) = 4, f(b) = 2, f(c) = 1 and f(d) = 3. Which of the following statements perfectly describes the classification of function f ?
Question 5
A bag contains 12 marbles : 5 red, 3 blue and 4 green. If two marbles are drawn consecutively without replacement, what is the probability that both marbles selected are red ?
Question 6
The chromatic number of the following graph (dashed lines are also edges) is

Question 7
Let U be the set of all real numbers and A = {x | x is a solution of x2– 1 = 0} and B = {–1, 4}, compute .
Question 8
If there are four people A, B, C, D and four Jobs J1, J2, J3 and J4 having cost as shown in the table below. What will be the total minimum cost if Hungarian Optimization algorithm is used ?
| J1 | J2 | J3 | J4 | |
| A | 10 | 7 | 8 | 2 |
| B | 1 | 5 | 6 | 3 |
| C | 2 | 10 | 3 | 9 |
| D | 4 | 3 | 2 | 3 |
Question 9
Find the vertex of the feasible region at which the constraint lines x + y = 40 and 2x + y = 60 intersect for the given L.P. (Linear Programming),
Maximize Z = 8x + y
Constraints are x + y ≤ 40
2x + y ≤ 60
x ≥ 0, y ≥ 0
Question 10
Which of the following statement(s) is/are true with reference to Graph Theory ?
(a) A given connected graph G is an Euler graph if and only if all vertices of G are of even degree.
(b) A simple graph (i.e., a graph without parallel edges or self-loops) with n vertices and k components can have at most (n – k) (n – k + 1)/2 edges.
(c) If a graph (connected or disconnected) has exactly two vertices of odd degree, there must be a path joining these two vertices.
(d) A graph is a tree if and only if it is minimally connected.
Previous papers with Discrete Structures and Optimization questions
Rajasthan SET (RSET) practice pack
The practice pack for Rajasthan SET (RSET) is coming soon to LawMint.