Golgappa.net | Golgappa.org | BagIndia.net | BodyIndia.Com | CabIndia.net | CarsBikes.net | CarsBikes.org | CashIndia.net | ConsumerIndia.net | CookingIndia.net | DataIndia.net | DealIndia.net | EmailIndia.net | FirstTablet.com | FirstTourist.com | ForsaleIndia.net | IndiaBody.Com | IndiaCab.net | IndiaCash.net | IndiaModel.net | KidForum.net | OfficeIndia.net | PaysIndia.com | RestaurantIndia.net | RestaurantsIndia.net | SaleForum.net | SellForum.net | SoldIndia.com | StarIndia.net | TomatoCab.com | TomatoCabs.com | TownIndia.com
Interested to Buy Any Domain ? << Click Here >> for more details...


Let the G be a graph with 100 vertices numbered 1 to 100
Two vertices i and j are adjecnt if | i-j| =8 or | i-j|
=12. The Number of connected components in G is ?

Answers were Sorted based on User's Feedback



Let the G be a graph with 100 vertices numbered 1 to 100 Two vertices i and j are adjecnt if | i-j..

Answer / rakesh

4

Is This Answer Correct ?    20 Yes 7 No

Let the G be a graph with 100 vertices numbered 1 to 100 Two vertices i and j are adjecnt if | i-j..

Answer / yogesh

as i-j=8 is connected that means
a) 1,9,17,25....are connected
b) 2,10,18.26... are connected
.
.
e) 5,13,19,27.. are connected
.
.

h) 8,16,24,32 .. are connected

|i-j| = 12 are connected
that means
t)1,13,25,27 are conncted
y)2,14,26,38 are connected
u)3,15,27,
i)4,16,28...

obv because of t, even a and e are connected.
so only four series left i.e. a,b,c,d
a and b can never be connected because of odd numbers can
never be connected to even numbers in both the series.
so only possibity left is whether a and u or b and i can
be connected .
lets see a and u
a start with 1 and increments by 8
u starts with 3 and inctements by 12
this can match somewhere only if
for any value of m and n following is true
3+12*m = 1+8*n => 1+6*m = 4*n which can never be true

hence maximum number of connecte elements is 4.

Is This Answer Correct ?    6 Yes 4 No

Let the G be a graph with 100 vertices numbered 1 to 100 Two vertices i and j are adjecnt if | i-j..

Answer / sam

how u get answer 4?

Is This Answer Correct ?    2 Yes 2 No

Let the G be a graph with 100 vertices numbered 1 to 100 Two vertices i and j are adjecnt if | i-j..

Answer / achintya singhal

good question
there are 4 connected components..
first contains vertices numbered 1, 5, 9,13,17,21,25,29....
second contains 2, 6, 10, 14, 18.......
third one contains 3, 7, 11, 15......
fourth contains 4, 8, 12, 16, 20.......

Is This Answer Correct ?    5 Yes 6 No

Post New Answer

More Data Structures Interview Questions

Write a Program for Linked list manipulation.

0 Answers  


How do you find a string is anagram or not?

0 Answers  


Can tuple be sorted?

0 Answers  


State the merit of linked representation of binary trees?

0 Answers  


Difference between arraylist and linkedlist?

0 Answers  


What is the main advantage of a linked list?

0 Answers  


Can we store null in arraylist?

0 Answers  


What is data structure and its operations?

0 Answers  


Explain the expression trees?

0 Answers  


How do you implement a stack?

0 Answers  


Define primary clustering?

0 Answers  


Which is faster hashmap or linkedhashmap?

0 Answers  


Categories