Answer Posted / ramanathan

ANSI = American National Standard Code for Information
Interchange

ISO = International standard Organization

Is c high or low level?

1055

---

What is the incorrect operator form following list(== , <> , >= , <=) and what is the reason for the answer?

1548

---

A text file that contains declarations used by a group of functions,programs,or users a) executable file b) header file c) obj file d) .cfile

1154

---

What is NULL pointer?

1144

---

What are 'near' and 'far' pointers?

1093

---

What's the difference between constant char *p and char * constant p?

1193

---

What is nested structure in c?

1119

---

What is putchar() function?

1222

---

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 }

3242

---

process by which one bit patten in to another by bit wise operation is? (a) masking, (b) pruning, (c) biting, (d) chopping,

2474

---

can any one please explain, how can i access hard disk(physical address)? it is possible by the use of far,near or huge pointer? if yes then please explain......

1971

---

What does dm mean sexually?

1386

---

What are qualifiers in c?

1090

---

Should I use symbolic names like true and false for boolean constants, or plain 1 and 0?

1130

---

What math functions are available for integers? For floating point?

1185

---