Answer Posted / amegha

main()
{
if(printf("AMEGHA")
{
}
}

What are categories used for in c?

1100

---

write a program to rearrange the array such way that all even elements should come first and next come odd

2279

---

any limit on the number of functions that might be present in a C program a) max 35 functions b) max 50 functions c) no limit d) none of the above

1052

---

Why main function is special give two reasons?

1546

---

write a program to display all prime numbers

1972

---

What is wrong with this program statement?

1042

---

What are the advantages of external class?

1071

---

What is #pragma statements?

1102

---

What is meant by inheritance?

1090

---

how many types of operators are include in c language a) 4 b) 6 c) 8 d) 12

1089

---

Why is c called a structured programming language?

1282

---

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 }

3189

---

What is 1f in c?

2664

---

Write a program to print factorial of given number without using recursion?

996

---

What is malloc() function?

1165

---