Register

NIELIT Scientific Assistant A 2020 November: 19

• recategorized by
1,031 views

2 Answers

3 votes
3 votes
Just trying to answer logically.
If you consider first node from A, there are 4 possible ways to reach B. So from A there are 4 nodes at level 1, which means total number of ways to reach B is 16.
User Avatar
1 votes
1 votes
From A $\rightarrow$ Level 1, we have 4 edges.

From Level 1 $\rightarrow$ Level 2, we can choose between 2 edges.

From Level 2 $\rightarrow$ Level 3, every vertex has 2 edges.

Applying Product Rule : $4\times 2\times 2 = 16$
User Avatar
Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
1 answer
1
gatecse asked Dec 9, 2020
418 views
NIELIT Scientific Assistant A 2020 November: 96
In an undirected graph, if we add the degrees of all vertices, it is: odd even cannot be determined always $n+1,$ where $n$ is number of nodes
In an undirected graph, if we add the degrees of all vertices, it is:oddevencannot be determinedalways $n+1,$ where $n$ is number of nodes
User Avatar
1 votes
1 votes
1 answer
2
gatecse asked Dec 9, 2020
591 views
NIELIT Scientific Assistant A 2020 November: 21
Ramesh’s father is a paediatrician. Ram’s father is a trader. Krishan’s father is a school teacher. Krishan falls ill. Where should his father take him? to home to school to Ramesh’s father to Ram’s father
Ramesh’s father is a paediatrician. Ram’s father is a trader. Krishan’s father is a school teacher. Krishan falls ill. Where should his father take him?to hometo sc...
User Avatar
4 votes
4 votes
1 answer
4
gatecse asked Dec 9, 2020
673 views
NIELIT Scientific Assistant A 2020 November: 23
Find the missing number. $14$ $10$ $9$ $3$
Find the missing number.$14$$10$$9$$3$
User Avatar
Link Copied!