what is a pointer

4 Answers   Bank Of America, TCS,

---

Write a programe print the sum of series 0,1,2,.....10

7 Answers  

---

Find the second largest element in an array with minimum no of comparisons and give the minimum no of comparisons needed on an array of size N to do the same.

0 Answers   Amazon,

---

How to explain the final year project as a fresher please answer with sample project

0 Answers  

---

to get a line of text and count the number of vowels in it

3 Answers   Satyam,

---

Explain how can I pad a string to a known length?

0 Answers  

---

is forign key will be unique key any table or not?

2 Answers  

---

write a program in c language to print your bio-data on the screen by using functions.

6 Answers   College School Exams Tests, IBM,

---

How the processor registers can be used in C ?

7 Answers   HP,

---

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,

---

What is the difference between char array and char pointer?

0 Answers  

---

What is indirection?

0 Answers  

---