Professional Documents
Culture Documents
Hi
Oracle has conducted online aptitude exam on 30 of July in JNTU college of Engineering
ANANTAPUR, KAKINADA, HYDERABAD.
Only students who have greater (>70%) are eligible for the Aptitude exam:
1) Which of the following requries a recursive solution (or equavalent use of the stack).
A) Factorial function
B) Lookup in a sorted binary tree
1) JUST 1 2) JUST 2 3) BOTH 4) NEITHER
3) Program uses a stack to visit each of the nodes of a binary tree starting at its root after a
node is visited its children are added to stack in what order do the node of the tree in the
followin diag:
http://www.placement-world.com/placement-papers/oracle/ORACLE-PAPER-30-JUL-200... 8/29/2008
» Print ORACLE PAPER - 30 JUL 2008 - ANDHRA PRADESH | Placement World Page 2 of 3
GLOBLAL N=0;
FUNCTION FOREACH(COL,F)
LOCAL N =20;
FOR EACH ELT IN COLL CO DO F(ELT)
FUNCTION FN1(COL);LOCAL N=30
FUNCTION FN2(NUMBER);
N=N+NUMBER
FOR EACH(COL,FN2);
RETURN N
FN1({1,2,3});
16
20
36
30
some thing like that
http://www.placement-world.com/placement-papers/oracle/ORACLE-PAPER-30-JUL-200... 8/29/2008
» Print ORACLE PAPER - 30 JUL 2008 - ANDHRA PRADESH | Placement World Page 3 of 3
All what I want to say is if ur cool and 100% good at Data Structures, you can easily clear the
code section in 40 min.
http://www.placement-world.com/placement-papers/oracle/ORACLE-PAPER-30-JUL-200... 8/29/2008