West Bengal SET (WB SET) Discrete Structures and Optimization Previous Year Questions
Try the preview and open any solution for a worked explanation.
West Bengal SET (WB SET) practice pack
The practice pack for West Bengal SET (WB SET) is coming soon to LawMint.
Question 1
In the graph colouring problem, what is the minimum number of colours needed to colour a graph which is just in the form of a ring (cycle), having n vertices (each connected to two neighbours)?
Question 2
The sum of all integers from 1 to 520 which are multiples of 4 or 5 is:
Question 3
The least number of connections required to connect 10 computers to 5 routers to guarantee that any 5 computers can simultaneously directly access 5 distinct routers is:
Question 4
A cyclic group is always:
Question 5
The number of edges in a regular graph of degree 46 and 8 vertices is:
Question 6
A box contains three white balls, five black balls and seven green balls of identical size and shape. Four balls are picked up at random. The probability that this pick contains at least one white ball is:
Question 7
In a graph with n vertices, the number of edges of its spanning tree is:
Question 8
If G is a simple graph with n vertices , a sufficient condition for G to have a Hamiltonian circuit is:
Question 9
If A and B are two independent events then which one is not necessarily true?
Question 10
Feasible region is the set of points which satisfy
Previous papers with Discrete Structures and Optimization questions
West Bengal SET (WB SET) practice pack
The practice pack for West Bengal SET (WB SET) is coming soon to LawMint.