1.      Find the recurrence relation for the number of ways to tile 2×n chessboard

1.      Find the recurrence relation for number of n-length words using a, b, c letters that can be transmitted where no word having two consecutive a’s.

1.      Find a recurrence relation for maximum number of regions defined using n lines in a plane.

1.      Find a recurrence relation for the number of bit sequences of length n with an even number of 0s.

1.      

1.      Find a recurrence relation for the number of bit strings of length n that contain the string 01.

1.      Which of the following conditions need to be satisfied for a graph K_m,n to be regular.

1.      For which value of n the graph W_n is regular.

1.      Which is not correct application for n-cubes.

1.      Which of the following graphs can not be considered as bipartite.

1.      Which of the following graph does not exist.