Answer Posted / sandeep

Check your question dude

What is a spanning Tree?

1092

---

Explain how do you declare an array that will hold more than 64kb of data?

1024

---

a sequence of bytes with one to one corrspondence to those in the external device a) sequential addressing b) address c) byte code d) none

845

---

What is a constant?

712

---

What are 'near' and 'far' pointers?

716

---

---

How can a process change an environment variable in its caller?

758

---

Write the Program to reverse a string using pointers.

706

---

What is pass by reference in c?

725

---

What is c language & why it is used?

670

---

You have given 2 array. You need to find whether they will create the same BST or not. For example: Array1:10 5 20 15 30 Array2:10 20 15 30 5 Result: True Array1:10 5 20 15 30 Array2:10 15 20 30 5 Result: False One Approach is Pretty Clear by creating BST O(nlogn) then checking two tree for identical O(N) overall O(nlogn) ..we need there exist O(N) Time & O(1) Space also without extra space .Algorithm ?? DevoCoder guest Posted 3 months ago # #define true 1 #define false 0 int check(int a1[],int a2[],int n1,int n2) { int i; //n1 size of array a1[] and n2 size of a2[] if(n1!=n2) return false; //n1 and n2 must be same for(i=0;ia1[i+1]) && (a2[i]>a2[i+1]) ) ) return false; } return true;//assumed that each array doesn't contain duplicate elements in themshelves }

2818

---

What is c standard library?

783

---

write a program to generate address labels using structures?

4139

---

Differentiate between declaring a variable and defining a variable?

707

---

When do you not use the keyword 'return' when defining a function a) Always b) Never c) When the function returns void d) dfd

737

---

How can I find out how much free space is available on disk?

717

---