Flat 50% off on all training & certification courses. Limited time offer Explore courses

Use these filters to find papers

  Question
0

Three boys B1 , B2, B3, and four girls G1, G2, G3, G4 are such that i) B, is a cousin of G1, G3, G4

ii) B, is a cousin of G2 and G4 iii) B3 is a cousin of G2 and G3.

If boys must marry a cousin girl, find the possible sets of such couples.

This question has 0 answers so far.
0

Find and solve a recurrence relation for the number of binary sequences of length n 1 that have no consecutive O's. 

This question has 0 answers so far.
0

The number of virus affected files in a system is 1000 ( to start with) and this increases 250% every two hours. Using a recurrence relation determine the number of virus affected files in the system after one day.

This question has 0 answers so far.
0

Solve the recurrence relation.


This question has 0 answers so far.
0

Using exponential generating function, find the number of ways in which four of the letter sin the word ENGINE be arranged.

This question has 0 answers so far.
0

A bag contains a large number of red, green, white and black marbles, with atleast 24 of each colour. In how many ways can one select 24 of these marbles, so that there are even number of white marbles and atleast six black marbles.

This question has 0 answers so far.
0

Using the generating functions, find the number of i) non negative, and ii) positive, integer solutions of the equation X1+ X2 +X3 + x4 = 25. 

This question has 0 answers so far.
0

An apple, a banana, a mango, and an orange are to be distributed to four boys B1, B2, B3, B4. The boys B1 and B2 do not wish to have apple, the boy B; does not want banana or mango, and BA refuses orange. In how many ways the distribution can be made so that no boy is displeased? 

This question has 0 answers so far.
0

In how many ways can the integers 1, 2, 3, ... 10 be arranged in a line so that no even integer is in its natural place?

This question has 0 answers so far.
0

In how many ways can the 26 letters of the English alphabet be permuted so that none of the patterns CAR, DOG, PIN, and BYTE occurs?

This question has 0 answers so far.
0

State and prove the principle of Inclusion - Exclusion for n sets.

This question has 0 answers so far.
0

In how many ways can one distribute eight identical balls into four distinct containers so that i) no container is left empty? ii) the fourth container gets an odd number of balls? 

This question has 0 answers so far.
0

Find the co-efficient of

ii) a2b3c2d5 in the expansion of (a + 2b-30-20+5)16

This question has 0 answers so far.
0

Find the co-efficient of

i) x9y3 in the expansion of (2x - 3y)12 

This question has 0 answers so far.
0

In how many of these arrangements

A and G are adjacent?

All the vowels are adjacent? 

This question has 0 answers so far.
0

How many arrangements are there for all letters in the word SOCIOLOGICAL?

This question has 0 answers so far.
0

Define:

i) Complete Bipartite Graph

This question has 0 answers so far.
0

Using Prim's algorithm, find a minimal spanning tree for the weighted graph shown below.

  

This question has 0 answers so far.
0

Explain the steps in Dijkstra's shortest path algorithm.

This question has 0 answers so far.
0

Explain prefix codes. Obtain an optimal prefix code for the message MISSION SUCCESSFUL. Indicate the code for the message.

This question has 0 answers so far.
0

Define:

iii) Full Binary Tree.

This question has 0 answers so far.
0

Define:

ii) Rooted Tree and

This question has 0 answers so far.
0

Define:

i) Spanning Tree

This question has 0 answers so far.
0

Define Trees. Prove that a tree with n- vertices has n-1 edges.

This question has 0 answers so far.
0

Find the chromatic polynomial for the following graph. If 5 colors are available, in how many ways can the vertices of this graph be properly colored? 

                              

This question has 0 answers so far.
0

State and explain Kuratowski's theorem. Show that the graphs K5 and K3.3 are non-planar byre-drawing them. 

This question has 0 answers so far.
0

Prove that a connected planar graph G with n vertices and m (m-n2) regions in every one of its diagrams. 

This question has 0 answers so far.
0

Write a note on Konigsberg's seven Bridge problems.

This question has 0 answers so far.
0

Show that the following graph is isomorphic to Kuratowski's second Graph (K3.3)

                                            

This question has 0 answers so far.
0

For a graph with n vertices and m edges, if  is minimum and  is maximum of the degrees of vertices show that 

This question has 0 answers so far.
0

Define:

iii) Induced Subgraph.

This question has 0 answers so far.
0

Define:

ii) Regular Graph and

This question has 0 answers so far.