LawMint Sign in

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)?

Select one answer

Question 2

The sum of all integers from 1 to 520 which are multiples of 4 or 5 is:

Select one answer

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:

Select one answer

Question 4

A cyclic group is always:

Select one answer

Question 5

The number of edges in a regular graph of degree 46 and 8 vertices is:

Select one answer

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:

Select one answer

Question 7

In a graph with n vertices, the number of edges of its spanning tree is:

Select one answer

Question 8

If G is a simple graph with n vertices (n≥3) (n \ge 3) , a sufficient condition for G to have a Hamiltonian circuit is:

Select one answer

Question 9

If A and B are two independent events then which one is not necessarily true?

Select one answer

Question 10

Feasible region is the set of points which satisfy

Select one answer

Continue practising

The practice pack for West Bengal SET (WB SET) is coming soon to LawMint.

West Bengal SET (WB SET) practice pack

The practice pack for West Bengal SET (WB SET) is coming soon to LawMint.