Answer / jagrit kashyap

A spanning tree is a tree associated with a network. All the nodes of the graph appear on the tree once. A minimum spanning tree is a spanning tree organized so that the total edge weight between nodes is minimized.

What is indirection? How many levels of pointers can you have?

0 Answers   Aspire, Infogain,

---

HOW DO YOU HANDLE EXCEPTIONS IN C?

2 Answers   AppLabs,

---

What does 2n 4c mean?

0 Answers  

---

What is wrong with this initialization?

0 Answers  

---

a=(1,2,3); b=1,2,3; c=1,(2,3); d=(1,2),3; what's the value of 'a','b','c','d'

2 Answers  

---

how to add numbers without using arithmetic operators.

14 Answers   TCS,

---

How to write in a function declaration and in function call in which the function has 'n' number of varible or arguments?

2 Answers  

---

which of the following statements is incorrect a.typedef struct new{ int n1; char n2; } DATA; b.typedef struct { int n3; char *n4; }ICE; c.typedef union { int n5; float n6; } UDT; d.#typedef union { int n7; float n8; } TUDAT;

5 Answers   Assurgent, TCS,

---

Is swift based on c?

0 Answers  

---

what are brk, sbrk?

1 Answers   Oracle,

---

How can you draw circles in C?

0 Answers   Accenture,

---

What are the languages are portable and platform independent?Why they are like that?

1 Answers   Excel, Satyam,

---