Answer Posted / saudip sen

choice d.

Reason:
The macro sign # is not applicable here.
Syntactical error!

What is conio h in c?

1000

---

Do variables need to be initialized?

989

---

How many identifiers are there in c?

961

---

A collection of functions,calls,subroutines or other data a) library b) header files c) set of files d) textfiles

1115

---

Why c language is called c?

947

---

write a program to rearrange the array such way that all even elements should come first and next come odd

2221

---

Can we add pointers together?

999

---

State the difference between x3 and x[3].

1051

---

What is the most efficient way to count the number of bits which are set in an integer?

1000

---

What is the use of static variable in c?

1043

---

What the advantages of using Unions?

1161

---

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 }

3126

---

What is the benefit of using an enum rather than a #define constant?

1170

---

Do you know what are bitwise shift operators in c programming?

1058

---

What is assert and when would I use it?

962

---