Answer Posted / prasenjit banik

#include<iostream.h>
#include<conio.h>
void main()
{
int n,fact;
int rec(int); clrscr();
cout<<"Enter the number:->";
cin>>n;
fact=rec(n);
cout<<endl<<"Factorial Result are:: "<<fact<<endl;
getch();
}
rec(int x)
{
int f;
if(x==1)
return(x);
else
{
f=x*rec(x-1);
return(f);
}
}

What do you mean by recursion in c?

1104

---

#define MAX(x,y) (x) >(y)?(x):(y) main() { inti=10,j=5,k=0; k= MAX(i++,++j); printf("%d..%d..%d",i,j,k); }

1152

---

What is the concatenation operator?

1147

---

Write the program that calculates and prints the average of several integers. Assume that the last value read is sentinel 9999.

3683

---

How can variables be characterized?

2184

---

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 }

3184

---

Explain built-in function?

1132

---

Explain how can I open a file so that other programs can update it at the same time?

1108

---

How do you list files in a directory?

1139

---

please explain clearly about execution of c program in detail,in which stage are the printf sacnf getting into exeecutable code

2174

---

Why do we use main function?

1173

---

What is exit() function?

1012

---

find the value of y y = 1.5x+3 for x<=2 y = 2x+5 for x>2

1988

---

How do you determine a file’s attributes?

1078

---

Describe the order of precedence with regards to operators in C.

1047

---