没有合适的资源？快使用搜索试试~ 我知道了~

文库首页考试认证Oracle认证OCJP-题库，覆盖率100%

OCJP-题库，覆盖率100%

ocjp

5星 · 超过95%的资源需积分: 8 445 下载量 141 浏览量 2013-03-08 22:02:41 上传评论 23 收藏 9.49MB PDF 举报

温馨提示

试读

202页

这套题库覆盖率100%，考前看了这套题，OCJP认证竟然以100%通过，好东西与大家一起分享，只要看此题库大家一定都能顺利通过。当然题库里有几题答案有误，我也标了出来了。大家觉得有疑问的不要净信答案，可以自己敲敲代码验证一下。

资源推荐

资源详情

资源评论

1z0-851_formatted

Number: 000-000

Passing Score: 800

Time Limit: 120 min

File Version: 1.0

Oracle 1z0-851

Java Standard Edition 6 Programmer Certified

Professional Exam

Practice Test

Version: 4.2

Oracle 1z0-851: Practice Exam

Exam A

QUESTION 1

Given a pre-generics implementation of a method:

11. public static int sum(List list) {

12. int sum = 0;

13. for ( Iterator iter = list.iterator(); iter.hasNext(); ) {

14. int i = ((Integer)iter.next()).intValue();

15. sum += i;

16. }

17. return sum;

18. }

What three changes allow the class to be used with generics and avoid an unchecked warning? (Choose

three.)

A. Remove line 14.

B. Replace line 14 with "int i = iter.next();".

C. Replace line 13 with "for (int i : intList) {".

D. Replace line 13 with "for (Iterator iter : intList) {".

E. Replace the method declaration with "sum(List<int> intList)".

F. Replace the method declaration with "sum(List<Integer> intList)".

Answer: ACF

Section: (none)

Explanation/Reference:

Explanation:

QUESTION 2

A programmer has an algorithm that requires a java.util.List that provides an efficient implementation of

add(0, object), but does NOT need to support quick random access. What supports these requirements?

A. java.util.Queue

B. java.util.ArrayList

C. java.util.LinearList

D. java.util.LinkedList

Answer: D

Section: (none)

Explanation/Reference:

Explanation:

QUESTION 3

Given:

11. // insert code here

12. private N min, max;

13. public N getMin() { return min; }

14. public N getMax() { return max; }

15. public void add(N added) {

16. if (min == null || added.doubleValue() < min.doubleValue())

17. min = added;

18. if (max == null || added.doubleValue() > max.doubleValue())

19. max = added;

20. }

21. }

Which two, inserted at line 11, will allow the code to compile? (Choose two.)

A. public class MinMax<?> {

B. public class MinMax<? extends Number> {

C. public class MinMax<N extends Object> {

D. public class MinMax<N extends Number> {

E. public class MinMax<? extends Object> {

F. public class MinMax<N extends Integer> {

Answer: DF

Section: (none)

Explanation/Reference:

Explanation:

QUESTION 4

Given:

12. import java.util.*;

13. public class Explorer2 {

14. public static void main(String[] args) {

15. TreeSet<Integer> s = new TreeSet<Integer>();

16. TreeSet<Integer> subs = new TreeSet<Integer>();

17. for(int i = 606; i < 613; i++)

18. if(i%2 == 0) s.add(i);

19. subs = (TreeSet)s.subSet(608, true, 611, true);

20. s.add(629);

21. System.out.println(s + " " + subs);

22. }

23. }

What is the result?

A. Compilation fails.

B. An exception is thrown at runtime.

C. [608, 610, 612, 629] [608, 610]

D. [608, 610, 612, 629] [608, 610, 629]

E. [606, 608, 610, 612, 629] [608, 610]

F. [606, 608, 610, 612, 629] [608, 610, 629]

Answer: E

Section: (none)

Explanation/Reference:

Explanation:

QUESTION 5

Given:

1. public class Score implements Comparable<Score> {

2. private int wins, losses;

3. public Score(int w, int l) { wins = w; losses = l; }

4. public int getWins() { return wins; }

5. public int getLosses() { return losses; }

6. public String toString() {

7. return "<" + wins + "," + losses + ">";

8. }

9. // insert code here

10. }

Which method will complete this class?

A. public int compareTo(Object o){/*more code here*/}

B. public int compareTo(Score other){/*more code here*/}

C. public int compare(Score s1,Score s2){/*more code here*/}

D. public int compare(Object o1,Object o2){/*more code here*/}

Answer: B

Section: (none)

Explanation/Reference:

Explanation:

QUESTION 6

Given:

11. public class Person {

12. private name;

13. public Person(String name) {

14. this.name = name;

15. }

16. public int hashCode() {

17. return 420;

18. }

19. }

Which statement is true?

A. The time to find the value from HashMap with a Person key depends on the size of the map.

B. Deleting a Person key from a HashMap will delete all map entries for all keys of type Person.

C. Inserting a second Person object into a HashSet will cause the first Person object to be removed as a

duplicate.

D. The time to determine whether a Person object is contained in a HashSet is constant and does NOT

depend on the size of the map.

Answer: A

Section: (none)

Explanation/Reference:

Explanation:

QUESTION 7

Given:

5. import java.util.*;

6. public class SortOf {

7. public static void main(String[] args) {

8. ArrayList<Integer> a = new ArrayList<Integer>();

9. a.add(1); a.add(5); a.add(3);

11. Collections.sort(a);

12. a.add(2);

13. Collections.reverse(a);

14. System.out.println(a);

15. }

16. }

What is the result?

A. [1, 2, 3, 5]

剩余201页未读，继续阅读

评论收藏

内容反馈

资源评论

资源反馈

评论星级较低，若资源使用遇到问题可联系上传者，3个工作日内问题未解决可申请退款~

克里斯蒂亚诺

2015-06-17

东西还不错，挺全面的资料。值得一看
吞噬星星

2016-01-12

题目还是很全的，最近正在准备考试ocjp认证，帮助非常大，谢谢楼主
yswift

2017-05-07

用来自己测试，不错！
yeyiyao

2015-12-27

非常全面的题库。赞！
木槿花夕V

2015-08-10

很好，值得一看，很清晰

前往

页

quanfengsun

粉丝: 1
资源: 1

上传资源快速赚钱

我的内容管理展开

我的资源快来上传第一个资源

我的收益

登录查看自己的收益

我的积分登录查看自己的积分

我的C币登录后查看C币余额

我的收藏

我的下载

下载帮助

前往需求广场，查看用户热搜

OCJP-题库，覆盖率100%

ocjp的题库

OCJP考试题库

ocjp权威题库

ocjp考试试题题库

OCJP认证-3期（PX017） PX122010101018_OCJP考试大纲 -.doc

ocjp认证题库

OCJP模拟器,OCJP模拟考试,OCJP题库

ocjp报名流程考试题目答案

Java_OCJP认证试题合集

OCJP题库（亲测100%覆盖）

OCJP超全题库

OCJP题目+答案

OCJP考试题题库解析，稳过290道

ocjp题库，答案，分析

OCJP(OCA)模拟题

OCJP原题及答案

Ocjp6 考试笔记及心得总结

OCA Java SE 8 Programmer I Exam Guide (Exams 1Z0-808) 高清完整azw3版

Testpassport_最新_OCJP题库_1Z0-853

OCJP试题 讲解(本人亲测有效，稳过)

ocjp认证考试题库及部分详解

ojcp认证考试复习资料

OJCP（SCJP）题库

ocjp认证，1z0-808题库（中英）+解析.rar

Ocjp 复习题库与解析 及考试模拟器

Oracle 19C OCP全程课堂笔记

MySQL 8.0 OCP应试必备指南

MySQL OCP 8.0 1Z0-908题库

最新资源

OCJP试题讲解(本人亲测有效，稳过)

Ocjp 复习题库与解析及考试模拟器