Answer Posted / gajendra

1

What is a shell structure examples?

1101

---

What is a stream?

1135

---

How arrays can be passed to a user defined function

1022

---

What is calloc()?

1071

---

which of the following is allowed in a "C" arithematic instruction a) [] b) {} c) () d) none of the above

1723

---

Explain how do you list a file’s date and time?

1038

---

illustrate the use of address operator and dereferencing operator with the help of a program guys plzzz help for this question

2074

---

What is mean by data types in c?

1031

---

Is it possible to execute code even after the program exits the main() function?

1342

---

What is the difference between pure virtual function and virtual function?

1122

---

Can we increase size of array in c?

969

---

Can you return null in c?

1167

---

Why isnt there a numbered, multi-level break statement to break out

1046

---

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 }

3187

---

Is stack a keyword in c?

1080

---