Oracle India Fresher Online Test Pattern and Exam Question Papers conducted by PAC

Professional Aptitude Council (PAC) is the authorized hiring partner of Oracle. PAC works with leading technology employers across the globe to help them find the very best people. PAC exists to help you get the very best job, so it will be their pleasure and honor to assist you.
Question Pattern:

    * CODING SKILLS(20 QUESTIONS ) …….40 MINUTES
            1) MATHEMATICAL REASONING…….10 QUES…….10 MIN
            2) IT REASONING……………………….10 QUES……..10 MIN
            3) ATTENTION TO DETAIL……………..10 QUES….ONLY 5 MINUTES
            4) LOGICAL DIAGRAMMING……………5 QUES……..10 MIN SOFTWARE ENGINEERING APTITUDE (35 QUESTIONS)……35 MINUTES
  * * COMPUTER SCIENCE(BASIC)(20 QUESTIONS)………20 MINUTES
          o BASIC
          o CODING SKILLS

we can start the exam with any one of 3 sections(our choice). Each section contain SUB-SECTIONS with the particular questions and time for example in software engineering and aptitude. Like this every section contains sub-sections with allotted time after that section expires.

COMPUTER SCIENCE (BASIC) SECTION  is easy section one can answer the question just by seeing the question itself. CODING SKILLS SECTION contains 2 SUB-SECTIONS. One should have sound knowledge about the data structures and programming with data structures to answer this section. mainly concentrate on SORTINGS, TREES, B-TREES, B++ TREES, COMPLEXITIES., ETC. these are the topics and sections up to my knowledge.

Some of the questions i remember are

1) Which of the following requires a recursive solution (or equivalent use of the stack).
A) Factorial function
B) Lookup in a sorted binary tree
1) JUST 1 2) JUST 2 3) BOTH 4) NEITHER

2) Decimal value of bitwise or of 96,48,24,8
A) 0 B) 64 C) 120 D) 176
not exactly the same but some thing of that sort

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 following diagram:

A-B,C (means A is the root and B, C are its children )
B-D,E
C-F,G
D-H,I
G-J
1) A B C D E F G H I J
2) A B D H I E C F G J
3) H I D E B F J G C A
4) H D I B E A F C J G

This question is there in data structures by Yaswanth Kanitkar.

4) Which is the regular expression matches string and only those strings that represent decimal numbers meeting the following R.E
1) .[0-9].[0-9]+
2) -?[0-9].0-9[0-9]
3) -?[0-9]*.[0-9]+
4)-?[0-9]*.0-9+

5) A Data Base trigger executes in response to
DBMS QUESTION

6) A stored procedure in a DBMS is

7) PSUEDO CODE question :
find the output of the program

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

9) A field of a data object in a multi threaded program can be read from

10) How two processes of different system communicate
thru
Sockets
Shared Memory
Remote Procedure Call

11) Question on evaluation of expression

12) Question on C++ classes and inheritance

13) DATASTRUCTURES questions

(Others I don’t remember)

3) CODING SECTION WAS ENTIRELY DATA STRUCTURES
TREES THAT TOO

15 question were given and in 40 mins we have solve
1) CLASS INTERNALNODE EXTENDS NODE {
@@@ LEFT,RIGHT;
}

what type should replace @@@
INTERNAL NODE
TERIMINAL NODE
OBJECT
NODE

2) CLASS INTERNALNODE EXTENDS NODE
{
NODE LEFT,RIGHT ;
}
What constructors should internal node have according to the specification for the tree structures

Hope i gave some good information to those who are about to write the exam.