Register

Ace testseries

• retagged by
237 views

1 Answer

1 votes
1 votes
I think option C is correct

Option A   is given as

                        Discovery time                        Finishing time

P                           1                                             6

Q                           2                                             5

R                           3                                             4

S                           8                                            10

Here P discover first at time 1 unit , then Q at 2 unit and R at 3 unit

PQR will finish before discovering S hence this is only possible if PQR belongs to same connected Let say C1 component and S belong to other connected component Let say C2  of Graph .

 

Option B

 

                        Discovery time                        Finishing time

P                             6                                            7

Q                           2                                             5

R                           3                                             4

S                           8                                            9

Again just same scenario like above with one change Q will discover first at 2 unit of time , Here PQR finish completely before discovery of S.

Option C  

                        Discovery time                        Finishing time

P                             4                                            5

Q                           2                                             8

R                           1                                             7

S                           3                                            6

Here R discover first then Q then S and while discovering of P atleast  one of (RQS)  is not finished which give idea that PQRS are  connected.
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

2 votes
2 votes
1 answer
1
CKgurav asked Feb 1, 2016
827 views
Ace Test Series: Algorithms - Graph Algorithms
User Avatar
1 votes
1 votes
1 answer
2
KISHALAY DAS asked Dec 25, 2016
726 views
ACE-TestSeries:-Algorithm Time Complexity
Determine the time complexity of the program segment given below: k = n; while ( k > 0) { i = 1; for(j = 1; j <= n; j+=i) i++; k/=2; } $\Theta\left(n^2\right)$ $\Theta(n \log n)$ $\Theta(\log^2 n)$ $\Theta\left(\log n \sqrt n\right)$
Determine the time complexity of the program segment given below:k = n; while ( k 0) { i = 1; for(j = 1; j <= n; j+=i) i++; k/=2; }$\Theta\left(n^2\right)$$\Theta(n \log...
User Avatar
0 votes
0 votes
1 answer
3
Shubhanshu asked Mar 13, 2017
320 views
ME Testseries
how many of the above statements are true?
how many of the above statements are true?
User Avatar
2 votes
2 votes
1 answer
4
rasto mapp asked Jan 20, 2018
247 views
ace testseries
User Avatar
Link Copied!