application attempts to perform an operation?

0 Answers  

---

What is a volatile keyword in c?

0 Answers  

---

Explain bit masking in c?

0 Answers  

---

why return type of main is not necessary in linux

0 Answers   TCS,

---

What is a MAC Address?

0 Answers  

---

A variable that is defined in a specified portion of a program but can be used throughout the program a) global variable b) local variable c) character d) none

0 Answers  

---

Which driver is a pure java driver

0 Answers   Vertex,

---

Table of Sudoku n*n

0 Answers  

---

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;i<n1-1;i++) { if( !( (a1[i]>a1[i+1]) && (a2[i]>a2[i+1]) ) ) return false; } return true;//assumed that each array doesn't contain duplicate elements in themshelves }

0 Answers   Facebook,

---

write a program to find the largest and second largest integer from an array

2 Answers   Value Labs,

---

Write a program to print fibonacci series without using recursion?

0 Answers  

---

What is meant by high-order and low-order bytes?

0 Answers  

---