What is the difference between bind parameter and lexical parameter?
Tuesday, August 30, 2011
Tuesday, August 23, 2011
Getting Error When trying to consume svc webservice from .net in Java
org.apache.axis2.AxisFault: The input stream for an incoming message is null.
Monday, August 22, 2011
We created a custom report using report builder and registered that as concurrent program in the application. While running the request, got the error in the log file 'Routine FDPREP cannot read the ../reports/US/sample_report.rep.'
Check if the file exists under correct product directory.
Check if the person who started the Concurrent Manager has read privil
Concurrent Manager encountered an error while running Oracle*Report for your concurrent request 10709213.
Review your concurrent request log and/or report output file for more detailed information.
Saturday, August 20, 2011
Friday, August 19, 2011
When querying for a code combination from GL Responsibility -> Setup-> Accounts -> Combinations window, we got the error APP-FND-00906
TDS Sections are not getting generated for a Vendor after Vendor Site and PAN details are given from Suppliers -> Additional Information window in R12.
Wednesday, August 17, 2011
Tuesday, August 16, 2011
Given 100 bulbs where all the bulbs are switched off.
In the 1st iteration you will toggle 1st,2nd,3rd .....100th bulbs
In the 2nd iteration you will toggle 2nd,4th,6th....
In the 3rd iteration you will toggle 3rd,6th,9th,12th so on
After the 100th iteration how many bulbs will be switched off and how many bulbs will be switched on.
Monday, August 15, 2011
Thursday, August 11, 2011
Wednesday, August 10, 2011
We got the error ' This combination is disabled.(ROUTINE=fdfvcc)' when we are creating AP invoice and entering accounting segments values.
Monday, August 8, 2011
Given a list of strings,each string represents a node in a binary tree and the string value will be its access path in the binary tree(eg: lr - goto the leftchild from the root and goto the right child from there o find the node). WAP to check if a valid binary tree can be formed from the list.
You are on a game show. There are 3 doors. Behind one of the doors, there is a great prize. Behind the other two doors, there is nothing. To win the prize, you must correctly guess which door it is behind and open that door. But wait ... there's more! After you guess, the host opens one of the doors and gives you a chance to change your mind.
Pay close attention to the following rules:
1. First, you choose one of the 3 doors.
2. After you make your choice, the game show host opens one of the other 2 doors.
3. The host is not allowed to open the door with the prize.
4. The host is not allowed to open the door, that you chose.
5. After the host opens a door, he gives you a chance to change your mind.
1. You choose door #1.
2. Host opens door #2, which is empty.
3. You may either stay with #1 or switch to #3.
What should you do? Does switching increase or decrease your chance of winning the prize? Does it even make a difference?