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,

---

Name all parameters for virtual private networks. what are different metrics of virtual private networks

0 Answers  

---

What would happen if you drilled through the Earth all the way to the other side and then jumped into the hole?

0 Answers  

---

what is the difference between composite key and primary key in sap abap

0 Answers   Cap Gemini,

---

draw diagram of earthings

0 Answers   IBM,

---

What is The Need of Template?

0 Answers  

---

which of the following is not a storage class specifier in c?

1 Answers   Infosys,

---

I want the syllabus of Section Enginner(Signal & Telecom) of RRB Exam

0 Answers  

---

question no. 4======Give a brief description of the following terms: a) Play head b) Symbol c) Tweening d) ActionScript e) Frame rate f) Library panel g) Masking h) Context – sensitive Property Inspector i) Bandwidth Profiler j) Frame Label

0 Answers  

---

what is isolator

0 Answers  

---

Explain the concept of segmentaion.

0 Answers  

---

Why is not creat swap partition in my system.

0 Answers  

---