Answer / karthik

log(n) is depth of binary tree containing n-elements..
so if we split array into two and omit one part and consider
another part... and continue this process.....
in problems like this the complexity will be log(n)..

Is the below things valid & where it will be stored in memory layout ? static const volatile int i; register struct { } ; static register;

2 Answers   Lucent,

---

1.What is a Data Structure? Explain its need? 2.What is a Directed Graph? Write an algorithm to find whether a Directed Graph is connected or not? 3.Explain the process of converting a Tree to a Binary Tree.

4 Answers   Ignou, TCS,

---

What is the use of #include in c?

0 Answers  

---

WHOT IS CHAR?

4 Answers   TCS,

---

What is variable initialization and why is it important?

0 Answers  

---

Is it possible to use curly brackets ({}) to enclose single line code in c program?

0 Answers  

---

What is methods in c?

0 Answers  

---

12344321 123 321 12 21 1 1 how i print this program??

5 Answers   DSR Management, Winit,

---

What are the advantage of c language?

0 Answers  

---

What is include directive in c?

0 Answers  

---

The C language terminator is a.semicolon b.colon c.period d.exclamation mark

6 Answers   TCS,

---

Differentiate between new and malloc(), delete and free() ?

0 Answers   iNautix,

---