Jammu & Kashmir and Ladakh SET (JKSET/LASET) Discrete Structures and Optimization Previous Year Questions
Try the preview and open any solution for a worked explanation.
Jammu & Kashmir and Ladakh SET (JKSET/LASET) practice pack
The practice pack for Jammu & Kashmir and Ladakh SET (JKSET/LASET) is coming soon to LawMint.
Question 1
If A is a finite set with n elements, then number of elements in the largest equivalence relation of A is __________.
Question 2
Every cut set of a connected Euler graph has __________.
Question 3
The number of integers between 1 and 250 that are not divisible by 2, 3, 5 or 7 is __________.
Question 4
Given below are two statements:
Statement I: A graph is planar if it can be drawn in a plane so that no edges cross.
Statement II: Every planar graph has at least one vertex of degree 5 or less than 5.
Question 5
The calculation of opportunity cost in the MODI method is analogous to a __________.
Question 6
If a non-redundant constraint is removed from an LP problem, then :
Question 7
How many different four-digit numbers greater than 5000 can be formed with the following digits - 0, 1, 2, 5, 9 if repetition is not allowed?
Question 8
Given below are two statements, one labelled as Assertion (a) and the other labelled as Reason (r).
Assertion (a): One disadvantage of using North-West Corner Rule to find initial solution to the transportation problem is that it does not take into account cost of transportation.
Reason (r) : A basic feasible solution to a transportation problem with m rows (supplies) and n columns (destinations) is non-degenerate if the number of positive allocations is m + n - 1.
Question 9
Match List-I and List-II:
| List-I (Rule of Inference in Logic ) | List-II (Symbolic Representation) |
| P. Modus Ponens | 1. ((p → q) ∧ (q → r)) → (p → r) |
| Q. Modus Tollens | 2. (¬p ∧ (p ∨ q)) → q |
| R. Disjunctive Syllogism | 3. (p ∧ (p → q)) → q |
| S. Hypothetical Syllogism | 4. (¬q ∧ (p → q)) → ¬p |
Question 10
Given below are two statements:
Statement I: A cyclic group is always an abelian group but every abelian group is not a cyclic group.
Statement II: An isomorphism can also be called automorphism if both domain and range are not equal.
Previous papers with Discrete Structures and Optimization questions
Jammu & Kashmir and Ladakh SET (JKSET/LASET) practice pack
The practice pack for Jammu & Kashmir and Ladakh SET (JKSET/LASET) is coming soon to LawMint.