T is a tree and V is a vertex of T of maximum degree in T, say the degree of V in n. Prove that T has atleast n vertices of degree 1.

0 Answers   TCS,

---

in single linked list , each node contains data and address of next node. if middle of list the node is damaged/crashed then how to find where the link is failed and how to get the all the data which is stored after the crashed node?

0 Answers  

---

why dijkstra algorithm not used for negative weighted edges graph??

0 Answers  

---

defference between menu and context menu in vb.net?

0 Answers  

---

is the density of water decreases if we go deep into the ocean?

1 Answers  

---

i have passed my gRaduation in BCA and now im looking for post graduation from Germany, i haver passed my ielts wth 6 band, nw plz tell me some question that wll ambessay ask

0 Answers  

---

plz send me how to overhauling of freon bitzer semi receprocal comprassors with available video

0 Answers  

---

performance test required for a automatic bank teller?

0 Answers  

---

How to recyling of Expired Computer/Laptop,Mouse,CPU & Key Board (Warranty)?

0 Answers  

---

hi friends i am b-tech in computer science having interview of State bank of india clerk day on 30 th april. I want to know the answer of question:"you r B.tech in C.S. why do u want to become a bank clerk?" please help.Its my humble request.

0 Answers   State Bank Of India SBI,

---

tell me one scenario where we go for idoc and WHy we go for idoc.

0 Answers   HCL,

---

postfix expression for x^y^z-m+n+p/q ?

0 Answers   Cognizant,

---