Answer Posted / thavamoorthi

c does not support the method overloading it supported only by object oriented

How can I delete a file?

812

---

What are the three constants used in c?

727

---

Is c dynamically typed?

869

---

When is a void pointer used?

877

---

WHAT IS THE DEFINATION OF IN TECHNOLOGY AND OFF TECHNOLOGY ?

2080

---

Write a program to print numbers from 1 to 100 without using loop in c?

846

---

What is indirection?

833

---

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 }

2930

---

Why do we use null pointer?

782

---

The performance of an operation in several steps with each step using the output of the preceding step a) recursion b) search c) call by value d) call by reference

910

---

Why structure is used in c?

803

---

I heard that you have to include stdio.h before calling printf. Why?

802

---

Write a program to identify if a given binary tree is balanced or not.

897

---

Combinations of fibanocci prime series

1336

---

What is the difference between text files and binary files?

930

---