Programming 2

Front 1

How many comparisons will the linear search algorithm make if the search key is not in an array of 10 elements?

Back 1

10

Front 2

Which of the following is not a name for a big O run time?

Back 2

Variable run time.

Front 3

What is the efficiency of linear search?

Back 3

O(n)

Front 4

What is the maximum number of comparisons required to find a search key in a sorted 31-element array?

Back 4

5

Front 5

Which of the following is a negative of binary search?

Back 5

The data must be in sorted order.

Front 6

What is the term used for binary search’s run time?

Back 6

Logarithmic run time.

Front 7

What does the first pass of selection sort do?

Back 7

Locates the smallest element in the array and swaps it into the zeroth position.

Front 8

What does each iteration of the insertion sort algorithm do?

Back 8

Each iteration takes the next element in the unsorted portion of the array and inserts it into the sorted portion.

Front 9

How much faster is insertion sort with a 15-element array than with a 60-element array?

Back 9

19 times

Front 10

What is the base case for the recursive merge sort algorithm?

Back 10

A one-element array

Front 11

Which of the following sorting algorithms is the fastest?

Back 11

Merge sort

Front 12

When a recursive method is called to solve a problem, the method actually is capable of solving only the simplest case(s), or ___________

Back 12

base case(s).

Front 13

When the recursion step executes:

Back 13

the original call to the method is still active.

Front 14

Which of the following statements about recursion are true?

Back 14

Recursion uses a termination test.

Recursion can occur infinitely.

Front 15

The recursion step should:

Back 15

call a fresh copy of the recursive method to work on a smaller problem.

Front 16

Which of the following is false?

Back 16

The value 1 can be implicitly converted to a BigInteger.

Front 17

The number of calls to recursively calculate the Fibonacci value of 7 is

Back 17

41

Front 18

The operands of an operator are evaluated ________

Back 18

from left to right.

Front 19

The current method executing is always the method whose activation record is ________

Back 19

at the top of the stack

Front 20

Recursion is often less efficient than iteration because ________

Back 20

it can cause an explosion of method calls.

Front 21

All of the following are true for both recursion and iteration except ________

Back 21

they have a base case.

Front 22

Recursion often is preferable to iteration because ________.

Back 22

it models the problem more logically.

Front 23

Fractals that yield an exact copy of the original when a portion of the original image is magnified are called _______ fractals.

Back 23

strictly self-similar.

Front 24

Each time a fractal’s pattern is applied to it, the fractal is said to be at a new ________.

Back 24

order.

Front 25

After a fractal’s pattern is applied several times, the shape of the fractal will generally become ________.

Back 25

stabilized and more detailed.

Front 26

In recursive backtracking, if one set of recursive calls does not result in a solution to the problem, what happens?

Back 26

The program returns to a previous decision point and makes a different decision.

Front 27

The basic generic functional interface ________ in package java.util.function contains method get that takes no arguments and returns a value of type T

Back 27

UnaryOperator

Front 28

By default, method sorted uses ________.

Back 28

the natural order for the stream's element type

Front 29

Interface Stream (package java.util.stream) is a generic interface for performing stream operations on objects. The types of objects that are processed are determined by the Stream’s ________.

Back 29

source

Front 30

The basic generic functional interface ________ in package java.util.function contains method apply that takes a T argument and returns a value of type R. Calls a method on the T argument and returns that method’s result.

Back 30

Function

Front 31

Terminal operations are eager; they perform the requested operation when they are called.

Back 31

eager

Front 32

You can declare that an interface is a functional interface by preceding it with the @FunctionalInterface annotation. The compiler will then ensure that the interface contains ________; otherwise, it’ll generate a compilation error.

Back 32

only one abstract method

Front 33

Stream method ________ eliminates duplicate objects in a stream.

Back 33

different

Front 34

The basic generic functional interface ________ in package java.util.function contains method apply that takes two T arguments, performs an operation on them (such as a calculation) and returns a value of type T.

Back 34

BinaryOperator

Front 35

________ is a method reference for an instance method that should be called on a specific object. It creates a one-parameter lambda that invokes the instance method on the specified object—passing the lambda’s argument to the instance method—and returns the method’s result.

Back 35

System.out::println

Front 36

An ________ (package java.util.stream) is a specialized stream for manipulating int values.

Back 36

IntStream

Front 37

The intermediate Stream operation ________ results in a stream containing only the unique elements.

Back 37

distinct

Front 38

Interface Stream (package java.util.stream) is a generic interface for performing stream operations on objects. The types of objects that are processed are determined by the Stream’s ________.

Back 38

source

Front 39

________ is a method reference for an instance method of a class. It creates a one-parameter lambda that invokes the instance method on the lambda’s argument and returns the method’s result.

Back 39

String::toUpperCase

Front 40

Class Array’s ________ method is used to create a Stream from an array of objects.

Back 40

stream

Front 41

________ is a constructor reference. It creates a lambda that invokes the no-argument constructor of the specified class to create and initialize a new object of that class

Back 41

TreeMap::new

Front 42

The classes and interfaces which comprise the collections framework are members of package ________

Back 42

java.util.

Front 43

A(n) __________ allows a program to walk through the collection and remove elements from the collection.

Back 43

Iterator

Front 44

Interface Collection contains __________ operations (i.e., operations performed on the entire collection)

Back 44

bulk

Front 45

Iterator method __________ determines whether the Collection contains more elements

Back 45

hasNext

Front 46

Java SE 7 supports type inferencing with the <> notation in statements that declare and create generic type variables and objects. For example, the following lineList< String > list = new ArrayList< String >();can be written as:

Back 46

List< String > list = new ArrayList<>();

Front 47

LinkedList method listIterator returns a(n) __________.

Back 47

bidirectional iterator.

Front 48

The collections framework algorithms are __________, i.e., each of these algorithms can operate on objects that offer given interfaces without concern to the underlying implementations

Back 48

polymorphic

Front 49

Collections method sort that accepts a List as an argument sorts the elements of a List, which must implement the __________ interface.

Back 49

Comparable

Front 50

Collections method ___________ returns a Comparator object that orders the collection's elements in reverse order.

Back 50

reverseOrder.

Front 51

Comparator method compare should return ________ if the first argument is greater than the second argument.

Back 51

a positive int value.

Front 52

Algorithm __________ randomly orders a List's elements

Back 52

shuffle.

Front 53

Method shuffle is a member of __________

Back 53

class Collections.

Front 54

Class Collections provides algorithms for reversing, filling and copying ________.

Back 54

Lists

Front 55

To find the smallest and largest element of a Collection, use Collections methods _________ and __________.

Back 55

least, greatest.

Front 56

If the desired Object is not found, binarySearch returns __________.

Back 56

a negative value

Front 57

Collections method __________ returns true if two Collections have no elements in common.

Back 57

disjoint

Front 58

Stack method __________ looks at the top element of a stack without removing that element

Back 58

peek

Front 59

If no elements are in the Stack, method pop throws an __________

Back 59

EmptyStackException.

Front 60

PriorityQueue method __________ inserts an element at the appropriate location in the queue.

Back 60

offer

Front 61

__________ methods enable a program to view a portion of a collection.

Back 61

Range-view.

Front 62

Maps allocate keys to values and cannot contain duplicate keys, i.e., the key-to-value mapping is a __________ mapping.

Back 62

one-to-one.

Front 63

Which statement about hashing is false?

Back 63

A load factor of 1.0 usually results in good hashing performance, but less efficient utilization of memory.

Front 64

Map method ________ is used to determine whether a map contains a mapping for the specified key.

Back 64

containsKey.

Front 65

A Properties object is a __________ Hashtable object.

Back 65

persistent

Front 66

Most objects in Java can now be output and input with Java's object __________

Back 66

Serialization.

Front 67

The collections framework provides various __________ collection interfaces from which the programmer can quickly "flesh out" complete customized implementations.

Back 67

abstract.

Front 68

Which of the following is not an abstract implementation provided by the collections framework?

Back 68

AbstractTree.

Front 69

Relative paths normally start from which directory?

Back 69

The directory in which the application began executing

Front 70

How do methods setIn, setOut and setErr affect the standard input, output and error streams?

Back 70

They redirect the standard input, output and error streams.

Front 71

Which of the following is arranged in increasing size order?

Back 71

bit, field, record, file.

Front 72

What does the following statement do? Scanner scanner = new Scanner( new File( "test.txt" ) );

Back 72

Opens a text file for input.

Front 73

Records in a sequential file are not usually updated in place. Instead:

Back 73

the entire file is usually rewritten.

Front 74

A serialized object is:

Back 74

an object represented as a sequence of bytes used to store the object’s data in a file.

Front 75

Which JFileChooser method returns the file the user selected.

Back 75

getSelectedFile

Front 76

Instance variables that are not to be output with a Serializable object are declared using which keyword?

Back 76

transient

Front 77

Relative paths normally start from which directory?

Back 77

The directory in which the application began executing.

Front 78

What does the following statement do? Scanner scanner = new Scanner( new File( "test.txt" ) );

Back 78

Opens a text file for input.