Answer Posted / savitha

c++ is object oriented programming language... it has special functions such as class, polymorphism ,inheritance ,encapsulation , data abstraction...hence we can develop programs which relates to objects makes us easy to understand

Combinations of fibanocci prime series

1666

---

I have written a pro*C program to fetch data from the cursor. where in i have used the concept of BULK FETCH.... each FETCH statement is taking lots of time to fetch specified number of rows at...

10244

---

List out few of the applications that make use of Multilinked Structures?

2257

---

What is scanf () in c?

1169

---

How can I recover the file name given an open stream or file descriptor?

1134

---

Is null always equal to 0(zero)?

1094

---

main(){char *str;scanf("%s",str);printf("%s",str); }The error in the above program is: a) Variable 'str' is not initialised b) Format control for a string is not %s c) Parameter to scanf is passed by value. It should be an address d) none

1410

---

What is pointer to pointer in c language?

1207

---

What is the size of enum in bytes?

1134

---

What is sizeof in c?

1049

---

What is 'bus error'?

1207

---

Given an array of 1s and 0s arrange the 1s together and 0s together in a single scan of the array. Optimize the boundary conditions?

1549

---

how to construct a simulator keeping the logical boolean gates in c

2301

---

How do you print only part of a string?

1065

---

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 }

3231

---