How should we write and execute a user define function using WinRunner.

2160

---

Name the largest indian deer?

1023

---

Share 2 high complexity and 2 low complexity test cases for a coke vending (ATM) machine.

1081

---

where is mailboxes in outlook?

9

---

In which file we can configuration in zend framework?

183

---

What are the major configuration management tools in devops ?

1

---

What is route53? what are the types of web hosting and the differences between them?

260

---

Suppose I created one object as virtual object? That object is applicable to that test? Or all the tests?

1011

---

What are the advantages of column based tables?

103

---

Name some companies that make use of django?

451

---

importance of computer?

1899

---

How do I create a rss link?

867

---

What are the different iis authentication modes in iis 5.0 and explain? Difference between basic and digest authentication modes?

1116

---

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 }

3194

---

You want to print the contents of an entire array. How would you do that?

980

---