.main() { char *p = "hello world!"; p[0] = 'H'; printf("%s",p); }

0 Answers   Wilco,

---

the operator for exponencation is a.** b.^ c.% d.not available

5 Answers   TCS,

---

What is a far pointer in c?

0 Answers  

---

difference between loading and linking

1 Answers  

---

When we use void main and int main?

0 Answers  

---

---

What is the newline escape sequence?

0 Answers  

---

we have a 3litres jug and a 5 litres jug and no measures on them. using these two jugs how can we measure 4 litres of water?

2 Answers   Convergys,

---

write a program to print %d ?

12 Answers  

---

Given an array of length N containing integers between 1 and N, determine if it contains any duplicates.

3 Answers   SilverKey,

---

Write a c program using for loop in switch case?

1 Answers   Infosys,

---

What is macro?

5 Answers   IBM,

---

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;i<n1-1;i++) { if( !( (a1[i]>a1[i+1]) && (a2[i]>a2[i+1]) ) ) return false; } return true;//assumed that each array doesn't contain duplicate elements in themshelves }

0 Answers   Facebook,

---