define the term filter actions

200

---

What is the tensile strength of marble?

653

---

What is database isolation in sql server? : sql server database administration

570

---

How can you SORT an already partitioned (round-robin) data ? How to use in abinitio graph? 3. How internally partition by key decides which key to send in which partition ? How to use in abinitio graph? 4. What is PDL ? Give him a shell type parameter and ask him to convert it to PDL. How to use in abinitio graph? 5. As shell type parameters are not supported by EME, then how you can use shell type parameter (If you don't want to use PDL) without hampering lineage diagram ? How to use in abinitio graph? 6.How you can generate dml from a COBOL copy book ? How to use in abinitio graph? 7. How you can convert from ebcdic to packed decimal ? How to use in abinitio graph?

3899

---

Define pattern markings?

1

---

---

How to disiegn DCV circuit ?

2260

---

Suppose you run a report with empty data, how will you inform the end user that it has no data while running the report in report studio? Is it possible, if so how?

560

---

When will we go for BPM?

267

---

Kindly post me previous year interview questions with answer for post of Manager (civil engg.) for NTPC, IOC , GAIL etc. I have interview on july 2013.I will be very grateful to you. Please guide me.

1796

---

Can I use exchange 5.5s owa to access a mailbox on an exchange 2003 server?

550

---

Explain binary searching and Fibinocci search?

565

---

What is the dipole moment direction for methanol?

647

---

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 }

2718

---

What is the purpose of the pythonpath environment variable?

484

---

What is meaning of 'readonly' keyword?

503

---