Question 1

A collection that allows items to be added only at one end and removed only at the other end is called a ____.

Accepted Answer

A) set 
B) stack 
C) queue 
D) list 
A) set 
B) stack 
C) queue 
D) list

Question 2

Assume that you have declared a map named myMap to hold String values with Integer keys.Which of the following statements will correctly add an association into myMap?

Accepted Answer

A) myMap.insert(3, "apple"); 
B) myMap.add(3, "apple"); 
C) myMap.put(3, "apple"); 
D) myMap.push(3, "apple"); 
A) myMap.insert(3, "apple"); 
B) myMap.add(3, "apple"); 
C) myMap.put(3, "apple"); 
D) myMap.push(3, "apple");

Question 3

A binary search requires ____ access.

Accepted Answer

A) sorted 
B) random 
C) arbitrary 
D) sequential 
A) sorted 
B) random 
C) arbitrary 
D) sequential

Question 4

You need a data structure in your program for evaluating algebraic expressions.Which data structure would be most appropriate to model this situation?

Accepted Answer

A) list 
B) array 
C) queue 
D) stack 
A) list 
B) array 
C) queue 
D) stack

Question 5

Which of the following statements about sets is correct?

Accepted Answer

A) Attempting to remove an element that is not in the set generates an exception. 
B) You can add an element to a specific position within a set. 
C) A set is a collection of unique elements organized for efficiency. 
D) A set allows duplicate values. 
A) Attempting to remove an element that is not in the set generates an exception. 
B) You can add an element to a specific position within a set. 
C) A set is a collection of unique elements organized for efficiency. 
D) A set allows duplicate values.

Question 6

You need to access values in the opposite order in which they were added (last in, first out), and not randomly.Which collection type should you use?

Accepted Answer

A) Hashtable 
B) Map 
C) Queue 
D) Stack 
A) Hashtable 
B) Map 
C) Queue 
D) Stack

Question 7

Which method is NOT part of the ListIterator interface?

Accepted Answer

A) hasPrevious 
B) hasMore 
C) add 
D) hasNext 
A) hasPrevious 
B) hasMore 
C) add 
D) hasNext

Question 8

Select an appropriate expression to complete the following method, which is designed to return the sum of the two smallest values in the parameter array numbers.

Accepted Answer

A) return values.remove() * 2; 
B) return values.peek() + values.remove(); 
C) return values.peek() + values.peek(); 
D) return values.remove() + values.remove(); 
A) return values.remove() * 2; 
B) return values.peek() + values.remove(); 
C) return values.peek() + values.peek(); 
D) return values.remove() + values.remove();

Question 9

Consider the following code snippet:
Map<String, Integer> scores;
You expect to retrieve elements randomly by key, and want fastest retrieval times.Which of the following statements will create a structure to support this?

Accepted Answer

A) scores = new HashMap<>; B) scores = new Map<>; C) scores = new TreeMap<>; D) scores = new TreeSet<>; A) scores = new HashMap<>; B) scores = new Map<>; C) scores = new TreeMap<>; D) scores = new TreeSet<>;

Question 10

Assume you have created a linked list named myList that currently holds some number of String objects.Which of the following statements correctly adds a new element to the beginning of myList?

Accepted Answer

A) myList.insert("Harry"); 
B) myList.addFirst("Harry"); 
C) myList.add("Harry"); 
D) myList.put("Harry"); 
A) myList.insert("Harry"); 
B) myList.addFirst("Harry"); 
C) myList.add("Harry"); 
D) myList.put("Harry");

Question 11

You need a data structure in your program for balancing parentheses in an expression.Which data structure would be most appropriate to model this situation?

Accepted Answer

A) list 
B) stack 
C) array 
D) queue 
A) list 
B) stack 
C) array 
D) queue

Question 12

Consider the following code snippet:   What output will be produced when this code is executed?

Accepted Answer

A) ab,abc,a, 
B) a,ab,abc, 
C) abc,ab,a, 
D) a,abc,ab, 
A) ab,abc,a, 
B) a,ab,abc, 
C) abc,ab,a, 
D) a,abc,ab,

Question 13

A linear search only requires ____ access.

Accepted Answer

A) sorted 
B) arbitrary 
C) sequential 
D) random 
A) sorted 
B) arbitrary 
C) sequential 
D) random

Question 14

Using the merge method of the Map interface, which statement correctly updates the salesTotalByDept map of type Map<String,Integer> to update the sales total for a dept by an integer sales value?

Accepted Answer

A) salesTotalByDept.merge(dept, sales,(d,s) -> s + 1); 
B) sales.merge(salesTotalByDept, dept, (d,s) -> s + sales); 
C) dept.merge(salesTotalByDept, sales, (d,s) -> s + sales); 
D) salesTotalByDept.merge(dept, sales, (d,s) -> s + sales); 
A) salesTotalByDept.merge(dept, sales,(d,s) -> s + 1); 
B) sales.merge(salesTotalByDept, dept, (d,s) -> s + sales); 
C) dept.merge(salesTotalByDept, sales, (d,s) -> s + sales); 
D) salesTotalByDept.merge(dept, sales, (d,s) -> s + sales);

Question 15

Select an appropriate expression to complete the method below.The method should return the number of times that the string stored in name appears in theList.

Accepted Answer

A) theList.next() != null 
B) iter.hasNext() 
C) theList.hasNext() 
D) iter.next() != null 
A) theList.next() != null 
B) iter.hasNext() 
C) theList.hasNext() 
D) iter.next() != null

Question 16

Suppose we have two String objects and treat the characters in each string from beginning to end in the following way: With one string, we push each character on a stack.With the other string, we add each character to a queue.After processing both strings, we then pop one character from the stack and remove one character from the queue, and compare the pair of characters to each other.We do this until the stack and the queue are both empty.What does it mean if all the character pairs match?

Accepted Answer

A) The strings are the identical. 
B) We can only conclude the strings are of the same length. 
C) One string is the reverse of the other. 
D) The strings are 
A) The strings are the identical. 
B) We can only conclude the strings are of the same length. 
C) One string is the reverse of the other. 
D) The strings are

Question 17

When using the add method of the ListIterator to add an element to a linked list, which of the following statements is correct?

Accepted Answer

A) The new element is inserted before the iterator position, and a subsequent call to next would be unaffected. 
B) The new element is inserted after the iterator position, and a subsequent call to next would return the new element. 
C) The new element is inserted after the iterator position, and a subsequent call to previous would be unaffected. 
D) The new element is inserted before the iterator position, and a subsequent call to next would return the new element. 
A) The new element is inserted before the iterator position, and a subsequent call to next would be unaffected. 
B) The new element is inserted after the iterator position, and a subsequent call to next would return the new element. 
C) The new element is inserted after the iterator position, and a subsequent call to previous would be unaffected. 
D) The new element is inserted before the iterator position, and a subsequent call to next would return the new element.

Question 18

Select an appropriate expression to complete the following code segment, which is designed to print a message if the string stored in name is the first element of the players linked list.

Accepted Answer

A) (players.getFirst().equals(name)) 
B) (players[0].equals(name)) 
C) (players.contains(name)) 
D) (players.indexOf(name) == 1) 
A) (players.getFirst().equals(name)) 
B) (players[0].equals(name)) 
C) (players.contains(name)) 
D) (players.indexOf(name) == 1)

Question 19

Assume that you have declared a queue named myQueue to hold String elements.Which of the following statements will correctly insert an element into myQueue?

Accepted Answer

A) myQueue.add("apple"); 
B) myQueue.push("apple"); 
C) myQueue.put("apple"); 
D) myQueue.insert("apple"); 
A) myQueue.add("apple"); 
B) myQueue.push("apple"); 
C) myQueue.put("apple"); 
D) myQueue.insert("apple");

Question 20

Print jobs submitted to a printer would probably be stored in which type of data structure?

Accepted Answer

A) linked list 
B) queue 
C) stack 
D) hash table 
A) linked list 
B) queue 
C) stack 
D) hash table

Exam 15: The Java Collections Framework

A collection that allows items to be added only at one end and removed only at the other end is called a ____.

Assume that you have declared a map named myMap to hold String values with Integer keys.Which of the following statements will correctly add an association into myMap?

A binary search requires ____ access.

You need a data structure in your program for evaluating algebraic expressions.Which data structure would be most appropriate to model this situation?

Which of the following statements about sets is correct?

You need to access values in the opposite order in which they were added (last in, first out), and not randomly.Which collection type should you use?

Which method is NOT part of the ListIterator interface?

Select an appropriate expression to complete the following method, which is designed to return the sum of the two smallest values in the parameter array numbers.

Consider the following code snippet: Map<String, Integer> scores; You expect to retrieve elements randomly by key, and want fastest retrieval times.Which of the following statements will create a structure to support this?

Assume you have created a linked list named myList that currently holds some number of String objects.Which of the following statements correctly adds a new element to the beginning of myList?

You need a data structure in your program for balancing parentheses in an expression.Which data structure would be most appropriate to model this situation?

Consider the following code snippet: What output will be produced when this code is executed?

A linear search only requires ____ access.

Using the merge method of the Map interface, which statement correctly updates the salesTotalByDept map of type Map<String,Integer> to update the sales total for a dept by an integer sales value?

Select an appropriate expression to complete the method below.The method should return the number of times that the string stored in name appears in theList.

When using the add method of the ListIterator to add an element to a linked list, which of the following statements is correct?

Select an appropriate expression to complete the following code segment, which is designed to print a message if the string stored in name is the first element of the players linked list.

Assume that you have declared a queue named myQueue to hold String elements.Which of the following statements will correctly insert an element into myQueue?

Print jobs submitted to a printer would probably be stored in which type of data structure?

Introduction

Using Objects

Implementing Classes

Fundamental Data Types

Decisions

Loops

Arrays and Array Lists

Designing Classes

Inheritance

Interfaces

Input/Output and Exception Handling

Object-Oriented Design

Recursion

Sorting and Searching

Basic Data Structures

Tree Structures

Generic Classes

Stream Processing

Graphical User Interfaces

Advanced Input/Output

Multithreading

Internet Networking

Relational Databases

XML

Filters