Answer Posted / tejraj

51

Distinguish between actual and formal arguments.

587

---

What is size of union in c?

578

---

What are the rules for the identifier?

667

---

What is the best way to store flag values in a program?

576

---

What is this infamous null pointer, anyway?

605

---

---

What is a keyword?

740

---

Is there any demerits of using pointer?

621

---

Can I use base-2 constants (something like 0b101010)? Is there a printf format for binary?

569

---

Write a program for Overriding.

677

---

What is the difference between union and structure in c?

567

---

Explain how do you convert strings to numbers in c?

591

---

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 }

2709

---

What is string function c?

561

---

What is a pointer variable in c language?

641

---

what is recursion in C

605

---