【免费】SCJP题库/附考试器资源-CSDN文库

共13个文件

pdf：11个

exe：2个

5星 · 超过95%的资源需积分: 0 154 浏览量 2011-01-26 19:40:05 上传评论收藏 8.46MB RAR 举报

SCJP，全称为Sun Certified Programmer for the Java 2 Platform, Standard Edition，是由Oracle公司（原Sun Microsystems）推出的针对Java编程语言的入门级认证考试。这个认证主要针对的是Java SE（标准版）平台，旨在验证候选者对Java编程基础知识的掌握程度，包括语法、类库、异常处理、内存管理等方面的知识。在提供的文件中，“SCJP题库”可能包含了大量的模拟试题，这些题目通常会覆盖SCJP考试的所有主题，包括但不限于以下几点： 1. **Java语言基础**：这包括变量声明、数据类型、运算符、流程控制（if-else、switch、for、while、do-while）、方法定义和调用等基本概念。 2. **类与对象**：深入理解面向对象编程，如封装、继承、多态，以及类的构造器、访问修饰符、final关键字的使用。 3. **数组和集合框架**：掌握一维和多维数组，了解ArrayList、LinkedList、HashSet、HashMap等集合类的使用及其底层原理。 4. **接口与抽象类**：理解接口的作用，如何实现接口，以及抽象类与接口的区别。 5. **异常处理**：学习try-catch-finally结构，理解不同类型的异常以及何时使用checked异常和unchecked异常。 6. **内存管理与垃圾回收**：了解Java的自动内存管理，包括对象的生命周期、引用类型、垃圾收集机制。 7. **多线程**：学习线程的创建与同步，包括synchronized关键字、wait()、notify()、notifyAll()方法的应用。 8. **输入/输出流**：掌握文件操作，包括File类、InputStream/OutputStream、Reader/Writer家族，以及缓冲流的使用。 9. **反射机制**：理解反射的概念，如何在运行时动态地获取类信息，创建和调用类的对象。 10. **JVM与类加载器**：对Java虚拟机有基本认识，理解类加载的过程和双亲委派模型。 “Whizlabs SCJP 5.0”可能是一个模拟测试软件，它提供了模拟真实考试环境的练习题，帮助考生熟悉考试格式和时间管理。通过使用这样的工具，考生可以评估自己的准备情况，并针对不足之处进行复习。由于描述中提到2011年1月份使用过这些资源，需要注意的是，尽管SCJP认证已经更新为OCPJP（Oracle Certified Professional, Java SE 8 Programmer），但基础知识大体相同，只是随着Java版本的升级，一些新的特性和API可能会加入到考试中。因此，对于准备最新的OCPJP考试的考生，除了上述内容，还需要关注Java 8及更高版本的新特性，如Lambda表达式、Stream API、Optional类等。

资源详情

资源评论

资源推荐

收起资源包目录

SCJP.rar （13个子文件）

SCJP

Module3.pdf 577KB

Module5-8_tips.pdf 247KB

Module2.pdf 435KB

Module4.pdf 101KB

Module3-4_tips.pdf 58KB

Module7.pdf 1.44MB

Module5.pdf 522KB

Module1-2_tips.pdf 107KB

Module6.pdf 220KB

Module1.pdf 572KB

Module8.pdf 428KB

Whizlabs SCJP 5.0

SCJP50.exe 3.94MB

SCJP50-patch.exe 20KB

Module 7- 集合和泛型

一、选择题：

Question 1

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 is true?

A. The time to find the value from HashMap with a Person key depends

on the size of the map.

Deleting a Person key from a HashMap will delete all map entries for

all keys of type Person.

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:

Question 2

Given:

11.

public static Collection get() {

12. Collection sorted = new LinkedList();

13. sorted.add( " B " ); sorted.add( " C " ); sorted.add( " A " );

14. return sorted;

15. }

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

17. for (Object obj: get()) {

18. System.out.print(obj + " , " );

19. }

20. }

What is the result?

A. A,

B, C,

B. B, C,

Compilation fails.

D. The code runs with no output.

E. An exception is thrown at runtime.

Answer: B

Question 3

Given:

import java.util.*;

public class Example {

public static void main(String[] args) {

// insert code here

set.add(new integer(2));

set.add(new integer(l));

System.out.println(set);

}

Which code, inserted at line

guarantees that this program will

output [1, 2]?

A. Set set = new TreeSet();

Set set = new HashSet();

Set set = new SortedSet();

D. List set = new SortedList();

E. Set set = new LinkedHashSet();

Answer:

Question 4

Given:

import java.util.*;

public class PQ {

public static void main(String[] args) {

PriorityQueue<String> pq = new PriorityQueue<String>();

pq.add( " carrot " );

pq.add( " apple " );

pq.add( " banana " );

System.out.println(pq.poll() + " : " + pq.peek());

}

10. }

What is the result?

A. apple:apple

carrot:apple

apple:banana

D. banana:apple

E. carrot:carrot

carrot:banana

Answer: C

Question 5

Given:

import java.util.*;

public class WrappedString {

private String s;

public WrappedString(String s) { this.s = s; }

public static void main(String[] args) {

HashSet<Object> hs = new HashSet<Object>();

WrappedString ws1 = new WrappedString( " aardvark " );

WrappedString ws2 = new WrappedString( " aardvark " );

String s1 = new String( " aardvark "

);

10. String s2 = new String( " aardvark "

);

11.

hs.add(ws1); hs.add(ws2); hs.add(s1); hs.add(s2);

12. System.out.println(hs.size()); } }

What is the result?

A. 0

D. 3

E. 4

Compilation fails.

G. An exception is thrown at runtime.

Answer: D

Question 6

Click the Exhibit button.

import java.util.*;

public class TestSet {

enum Example { ONE, TWO, THREE }

public static void main(String[] args) {

Collection coll = new ArrayList();

coll.add(Example.THREE);

coll.add(Example.TWO);

10. coll.add(Example.TWO);

11.

coll.add(Example.ONE);

12. Set set = new HashSet(coll);

13. }

14. }

Which statement is true about the set variable on line 12?

A. The set variable contains all six elements from the coll collection,

and the order is guaranteed to be preserved.

The set variable contains only three elements from the coll

collection, and the order is guaranteed to be preserved.

The set variable contains all six elements from the coil collection,

but the order is NOT guaranteed to be preserved.

D. The set variable contains only three elements from the coil

collection, but the order is NOT guaranteed to be preserved.

Answer: D

Question 7

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

java.util.ArrayList

java.util.LinearList

D. java.util.LinkedList

Answer: D

Question 8

Click the Exhibit button.

import java.util.*;

class KeyMaster {

public int i;

public KeyMaster(int i) { this.i = i; }

public boolean equals(Object o) { return i == ((KeyMaster)o).i; }

public int hashCode() { return i; }

}

public class MapIt {

public static void main(String[] args) {

10. Set<KeyMaster> set = new HashSet<KeyMaster>();

11.

KeyMaster k1 = new KeyMaster(1);

12. KeyMaster k2 = new KeyMaster(2);

13. set.add(k1); set.add(k1);

14. set.add(k2); set.add(k2);

15. System.out.print(set.size() + " : " );

16. k2.i = 1;

17. System.out.print(set.size() + " : " );

18. set.remove(k1);

19. System.out.print(set.size() + " : " );

20. set.remove(k2);

21. System.out.print(set.size());

22. }

23. }

What is the result?

A. 4:4:2:2

4:4:3:2

2:2:1:0

D. 2:2:0:0

E. 2:1:0:0

2:2:1:1

G. 4:3:2:1

Answer: F

Question 9

Given:

11.

public static void append(List list) { list.add( " 0042 " ); }

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

13. List<Integer> intList = new ArrayList<Integer>();

14. append(intList);

15. System.out.println(intList.get(0));

16. }

‘ What is the result?

A. 42

0042

An exception is thrown at runtime.

D. Compilation fails because of an error in line 13.

E. Compilation fails because of an error in line 14.

Answer: B

Question 10

Given:

int[] myArray=newint[] {1, 2,3,4, 5};

What allows you to create a list from this array?

A. List myList = myArray.asList();

List myList = Arrays.asList(myArray);

List myList = new ArrayList(myArray);

D. List myList = Collections.fromArray(myArray);

Answer: B

Question 11

Given:

34. HashMap props = new HashMap();

35. props.put( " key45 "

" some value " );

36. props.put( " key12 "

" some other value " );

37. props.put( " key39 "

" yet another value "

);

38. Set s = props.keySet();

39. // insert code here

What, inserted at line 39, will sort the keys in the props HashMap?

A. Arrays.sort(s);

s = new TreeSet(s);

Collections.sort(s);

nonus

2014-05-16

文檔內容不錯，考試器更是實用。感謝分享。

评论收藏

内容反馈

sanzhituoxie

粉丝: 0
资源: 5

SCJP题库/附考试器

评论1

最新资源

SCJP题库/附考试器

评论1

SCJP题库

SCJP 题库

SCJP考试题库

SCJP 考试题 题库

scjp题库（中文版）

scjp题库（收集了CSDN上大部分题库，近1000道SCJP试题）

最新scjp题库 真题

SCJP题库，有了它必过

SCJP考试模拟机题库

SCJP考试题目

SCJP考试资料，题库

最新SCJP考试题库

java的SCJP考试题库

SCJP5.0真题题库

SCJP题库 V8.02

sun公司scjp认证题库

OJCP（SCJP）题库

SCJP Braindump SCJP 题库 SCJP 考题

SCJP 065 题库

SCJP考试大纲

SCJP考试指南（考试号310-065 中文版

java scjp认证考试题库

SUN公司SCJP国际认证最新题库

scjp题库部分题目绝对真实有用

SCJP考试题库（只要背回70分以上，没问题，有答案！）

最新资源

SCJP 考试题题库

最新scjp题库真题