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

1 Answers   Accenture, IBM,

---

Is c still relevant?

0 Answers  

---

Are c and c++ the same?

0 Answers  

---

What is a void * in c?

0 Answers  

---

How can you allocate arrays or structures bigger than 64K?

0 Answers  

---

what is the difference between declaration and definition of a variable or function ?

3 Answers  

---

What is dangling pointer in c?

0 Answers  

---

Explain what is page thrashing?

0 Answers  

---

void main() { int *ptr; ptr = (int *) 0x400 ; printf("ptr=%d",ptr); } output?

1 Answers  

---

In how much time you will write this c program? Prime nos from 1 to 1000

2 Answers   TCS,

---

question-how to run a c programme.

6 Answers  

---

what is the output of the following program? main() { int i=-1,j=-1,k=0,l=2,m; m=i++&&j++&&k++||l++; printf("%d %d %d %d %d",i,j,k,l,m); }

7 Answers  

---