When do you say that a digraph is acyclic
A)if and only if its first search does not have back arcs
B)a digraph is acyclic if and only if its first search does
not have back vertices
C)if and only if its first search does not have same
dfnumber
D)None of these



When do you say that a digraph is acyclic A)if and only if its first search does not have back arcs..

Answer / liamsi422

i

Is This Answer Correct ?    1 Yes 1 No

Post New Answer

More C Interview Questions

why arguments can generally be passed to functions a) sending the values of the arguments b) sending the addresses of the arguments c) a & b d) none of the above

0 Answers  


can we have joblib in a proc ?

0 Answers  


can any one tel me wt is the question pattern for NIC exam

0 Answers   NIC,


what is a pointer

4 Answers   Bank Of America, TCS,


wat s the meaning of (int *)p +4;

2 Answers  






How does normalization of huge pointer works?

0 Answers  


Prove or disprove P!=NP.

5 Answers   Microsoft,


What are the 5 elements of structure?

0 Answers  


Describe the order of precedence with regards to operators in C.

0 Answers  


how many error occurs in C language ?

22 Answers   Infosys, Wipro,


Write a function expand(s1,s2) that expands shorthand notations like a-z in the string s1 into the equivalent complete list abc...xyz in s2 . Allow for letters of either case and digits, and be prepared to handle cases like a-b-c and a-z0-9 and -a-z. z-a:zyx......ba -1-6-:-123456- 1-9-1:123456789987654321 a-R-L:a-R...L a-b-c:abbc

0 Answers  


what is the role you expect in software industry?

0 Answers   HCL,


Categories