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

main() { int a; a=++100; printf("%d",a); getch(); }

4 Answers  


for(i=0;i=printf("Hello");i++); printf("Hello"); how many times how will be printed?????????

8 Answers  


Why doesn't the code "int a = 1000, b = 1000; long int c = a * b;" work?

7 Answers  


how can i print "hello"

3 Answers  


What is s or c?

0 Answers  






What are reserved words?

0 Answers  


Write a program to check palindrome number in c programming?

0 Answers  


write a program that eliminates the value of mathematical constant e by using the formula e=1+1/1!+1/2!+1/3!+

1 Answers   Reliance,


Is fortran still used in 2018?

0 Answers  


What is the difference between array and pointer in c?

0 Answers  


What does c mean?

0 Answers  


What is header file in c?

0 Answers  


Categories