甲骨文笔试类型分析
甲骨文的笔试是上机测试，全英文试题，分为两部分，第一部分：40min，45题，考查应聘者的数学、逻
辑、英文、细节观察以及性格等各方面的综合素质。
Math Reasoning数学推理 10 min
Sentence Structure 语法结构5 min
IT Reasoning 5 min
Reading Comprehension 阅读理解7 min
Attention to Detail 细节观察 5 min
Logic Diagramming逻辑框图 8 min
第二部分：性格测试，也是英文的，155道，每题5个选项，选非常符合极不符合那种。
下面提供部分试题，供大家参考
Question Number 20In the implementation of many linear linked structures it is often useful
to keep a pointer to the last node in addition to the first, so that a new node can be added
at the end without having to loop through the entire structure looking for the last node. In
what ways would adding a pointer to the last node improve the efficiency of this dictionary
implementation?It would speed up put operations when the dictionary contains an item with
the designated key.It would speed up put operations when the dictionary does not contain an
item with the designated key.
neither
A but not B
both
B but not A------------
ABC Housekeeping Forces are responsible for maintaining a building that comprises of 100
floors. The maintenance company decides to use a database to schedule work for its employees
and also check the status of the work. When an assigned housekeeper does not report for
work, an alternate resource is allotted to complete the job.
The Housekeeping database in its un-normalized form is given below:
HouseKeeperID – ID of the housekeeper
HouseKeeperName – Housekeeper's Name
SupervisorID – ID of the Housekeeper's
Supervisor
SupervisorName - Name of the Housekeeper's
Supervisor
DutyID – ID of an assigned duty
FloorNo – Floor to which the duty is
assigned
DutyDate – Date on which the duty has to be
done
WorkStatus - Status of the duty
AlternateHID - ID of the alternate housekeeper's
assigned to complete the job, in
case the originally assigned
housekeeper is absent.
AlternateWorkSt – Work Status of the Alternate
Housekeeper's duty.
From the following options, select the Housekeeping database in 2NF.
Housekeeper
HouseKeeperID
HouseKeeperName
Supervisor
SupervisorID
SupervisorName
Duty
DutyID
FloorNo