Answer Posted / satya

#include<conio.h>
main()
{ int i,j;
char *ptr="z";
clrscr();
for(i=1;i<=26;i++)
{
for(j=1;j<=i;j++)
{
printf("%s",ptr);
}
--(*ptr);
printf("\n");
}
getch();



}

Write a program to produce the following output: 1 2 3 4 5 6 7 8 9 10

15791

---

What are identifiers in c?

1188

---

Why use int main instead of void main?

1105

---

Can 'this' pointer by used in the constructor?

1080

---

What are the advantages of c preprocessor?

1241

---

What is the difference between specifying a constant variable like with constant keyword and #define it? i.e what is the difference between CONSTANT FLOAT A=1.25 and #define A 1.25

1966

---

How do you do dynamic memory allocation in C applications?

1071

---

What are control structures? What are the different types?

1075

---

How can I write data files which can be read on other machines with different word size, byte order, or floating point formats?

1015

---

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 }

3171

---

Why C language is a procedural language?

1007

---

What is operator precedence?

1183

---

What are the complete rules for header file searching?

1063

---

Is there a built-in function in C that can be used for sorting data?

1228

---

What is the use of volatile?

1071

---