Golgappa.net | Golgappa.org | BagIndia.net | BodyIndia.Com | CabIndia.net | CarsBikes.net | CarsBikes.org | CashIndia.net | ConsumerIndia.net | CookingIndia.net | DataIndia.net | DealIndia.net | EmailIndia.net | FirstTablet.com | FirstTourist.com | ForsaleIndia.net | IndiaBody.Com | IndiaCab.net | IndiaCash.net | IndiaModel.net | KidForum.net | OfficeIndia.net | PaysIndia.com | RestaurantIndia.net | RestaurantsIndia.net | SaleForum.net | SellForum.net | SoldIndia.com | StarIndia.net | TomatoCab.com | TomatoCabs.com | TownIndia.com
Interested to Buy Any Domain ? << Click Here >> for more details...

Company Name Starts with ...
#  A  B  C  D  E   F  G  H  I  J   K  L  M  N  O   P  Q  R  S  T   U  V  W  X  Y  Z

Facebook C Interview Questions
Questions Answers Views Company eMail

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 }

3191

#include #include struct stu { int i; char j; }; union uni { int i; char j; }; void main() { int j,k; clrscr(); struct stu s; j=sizeof(s); printf("%d",j); union uni u; k=sizeof(u); printf("%d",k); getch(); } what is value of j and k.

2 6322

#‎include‬ void main() { int i; for(i=5;0;i++) { printf("%d",i); } }

2 4539

Post New Facebook C Interview Questions




Un-Answered Questions

Can you have multiple retained earnings a/c?

1053


What are independent graphics subsystems?

421


What are some secret sharing schemes ?

2387


What is race condition?

1083


What is the guid concept in crm. How is it used?

1084


What is transaction server auto commit?

1066


Can you explain completion handler?

813


Is mongodb publicly traded?

1


What is difference between table aliases and column aliases? Do they affect performance?

968


Explain the use of excitation table in digital electronics?

917


Is sql a backend?

1027


Suppose you have to plan a business meeting or a party for some clients. How will you go about the task?

1173


Assuming that a firm pays tax at a 50 per cent rate, compute the after tax cost of capital in the following cases: I. A 8.5 % preference share sold at par. II. A perpetual bond sold at par, coupon rate of interest being 7 per cent III. A ten year, 8 percent, Rs.1000 par bond sold at Rs.950 less 4 percent underwriting commission.

3580


What is gelatinization?

1619


2. Tell me about a time when you had to use your presentation skills to influence someone’s opinion.

2567