Answer Posted / guest

friend

The performance of an operation in several steps with each step using the output of the preceding step a) recursion b) search c) call by value d) call by reference

1164

---

In c programming, explain how do you insert quote characters (? And ?) Into the output screen?

1196

---

Why should I use standard library functions instead of writing my own?

1204

---

Can we use any name in place of argv and argc as command line arguments?

1009

---

Explain heap and queue.

1007

---

What is the explanation for modular programming?

1141

---

What is call by reference in functions?

1316

---

What is the default value of local and global variables in c?

981

---

What is size of union in c?

974

---

Explain continue keyword in c

959

---

Does c have class?

1049

---

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

---

Explain how do you print only part of a string?

1157

---

What is the role of this pointer?

989

---

How can I make it pause before closing the program output window?

989

---