Answer Posted / manojkumar challagundla

#include<stdio.h>
#include<conio.h>
void main()
{
int i,j;
int ctr=1;
for(i=1;i<=4;i++)
{
printf("\n")
for(j=1;j<=i;j++)
{
printf("%d",ctr);
ctr++;
}
}
}

Write a program to print fibonacci series using recursion?

1131

---

What is volatile c?

1088

---

What are the advantages and disadvantages of a heap?

1258

---

What is the use of bitwise operator?

1173

---

Why we use conio h in c?

1301

---

write a c program thal will find all sequences of length N that produce the sum is Zero, print all possible solutions?

2924

---

how should functions be apportioned among source files?

1165

---

What is the difference between exit() and _exit() function?

1101

---

Do pointers take up memory?

1207

---

Why c is a procedural language?

1129

---

What do you understand by normalization of pointers?

1101

---

When we use void main and int main?

1128

---

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 }

3237

---

Here is a neat trick for checking whether two strings are equal

1073

---

I need a sort of an approximate strcmp routine?

1079

---