In which branch of mathematics should I specialise if I want to make a career in materials management?

1075

---

I have some query regarding Report generation from Oracle Apps "PO module". I have to generate a report where table columns are as below: Vendor_name Invoice No PO Number Item_Quantity Value of Goods Date of Shipping Name_of_the_transport Date_of_receipt_issued. Now my questions is :from which table/column I can get the information of "Name_of_the_transport" column. Thanks in advance.

2886

---

How to track the requirement from bugzilla tools? As our project requirement are changing frequestly and all are tracked in bugzilla tool. How to manage all as all project having short term duration. Please reply back ASAP? Thanks in advanced?

1821

---

What device installed in the F.O. system when excess oil return to drain tank?

1450

---

Difference interview pre-image vs post image in plug-ins.

336

---

---

I want to Use Motorola Canopy 5.4 GHZ System for wireless Internt , i need how setup this network , i need step by step guide , Also i need what Hard i need for in such setup .

1706

---

what is auto increment? : Sql dba

569

---

what is dbcc? : Sql server database administration

519

---

Do all vascular plants develop annual rings?

544

---

How does the system calculate the activity price? : co- cost center accounting

596

---

How do you use the choose function in excel?

308

---

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 }

2710

---

What is grep used for in perl?

527

---

List out the dis-advantages of scrum?

5

---

What is the company's social media strategy? - Venture Capitalists

958

---