Answer Posted / dfda

because iam so smart.

When is the “void” keyword used in a function?

1586

---

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

1552

---

Hai what is the different types of versions and their differences

1983

---

What would happen to X in this expression: X += 15; (assuming the value of X is 5)

2028

---

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 }

3245

---

Where static variables are stored in c?

1174

---

Explain what are bus errors, memory faults, and core dumps?

1319

---

What is nested structure?

1103

---

What is the significance of c program algorithms?

1199

---

What does %d do in c?

1014

---

Explain how can I remove the trailing spaces from a string?

1108

---

Is this program statement valid? INT = 10.50;

1235

---

Write a C program to count the number of email on text

1973

---

what is the different bitween abap and abap-hr?

2431

---

What is signed and unsigned?

1128

---