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 ?
- 4 Answers
- 13891 Views
- I also Faced
- E-Mail Answers
Answer Posted / 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 View All Answers
Explain quick sort and merge sort algorithms.
What is top in stack?
Define a path in a tree?
Define data type and what are the types of data type?
What do you mean by tree edge?
Write any two principles of gradation of structures.
Can we null keys in treemap?
Is sorting a math skill?
How would you implement two stacks using a single array?
How does insertion sort works?
Explain pre-order and in-order tree traversal.
Which is better hashset or treeset?
How to compare Two Arrays?
Evaluate the following prefix expression " ++ 26 + - 1324" (Similar types can be asked)
Is heap sort adaptive?
