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,

---

Explain the properties of union. What is the size of a union variable

0 Answers  

---

Is c a great language, or what?

0 Answers  

---

What is a structural principle?

0 Answers  

---

1.write a program to merge the arrays 2.write efficient code for extracting unique elements from a sorted list of array?

3 Answers   Qualcomm,

---

What is the difference between a structure and a union?

2 Answers  

---

WAP to accept first name,middle name & last name of a student display its initials?

5 Answers   AITH, NIIT,

---

Go through this linked list concept.While traversing through the singly linked list sometimes the following code snippet "while(head != NULL)" is used and other times "while(head->link != NULL)"is used(Here head is the pointer pointing to the first node,node has two parts data part and link part).What is the difference between head != NULL and Head->link != NULL and in which situation are they used?

1 Answers   Oracle,

---

What are identifiers c?

0 Answers  

---

Explain output of printf("Hello World"-'A'+'B'); ?

0 Answers  

---

Diff between for loop and while loop?

2 Answers   TCS,

---

Write a program to print “hello world” without using semicolon?

0 Answers  

---