Answer Posted / sudeep reddy

function pointers can be used to replace switch/if
statements,to realize late binding(virtual function tables)
or to implement callback function primitives.

Explain how can a program be made to print the name of a source file where an error occurs?

693

---

What is null pointer constant?

597

---

What is the c value paradox and how is it explained?

577

---

What is the difference between ++a and a++?

699

---

What are qualifiers in c?

574

---

---

Where can I get an ansi-compatible lint?

645

---

How can I do serial ("comm") port I/O?

693

---

How does selection sort work in c?

627

---

Are the variables argc and argv are always local to main?

576

---

When should the const modifier be used?

660

---

5 Write an Algorithm to find the maximum and minimum items in a set of ‘n’ element.

1584

---

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 }

2718

---

Can we replace the struct function in tree syntax with a union?

784

---

why return type of main is not necessary in linux

1708

---

a c code by using memory allocation for add ,multiply of sprase matrixes

2306

---