Answer / om

struct tree //creating structure

{

int data; //data field of node

struct tree *lchild,*rchild;//left child & right child of node

};


//for depth calculation

int depth(struct tree *p)

{

int l,r;

if(p!=NULL)

{

l=depth(p->lchild);

r=depth(p->rchild);

return (1+((l>r)?l:r));

}

return -1;

}

Answer / crispin

/*
* Simple tree node representation
*/
struct node_t {
struct node_t *left;
struct note_t *right;
};

/*
* Return the maximum depth of the tree given a pointer
* to its root node.
*/
unsigned int
tree_depth (node_t *root)
{
return (NULL == root) ? 0 :
MAX(tree_depth(root->left, root->right)+1);
}

Would you rather wait for the results of a quicksort, a linear search, or a bubble sort on a 200000 element array? 1) Quicksort 2) Linear Search 3) Bubble Sort

3 Answers  

---

explain what is an endless loop?

0 Answers  

---

int j =15,i; for (i=1; 1<5; ++i) {printf ("%d%d ",j,i); j = j-3; }

2 Answers  

---

What is the use of getch ()?

0 Answers  

---

write an algorithm to get a sentence and reverse it in the following format: input : I am here opuput: Here Am I note: first letter of every word is capiatlised

3 Answers  

---

#include <stdio.h> int main() { int i; for (i=0;i<3;++i) { fork();fork(); } } How many processes are created when running this program (including the initial one)? Explain &#1567;&#1567;&#1567;

4 Answers  

---

The % symbol has a special use in a printf statement. How would you place this character as part of the output on the screen?

0 Answers  

---

How to avoid buffer overflow?

1 Answers  

---

difference between Low, Middle, High Level languages in c ?

0 Answers   Bosch, Infosys,

---

what is the output of below int n=10; (n++)++; printf("%d",n);

3 Answers  

---

What is new line escape sequence?

0 Answers  

---

How will you allocate memory to a double pointer ?

2 Answers  

---