3. 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


No Answer is Posted For this Question
Be the First to Post Answer

Post New Answer

More C Interview Questions

Write a program to find factorial of a number using recursive function.

0 Answers   Global Logic, TCS,


Write a program to swap two numbers without using third variable?

0 Answers  


What language is windows 1.0 written?

0 Answers  


What is a Genralised LInked List?? Please give a detailed explation of it..

1 Answers  


What are run-time errors?

0 Answers  






How can I delete a file?

0 Answers  


how to write hello word without using semicolon at the end?

6 Answers   Accenture,


what will be the output of this program........ main() { int a=2,b=4,c=6; printf("%d"); } why it gives the value of third variable.

6 Answers   HCL,


what is the c.

3 Answers   IBM, TCS,


What are structure members?

0 Answers  


write a pgm to print 1 1 2 1 1 2 3 2 1 1 2 3 4 3 2 1

3 Answers  


Explain what’s a signal? Explain what do I use signals for?

0 Answers  


Categories